About the Execution of LoLa for PolyORBLF-PT-S04J04T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15734.660 | 579504.00 | 582699.00 | 1741.20 | ?FTFFFFTTFFF?TFF | normal |
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-S04J04T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088900716
=====================================================================
--------------------
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-S04J04T06-LTLCardinality-0
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-1
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-15
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-2
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-3
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-4
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-5
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-6
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-7
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-8
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1463723166766
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ PolyORBLF-PT-S04J04T06
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-0 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-6 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 3552/65536 symbol table entries, 872 collisions
lola: preprocessing...
lola: finding significant places
lola: 554 places, 2998 transitions, 504 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1821 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S04J04T06-LTLCardinality.task
lola: read: AF (G ((2 <= cPollingAbort U SigAbort <= QueueJobB_3_3 + QueueJobB_4_4 + QueueJobB_1_1 + QueueJobB_2_2 + QueueJobB_1_0 + QueueJobB_5_4 + QueueJobB_3_2 + QueueJobB_2_0 + QueueJobB_1_2 + QueueJobB_5_3 + QueueJobB_2_3 + QueueJobB_3_0 + QueueJobB_4_3 + QueueJobB_6_4 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_4_0 + QueueJobB_1_4 + QueueJobB_5_1 + QueueJobB_4_1 + QueueJobB_1_3 + QueueJobB_6_3 + QueueJo... (shortened)
lola: formula length: 6425
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G ((-cPollingAbort <= -2 U SigAbort + -QueueJobB_6_4 + -QueueJobB_6_3 + -QueueJobB_6_2 + -QueueJobB_6_1 + -QueueJobB_6_0 + -QueueJobB_5_4 + -QueueJobB_5_3 + -QueueJobB_5_2 + -QueueJobB_5_1 + -QueueJobB_5_0 + -QueueJobB_4_4 + -QueueJobB_4_3 + -QueueJobB_4_2 + -QueueJobB_4_1 + -QueueJobB_4_0 + -QueueJobB_3_4 + -QueueJobB_3_3 + -QueueJobB_3_2 + -QueueJobB_3_1 + -QueueJobB_3_0 + -QueueJobB_2_4 + -... (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 2016 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-P_1617_6 + -P_1617_5 + -P_1617_4 + -P_1617_3 + -P_1617_2 + -P_1617_1 <= -3 U G (G (-Insert_Source_B_6_4 + -Insert_Source_B_6_3 + -Insert_Source_B_6_2 + -Insert_Source_B_6_1 + -Insert_Source_B_5_4 + -Insert_Source_B_5_3 + -Insert_Source_B_5_2 + -Insert_Source_B_5_1 + -Insert_Source_B_4_4 + -Insert_Source_B_4_3 + -Insert_Source_B_4_2 + -Insert_Source_B_4_1 + -Insert_Source_B_3_4 + -Insert_Source_... (shortened)
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 2016 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 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ScheduleTaskE_Idle_6 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_1 + -ScheduleTaskE_Check_6 + -ScheduleTaskE_Check_5 + -ScheduleTaskE_Check_4 + -ScheduleTaskE_Check_3 + -ScheduleTaskE_Check_2 + -ScheduleTaskE_Check_1 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S04J04T06-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + -RunE_6 + -RunE_5 + -RunE_4 + -RunE_3 + -RunE_2 + -RunE_1 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S04J04T06-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(G (-P_1113_6 + -P_1113_1 + -P_1113_2 + -P_1113_3 + -P_1113_4 + -P_1113_5 <= -3) U G (Insert_Source_E_6 + Insert_Source_E_5 + Insert_Source_E_4 + Insert_Source_E_3 + Insert_Source_E_2 + Insert_Source_E_1 + -P_1095 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2016 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 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (-Insert_Source_B_6_4 + -Insert_Source_B_6_3 + -Insert_Source_B_6_2 + -Insert_Source_B_6_1 + -Insert_Source_B_5_4 + -Insert_Source_B_5_3 + -Insert_Source_B_5_2 + -Insert_Source_B_5_1 + -Insert_Source_B_4_4 + -Insert_Source_B_4_3 + -Insert_Source_B_4_2 + -Insert_Source_B_4_1 + -Insert_Source_B_3_4 + -Insert_Source_B_3_3 + -Insert_Source_B_3_2 + -Insert_Source_B_3_1 + -Insert_Source_B_2_4 + -Ins... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2016 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 6 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(G (ScheduleTaskE_Work_6_4 + ScheduleTaskE_Work_6_3 + ScheduleTaskE_Work_6_2 + ScheduleTaskE_Work_6_1 + ScheduleTaskE_Work_6_0 + -P_1095 + ScheduleTaskE_Work_5_4 + ScheduleTaskE_Work_5_3 + ScheduleTaskE_Work_5_2 + ScheduleTaskE_Work_5_1 + ScheduleTaskE_Work_5_0 + ScheduleTaskE_Work_4_4 + ScheduleTaskE_Work_4_3 + ScheduleTaskE_Work_4_2 + ScheduleTaskE_Work_4_1 + ScheduleTaskE_Work_4_0 + ScheduleTa... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2016 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-IdleTasks_1 + -IdleTasks_2 + -IdleTasks_3 + -IdleTasks_4 + -IdleTasks_5 + -IdleTasks_6 + ScheduleTaskB_6 + ScheduleTaskB_5 + ScheduleTaskB_4 + ScheduleTaskB_3 + ScheduleTaskB_2 + ScheduleTaskB_1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-IdleTasks_1 + -IdleTasks_2 + -IdleTasks_3 + -IdleTasks_4 + -IdleTasks_5 + -IdleTasks_6 + ScheduleTaskB_6 + ScheduleTaskB_5 + ScheduleTaskB_4 + ScheduleTaskB_3 + ScheduleTaskB_2 + ScheduleTaskB_1 <= 0)
lola: processed formula length: 204
lola: 5525 rewrites
lola: formula mentions 12 of 554 places; total mentions: 12
lola: closed formula file PolyORBLF-COL-S04J04T06-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2016 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Try_Check_Sources_B_6 + -Try_Check_Sources_B_5 + -Try_Check_Sources_B_4 + -Try_Check_Sources_B_3 + -Try_Check_Sources_B_2 + -Try_Check_Sources_B_1 <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S04J04T06-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X ((-P_1726 <= -2 U P_2318_6 + P_2318_5 + P_2318_4 + P_2318_3 + P_2318_2 + P_2318_1 + -JobCnt <= 0)))
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 2016 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 10 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (G (EnablePollingE_6 + EnablePollingE_5 + EnablePollingE_4 + EnablePollingE_3 + EnablePollingE_2 + EnablePollingE_1 + -ScheduleTaskE_Check_6 + -ScheduleTaskE_Check_5 + -ScheduleTaskE_Check_4 + -ScheduleTaskE_Check_3 + -ScheduleTaskE_Check_2 + -ScheduleTaskE_Check_1 <= 0)) U P_1155_6 + P_1155_5 + P_1155_4 + P_1155_3 + P_1155_2 + P_1155_1 + -P_1617_6 + -P_1617_5 + -P_1617_4 + -P_1617_3 + -P_1617... (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 2016 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 11 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-ProcessingEvt_6 + -ProcessingEvt_5 + -ProcessingEvt_4 + -ProcessingEvt_3 + -ProcessingEvt_2 + -ProcessingEvt_1 <= -1 U F (G (-Insert_Source_E_6 + -Insert_Source_E_5 + -Insert_Source_E_4 + -Insert_Source_E_3 + -Insert_Source_E_2 + -Insert_Source_E_1 <= -3)))
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 2016 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 741 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-cBlockedTasks <= -3 U -TryAllocateOneTaskB_6 + -TryAllocateOneTaskB_5 + -TryAllocateOneTaskB_4 + -TryAllocateOneTaskB_3 + -TryAllocateOneTaskB_2 + -TryAllocateOneTaskB_1 <= -3) U -P_1725_4 + -P_1725_3 + -P_1725_2 + -P_1725_1 + -P_1725_0 <= -2)
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 2016 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 987 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (X (G (Insert_Source_B_6_4 + Insert_Source_B_6_3 + Insert_Source_B_6_2 + Insert_Source_B_6_1 + Insert_Source_B_5_4 + Insert_Source_B_5_3 + Insert_Source_B_5_2 + Insert_Source_B_5_1 + Insert_Source_B_4_4 + Insert_Source_B_4_3 + Insert_Source_B_4_2 + Insert_Source_B_4_1 + Insert_Source_B_3_4 + Insert_Source_B_3_3 + Insert_Source_B_3_2 + Insert_Source_B_3_1 + Insert_Source_B_2_4 + Insert_Source... (shortened)
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 2016 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 1480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-NotifyEventJobQueuedB_1_4 + -NotifyEventJobQueuedB_1_3 + -NotifyEventJobQueuedB_1_2 + -NotifyEventJobQueuedB_1_1 + -NotifyEventJobQueuedB_1_0 + -NotifyEventJobQueuedB_6_4 + -NotifyEventJobQueuedB_6_3 + -NotifyEventJobQueuedB_6_2 + -NotifyEventJobQueuedB_6_1 + -NotifyEventJobQueuedB_6_0 + -NotifyEventJobQueuedB_5_4 + -NotifyEventJobQueuedB_5_3 + -NotifyEventJobQueuedB_5_2 + -NotifyEventJobQueu... (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 2016 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 2960 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -IsMonitoring <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S04J04T06-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: RESULT
lola: summary: unknown no yes no no no unknown yes no no yes no no no no yes
lola: ========================================
BK_STOP 1463723746270
--------------------
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-S04J04T06"
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-S04J04T06.tgz
mv PolyORBLF-PT-S04J04T06 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-S04J04T06, 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-146369088900716"
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 '
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 ;