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)
..............
=====================================================================
Generated by BenchKit 2-2979
Executing tool lola
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 r086kn-ebro-146369088900707
=====================================================================

--------------------
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-COL-S02J06T10-LTLCardinality-0
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-1
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-15
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-2
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-3
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-4
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-5
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-6
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-7
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-8
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1463722620248

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ PolyORBLF-PT-S02J06T10
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-5 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-15 CANNOT_COMPUTE
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-COL-S02J06T10-LTLCardinality.task
lola: read: A3 <= NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_9 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_10 + NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_7 + NotifyEventSourceAddedB_8 + NotifyEventSourceAddedB_6 : AF (F (P_1095 <= P_1716)) : AX (F (X (DisablePollingE_7_2 + DisablePollingE_3_2 + DisablePollingE_10_2 + DisableP... (shortened)
lola: formula length: 7230
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -NotifyEventSourceAddedB_10 + -NotifyEventSourceAddedB_9 + -NotifyEventSourceAddedB_8 + -NotifyEventSourceAddedB_7 + -NotifyEventSourceAddedB_6 + -NotifyEventSourceAddedB_5 + -NotifyEventSourceAddedB_4 + -NotifyEventSourceAddedB_3 + -NotifyEventSourceAddedB_2 + -NotifyEventSourceAddedB_1 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-P_1716 + P_1095 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -P_1716 + P_1095 <= 0)
lola: processed formula length: 31
lola: 10306 rewrites
lola: formula mentions 2 of 844 places; total mentions: 2
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F (X (DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_9_2 + DisablePollingE_9_1 + DisablePollingE_8_2 + DisablePollingE_8_1 + DisablePollingE_7_2 + DisablePollingE_7_1 + DisablePollingE_6_2 + DisablePollingE_6_1 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_10_2 + DisablePollingE_10_1 + DisablePollingE_4_2 + DisablePolling... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
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
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: P_2579_3_2 + -IdleTasks_10 + -IdleTasks_1 + -IdleTasks_2 + -IdleTasks_3 + -IdleTasks_4 + -IdleTasks_5 + -IdleTasks_6 + -IdleTasks_7 + -IdleTasks_8 + -IdleTasks_9 + P_2579_1_1 + P_2579_1_2 + P_2579_2_1 + P_2579_2_2 + P_2579_3_1 + P_2579_9_2 + P_2579_9_1 + P_2579_10_2 + P_2579_10_1 + P_2579_8_2 + P_2579_8_1 + P_2579_7_2 + P_2579_7_1 + P_2579_6_2 + P_2579_6_1 + P_2579_5_2 + P_2579_5_1 + P_2579_4_2 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F (X (G (-P_1113_9 + cPollingAbort + -P_1113_1 + -P_1113_2 + -P_1113_3 + -P_1113_4 + -P_1113_5 + -P_1113_6 + -P_1113_7 + -P_1113_8 + -P_1113_10 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
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
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G ((-IdleTasks_10 + -IdleTasks_1 + -IdleTasks_2 + -IdleTasks_3 + -IdleTasks_4 + -IdleTasks_5 + -IdleTasks_6 + -IdleTasks_7 + -IdleTasks_8 + -IdleTasks_9 <= -2 U P_1717 + -NotifyEventSourceAddedE_10 + -NotifyEventSourceAddedE_9 + -NotifyEventSourceAddedE_8 + -NotifyEventSourceAddedE_7 + -NotifyEventSourceAddedE_6 + -NotifyEventSourceAddedE_5 + -NotifyEventSourceAddedE_4 + -NotifyEventSourceAdde... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
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
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-MarkerWrite + cPollingAbort <= 0 U X (X (Abort_Check_Sources_B_10 + -ORB_Lock + Abort_Check_Sources_B_9 + Abort_Check_Sources_B_8 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 7 states
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
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 7 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F (X (-Abort_Check_Sources_B_10 + -Abort_Check_Sources_B_9 + -Abort_Check_Sources_B_8 + -Abort_Check_Sources_B_7 + -Abort_Check_Sources_B_6 + -Abort_Check_Sources_B_5 + -Abort_Check_Sources_B_4 + -Abort_Check_Sources_B_3 + -Abort_Check_Sources_B_2 + -Abort_Check_Sources_B_1 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
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
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 8 will run for 420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (ScheduleTaskE_Check_10 + -AbourtToModifySrc_2 + -AbourtToModifySrc_1 + ScheduleTaskE_Check_9 + ScheduleTaskE_Check_8 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_1 <= 0) U (JobCnt + -PlaceSources_2 + -PlaceSources_1 <= 0 U -P_1717 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 5 states
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
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 9 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-Try_Check_Sources_E_10 + -Try_Check_Sources_E_9 + -Try_Check_Sources_E_8 + -Try_Check_Sources_E_7 + -Try_Check_Sources_E_6 + -Try_Check_Sources_E_5 + -Try_Check_Sources_E_4 + -Try_Check_Sources_E_3 + -Try_Check_Sources_E_2 + -Try_Check_Sources_E_1 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-Try_Check_Sources_E_10 + -Try_Check_Sources_E_9 + -Try_Check_Sources_E_8 + -Try_Check_Sources_E_7 + -Try_Check_Sources_E_6 + -Try_Check_Sources_E_5 + -Try_Check_Sources_E_4 + -Try_Check_Sources_E_3 + -Try_Check_Sources_E_2 + -Try_Check_Sources_E_1 <= -1)
lola: processed formula length: 258
lola: 10306 rewrites
lola: formula mentions 10 of 844 places; total mentions: 10
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
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: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (G ((-ScheduleTaskE_Idle_10 + -ScheduleTaskE_Idle_9 + -ScheduleTaskE_Idle_8 + -ScheduleTaskE_Idle_7 + -ScheduleTaskE_Idle_6 + -ScheduleTaskE_Idle_5 + -ScheduleTaskE_Idle_4 + -ScheduleTaskE_Idle_3 + -ScheduleTaskE_Idle_2 + -ScheduleTaskE_Idle_1 + PlaceSources_2 + PlaceSources_1 <= 0 U -P_1093 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
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
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 11 will run for 661 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (X (-PollingAbort <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
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
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 12 will run for 820 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (X (Check_Sources_E_10 + Check_Sources_E_9 + Check_Sources_E_8 + Check_Sources_E_7 + Check_Sources_E_6 + Check_Sources_E_5 + Check_Sources_E_4 + Check_Sources_E_3 + Check_Sources_E_2 + Check_Sources_E_1 + -AwakeTasks_10 + -AwakeTasks_9 + -AwakeTasks_8 + -AwakeTasks_7 + -AwakeTasks_6 + -AwakeTasks_5 + -AwakeTasks_4 + -AwakeTasks_3 + -AwakeTasks_2 + -AwakeTasks_1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
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
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 13 will run for 1079 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X ((FetchJobE_9_6 + FetchJobE_9_0 + FetchJobE_9_1 + FetchJobE_9_2 + FetchJobE_9_3 + FetchJobE_9_4 + FetchJobE_9_5 + FetchJobE_8_6 + FetchJobE_8_5 + FetchJobE_8_4 + FetchJobE_8_3 + FetchJobE_8_2 + FetchJobE_8_1 + FetchJobE_8_0 + FetchJobE_7_6 + FetchJobE_7_5 + FetchJobE_7_4 + FetchJobE_7_3 + FetchJobE_7_2 + FetchJobE_7_1 + FetchJobE_7_0 + FetchJobE_6_6 + FetchJobE_6_5 + FetchJobE_6_4 + FetchJob... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
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
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 14 will run for 1585 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-cSources <= -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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3171 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((G (-cJobCnt + P_1716 <= 0) U -QueueJobE_9 + -QueueJobE_8 + -QueueJobE_7 + -QueueJobE_6 + -QueueJobE_5 + -QueueJobE_4 + -QueueJobE_3 + -QueueJobE_2 + -QueueJobE_1 + -QueueJobE_10 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
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
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: no yes yes yes no unknown yes no no no no no no no no unknown

BK_STOP 1463723163319

--------------------
content from 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-S02J06T10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
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 r086kn-ebro-146369088900707"
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 ;