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 5.4M
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 6.3K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 38K 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 24K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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 6.0K 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 5.0M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is PolyORBLF-PT-S04J06T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-152732266800409
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527483051618


BK_STOP 1527483541206

--------------------
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-S04J06T08 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': 258534, 'Memory': 15937.38, 'Tool': 'lola'}, {'Time': 264335, 'Memory': 15894.13, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PolyORBLF-PT-S04J06T08...

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


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S04J06T08: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ PolyORBLF-PT-S04J06T08 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 5060/65536 symbol table entries, 1254 collisions
lola: preprocessing...
lola: finding significant places
lola: 792 places, 4268 transitions, 734 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2899 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S04J06T08-LTLCardinality.task
lola: A (F ((DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_4_3 + DisablePollingB_7_1 + DisablePollingB_7_2 + DisablePollingB_7_3 + DisablePollingB_7_4 + DisablePollingB_8_1 + DisablePollingB_8_2 + DisablePollingB_8_3 + DisablePollingB_8_4 + DisablePollingB_4_2 + DisablePollingB_4_1 + DisablePollingB_3_4 + DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_1_3 + DisablePollingB_1_4 + DisablePollingB_3_3 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_2_1 + DisablePollingB_2_2 + DisablePollingB_2_3 + DisablePollingB_2_4 + DisablePollingB_4_4 <= NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + NotifyEventJobCompletedE_7 + NotifyEventJobCompletedE_8))) : A (G ((Abort_Check_Sources_E_1 + Abort_Check_Sources_E_2 + Abort_Check_Sources_E_3 + Abort_Check_Sources_E_4 + Abort_Check_Sources_E_5 + Abort_Check_Sources_E_6 + Abort_Check_Sources_E_7 + Abort_Check_Sources_E_8 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8))) : A (F ((3 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8))) : A (((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 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8) U (3 <= ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 + ScheduleTaskE_Idle_7 + ScheduleTaskE_Idle_8))) : A (X (G (G (G ((Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 + Check_Sources_B_7 + Check_Sources_B_8 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_2_5 + QueueJobB_2_6 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_3_5 + QueueJobB_3_6 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_4_5 + QueueJobB_4_6 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_5_5 + QueueJobB_5_6 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4 + QueueJobB_6_5 + QueueJobB_6_6 + QueueJobB_7_0 + QueueJobB_7_1 + QueueJobB_7_2 + QueueJobB_7_3 + QueueJobB_7_4 + QueueJobB_7_5 + QueueJobB_7_6 + QueueJobB_8_0 + QueueJobB_8_1 + QueueJobB_8_2 + QueueJobB_8_3 + QueueJobB_8_4 + QueueJobB_8_5 + QueueJobB_8_6)))))) : A (F ((2 <= P_1095))) : A ((2 <= AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0)) : A ((((1 <= P_1717) U (3 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8)) U F ((P_1717 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8)))) : A (G (G (F ((TryAllocateOneTaskE_7 <= P_1119_6_2))))) : A ((TryAllocateOneTaskE_5 <= NotifyEventJobCompletedE_2)) : A (G ((DisablePollingE_4_4 <= NotifyEventJobQueuedB_1_1))) : A (G (X ((NotifyEventSourceAddedE_4 <= Insert_Source_B_5_2)))) : A (X ((ScheduleTaskE_Work_8_3 <= Idle_5))) : A ((QueueJobB_1_3 <= DisablePollingE_8_3)) : A ((NotifyEventJobQueuedB_6_4 <= Insert_Source_E_1)) : A (X (X (X (X ((EnablePollingE_1 <= P_2321_2))))))
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 ((DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_4_3 + DisablePollingB_7_1 + DisablePollingB_7_2 + DisablePollingB_7_3 + DisablePollingB_7_4 + DisablePollingB_8_1 + DisablePollingB_8_2 + DisablePollingB_8_3 + DisablePollingB_8_4 + DisablePollingB_4_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_4_3 + DisablePollingB_7_1 + DisablePollingB_7_2 + DisablePollingB_7_3 + DisablePollingB_7_4 + DisablePollingB_8_1 + DisablePollingB_8_2 + DisablePollingB_8_3 + DisablePollingB_8_4 + DisablePollingB_4_2 + DisablePollingB_4_1 + DisablePollingB_3_4 + DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_1_3 + DisablePollingB_1_4 + DisablePollingB_3_3 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_2_1 + DisablePollingB_2_2 + DisablePollingB_2_3 + DisablePollingB_2_4 + DisablePollingB_4_4 <= NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + NotifyEventJobCompletedE_7 + NotifyEventJobCompletedE_8)))
lola: processed formula: A (F ((DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_4_3 + DisablePollingB_7_1 + DisablePollingB_7_2 + DisablePollingB_7_3 + DisablePollingB_7_4 + DisablePollingB_8_1 + DisablePollingB_8_2 + DisablePollingB_8_3 + DisablePollingB_8_4 + DisablePollingB_4_2... (shortened)
lola: processed formula length: 944
lola: 0 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J06T08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2940 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Abort_Check_Sources_E_1 + Abort_Check_Sources_E_2 + Abort_Check_Sources_E_3 + Abort_Check_Sources_E_4 + Abort_Check_Sources_E_5 + Abort_Check_Sources_E_6 + Abort_Check_Sources_E_7 + Abort_Check_Sources_E_8 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEven... (shortened)
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 2936 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: 48 markings, 47 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8)))
lola: processed formula: A (F ((3 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8)))
lola: processed formula length: 244
lola: 0 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J06T08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2940 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 363 markings, 363 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((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 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((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 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8) U (3 <= ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 + ScheduleTaskE_Idle_7 + ScheduleTaskE_Idle_8)))
lola: processed formula: A (((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 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 +... (shortened)
lola: processed formula length: 621
lola: 0 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J06T08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2940 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: 363 markings, 363 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G (G ((Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 + Check_Sources_B_7 + Check_Sources_B_8 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_2_5 + QueueJobB_2_6 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (G (G ((Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 + Check_Sources_B_7 + Check_Sources_B_8 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_2_5 + QueueJobB_2_6 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_3_5 + QueueJobB_3_6 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_4_5 + QueueJobB_4_6 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_5_5 + QueueJobB_5_6 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4 + QueueJobB_6_5 + QueueJobB_6_6 + QueueJobB_7_0 + QueueJobB_7_1 + QueueJobB_7_2 + QueueJobB_7_3 + QueueJobB_7_4 + QueueJobB_7_5 + QueueJobB_7_6 + QueueJobB_8_0 + QueueJobB_8_1 + QueueJobB_8_2 + QueueJobB_8_3 + QueueJobB_8_4 + QueueJobB_8_5 + QueueJobB_8_6))))))
lola: processed formula: A (X (G (G (G ((Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 + Check_Sources_B_7 + Check_Sources_B_8 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_2_5 + QueueJobB_2_6 +... (shortened)
lola: processed formula length: 1076
lola: 0 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J06T08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2940 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: 402 markings, 402 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= P_1095)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= P_1095)))
lola: processed formula: A (F ((2 <= P_1095)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J06T08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2940 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 996 markings, 1038 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0)
lola: processed formula length: 137
lola: 1 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J06T08-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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= P_1717) U (3 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8)) U F ((P_1717 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= P_1717) U (3 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8)) U F ((P_1717 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8))))
lola: processed formula: A ((((1 <= P_1717) U (3 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8)) U F ((P_1717 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8))))
lola: processed formula length: 380
lola: 0 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J06T08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2940 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 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F ((TryAllocateOneTaskE_7 <= P_1119_6_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (F ((TryAllocateOneTaskE_7 <= P_1119_6_2)))))
lola: processed formula: A (G (G (F ((TryAllocateOneTaskE_7 <= P_1119_6_2)))))
lola: processed formula length: 53
lola: 0 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J06T08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2940 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: 14050 markings, 14234 edges, 2810 markings/sec, 0 secs
lola: 28653 markings, 29082 edges, 2921 markings/sec, 5 secs
lola: 43535 markings, 44449 edges, 2976 markings/sec, 10 secs
lola: 58304 markings, 59677 edges, 2954 markings/sec, 15 secs
lola: 72872 markings, 74693 edges, 2914 markings/sec, 20 secs
lola: 87696 markings, 90208 edges, 2965 markings/sec, 25 secs
lola: 102477 markings, 105490 edges, 2956 markings/sec, 30 secs
lola: 117319 markings, 121000 edges, 2968 markings/sec, 35 secs
lola: 132469 markings, 136990 edges, 3030 markings/sec, 40 secs
lola: 147116 markings, 152357 edges, 2929 markings/sec, 45 secs
lola: 162419 markings, 168832 edges, 3061 markings/sec, 50 secs
lola: 177712 markings, 185297 edges, 3059 markings/sec, 55 secs
lola: 192536 markings, 200913 edges, 2965 markings/sec, 60 secs
lola: 207663 markings, 217124 edges, 3025 markings/sec, 65 secs
lola: 222940 markings, 233484 edges, 3055 markings/sec, 70 secs
lola: 237765 markings, 249105 edges, 2965 markings/sec, 75 secs
lola: 252722 markings, 265034 edges, 2991 markings/sec, 80 secs
lola: 267714 markings, 281012 edges, 2998 markings/sec, 85 secs
lola: 282661 markings, 297030 edges, 2989 markings/sec, 90 secs
lola: 297453 markings, 312744 edges, 2958 markings/sec, 95 secs
lola: 312417 markings, 328706 edges, 2993 markings/sec, 100 secs
lola: 327390 markings, 344828 edges, 2995 markings/sec, 105 secs
lola: 342515 markings, 361028 edges, 3025 markings/sec, 110 secs
lola: 356913 markings, 376492 edges, 2880 markings/sec, 115 secs
lola: 371723 markings, 392217 edges, 2962 markings/sec, 120 secs
lola: 386884 markings, 408659 edges, 3032 markings/sec, 125 secs
lola: 402021 markings, 424799 edges, 3027 markings/sec, 130 secs
lola: 417029 markings, 441053 edges, 3002 markings/sec, 135 secs
lola: 432310 markings, 457542 edges, 3056 markings/sec, 140 secs
lola: 447671 markings, 474267 edges, 3072 markings/sec, 145 secs
lola: 463315 markings, 491547 edges, 3129 markings/sec, 150 secs
lola: 478343 markings, 507904 edges, 3006 markings/sec, 155 secs
lola: 493246 markings, 524046 edges, 2981 markings/sec, 160 secs
lola: 508077 markings, 540097 edges, 2966 markings/sec, 165 secs
lola: 523062 markings, 556363 edges, 2997 markings/sec, 170 secs
lola: 538476 markings, 573339 edges, 3083 markings/sec, 175 secs
lola: 553513 markings, 589706 edges, 3007 markings/sec, 180 secs
lola: 568865 markings, 606359 edges, 3070 markings/sec, 185 secs
lola: 583828 markings, 622575 edges, 2993 markings/sec, 190 secs
lola: 599167 markings, 639321 edges, 3068 markings/sec, 195 secs
lola: 614025 markings, 655549 edges, 2972 markings/sec, 200 secs
lola: 628930 markings, 671799 edges, 2981 markings/sec, 205 secs
lola: 644301 markings, 688878 edges, 3074 markings/sec, 210 secs
lola: 659318 markings, 705247 edges, 3003 markings/sec, 215 secs
lola: 674332 markings, 721403 edges, 3003 markings/sec, 220 secs
lola: 689184 markings, 737460 edges, 2970 markings/sec, 225 secs
lola: 704270 markings, 753891 edges, 3017 markings/sec, 230 secs
lola: 719201 markings, 769971 edges, 2986 markings/sec, 235 secs
lola: 734372 markings, 786636 edges, 3034 markings/sec, 240 secs
lola: 749587 markings, 803392 edges, 3043 markings/sec, 245 secs
lola: 764517 markings, 819675 edges, 2986 markings/sec, 250 secs
lola: 779797 markings, 836342 edges, 3056 markings/sec, 255 secs
lola: 794729 markings, 852616 edges, 2986 markings/sec, 260 secs
lola: 810098 markings, 869470 edges, 3074 markings/sec, 265 secs
lola: 825502 markings, 886438 edges, 3081 markings/sec, 270 secs
lola: 840919 markings, 903559 edges, 3083 markings/sec, 275 secs
lola: 855971 markings, 920320 edges, 3010 markings/sec, 280 secs
lola: 870853 markings, 936454 edges, 2976 markings/sec, 285 secs
lola: 885715 markings, 952767 edges, 2972 markings/sec, 290 secs
lola: 900227 markings, 968623 edges, 2902 markings/sec, 295 secs
lola: 915229 markings, 985264 edges, 3000 markings/sec, 300 secs
lola: 930088 markings, 1001660 edges, 2972 markings/sec, 305 secs
lola: 945042 markings, 1017952 edges, 2991 markings/sec, 310 secs
lola: 960342 markings, 1034701 edges, 3060 markings/sec, 315 secs
lola: 975309 markings, 1051253 edges, 2993 markings/sec, 320 secs
lola: 990359 markings, 1067617 edges, 3010 markings/sec, 325 secs
lola: 1005271 markings, 1084143 edges, 2982 markings/sec, 330 secs
lola: 1020339 markings, 1100543 edges, 3014 markings/sec, 335 secs
lola: 1035547 markings, 1117445 edges, 3042 markings/sec, 340 secs
lola: 1050480 markings, 1133857 edges, 2987 markings/sec, 345 secs
lola: 1065542 markings, 1150609 edges, 3012 markings/sec, 350 secs
lola: 1080181 markings, 1166906 edges, 2928 markings/sec, 355 secs
lola: 1095277 markings, 1183486 edges, 3019 markings/sec, 360 secs
lola: 1110197 markings, 1199965 edges, 2984 markings/sec, 365 secs
lola: 1125111 markings, 1216118 edges, 2983 markings/sec, 370 secs
lola: 1139959 markings, 1232500 edges, 2970 markings/sec, 375 secs
lola: 1155019 markings, 1249219 edges, 3012 markings/sec, 380 secs
lola: 1169858 markings, 1265596 edges, 2968 markings/sec, 385 secs
lola: 1184691 markings, 1281979 edges, 2967 markings/sec, 390 secs
lola: 1199878 markings, 1298762 edges, 3037 markings/sec, 395 secs
lola: 1214792 markings, 1315158 edges, 2983 markings/sec, 400 secs
lola: 1229840 markings, 1331803 edges, 3010 markings/sec, 405 secs
lola: 1244666 markings, 1347988 edges, 2965 markings/sec, 410 secs
lola: 1259663 markings, 1364638 edges, 2999 markings/sec, 415 secs
lola: 1274592 markings, 1381150 edges, 2986 markings/sec, 420 secs
lola: 1289803 markings, 1398008 edges, 3042 markings/sec, 425 secs
lola: 1304764 markings, 1414659 edges, 2992 markings/sec, 430 secs
lola: 1319721 markings, 1431093 edges, 2991 markings/sec, 435 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((TryAllocateOneTaskE_5 <= NotifyEventJobCompletedE_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (TryAllocateOneTaskE_5 <= NotifyEventJobCompletedE_2)
lola: processed formula length: 53
lola: 1 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J06T08-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 516 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((DisablePollingE_4_4 <= NotifyEventJobQueuedB_1_1)))
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 2936 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: 128 markings, 127 edges
lola: ========================================
lola: subprocess 11 will run for 619 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((NotifyEventSourceAddedE_4 <= Insert_Source_B_5_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X ((NotifyEventSourceAddedE_4 <= Insert_Source_B_5_2))))
lola: processed formula: A (G (X ((NotifyEventSourceAddedE_4 <= Insert_Source_B_5_2))))
lola: processed formula length: 62
lola: 0 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J06T08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2940 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: 6164 markings, 6332 edges
lola: ========================================
lola: subprocess 12 will run for 773 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((ScheduleTaskE_Work_8_3 <= Idle_5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((ScheduleTaskE_Work_8_3 <= Idle_5)))
lola: processed formula: A (X ((ScheduleTaskE_Work_8_3 <= Idle_5)))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J06T08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2940 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 13 will run for 1031 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((QueueJobB_1_3 <= DisablePollingE_8_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (QueueJobB_1_3 <= DisablePollingE_8_3)
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J06T08-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 14 will run for 1547 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NotifyEventJobQueuedB_6_4 <= Insert_Source_E_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NotifyEventJobQueuedB_6_4 <= Insert_Source_E_1)
lola: processed formula length: 48
lola: 1 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J06T08-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 15 will run for 3095 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (X ((EnablePollingE_1 <= P_2321_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (X (X ((EnablePollingE_1 <= P_2321_2))))))
lola: processed formula: A (X (X (X (X ((EnablePollingE_1 <= P_2321_2))))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J06T08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2940 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: 44 markings, 74 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no yes yes unknown yes no no yes yes yes yes
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J06T08-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S04J06T08"
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-S04J06T08.tgz
mv PolyORBLF-PT-S04J06T08 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-S04J06T08, 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-152732266800409"
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 ;