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

About the Execution of LoLa for TriangularGrid-PT-5046

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13576.120 2266109.00 2269725.00 5961.90 TTF???FFTTFF?FTF 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 TriangularGrid-PT-5046, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r218su-smll-146468021900795
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1465002924909

bkconf 3600
===========================================================================================
===========================================================================================
TriangularGrid-PT-5046: translating Petri net model.pnml into LoLA format
TriangularGrid-PT-5046: translating formula CTLCardinality into LoLA format
===========================================================================================
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
===========================================================================================
/home/mcc/BenchKit/bin/formula2lola.py CTLCardinality.xml
touch formulae;


in benchkit_head lolaszeit 3539
CTLCardinality @ TriangularGrid-PT-5046
FORMULA TriangularGrid-PT-5046-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TriangularGrid-PT-5046-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TriangularGrid-PT-5046-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TriangularGrid-PT-5046-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TriangularGrid-PT-5046-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TriangularGrid-PT-5046-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TriangularGrid-PT-5046-CTLCardinality-6 CANNOT_COMPUTE
FORMULA TriangularGrid-PT-5046-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TriangularGrid-PT-5046-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TriangularGrid-PT-5046-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TriangularGrid-PT-5046-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TriangularGrid-PT-5046-CTLCardinality-11 CANNOT_COMPUTE
FORMULA TriangularGrid-PT-5046-CTLCardinality-12 CANNOT_COMPUTE
FORMULA TriangularGrid-PT-5046-CTLCardinality-13 CANNOT_COMPUTE
FORMULA TriangularGrid-PT-5046-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TriangularGrid-PT-5046-CTLCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 520/65536 symbol table entries, 4 collisions
lola: preprocessing...
lola: finding significant places
lola: 280 places, 240 transitions, 164 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 355 transition conflict sets
lola: TASK
lola: reading formula from TriangularGrid-PT-5046-CTLCardinality.task
lola: read: (EG (!(!(po2_3_5 <= po1_4_5))) AND pb3_4_5 <= pbl_2_3) : !(AG (pb2_2_2 <= pbl_2_3)) : EF ((EG (po1_2_1 <= pi1_5_3) AND pbl_4_6 <= pb2_5_7)) : EF (pb3_3_1 <= pil1_3_1) : A((!(pb1_5_5 <= pil3_3_1) OR (pbl_4_4 <= po1_5_7 OR 3 <= pil3_4_5)) U ((pil3_5_1 <= pol3_2_1 AND pb3_3_3 <= pbl_4_4) AND 2 <= po3_3_3)) : AF (EG (2 <= pil3_5_7)) : !(AF (AG (pb1_4_3 <= pi3_3_1))) : (pil2_4_1 <= pi2_2_3 OR AG (((pi1... (shortened)
lola: formula length: 1180
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG (po2_3_5 + -po1_4_5 <= 0) AND -pbl_2_3 + pb3_4_5 <= 0)
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: EG (po2_3_5 + -po1_4_5 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(po2_3_5 + -po1_4_5 <= 0)))
lola: processed formula length: 39
lola: 235 rewrites
lola: formula mentions 2 of 280 places; total mentions: 2
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: -pbl_2_3 + pb3_4_5 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (pb2_2_2 + -pbl_2_3 > 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 656 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 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((EG (po1_2_1 + -pi1_5_3 <= 0) AND -pb2_5_7 + pbl_4_6 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (!(A(TRUE U !(po1_2_1 + -pi1_5_3 <= 0))) AND -pb2_5_7 + pbl_4_6 <= 0))
lola: processed formula length: 79
lola: 236 rewrites
lola: formula mentions 4 of 280 places; total mentions: 4
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-pil1_3_1 + pb3_3_1 <= 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 656 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 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((pb1_5_5 + -pil3_3_1 > 0 OR (-po1_5_7 + pbl_4_4 <= 0 OR -pil3_4_5 <= -3)) U (-pol3_2_1 + pil3_5_1 <= 0 AND (-pbl_4_4 + pb3_3_3 <= 0 AND -po3_3_3 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((pb1_5_5 + -pil3_3_1 > 0 OR (-po1_5_7 + pbl_4_4 <= 0 OR -pil3_4_5 <= -3)) U (-pol3_2_1 + pil3_5_1 <= 0 AND (-pbl_4_4 + pb3_3_3 <= 0 AND -po3_3_3 <= -2)))
lola: processed formula length: 155
lola: 235 rewrites
lola: formula mentions 9 of 280 places; total mentions: 10
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EG (-pil3_5_7 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(A(TRUE U !(-pil3_5_7 <= -2))))
lola: processed formula length: 41
lola: 236 rewrites
lola: formula mentions 1 of 280 places; total mentions: 1
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF (-pi3_3_1 + pb1_4_3 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U -pi3_3_1 + pb1_4_3 > 0))))
lola: processed formula length: 48
lola: 236 rewrites
lola: formula mentions 2 of 280 places; total mentions: 2
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (pil2_4_1 + -pi2_2_3 <= 0 OR AG ((pi1_1_1 + -po2_5_9 <= 0 OR (-pb3_5_5 <= -2 OR (-pbl_3_1 <= -2 OR pol2_5_1 + -pb3_1_1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: pil2_4_1 + -pi2_2_3 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((pi1_1_1 + -po2_5_9 <= 0 OR (-pb3_5_5 <= -2 OR (-pbl_3_1 <= -2 OR pol2_5_1 + -pb3_1_1 <= 0))))
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 656 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (pb1_4_3 + -po3_5_1 <= 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 656 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 9 will run for 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-pol2_3_3 + pb3_2_1 <= 0 OR ((-pi3_2_1 <= -1 AND -pi1_3_5 <= -3) OR AG (-pb3_1_1 <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -pol2_3_3 + pb3_2_1 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.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 531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-pi3_2_1 <= -1 AND -pi1_3_5 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-pb3_1_1 <= -1)
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 656 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (AG ((-pb3_5_9 <= -2 OR -pb3_4_2 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(!(E(TRUE U !((-pb3_5_9 <= -2 OR -pb3_4_2 <= -2)))))
lola: processed formula length: 54
lola: 236 rewrites
lola: formula mentions 2 of 280 places; total mentions: 2
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG ((pil1_5_9 + -pil1_2_3 <= 0 OR (-pil1_4_7 <= -1 OR -pi1_4_5 > -3))) OR AX ((-po1_3_5 + pi1_3_1 > 0 OR pol1_1_1 + -pb2_3_5 > 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((pil1_5_9 + -pil1_2_3 <= 0 OR (-pil1_4_7 <= -1 OR -pi1_4_5 > -3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((EX (-pol2_5_9 <= -2) OR EF (-pi3_4_1 + pi2_5_5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((EX(-pol2_5_9 <= -2) OR E(TRUE U -pi3_4_1 + pi2_5_5 <= 0)))))
lola: processed formula length: 74
lola: 237 rewrites
lola: formula mentions 3 of 280 places; total mentions: 3
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E((-pb3_3_4 + pi1_3_1 <= 0 OR -pil2_5_5 + pil2_5_3 <= 0) U (-pbl_4_5 <= -2 OR -pol2_1_1 <= -3)) AND A(pol1_2_1 + -pol3_4_3 > 0 R -po2_3_1 > -3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((-pb3_3_4 + pi1_3_1 <= 0 OR -pil2_5_5 + pil2_5_3 <= 0) U (-pbl_4_5 <= -2 OR -pol2_1_1 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-pb3_3_4 + pi1_3_1 <= 0 OR -pil2_5_5 + pil2_5_3 <= 0) U (-pbl_4_5 <= -2 OR -pol2_1_1 <= -3))
lola: processed formula length: 95
lola: 235 rewrites
lola: formula mentions 6 of 280 places; total mentions: 6
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 14 will run for 955 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(pol1_2_1 + -pol3_4_3 > 0 R -po2_3_1 > -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!(pol1_2_1 + -pol3_4_3 > 0) U !(-po2_3_1 > -3)))
lola: processed formula length: 52
lola: 235 rewrites
lola: formula mentions 3 of 280 places; total mentions: 3
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 14 will run for 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((AG (-pb2_4_4 + po1_5_9 <= 0) OR (-pb3_4_7 <= -1 AND (-pb2_4_6 <= -2 AND -pi3_4_1 + pil2_1_1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((!(E(TRUE U !(-pb2_4_4 + po1_5_9 <= 0))) OR (-pb3_4_7 <= -1 AND (-pb2_4_6 <= -2 AND -pi3_4_1 + pil2_1_1 <= 0))))))
lola: processed formula length: 127
lola: 236 rewrites
lola: formula mentions 6 of 280 places; total mentions: 6
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 15 will run for 1274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (((pb2_5_5 + -pil3_5_3 <= 0 AND (-po3_5_5 <= -3 AND (po1_4_5 + -pi1_3_3 <= 0 OR -pb3_5_1 <= -2))) OR (pil2_5_9 + -pbl_5_2 > 0 AND -pil1_2_3 > -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((pb2_5_5 + -pil3_5_3 <= 0 AND (-po3_5_5 <= -3 AND (po1_4_5 + -pi1_3_3 <= 0 OR -pb3_5_1 <= -2))) OR (pil2_5_9 + -pbl_5_2 > 0 AND -pil1_2_3 > -3)))
lola: processed formula length: 155
lola: 235 rewrites
lola: formula mentions 9 of 280 places; total mentions: 9
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: RESULT
lola: summary: yes yes yes yes no no unknown no yes no no unknown unknown unknown no no
lola: ========================================

BK_STOP 1465005191018

--------------------
content from stderr:

parsing of model.pnml complete

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="TriangularGrid-PT-5046"
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/TriangularGrid-PT-5046.tgz
mv TriangularGrid-PT-5046 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 TriangularGrid-PT-5046, 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 r218su-smll-146468021900795"
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 ;