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-18, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098kn-smll-146369140300102
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463700838831

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ QuasiCertifProtocol-PT-18
FORMULA QuasiCertifProtocol-COL-18-CTLCardinality-0 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-18-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-CTLCardinality-2 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-18-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-CTLCardinality-4 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-18-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-CTLCardinality-7 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-18-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-CTLCardinality-12 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-18-CTLCardinality-13 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-18-CTLCardinality-14 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-18-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: 1694/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1398 places, 296 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 391 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-18-CTLCardinality.task
lola: read: ((AF (!(2 <= n3_3 + n3_2 + n3_1 + n3_0 + n3_7 + n3_6 + n3_5 + n3_4 + n3_16 + n3_17 + n3_18 + n3_8 + n3_9 + n3_10 + n3_11 + n3_12 + n3_13 + n3_14 + n3_15)) AND AG ((3 <= Cstart_1 + Cstart_0 + Cstart_3 + Cstart_2 + Cstart_5 + Cstart_4 + Cstart_7 + Cstart_6 + Cstart_9 + Cstart_8 + Cstart_18 + Cstart_17 + Cstart_16 + Cstart_15 + Cstart_14 + Cstart_13 + Cstart_12 + Cstart_11 + Cstart_10 OR a4 <= s2_1 +... (shortened)
lola: formula length: 23781
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 (-n3_18 + -n3_17 + -n3_16 + -n3_15 + -n3_14 + -n3_13 + -n3_12 + -n3_11 + -n3_10 + -n3_0 + -n3_1 + -n3_2 + -n3_3 + -n3_4 + -n3_5 + -n3_6 + -n3_7 + -n3_8 + -n3_9 > -2) AND (AG ((-Cstart_9 + -Cstart_8 + -Cstart_7 + -Cstart_6 + -Cstart_5 + -Cstart_4 + -Cstart_3 + -Cstart_2 + -Cstart_1 + -Cstart_0 + -Cstart_11 + -Cstart_12 + -Cstart_13 + -Cstart_14 + -Cstart_15 + -Cstart_16 + -Cstart_17 + -Cstart_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-n3_18 + -n3_17 + -n3_16 + -n3_15 + -n3_14 + -n3_13 + -n3_12 + -n3_11 + -n3_10 + -n3_0 + -n3_1 + -n3_2 + -n3_3 + -n3_4 + -n3_5 + -n3_6 + -n3_7 + -n3_8 + -n3_9 > -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -n3_18 + -n3_17 + -n3_16 + -n3_15 + -n3_14 + -n3_13 + -n3_12 + -n3_11 + -n3_10 + -n3_0 + -n3_1 + -n3_2 + -n3_3 + -n3_4 + -n3_5 + -n3_6 + -n3_7 + -n3_8 + -n3_9 > -2)
lola: processed formula length: 173
lola: 509735 rewrites
lola: formula mentions 19 of 1398 places; total mentions: 19
lola: closed formula file QuasiCertifProtocol-COL-18-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Cstart_9 + -Cstart_8 + -Cstart_7 + -Cstart_6 + -Cstart_5 + -Cstart_4 + -Cstart_3 + -Cstart_2 + -Cstart_1 + -Cstart_0 + -Cstart_11 + -Cstart_12 + -Cstart_13 + -Cstart_14 + -Cstart_15 + -Cstart_16 + -Cstart_17 + -Cstart_18 + -Cstart_10 <= -3 OR -s2_10 + -s2_11 + -s2_12 + -s2_13 + -s2_14 + -s2_15 + -s2_16 + -s2_17 + -s2_18 + a4 + -s2_0 + -s2_1 + -s2_2 + -s2_3 + -s2_4 + -s2_5 + -s2_6 + -s2_7 + -... (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 1180 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: 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 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-a1 <= -1 U EG (-n4_9 + -n4_8 + -n4_7 + -n4_6 + -n4_5 + -n4_4 + -n4_3 + -n4_2 + -n4_1 + -n4_0 + a4 + -n4_18 + -n4_17 + -n4_16 + -n4_15 + -n4_14 + -n4_13 + -n4_12 + -n4_11 + -n4_10 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-a1 <= -1 U !(A(TRUE U !(-n4_9 + -n4_8 + -n4_7 + -n4_6 + -n4_5 + -n4_4 + -n4_3 + -n4_2 + -n4_1 + -n4_0 + a4 + -n4_18 + -n4_17 + -n4_16 + -n4_15 + -n4_14 + -n4_13 + -n4_12 + -n4_11 + -n4_10 <= 0))))
lola: processed formula length: 199
lola: 509736 rewrites
lola: formula mentions 21 of 1398 places; total mentions: 21
lola: closed formula file QuasiCertifProtocol-COL-18-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AG ((-c1_9 + -c1_10 + -c1_11 + -c1_12 + -c1_13 + -c1_14 + -c1_15 + -c1_16 + -c1_17 + -c1_18 + -c1_0 + -c1_1 + -c1_2 + -c1_3 + -c1_4 + -c1_5 + -c1_6 + -c1_7 + -c1_8 <= -1 OR 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 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(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_0 + -c1_1 + -c1_2 + -c1_3 + -c1_4 + -c1_5 + -c1_6 + -c1_7 + -c1_8 <= -1 OR 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_... (shortened)
lola: processed formula length: 441
lola: 509736 rewrites
lola: formula mentions 39 of 1398 places; total mentions: 39
lola: closed formula file QuasiCertifProtocol-COL-18-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 3 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-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 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -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 <= -1)
lola: processed formula length: 269
lola: 509735 rewrites
lola: formula mentions 19 of 1398 places; total mentions: 19
lola: closed formula file QuasiCertifProtocol-COL-18-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 4 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AG (-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_14_11 + -n8_14_12 + -n8_14_13 + -n8_14_14 + -n8_14_15 + -n8_14_16 + -n8_14_17 + -n8_14_18 + -n8_0_18 + -n8_0_17 + -n8_0_16 + -n8_0_15 + -n8_0_14 + -n8_0_13 + -n8_0_12 + -n8_0_11 + -n8_0_10 + -n8_11_1 + -n8_11_2 + -n8_11_3 + -n8_11_4 + -n8_11_5 + -n8_11_6 + -n8_11_7 + -n8_11_8 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-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_14_11 + -n8_14_12 + -n8_14_13 + -n8_14_14 + -n8_14_15 + -n8_14_16 + -n8_14_17 + -n8_14_18 + -n8_0_18 + -n8_0_17 + -n8_0_16 + -n8_0_15 + -n8_0_14 + -n8_0_13 + -n8_0_12 + -n8_0_11 + -n8_0_10 + -n8_11_1 + -n8_11_2 + -n8_11_3 + -n8_11_4 + -n8_11_5 + -n8_11_6 + -n8_11_7 + -n8_11_8 + -n8... (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 1180 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 5 will run for 279 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_14_11 + -n8_14_12 + -n8_14_13 + -n8_14_14 + -n8_14_15 + -n8_14_16 + -n8_14_17 + -n8_14_18 + -n8_0_18 + -n8_0_17 + -n8_0_16 + -n8_0_15 + -n8_0_14 + -n8_0_13 + -n8_0_12 + -n8_0_11 + -n8_0_10 + -n8_11_1 + -n8_11_2 + -n8_11_3 + -n8_11_4 + -n8_11_5 + -n8_11_6 + -n8_11_7 + -n8_11_8 + -n8_1... (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_14_11 + -n8_14_12 + -n8_14_13 + -n8_14_14 + -n8_14_15 + -n8_14_16 + -n8_14_17 + -n8_14_18 + -n8_0_18 + -n8_0_17 + -n8_0_16 + -n8_0_15 + -n8_0_14 + -n8_0_13 + -n8_0_12 + -n8_0_11 + -n8_0_10 + -n8_11_1 + -n8_11_2 + -n8_11_3 + -n8_11_4 + -n8_11_5 + -n8_11_6 + -n8_11_7 + -n8_11_8 + -n8_1... (shortened)
lola: processed formula length: 4201
lola: 509735 rewrites
lola: formula mentions 380 of 1398 places; total mentions: 380
lola: closed formula file QuasiCertifProtocol-COL-18-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 6 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (EF (-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 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U -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 <= -1))
lola: processed formula length: 273
lola: 509736 rewrites
lola: formula mentions 19 of 1398 places; total mentions: 19
lola: closed formula file QuasiCertifProtocol-COL-18-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((c1_9 + c1_10 + c1_11 + c1_12 + c1_13 + c1_14 + c1_15 + c1_16 + c1_17 + c1_18 + -a2 + c1_0 + c1_1 + c1_2 + c1_3 + c1_4 + c1_5 + c1_6 + c1_7 + c1_8 <= 0 OR -a4 + AstopOK <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((c1_9 + c1_10 + c1_11 + c1_12 + c1_13 + c1_14 + c1_15 + c1_16 + c1_17 + c1_18 + -a2 + c1_0 + c1_1 + c1_2 + c1_3 + c1_4 + c1_5 + c1_6 + c1_7 + c1_8 <= 0 OR -a4 + AstopOK <= 0))))
lola: processed formula length: 190
lola: 509735 rewrites
lola: formula mentions 22 of 1398 places; total mentions: 22
lola: closed formula file QuasiCertifProtocol-COL-18-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 6 will run for 282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-n5_9 + -n5_8 + -n5_7 + -n5_6 + -n5_5 + -n5_4 + -n5_3 + -n5_2 + -n5_1 + -n5_0 + -n5_18 + -n5_17 + -n5_16 + -n5_15 + -n5_14 + -n5_13 + -n5_12 + -n5_11 + -n5_10 + Sstart_18 + Sstart_17 + Sstart_16 + Sstart_15 + Sstart_14 + Sstart_13 + Sstart_12 + Sstart_11 + Sstart_10 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + Sstart_7 + Sstart_8 + Sstart_9 <= 0)
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 1180 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 7 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((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_6_1 + 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_9_18 + n7_9_17 + n7_9_16 + n7_9_15 + n7_9_14 + n7_9_13 + n7_9_12 + n7_9_11 + n7_9_10 + n7_15_18 + n7_15_17 + n7_15_16 + n7_15_15 + n7_15_14 + n7_15_13 + n7_15_12 + n7_15_11 + n7_15_10 + n7_6_2 ... (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 1180 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-SstopOK_7 + -SstopOK_6 + -SstopOK_1 + -SstopOK_0 + -SstopOK_2 + -SstopOK_3 + -SstopOK_4 + -SstopOK_5 + -SstopOK_8 + -SstopOK_9 + -SstopOK_18 + -SstopOK_17 + -SstopOK_16 + -SstopOK_15 + -SstopOK_14 + -SstopOK_13 + -SstopOK_12 + -SstopOK_11 + -SstopOK_10 > -3 AND E(-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_6_1 + -n7_16_9 + -n7_16_8 + -n... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -SstopOK_7 + -SstopOK_6 + -SstopOK_1 + -SstopOK_0 + -SstopOK_2 + -SstopOK_3 + -SstopOK_4 + -SstopOK_5 + -SstopOK_8 + -SstopOK_9 + -SstopOK_18 + -SstopOK_17 + -SstopOK_16 + -SstopOK_15 + -SstopOK_14 + -SstopOK_13 + -SstopOK_12 + -SstopOK_11 + -SstopOK_10 > -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-18-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 358 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-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_6_1 + -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_9_18 + -n7_9_17 + -n7_9_16 + -n7_9_15 + -n7_9_14 + -n7_9_13 + -n7_9_12 + -n7_9_11 + -n7_9_10 + -n7_15_18 + -n7_15_17 + -n7_15_16 + -n7_15_15 + -n7_15_14 + -n7_15_13 + -n7_15_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(!(-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_6_1 + -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_9_18 + -n7_9_17 + -n7_9_16 + -n7_9_15 + -n7_9_14 + -n7_9_13 + -n7_9_12 + -n7_9_11 + -n7_9_10 + -n7_15_18 + -n7_15_17 + -n7_15_16 + -n7_15_15 + -n7_15_14 + -n7_15_13 + -n7... (shortened)
lola: processed formula length: 4136
lola: 509735 rewrites
lola: formula mentions 381 of 1398 places; total mentions: 381
lola: closed formula file QuasiCertifProtocol-COL-18-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 358 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((SstopAbort + -s6_10 + -s6_11 + -s6_12 + -s6_13 + -s6_14 + -s6_15 + -s6_16 + -s6_17 + -s6_18 + -s6_9 + -s6_8 + -s6_7 + -s6_6 + -s6_5 + -s6_4 + -s6_3 + -s6_2 + -s6_1 + -s6_0 <= 0 AND (-s2_10 + -s2_11 + -s2_12 + -s2_13 + -s2_14 + -s2_15 + -s2_16 + -s2_17 + -s2_18 + -s2_0 + -s2_1 + -s2_2 + -s2_3 + -s2_4 + -s2_5 + -s2_6 + -s2_7 + -s2_8 + -s2_9 > -3 AND -CstopOK_18 + -CstopOK_17 + -CstopOK_16 + -Cs... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (SstopAbort + -s6_10 + -s6_11 + -s6_12 + -s6_13 + -s6_14 + -s6_15 + -s6_16 + -s6_17 + -s6_18 + -s6_9 + -s6_8 + -s6_7 + -s6_6 + -s6_5 + -s6_4 + -s6_3 + -s6_2 + -s6_1 + -s6_0 <= 0 AND (-s2_10 + -s2_11 + -s2_12 + -s2_13 + -s2_14 + -s2_15 + -s2_16 + -s2_17 + -s2_18 + -s2_0 + -s2_1 + -s2_2 + -s2_3 + -s2_4 + -s2_5 + -s2_6 + -s2_7 + -s2_8 + -s2_9 > -3 AND -CstopOK_18 + -CstopOK_17 + -CstopOK_16 ... (shortened)
lola: processed formula length: 857
lola: 509735 rewrites
lola: formula mentions 77 of 1398 places; total mentions: 77
lola: closed formula file QuasiCertifProtocol-COL-18-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 10 will run for 418 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AX (-s2_10 + -s2_11 + -s2_12 + -s2_13 + -s2_14 + -s2_15 + -s2_16 + -s2_17 + -s2_18 + -s2_0 + -s2_1 + -s2_2 + -s2_3 + -s2_4 + -s2_5 + -s2_6 + -s2_7 + -s2_8 + -s2_9 > -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(AX(-s2_10 + -s2_11 + -s2_12 + -s2_13 + -s2_14 + -s2_15 + -s2_16 + -s2_17 + -s2_18 + -s2_0 + -s2_1 + -s2_2 + -s2_3 + -s2_4 + -s2_5 + -s2_6 + -s2_7 + -s2_8 + -s2_9 > -1))))
lola: processed formula length: 183
lola: 509736 rewrites
lola: formula mentions 19 of 1398 places; total mentions: 19
lola: closed formula file QuasiCertifProtocol-COL-18-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 11 will run for 498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AG (-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_6_1 + -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_9_18 + -n7_9_17 + -n7_9_16 + -n7_9_15 + -n7_9_14 + -n7_9_13 + -n7_9_12 + -n7_9_11 + -n7_9_10 + -n7_15_18 + -n7_15_17 + -n7_15_16 + -n7_15_15 + -n7_15_14 + -n7_15_13 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(E(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_6_1 + -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_9_18 + -n7_9_17 + -n7_9_16 + -n7_9_15 + -n7_9_14 + -n7_9_13 + -n7_9_12 + -n7_9_11 + -n7_9_10 + -n7_15_18 + -n7_15_17 + -n7_15_16 + -n7_15_15 + -n7_15_14 +... (shortened)
lola: processed formula length: 3984
lola: 509736 rewrites
lola: formula mentions 362 of 1398 places; total mentions: 362
lola: closed formula file QuasiCertifProtocol-COL-18-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 12 will run for 622 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AG (-a3 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(!(E(TRUE U !(-a3 > -2))))))
lola: processed formula length: 40
lola: 509736 rewrites
lola: formula mentions 1 of 1398 places; total mentions: 1
lola: closed formula file QuasiCertifProtocol-COL-18-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 13 will run for 623 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EG (-a1 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(!(A(TRUE U !(-a1 > -3))))))
lola: processed formula length: 40
lola: 509736 rewrites
lola: formula mentions 1 of 1398 places; total mentions: 1
lola: closed formula file QuasiCertifProtocol-COL-18-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 14 will run for 622 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(n3_18 + n3_17 + n3_16 + n3_15 + n3_14 + n3_13 + n3_12 + n3_11 + n3_10 + -n6_10 + -n6_11 + -n6_12 + -n6_13 + -n6_14 + -n6_15 + -n6_16 + -n6_17 + -n6_18 + n3_0 + n3_1 + n3_2 + n3_3 + n3_4 + n3_5 + -n6_9 + -n6_8 + -n6_7 + -n6_6 + -n6_5 + -n6_4 + -n6_3 + -n6_2 + -n6_1 + -n6_0 + n3_6 + n3_7 + n3_8 + n3_9 <= 0 U AF (-a5 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(n3_18 + n3_17 + n3_16 + n3_15 + n3_14 + n3_13 + n3_12 + n3_11 + n3_10 + -n6_10 + -n6_11 + -n6_12 + -n6_13 + -n6_14 + -n6_15 + -n6_16 + -n6_17 + -n6_18 + n3_0 + n3_1 + n3_2 + n3_3 + n3_4 + n3_5 + -n6_9 + -n6_8 + -n6_7 + -n6_6 + -n6_5 + -n6_4 + -n6_3 + -n6_2 + -n6_1 + -n6_0 + n3_6 + n3_7 + n3_8 + n3_9 <= 0 U A(TRUE U -a5 <= -2))
lola: processed formula length: 330
lola: 509736 rewrites
lola: formula mentions 39 of 1398 places; total mentions: 39
lola: closed formula file QuasiCertifProtocol-COL-18-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 15 will run for 623 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AX (-n2_9 + -n2_8 + -n2_7 + -n2_6 + -n2_5 + -n2_4 + -n2_3 + -n2_2 + -n2_1 + -n2_0 + n3_18 + n3_17 + n3_16 + n3_15 + n3_14 + n3_13 + n3_12 + n3_11 + n3_10 + -n2_10 + -n2_11 + -n2_12 + -n2_13 + -n2_14 + -n2_15 + -n2_16 + -n2_17 + -n2_18 + n3_0 + n3_1 + n3_2 + n3_3 + n3_4 + n3_5 + n3_6 + n3_7 + n3_8 + n3_9 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(-n2_9 + -n2_8 + -n2_7 + -n2_6 + -n2_5 + -n2_4 + -n2_3 + -n2_2 + -n2_1 + -n2_0 + n3_18 + n3_17 + n3_16 + n3_15 + n3_14 + n3_13 + n3_12 + n3_11 + n3_10 + -n2_10 + -n2_11 + -n2_12 + -n2_13 + -n2_14 + -n2_15 + -n2_16 + -n2_17 + -n2_18 + n3_0 + n3_1 + n3_2 + n3_3 + n3_4 + n3_5 + n3_6 + n3_7 + n3_8 + n3_9 > 0))
lola: processed formula length: 318
lola: 509736 rewrites
lola: formula mentions 38 of 1398 places; total mentions: 38
lola: closed formula file QuasiCertifProtocol-COL-18-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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: time limit reached - aborting
lola: preliminary result: unknown yes unknown no unknown yes yes unknown yes no no no unknown unknown unknown

BK_STOP 1463704378936

--------------------
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-18"
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-18.tgz
mv QuasiCertifProtocol-PT-18 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-18, 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-146369140300102"
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 ;