fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r098kn-smll-146369140300129
Last Updated
June 30, 2016

About the Execution of LoLa for QuasiCertifProtocol-PT-32

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15950.850 3079154.00 3082889.00 7256.10 FT??F????FFF?FTT 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 QuasiCertifProtocol-PT-32, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098kn-smll-146369140300129
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1463716106760

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ QuasiCertifProtocol-PT-32
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-2 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-6 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-10 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-11 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-13 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-14 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-32-CTLCardinality-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: 4312/65536 symbol table entries, 134 collisions
lola: preprocessing...
lola: finding significant places
lola: 3806 places, 506 transitions, 505 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 671 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: read: ((A(a4 <= n4_32 + n4_31 + n4_30 + n4_29 + n4_24 + n4_23 + n4_22 + n4_21 + n4_28 + n4_27 + n4_26 + n4_25 + n4_15 + n4_16 + n4_13 + n4_14 + n4_19 + n4_20 + n4_17 + n4_18 + n4_7 + n4_8 + n4_5 + n4_6 + n4_11 + n4_12 + n4_9 + n4_10 + n4_0 + n4_2 + n4_1 + n4_4 + n4_3 U 2 <= malicious_reservoir) OR (AF (2 <= c1_0 + c1_1 + c1_2 + c1_3 + c1_4 + c1_5 + c1_6 + c1_7 + c1_8 + c1_9 + c1_10 + c1_11 + c1_13 + c1_... (shortened)
lola: formula length: 80504
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 212 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A(-n4_9 + -n4_8 + -n4_7 + -n4_6 + -n4_5 + -n4_4 + -n4_3 + -n4_2 + -n4_1 + -n4_0 + a4 + -n4_32 + -n4_31 + -n4_30 + -n4_29 + -n4_28 + -n4_27 + -n4_26 + -n4_25 + -n4_24 + -n4_23 + -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 U -malicious_reservoir <= -2) OR (AF (-c1_9 + -c1_10 + -c1_11 + -c1_12 + -c1_13 + -c1_14 + -c1_15 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 212 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-n4_9 + -n4_8 + -n4_7 + -n4_6 + -n4_5 + -n4_4 + -n4_3 + -n4_2 + -n4_1 + -n4_0 + a4 + -n4_32 + -n4_31 + -n4_30 + -n4_29 + -n4_28 + -n4_27 + -n4_26 + -n4_25 + -n4_24 + -n4_23 + -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 U -malicious_reservoir <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(-n4_9 + -n4_8 + -n4_7 + -n4_6 + -n4_5 + -n4_4 + -n4_3 + -n4_2 + -n4_1 + -n4_0 + a4 + -n4_32 + -n4_31 + -n4_30 + -n4_29 + -n4_28 + -n4_27 + -n4_26 + -n4_25 + -n4_24 + -n4_23 + -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 U -malicious_reservoir <= -2)
lola: processed formula length: 326
lola: 5465158 rewrites
lola: formula mentions 35 of 3806 places; total mentions: 35
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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 1 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-CstopOK_32 + -CstopOK_31 + -CstopOK_30 + -CstopOK_29 + -CstopOK_28 + -CstopOK_27 + -CstopOK_26 + -CstopOK_25 + -CstopOK_24 + -CstopOK_23 + -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 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 5 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-a5 <= -3 AND -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_23 + -c1_24 + -c1_25 + -c1_26 + -c1_27 + -c1_28 + -c1_29 + -c1_30 + -c1_31 + -c1_32 + -c1_0 + -c1_1 + -c1_2 + -c1_3 + -c1_4 + -c1_5 + -c1_6 + -c1_7 + -c1_8 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-a5 <= -3 AND -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_23 + -c1_24 + -c1_25 + -c1_26 + -c1_27 + -c1_28 + -c1_29 + -c1_30 + -c1_31 + -c1_32 + -c1_0 + -c1_1 + -c1_2 + -c1_3 + -c1_4 + -c1_5 + -c1_6 + -c1_7 + -c1_8 <= -1))
lola: processed formula length: 316
lola: 5465158 rewrites
lola: formula mentions 34 of 3806 places; total mentions: 34
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-a5 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (((-n1_32 + -n1_31 + -n1_30 + -n1_29 + -n1_28 + -n1_27 + -n1_26 + -n1_25 + -n1_24 + -n1_23 + -n1_22 + -n1_21 + -n1_20 + -n1_19 + -n1_18 + -n1_17 + -n1_16 + -n1_15 + -n1_14 + -n1_13 + -n1_12 + -n1_11 + -n1_10 + -n1_0 + -n1_1 + -n1_2 + -n1_3 + -n1_4 + -n1_5 + -n1_6 + -n1_7 + -n1_8 + -n1_9 > -1 AND -CstopOK_32 + -CstopOK_31 + -CstopOK_30 + -CstopOK_29 + -CstopOK_28 + -CstopOK_27 + -CstopOK_26 + -C... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((-n1_32 + -n1_31 + -n1_30 + -n1_29 + -n1_28 + -n1_27 + -n1_26 + -n1_25 + -n1_24 + -n1_23 + -n1_22 + -n1_21 + -n1_20 + -n1_19 + -n1_18 + -n1_17 + -n1_16 + -n1_15 + -n1_14 + -n1_13 + -n1_12 + -n1_11 + -n1_10 + -n1_0 + -n1_1 + -n1_2 + -n1_3 + -n1_4 + -n1_5 + -n1_6 + -n1_7 + -n1_8 + -n1_9 > -1 AND -CstopOK_32 + -CstopOK_31 + -CstopOK_30 + -CstopOK_29 + -CstopOK_28 + -CstopOK_27 + -CstopOK_26 + -Cs... (shortened)
lola: processed formula length: 1314
lola: 5465159 rewrites
lola: formula mentions 99 of 3806 places; total mentions: 132
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(n8_10_9 + n8_10_8 + n8_10_7 + n8_10_6 + n8_10_5 + n8_10_4 + n8_10_3 + n8_10_2 + n8_10_1 + n8_10_0 + n8_23_9 + n8_23_8 + n8_23_7 + n8_23_6 + n8_23_5 + n8_23_4 + n8_23_3 + n8_23_2 + n8_23_1 + n8_23_0 + n8_0_32 + n8_0_31 + n8_0_30 + n8_0_29 + n8_0_28 + n8_0_27 + n8_0_26 + n8_0_25 + n8_0_24 + n8_0_23 + n8_0_22 + n8_0_21 + n8_0_20 + n8_0_19 + n8_0_18 + n8_0_17 + n8_0_16 + n8_0_15 + n8_0_14 + n8_0_13 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(n8_10_9 + n8_10_8 + n8_10_7 + n8_10_6 + n8_10_5 + n8_10_4 + n8_10_3 + n8_10_2 + n8_10_1 + n8_10_0 + n8_23_9 + n8_23_8 + n8_23_7 + n8_23_6 + n8_23_5 + n8_23_4 + n8_23_3 + n8_23_2 + n8_23_1 + n8_23_0 + n8_0_32 + n8_0_31 + n8_0_30 + n8_0_29 + n8_0_28 + n8_0_27 + n8_0_26 + n8_0_25 + n8_0_24 + n8_0_23 + n8_0_22 + n8_0_21 + n8_0_20 + n8_0_19 + n8_0_18 + n8_0_17 + n8_0_16 + n8_0_15 + n8_0_14 + n8_0_13 ... (shortened)
lola: processed formula length: 24034
lola: 5465159 rewrites
lola: formula mentions 2211 of 3806 places; total mentions: 2211
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EX ((-a5 + n6_9 + n6_8 + n6_7 + n6_6 + n6_5 + n6_4 + n6_3 + n6_2 + n6_1 + n6_0 + 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 + n6_23 + n6_24 + n6_25 + n6_26 + n6_27 + n6_28 + n6_29 + n6_30 + n6_31 + n6_32 <= 0 AND s5_9 + s5_8 + s5_7 + s5_6 + s5_5 + s5_4 + s5_3 + s5_2 + s5_1 + s5_0 + -Sstart_32 + -Sstart_31 + -Sstart_30 + -Sstart_29 + -S... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(EX((-a5 + n6_9 + n6_8 + n6_7 + n6_6 + n6_5 + n6_4 + n6_3 + n6_2 + n6_1 + n6_0 + 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 + n6_23 + n6_24 + n6_25 + n6_26 + n6_27 + n6_28 + n6_29 + n6_30 + n6_31 + n6_32 <= 0 AND s5_9 + s5_8 + s5_7 + s5_6 + s5_5 + s5_4 + s5_3 + s5_2 + s5_1 + s5_0 + -Sstart_32 + -Sstart_31 + -Sstart_30 + -Sstart... (shortened)
lola: processed formula length: 964
lola: 5465159 rewrites
lola: formula mentions 100 of 3806 places; total mentions: 100
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (((a3 + -s4_10 + -s4_11 + -s4_12 + -s4_13 + -s4_14 + -s4_15 + -s4_16 + -s4_17 + -s4_18 + -s4_19 + -s4_20 + -s4_21 + -s4_22 + -s4_23 + -s4_24 + -s4_25 + -s4_26 + -s4_27 + -s4_28 + -s4_29 + -s4_30 + -s4_31 + -s4_32 + -s4_9 + -s4_8 + -s4_7 + -s4_6 + -s4_5 + -s4_4 + -s4_3 + -s4_2 + -s4_1 + -s4_0 <= 0 OR -n2_9 + -n2_8 + -n2_7 + -n2_6 + -n2_5 + -n2_4 + -n2_3 + -n2_2 + -n2_1 + -n2_0 + -n2_10 + -n2_11 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((a3 + -s4_10 + -s4_11 + -s4_12 + -s4_13 + -s4_14 + -s4_15 + -s4_16 + -s4_17 + -s4_18 + -s4_19 + -s4_20 + -s4_21 + -s4_22 + -s4_23 + -s4_24 + -s4_25 + -s4_26 + -s4_27 + -s4_28 + -s4_29 + -s4_30 + -s4_31 + -s4_32 + -s4_9 + -s4_8 + -s4_7 + -s4_6 + -s4_5 + -s4_4 + -s4_3 + -s4_2 + -s4_1 + -s4_0 <= 0 OR -n2_9 + -n2_8 + -n2_7 + -n2_6 + -n2_5 + -n2_4 + -n2_3 + -n2_2 + -n2_1 + -n2_0 + -n2_10 + -n... (shortened)
lola: processed formula length: 946
lola: 5465159 rewrites
lola: formula mentions 101 of 3806 places; total mentions: 101
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF ((-malicious_reservoir <= -3 AND -SstopOK_7 + -SstopOK_6 + -SstopOK_1 + -SstopOK_32 + -SstopOK_31 + -SstopOK_20 + -SstopOK_10 + -SstopOK_11 + -SstopOK_12 + -SstopOK_13 + -SstopOK_14 + -SstopOK_15 + -SstopOK_16 + -SstopOK_17 + -SstopOK_18 + -SstopOK_19 + -SstopOK_21 + -SstopOK_22 + -SstopOK_23 + -SstopOK_24 + -SstopOK_25 + -SstopOK_26 + -SstopOK_27 + -SstopOK_28 + -SstopOK_29 + -SstopOK_30 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U (-malicious_reservoir <= -3 AND -SstopOK_7 + -SstopOK_6 + -SstopOK_1 + -SstopOK_32 + -SstopOK_31 + -SstopOK_20 + -SstopOK_10 + -SstopOK_11 + -SstopOK_12 + -SstopOK_13 + -SstopOK_14 + -SstopOK_15 + -SstopOK_16 + -SstopOK_17 + -SstopOK_18 + -SstopOK_19 + -SstopOK_21 + -SstopOK_22 + -SstopOK_23 + -SstopOK_24 + -SstopOK_25 + -SstopOK_26 + -SstopOK_27 + -SstopOK_28 + -SstopOK_29 +... (shortened)
lola: processed formula length: 514
lola: 5465159 rewrites
lola: formula mentions 34 of 3806 places; total mentions: 34
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-SstopOK_7 + -SstopOK_6 + -SstopOK_1 + -SstopOK_32 + -SstopOK_31 + -SstopOK_20 + -SstopOK_10 + -SstopOK_11 + -SstopOK_12 + -SstopOK_13 + -SstopOK_14 + -SstopOK_15 + -SstopOK_16 + -SstopOK_17 + -SstopOK_18 + -SstopOK_19 + -SstopOK_21 + -SstopOK_22 + -SstopOK_23 + -SstopOK_24 + -SstopOK_25 + -SstopOK_26 + -SstopOK_27 + -SstopOK_28 + -SstopOK_29 + -SstopOK_30 + -SstopOK_0 + -SstopOK_2 + -SstopOK_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -SstopOK_7 + -SstopOK_6 + -SstopOK_1 + -SstopOK_32 + -SstopOK_31 + -SstopOK_20 + -SstopOK_10 + -SstopOK_11 + -SstopOK_12 + -SstopOK_13 + -SstopOK_14 + -SstopOK_15 + -SstopOK_16 + -SstopOK_17 + -SstopOK_18 + -SstopOK_19 + -SstopOK_21 + -SstopOK_22 + -SstopOK_23 + -SstopOK_24 + -SstopOK_25 + -SstopOK_26 + -SstopOK_27 + -SstopOK_28 + -SstopOK_29 + -SstopOK_30 + -SstopOK_0 + -SstopOK_2 + -Sst... (shortened)
lola: processed formula length: 465
lola: 5465158 rewrites
lola: formula mentions 33 of 3806 places; total mentions: 33
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-n9_30_9 + -n9_30_8 + -n9_30_7 + -n9_30_6 + -n9_30_5 + -n9_30_4 + -n9_30_3 + -n9_30_2 + -n9_30_1 + -n9_30_0 + -n9_2_32 + -n9_2_31 + -n9_2_30 + -n9_2_29 + -n9_2_28 + -n9_2_27 + -n9_2_26 + -n9_2_25 + -n9_2_24 + -n9_2_23 + -n9_2_22 + -n9_2_21 + -n9_2_20 + -n9_2_19 + -n9_2_18 + -n9_2_17 + -n9_2_16 + -n9_2_15 + -n9_2_14 + -n9_2_13 + -n9_2_12 + -n9_2_11 + -n9_2_10 + -n9_26_32 + -n9_26_31 + -n9_26_30 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -n9_30_9 + -n9_30_8 + -n9_30_7 + -n9_30_6 + -n9_30_5 + -n9_30_4 + -n9_30_3 + -n9_30_2 + -n9_30_1 + -n9_30_0 + -n9_2_32 + -n9_2_31 + -n9_2_30 + -n9_2_29 + -n9_2_28 + -n9_2_27 + -n9_2_26 + -n9_2_25 + -n9_2_24 + -n9_2_23 + -n9_2_22 + -n9_2_21 + -n9_2_20 + -n9_2_19 + -n9_2_18 + -n9_2_17 + -n9_2_16 + -n9_2_15 + -n9_2_14 + -n9_2_13 + -n9_2_12 + -n9_2_11 + -n9_2_10 + -n9_26_32 + -n9_26_31 + -n9_26_30 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -n1_32 + -n1_31 + -n1_30 + -n1_29 + -n1_28 + -n1_27 + -n1_26 + -n1_25 + -n1_24 + -n1_23 + -n1_22 + -n1_21 + -n1_20 + -n1_19 + -n1_18 + -n1_17 + -n1_16 + -n1_15 + -n1_14 + -n1_13 + -n1_12 + -n1_11 + a5 + -n1_10 + -n1_0 + -n1_1 + -n1_2 + -n1_3 + -n1_4 + -n1_5 + -n1_6 + -n1_7 + -n1_8 + -n1_9 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (n7_5_9 + n7_5_8 + n7_5_7 + n7_5_6 + n7_5_5 + n7_5_4 + n7_5_3 + n7_5_2 + n7_5_1 + n7_5_0 + n7_3_11 + n7_3_12 + n7_3_13 + n7_3_14 + n7_3_15 + n7_3_16 + n7_3_17 + n7_3_18 + n7_3_19 + n7_16_9 + n7_16_8 + n7_16_7 + n7_16_6 + n7_16_5 + n7_16_4 + n7_16_3 + n7_16_2 + n7_16_1 + n7_16_0 + n7_29_9 + n7_29_8 + n7_29_7 + n7_29_6 + n7_29_5 + n7_29_4 + n7_29_3 + n7_29_2 + n7_29_1 + n7_29_0 + n7_9_32 + n7_9_31 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-n2_9 + -n2_8 + -n2_7 + -n2_6 + -n2_5 + -n2_4 + -n2_3 + -n2_2 + -n2_1 + -n2_0 + -n2_10 + -n2_11 + -n2_12 + -n2_13 + -n2_14 + -n2_15 + -n2_16 + -n2_17 + -n2_18 + -n2_19 + -n2_20 + -n2_21 + -n2_22 + -n2_23 + -n2_24 + -n2_25 + -n2_26 + -n2_27 + -n2_28 + -n2_29 + -n2_30 + -n2_31 + -n2_32 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (A(a4 + -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 + -s2_23 + -s2_24 + -s2_25 + -s2_26 + -s2_27 + -s2_28 + -s2_29 + -s2_30 + -s2_31 + -s2_32 + -s2_0 + -s2_1 + -s2_2 + -s2_3 + -s2_4 + -s2_5 + -s2_6 + -s2_7 + -s2_8 + -s2_9 <= 0 U n4_9 + n4_8 + n4_7 + n4_6 + n4_5 + n4_4 + n4_3 + n4_2 + n4_1 + n4_0 + -s2_10 + -s2_11 + -s2_12 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(A(a4 + -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 + -s2_23 + -s2_24 + -s2_25 + -s2_26 + -s2_27 + -s2_28 + -s2_29 + -s2_30 + -s2_31 + -s2_32 + -s2_0 + -s2_1 + -s2_2 + -s2_3 + -s2_4 + -s2_5 + -s2_6 + -s2_7 + -s2_8 + -s2_9 <= 0 U n4_9 + n4_8 + n4_7 + n4_6 + n4_5 + n4_4 + n4_3 + n4_2 + n4_1 + n4_0 + -s2_10 + -s2_11 + ... (shortened)
lola: processed formula length: 859
lola: 5465159 rewrites
lola: formula mentions 67 of 3806 places; total mentions: 100
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A(n5_9 + n5_8 + n5_7 + n5_6 + n5_5 + n5_4 + n5_3 + n5_2 + n5_1 + n5_0 + n5_32 + n5_31 + n5_30 + n5_29 + n5_28 + n5_27 + n5_26 + n5_25 + n5_24 + n5_23 + n5_22 + n5_21 + n5_20 + n5_19 + n5_18 + n5_17 + n5_16 + n5_15 + n5_14 + n5_13 + n5_12 + n5_11 + -s6_0 + -s6_1 + -s6_2 + -s6_3 + -s6_4 + -s6_5 + -s6_6 + -s6_7 + -s6_8 + -s6_9 + -s6_10 + -s6_11 + -s6_12 + -s6_13 + -s6_14 + -s6_15 + -s6_16 + -s6_17 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(n5_9 + n5_8 + n5_7 + n5_6 + n5_5 + n5_4 + n5_3 + n5_2 + n5_1 + n5_0 + n5_32 + n5_31 + n5_30 + n5_29 + n5_28 + n5_27 + n5_26 + n5_25 + n5_24 + n5_23 + n5_22 + n5_21 + n5_20 + n5_19 + n5_18 + n5_17 + n5_16 + n5_15 + n5_14 + n5_13 + n5_12 + n5_11 + -s6_0 + -s6_1 + -s6_2 + -s6_3 + -s6_4 + -s6_5 + -s6_6 + -s6_7 + -s6_8 + -s6_9 + -s6_10 + -s6_11 + -s6_12 + -s6_13 + -s6_14 + -s6_15 + -s6_16 + -s6_17 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(n5_9 + n5_8 + n5_7 + n5_6 + n5_5 + n5_4 + n5_3 + n5_2 + n5_1 + n5_0 + n5_32 + n5_31 + n5_30 + n5_29 + n5_28 + n5_27 + n5_26 + n5_25 + n5_24 + n5_23 + n5_22 + n5_21 + n5_20 + n5_19 + n5_18 + n5_17 + n5_16 + n5_15 + n5_14 + n5_13 + n5_12 + n5_11 + -s6_0 + -s6_1 + -s6_2 + -s6_3 + -s6_4 + -s6_5 + -s6_6 + -s6_7 + -s6_8 + -s6_9 + -s6_10 + -s6_11 + -s6_12 + -s6_13 + -s6_14 + -s6_15 + -s6_16 + -s6_17 + ... (shortened)
lola: processed formula length: 566
lola: 5465158 rewrites
lola: formula mentions 67 of 3806 places; total mentions: 67
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 527 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (n7_5_9 + n7_5_8 + n7_5_7 + n7_5_6 + n7_5_5 + n7_5_4 + n7_5_3 + n7_5_2 + n7_5_1 + n7_5_0 + n7_3_11 + n7_3_12 + n7_3_13 + n7_3_14 + n7_3_15 + n7_3_16 + n7_3_17 + n7_3_18 + n7_3_19 + n7_16_9 + n7_16_8 + n7_16_7 + n7_16_6 + n7_16_5 + n7_16_4 + n7_16_3 + n7_16_2 + n7_16_1 + n7_16_0 + n7_29_9 + n7_29_8 + n7_29_7 + n7_29_6 + n7_29_5 + n7_29_4 + n7_29_3 + n7_29_2 + n7_29_1 + n7_29_0 + -Astart + n7_9_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U n7_5_9 + n7_5_8 + n7_5_7 + n7_5_6 + n7_5_5 + n7_5_4 + n7_5_3 + n7_5_2 + n7_5_1 + n7_5_0 + n7_3_11 + n7_3_12 + n7_3_13 + n7_3_14 + n7_3_15 + n7_3_16 + n7_3_17 + n7_3_18 + n7_3_19 + n7_16_9 + n7_16_8 + n7_16_7 + n7_16_6 + n7_16_5 + n7_16_4 + n7_16_3 + n7_16_2 + n7_16_1 + n7_16_0 + n7_29_9 + n7_29_8 + n7_29_7 + n7_29_6 + n7_29_5 + n7_29_4 + n7_29_3 + n7_29_2 + n7_29_1 + n7_29_0 + -Astart + n... (shortened)
lola: processed formula length: 11340
lola: 5465158 rewrites
lola: formula mentions 1090 of 3806 places; total mentions: 1090
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 659 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EX (-SstopAbort <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX(-SstopAbort <= -2))
lola: processed formula length: 31
lola: 5465159 rewrites
lola: formula mentions 1 of 3806 places; total mentions: 1
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 11 will run for 527 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E((-Cstart_9 + -Cstart_8 + -Cstart_7 + -Cstart_6 + -Cstart_5 + -Cstart_4 + -Cstart_3 + -Cstart_2 + -Cstart_1 + -Cstart_0 + -Cstart_32 + -Cstart_31 + -Cstart_30 + -Cstart_29 + -Cstart_28 + -Cstart_27 + -Cstart_26 + -Cstart_25 + -Cstart_24 + -Cstart_23 + -Cstart_22 + -Cstart_21 + -Cstart_20 + -Cstart_19 + -Cstart_18 + -Cstart_17 + -Cstart_16 + -Cstart_15 + -Cstart_14 + -Cstart_13 + -Cstart_12 + -Cs... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 527 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((-Cstart_9 + -Cstart_8 + -Cstart_7 + -Cstart_6 + -Cstart_5 + -Cstart_4 + -Cstart_3 + -Cstart_2 + -Cstart_1 + -Cstart_0 + -Cstart_32 + -Cstart_31 + -Cstart_30 + -Cstart_29 + -Cstart_28 + -Cstart_27 + -Cstart_26 + -Cstart_25 + -Cstart_24 + -Cstart_23 + -Cstart_22 + -Cstart_21 + -Cstart_20 + -Cstart_19 + -Cstart_18 + -Cstart_17 + -Cstart_16 + -Cstart_15 + -Cstart_14 + -Cstart_13 + -Cstart_12 + -Cst... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-Cstart_9 + -Cstart_8 + -Cstart_7 + -Cstart_6 + -Cstart_5 + -Cstart_4 + -Cstart_3 + -Cstart_2 + -Cstart_1 + -Cstart_0 + -Cstart_32 + -Cstart_31 + -Cstart_30 + -Cstart_29 + -Cstart_28 + -Cstart_27 + -Cstart_26 + -Cstart_25 + -Cstart_24 + -Cstart_23 + -Cstart_22 + -Cstart_21 + -Cstart_20 + -Cstart_19 + -Cstart_18 + -Cstart_17 + -Cstart_16 + -Cstart_15 + -Cstart_14 + -Cstart_13 + -Cstart_12 + -Cst... (shortened)
lola: processed formula length: 1007
lola: 5465158 rewrites
lola: formula mentions 102 of 3806 places; total mentions: 102
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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 12 will run for 659 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF (-a4 + 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 + s2_23 + s2_24 + s2_25 + s2_26 + s2_27 + s2_28 + s2_29 + s2_30 + s2_31 + s2_32 + 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 CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U -a4 + 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 + s2_23 + s2_24 + s2_25 + s2_26 + s2_27 + s2_28 + s2_29 + s2_30 + s2_31 + s2_32 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s2_7 + s2_8 + s2_9 <= 0))))
lola: processed formula length: 288
lola: 5465159 rewrites
lola: formula mentions 34 of 3806 places; total mentions: 34
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 527 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-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 + -s5_23 + -s5_24 + -s5_25 + -s5_26 + -s5_27 + -s5_28 + -s5_29 + -s5_30 + -s5_31 + -s5_32 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -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 + -s5_23 + -s5_24 + -s5_25 + -s5_26 + -s5_27 + -s5_28 + -s5_29 + -s5_30 + -s5_31 + -s5_32 <= -2)
lola: processed formula length: 300
lola: 5465158 rewrites
lola: formula mentions 33 of 3806 places; total mentions: 33
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (-AstopOK > -2) OR (-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 + -s5_23 + -s5_24 + -s5_25 + -s5_26 + -s5_27 + -s5_28 + -s5_29 + -s5_30 + -s5_31 + -s5_32 > -2 AND a5 + -AstopAbort > 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-AstopOK > -2)
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 2020 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: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 992 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-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 + -s5_23 + -s5_24 + -s5_25 + -s5_26 + -s5_27 + -s5_28 + -s5_29 + -s5_30 + -s5_31 + -s5_32 > -2 AND a5 + -AstopAbort > 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 14 will run for 992 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG ((-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_23 + -c1_24 + -c1_25 + -c1_26 + -c1_27 + -c1_28 + -c1_29 + -c1_30 + -c1_31 + -c1_32 + -c1_0 + -c1_1 + -c1_2 + -c1_3 + -c1_4 + -c1_5 + -c1_6 + -c1_7 + -c1_8 <= -2 OR -a1 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U !(E(TRUE U !((-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_23 + -c1_24 + -c1_25 + -c1_26 + -c1_27 + -c1_28 + -c1_29 + -c1_30 + -c1_31 + -c1_32 + -c1_0 + -c1_1 + -c1_2 + -c1_3 + -c1_4 + -c1_5 + -c1_6 + -c1_7 + -c1_8 <= -2 OR -a1 <= -3)))))
lola: processed formula length: 331
lola: 5465159 rewrites
lola: formula mentions 34 of 3806 places; total mentions: 34
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AF (-CstopOK_32 + -CstopOK_31 + -CstopOK_30 + -CstopOK_29 + -CstopOK_28 + -CstopOK_27 + -CstopOK_26 + -CstopOK_25 + -CstopOK_24 + -CstopOK_23 + -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 + -Csto... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U -CstopOK_32 + -CstopOK_31 + -CstopOK_30 + -CstopOK_29 + -CstopOK_28 + -CstopOK_27 + -CstopOK_26 + -CstopOK_25 + -CstopOK_24 + -CstopOK_23 + -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... (shortened)
lola: processed formula length: 727
lola: 5465159 rewrites
lola: formula mentions 66 of 3806 places; total mentions: 66
lola: closed formula file QuasiCertifProtocol-COL-32-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: no yes unknown no no no unknown no yes yes unknown unknown no unknown unknown unknown

BK_STOP 1463719185914

--------------------
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-32"
export BK_EXAMINATION="CTLCardinality"
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-32.tgz
mv QuasiCertifProtocol-PT-32 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-32, examination is CTLCardinality"
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-146369140300129"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;