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 QuasiCertifProtocol-PT-22, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098kn-smll-146369140300113
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463708188720

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ QuasiCertifProtocol-PT-22
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-5 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-12 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-15 FALSE 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: 2322/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1966 places, 356 transitions, 355 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 471 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-22-LTLCardinality.task
lola: read: Aa2 <= CstopOK_0 + CstopOK_1 + CstopOK_11 + CstopOK_10 + CstopOK_13 + CstopOK_12 + CstopOK_15 + CstopOK_14 + CstopOK_17 + CstopOK_16 + CstopOK_3 + CstopOK_2 + CstopOK_5 + CstopOK_4 + CstopOK_7 + CstopOK_6 + CstopOK_9 + CstopOK_8 + CstopOK_18 + CstopOK_19 + CstopOK_20 + CstopOK_21 + CstopOK_22 : As2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_16 + s2_15 + s2_18 + s2_17 + s2_20 + s2_19 + s2_22 ... (shortened)
lola: formula length: 4098
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -CstopOK_22 + -CstopOK_21 + -CstopOK_20 + -CstopOK_19 + -CstopOK_18 + -CstopOK_17 + -CstopOK_16 + -CstopOK_15 + -CstopOK_14 + -CstopOK_13 + -CstopOK_12 + -CstopOK_11 + -CstopOK_10 + -CstopOK_9 + -CstopOK_8 + -CstopOK_7 + -CstopOK_6 + -CstopOK_5 + -CstopOK_4 + -CstopOK_3 + -CstopOK_2 + -CstopOK_1 + -CstopOK_0 + a2 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-22-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -CstopOK_22 + -CstopOK_21 + -CstopOK_20 + -CstopOK_19 + -CstopOK_18 + -CstopOK_17 + -CstopOK_16 + -CstopOK_15 + -CstopOK_14 + -CstopOK_13 + -CstopOK_12 + -CstopOK_11 + -CstopOK_10 + -CstopOK_9 + -CstopOK_8 + -CstopOK_7 + -CstopOK_6 + -CstopOK_5 + -CstopOK_4 + -CstopOK_3 + -CstopOK_2 + -CstopOK_1 + -CstopOK_0 + s2_10 + s2_11 + s2_12 + s2_13 + s2_14 + s2_15 + s2_16 + s2_17 + s2_18 + s2_19 + s2_20 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-22-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (G (-c1_9 + -c1_10 + -c1_11 + -c1_12 + -c1_13 + -c1_14 + -c1_15 + -c1_16 + -c1_17 + -c1_18 + -c1_19 + -c1_20 + -c1_21 + -c1_22 + -c1_0 + -c1_1 + -c1_2 + -c1_3 + -c1_4 + -c1_5 + -c1_6 + -c1_7 + -c1_8 <= -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 1420 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (G (X (s2_10 + s2_11 + s2_12 + s2_13 + s2_14 + s2_15 + s2_16 + s2_17 + s2_18 + s2_19 + s2_20 + s2_21 + s2_22 + -a5 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s2_7 + s2_8 + s2_9 <= 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 1420 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 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F ((-s6_9 + -s6_8 + -s6_7 + -s6_6 + -s6_5 + -s6_4 + -s6_3 + -s6_2 + -s6_1 + -s6_0 + -s6_10 + -s6_11 + -s6_12 + -s6_13 + -s6_14 + -s6_15 + -s6_16 + -s6_17 + -s6_18 + -s6_19 + -s6_20 + -s6_21 + -s6_22 <= -2 U -c1_9 + -c1_10 + -c1_11 + -c1_12 + a5 + -c1_13 + -c1_14 + -c1_15 + -c1_16 + -c1_17 + -c1_18 + -c1_19 + -c1_20 + -c1_21 + -c1_22 + -c1_0 + -c1_1 + -c1_2 + -c1_3 + -c1_4 + -c1_5 + -c1_6 + -c1... (shortened)
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 1420 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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((F (-a2 + s5_9 + s5_8 + s5_7 + s5_6 + s5_5 + s5_4 + s5_3 + s5_2 + s5_1 + s5_0 + s5_10 + s5_11 + s5_12 + s5_13 + s5_14 + s5_15 + s5_16 + s5_17 + s5_18 + s5_19 + s5_20 + s5_21 + s5_22 <= 0) U X (malicious_reservoir + -s5_9 + -s5_8 + -s5_7 + -s5_6 + -s5_5 + -s5_4 + -s5_3 + -s5_2 + -s5_1 + -s5_0 + -s5_10 + -s5_11 + -s5_12 + -s5_13 + -s5_14 + -s5_15 + -s5_16 + -s5_17 + -s5_18 + -s5_19 + -s5_20 + -s... (shortened)
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 1420 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 6 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-c1_9 + -c1_10 + -c1_11 + -c1_12 + -c1_13 + -c1_14 + -c1_15 + -c1_16 + -c1_17 + -c1_18 + -c1_19 + -c1_20 + -c1_21 + -c1_22 + -c1_0 + -c1_1 + -c1_2 + -c1_3 + -c1_4 + -c1_5 + -c1_6 + -c1_7 + -c1_8 <= -3 U c1_9 + c1_10 + c1_11 + c1_12 + -a4 + c1_13 + c1_14 + c1_15 + c1_16 + c1_17 + c1_18 + c1_19 + c1_20 + c1_21 + c1_22 + c1_0 + c1_1 + c1_2 + c1_3 + c1_4 + c1_5 + c1_6 + c1_7 + c1_8 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -n4_9 + -n4_8 + -n4_7 + -n4_6 + -n4_5 + -n4_4 + -n4_3 + -n4_2 + -n4_1 + -n4_0 + a4 + -n4_22 + -n4_21 + -n4_20 + -n4_19 + -n4_18 + -n4_17 + -n4_16 + -n4_15 + -n4_14 + -n4_13 + -n4_12 + -n4_11 + -n4_10 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-22-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X (G (X (-malicious_reservoir + CstopAbort <= 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 1420 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 459 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -SstopAbort <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-22-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (X (G (-a4 <= -1))))
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 1420 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 643 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((X (-a2 <= -3) U -s6_9 + -s6_8 + -s6_7 + -s6_6 + -s6_5 + -s6_4 + -s6_3 + -s6_2 + -s6_1 + -s6_0 + -s6_10 + -s6_11 + -s6_12 + -s6_13 + -s6_14 + -s6_15 + -s6_16 + -s6_17 + -s6_18 + -s6_19 + -s6_20 + -s6_21 + -s6_22 + AstopOK <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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 12 will run for 804 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (-SstopOK_20 + -SstopOK_7 + -SstopOK_6 + -SstopOK_1 + n3_22 + n3_21 + n3_20 + n3_19 + n3_18 + n3_17 + n3_16 + n3_15 + n3_14 + n3_13 + n3_12 + n3_11 + n3_10 + -SstopOK_0 + -SstopOK_2 + -SstopOK_3 + -SstopOK_4 + -SstopOK_5 + -SstopOK_22 + -SstopOK_21 + -SstopOK_8 + -SstopOK_19 + -SstopOK_18 + -SstopOK_17 + -SstopOK_16 + -SstopOK_15 + -SstopOK_14 + -SstopOK_13 + -SstopOK_12 + -SstopOK_11 + -Sst... (shortened)
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 1420 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 13 will run for 804 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F (X (-n5_9 + -n5_8 + -n5_7 + -n5_6 + -n5_5 + -n5_4 + -n5_3 + -n5_2 + -n5_1 + -n5_0 + Astart + -n5_22 + -n5_21 + -n5_20 + -n5_19 + -n5_18 + -n5_17 + -n5_16 + -n5_15 + -n5_14 + -n5_13 + -n5_12 + -n5_11 + -n5_10 <= 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 1420 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 14 will run for 1048 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (G (SstopAbort + -a5 <= 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 1420 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 15 will run for 2097 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((G (n6_10 + n6_11 + n6_12 + n6_13 + n6_14 + n6_15 + n6_16 + n6_17 + n6_18 + n6_19 + n6_20 + n6_21 + n6_22 + -Sstart_22 + -Sstart_21 + -Sstart_20 + -Sstart_19 + -Sstart_18 + -Sstart_17 + -Sstart_16 + -Sstart_15 + -Sstart_14 + -Sstart_13 + -Sstart_12 + -Sstart_11 + -Sstart_10 + n6_9 + n6_8 + n6_7 + n6_6 + n6_5 + n6_4 + n6_3 + n6_2 + n6_1 + n6_0 + -Sstart_0 + -Sstart_1 + -Sstart_2 + -Sstart_3 + -... (shortened)
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 1420 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: RESULT
lola: summary: yes yes no no yes unknown yes yes no no no yes unknown yes no no
lola: ========================================

BK_STOP 1463709631411

--------------------
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="QuasiCertifProtocol-PT-22"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/QuasiCertifProtocol-PT-22.tgz
mv QuasiCertifProtocol-PT-22 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 QuasiCertifProtocol-PT-22, 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 r098kn-smll-146369140300113"
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 ;