fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r078-ebro-149441008300138
Last Updated
June 27, 2017

About the Execution of LoLA for SquareGrid-PT-080408

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7211.690 1012917.00 1017800.00 242.60 FFTTTFFFFF??TFT? 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-3253
Executing tool lola
Input is SquareGrid-PT-080408, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-ebro-149441008300138
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494933782578


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ SquareGrid-PT-080408 @ 3540 seconds
----- Start make result stdout -----
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: 1952/65536 symbol table entries, 279 collisions
lola: preprocessing...
lola: finding significant places
lola: 896 places, 1056 transitions, 543 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1408 transition conflict sets
lola: TASK
lola: reading formula from SquareGrid-PT-080408-CTLCardinality.task
lola: (A (F (A (G ((2 <= pbl_3_3))))) AND E (X ((1 <= p4o_4_2)))) : (A (F (((pb1_3_1 <= p1o_5_3) AND (1 <= p1o_7_8) AND (3 <= pb4_8_3) AND (pbl_7_1 <= pb2_4_3)))) OR ((((2 <= pb4_3_5) OR (p4ol_4_5 <= p1i_4_8)) AND ((p1o_9_7 <= pb1_2_3) OR (pb4_5_1 <= p4o_6_1)) AND ((pbl_6_7 + 1 <= pbl_7_6) OR (p1i_2_2 <= 0))) AND A (G ((3 <= pbl_1_2))))) : A (X ((E (F ((p4ol_8_2 <= pbl_2_2))) AND A (G ((p4il_3_9 <= pb2_7_5)))))) : A (F (((p4i_5_9 <= p4il_1_2) AND (p1ol_1_4 <= p4o_3_6) AND ((pbl_1_1 <= 2) OR (pb3_6_3 <= 2))))) : E (F ((E (G ((2 <= pbl_1_1))) AND (pb1_5_4 <= p4i_3_9)))) : E (G (E (F ((2 <= pb3_1_6))))) : NOT(A (G (A (F ((1 <= pb3_4_3)))))) : (((A (X ((p1il_9_8 <= pbl_7_5))) AND A (G ((pb3_8_2 <= pbl_6_3)))) AND E (X (((p4o_3_9 <= pb2_2_4) AND (p1o_2_8 <= p1il_4_2))))) AND ((A (X ((p4i_1_2 <= p4i_7_4))) OR ((3 <= pb3_1_3) OR (3 <= p1il_8_1) OR (pbl_3_8 <= p4il_7_5))) OR (pb1_8_1 <= pb2_3_6))) : A (F (NOT(A (F ((pb4_7_8 <= p4o_8_1)))))) : A (G (E (((2 <= pb3_3_4) U (p1i_4_7 <= p1o_9_7))))) : E (F (A (X ((p4i_4_9 + 1 <= p4i_8_4))))) : NOT(((3 <= p4i_8_2) OR E (F ((2 <= p1i_2_6))))) : E (F (((2 <= pb3_3_1) AND (pbl_4_5 <= p1o_8_5)))) : ((p4il_3_5 <= p1ol_7_8) AND E (X (E (X ((pbl_4_7 <= p4i_6_2)))))) : E (G (A (G ((3 <= pbl_5_8))))) : (A (((2 <= pb3_5_4) U ((3 <= p1i_3_3) AND (1 <= pbl_8_7)))) AND NOT(E (F ((pbl_2_7 <= p1il_7_6)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (G ((2 <= pbl_3_3))))) AND E (X ((1 <= p4o_4_2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((2 <= pbl_3_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U (pbl_3_3 <= 1))))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
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 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((pb1_3_1 <= p1o_5_3) AND (1 <= p1o_7_8) AND (3 <= pb4_8_3) AND (pbl_7_1 <= pb2_4_3)))) OR ((((2 <= pb4_3_5) OR (p4ol_4_5 <= p1i_4_8)) AND ((p1o_9_7 <= pb1_2_3) OR (pb4_5_1 <= p4o_6_1)) AND ((pbl_6_7 + 1 <= pbl_7_6) OR (p1i_2_2 <= 0))) AND A (G ((3 <= pbl_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((pb1_3_1 <= p1o_5_3) AND (1 <= p1o_7_8) AND (3 <= pb4_8_3) AND (pbl_7_1 <= pb2_4_3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((pb1_3_1 <= p1o_5_3) AND (1 <= p1o_7_8) AND (3 <= pb4_8_3) AND (pbl_7_1 <= pb2_4_3)))
lola: processed formula length: 95
lola: 1 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= pb4_3_5) OR (p4ol_4_5 <= p1i_4_8)) AND ((p1o_9_7 <= pb1_2_3) OR (pb4_5_1 <= p4o_6_1)) AND ((pbl_6_7 + 1 <= pbl_7_6) OR (p1i_2_2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= pb4_3_5) OR (p4ol_4_5 <= p1i_4_8)) AND ((p1o_9_7 <= pb1_2_3) OR (pb4_5_1 <= p4o_6_1)) AND ((pbl_6_7 + 1 <= pbl_7_6) OR (p1i_2_2 <= 0)))
lola: processed formula length: 146
lola: 0 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: processed formula with 6 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= pbl_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to SquareGrid-PT-080408-CTLCardinality-3.sara
lola: The predicate is not invariant.
lola: lola: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((E (F ((p4ol_8_2 <= pbl_2_2))) AND A (G ((p4il_3_9 <= pb2_7_5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((p4ol_8_2 <= pbl_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (p4ol_8_2 <= pbl_2_2)))
lola: processed formula length: 35
lola: 3 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p4il_3_9 <= pb2_7_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(E(TRUE U (pb2_7_5 + 1 <= p4il_3_9))))
lola: processed formula length: 44
lola: 4 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p4i_5_9 <= p4il_1_2) AND (p1ol_1_4 <= p4o_3_6) AND ((pbl_1_1 <= 2) OR (pb3_6_3 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p4i_5_9 <= p4il_1_2) AND (p1ol_1_4 <= p4o_3_6) AND ((pbl_1_1 <= 2) OR (pb3_6_3 <= 2))))
lola: processed formula length: 99
lola: 1 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((2 <= pbl_1_1))) AND (pb1_5_4 <= p4i_3_9))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(A(TRUE U (pbl_1_1 <= 1))) AND (pb1_5_4 <= p4i_3_9)))
lola: processed formula length: 66
lola: 3 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 171281 markings, 755483 edges, 2948819816951054336 markings/sec, 0 secs
lola: 306402 markings, 1484823 edges, 27024 markings/sec, 5 secs
lola: 441830 markings, 2197073 edges, 27086 markings/sec, 10 secs
lola: 576678 markings, 2917023 edges, 26970 markings/sec, 15 secs
lola: 715049 markings, 3625263 edges, 27674 markings/sec, 20 secs
lola: 866683 markings, 4299499 edges, 30327 markings/sec, 25 secs
lola: 1030146 markings, 4992812 edges, 32693 markings/sec, 30 secs
lola: 1195975 markings, 5678207 edges, 33166 markings/sec, 35 secs
lola: 1362383 markings, 6360080 edges, 33282 markings/sec, 40 secs
lola: 1494461 markings, 7003812 edges, 26416 markings/sec, 45 secs
lola: 1572127 markings, 7563729 edges, 15533 markings/sec, 50 secs
lola: 1669596 markings, 8161584 edges, 19494 markings/sec, 55 secs
lola: 1794034 markings, 8766392 edges, 24888 markings/sec, 60 secs
lola: 1907700 markings, 9322979 edges, 22733 markings/sec, 65 secs
lola: 2059980 markings, 9967111 edges, 30456 markings/sec, 70 secs
lola: 2216724 markings, 10606995 edges, 31349 markings/sec, 75 secs
lola: 2368568 markings, 11243120 edges, 30369 markings/sec, 80 secs
lola: 2475072 markings, 11828174 edges, 21301 markings/sec, 85 secs
lola: 2538296 markings, 12335821 edges, 12645 markings/sec, 90 secs
lola: 2604971 markings, 12863911 edges, 13335 markings/sec, 95 secs
lola: 2748949 markings, 13543998 edges, 28796 markings/sec, 100 secs
lola: 2870857 markings, 14191692 edges, 24382 markings/sec, 105 secs
lola: 2991504 markings, 14839670 edges, 24129 markings/sec, 110 secs
lola: 3109663 markings, 15476918 edges, 23632 markings/sec, 115 secs
lola: 3229235 markings, 16098695 edges, 23914 markings/sec, 120 secs
lola: 3364792 markings, 16705759 edges, 27111 markings/sec, 125 secs
lola: 3493855 markings, 17279133 edges, 25813 markings/sec, 130 secs
lola: 3640062 markings, 17885580 edges, 29241 markings/sec, 135 secs
lola: 3786181 markings, 18477195 edges, 29224 markings/sec, 140 secs
lola: 3930450 markings, 19071197 edges, 28854 markings/sec, 145 secs
lola: 4041198 markings, 19640550 edges, 22150 markings/sec, 150 secs
lola: 4111563 markings, 20153703 edges, 14073 markings/sec, 155 secs
lola: 4197031 markings, 20705234 edges, 17094 markings/sec, 160 secs
lola: 4313756 markings, 21257657 edges, 23345 markings/sec, 165 secs
lola: 4416352 markings, 21765050 edges, 20519 markings/sec, 170 secs
lola: 4555802 markings, 22356161 edges, 27890 markings/sec, 175 secs
lola: 4686887 markings, 22914791 edges, 26217 markings/sec, 180 secs
lola: 4824667 markings, 23483541 edges, 27556 markings/sec, 185 secs
lola: 4960048 markings, 24069651 edges, 27076 markings/sec, 190 secs
lola: 5032123 markings, 24552087 edges, 14415 markings/sec, 195 secs
lola: 5088379 markings, 25014438 edges, 11251 markings/sec, 200 secs
lola: 5156988 markings, 25515129 edges, 13722 markings/sec, 205 secs
lola: 5291058 markings, 26173877 edges, 26814 markings/sec, 210 secs
lola: 5418013 markings, 26829372 edges, 25391 markings/sec, 215 secs
lola: 5539538 markings, 27483962 edges, 24305 markings/sec, 220 secs
lola: 5657238 markings, 28118070 edges, 23540 markings/sec, 225 secs
lola: 5797659 markings, 28743895 edges, 28084 markings/sec, 230 secs
lola: 5925740 markings, 29323250 edges, 25616 markings/sec, 235 secs
lola: 6077764 markings, 29951489 edges, 30405 markings/sec, 240 secs
lola: 6228430 markings, 30561217 edges, 30133 markings/sec, 245 secs
lola: 6377125 markings, 31173785 edges, 29739 markings/sec, 250 secs
lola: 6487520 markings, 31752726 edges, 22079 markings/sec, 255 secs
lola: 6559250 markings, 32277869 edges, 14346 markings/sec, 260 secs
lola: 6652244 markings, 32841964 edges, 18599 markings/sec, 265 secs
lola: 6767788 markings, 33402187 edges, 23109 markings/sec, 270 secs
lola: 6869848 markings, 33893765 edges, 20412 markings/sec, 275 secs
lola: 7009825 markings, 34487306 edges, 27995 markings/sec, 280 secs
lola: 7139493 markings, 35041019 edges, 25934 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((2 <= pb3_1_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (2 <= pb3_1_6)))))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 308785 markings, 1150830 edges, 3095640903142866944 markings/sec, 0 secs
lola: 515087 markings, 2178996 edges, 41260 markings/sec, 5 secs
lola: 735515 markings, 3162102 edges, 44086 markings/sec, 10 secs
lola: 912241 markings, 4132923 edges, 35345 markings/sec, 15 secs
lola: 1085102 markings, 4968478 edges, 34572 markings/sec, 20 secs
lola: 1283931 markings, 5883759 edges, 39766 markings/sec, 25 secs
lola: 1471910 markings, 6849086 edges, 37596 markings/sec, 30 secs
lola: 1685454 markings, 7754387 edges, 42709 markings/sec, 35 secs
lola: 1890380 markings, 8621523 edges, 40985 markings/sec, 40 secs
lola: 2059405 markings, 9431954 edges, 33805 markings/sec, 45 secs
lola: 2199613 markings, 10261747 edges, 28042 markings/sec, 50 secs
lola: 2327162 markings, 11129263 edges, 25510 markings/sec, 55 secs
lola: 2437716 markings, 11820771 edges, 22111 markings/sec, 60 secs
lola: 2558484 markings, 12573536 edges, 24154 markings/sec, 65 secs
lola: 2739985 markings, 13323320 edges, 36300 markings/sec, 70 secs
lola: 2898034 markings, 14091997 edges, 31610 markings/sec, 75 secs
lola: 3037730 markings, 14935723 edges, 27939 markings/sec, 80 secs
lola: 3143599 markings, 15830720 edges, 21174 markings/sec, 85 secs
lola: 3255473 markings, 16644501 edges, 22375 markings/sec, 90 secs
lola: 3431720 markings, 17462309 edges, 35249 markings/sec, 95 secs
lola: 3546667 markings, 18289491 edges, 22989 markings/sec, 100 secs
lola: 3782539 markings, 19047573 edges, 47174 markings/sec, 105 secs
lola: 3951263 markings, 19810880 edges, 33745 markings/sec, 110 secs
lola: 4093468 markings, 20700577 edges, 28441 markings/sec, 115 secs
lola: 4216579 markings, 21670452 edges, 24622 markings/sec, 120 secs
lola: 4388275 markings, 22594379 edges, 34339 markings/sec, 125 secs
lola: 4548912 markings, 23453161 edges, 32127 markings/sec, 130 secs
lola: 4717914 markings, 24312630 edges, 33800 markings/sec, 135 secs
lola: 4882796 markings, 25123380 edges, 32976 markings/sec, 140 secs
lola: 5013421 markings, 26066972 edges, 26125 markings/sec, 145 secs
lola: 5137477 markings, 26968718 edges, 24811 markings/sec, 150 secs
lola: 5223706 markings, 27744257 edges, 17246 markings/sec, 155 secs
lola: 5368111 markings, 28567414 edges, 28881 markings/sec, 160 secs
lola: 5536095 markings, 29378998 edges, 33597 markings/sec, 165 secs
lola: 5683140 markings, 30242009 edges, 29409 markings/sec, 170 secs
lola: 5817212 markings, 31036398 edges, 26814 markings/sec, 175 secs
lola: 5893810 markings, 31843327 edges, 15320 markings/sec, 180 secs
lola: 6025891 markings, 32637988 edges, 26416 markings/sec, 185 secs
lola: 6120803 markings, 33405842 edges, 18982 markings/sec, 190 secs
lola: 6255331 markings, 34171899 edges, 26906 markings/sec, 195 secs
lola: 6371110 markings, 34988976 edges, 23156 markings/sec, 200 secs
lola: 6553966 markings, 35896360 edges, 36571 markings/sec, 205 secs
lola: 6702069 markings, 36719739 edges, 29621 markings/sec, 210 secs
lola: 6904629 markings, 37431206 edges, 40512 markings/sec, 215 secs
lola: 7052461 markings, 38150669 edges, 29566 markings/sec, 220 secs
lola: 7159537 markings, 38928461 edges, 21415 markings/sec, 225 secs
lola: 7287956 markings, 39851714 edges, 25684 markings/sec, 230 secs
lola: 7395853 markings, 40740260 edges, 21579 markings/sec, 235 secs
lola: 7622613 markings, 41705966 edges, 45352 markings/sec, 240 secs
lola: 7862046 markings, 42765261 edges, 47887 markings/sec, 245 secs
lola: 8069959 markings, 43730302 edges, 41583 markings/sec, 250 secs
lola: 8227186 markings, 44759207 edges, 31445 markings/sec, 255 secs
lola: 8389045 markings, 45655754 edges, 32372 markings/sec, 260 secs
lola: 8506434 markings, 46510355 edges, 23478 markings/sec, 265 secs
lola: 8662274 markings, 47510080 edges, 31168 markings/sec, 270 secs
lola: 8785603 markings, 48344394 edges, 24666 markings/sec, 275 secs
lola: 8971632 markings, 49198527 edges, 37206 markings/sec, 280 secs
lola: 9127475 markings, 50087990 edges, 31169 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (A (F ((1 <= pb3_4_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (1 <= pb3_4_3))))
lola: processed formula length: 39
lola: 8 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A (X ((p1il_9_8 <= pbl_7_5))) AND A (G ((pb3_8_2 <= pbl_6_3)))) AND E (X (((p4o_3_9 <= pb2_2_4) AND (p1o_2_8 <= p1il_4_2))))) AND ((A (X ((p4i_1_2 <= p4i_7_4))) OR ((3 <= pb3_1_3) OR (3 <= p1il_8_1) OR (pbl_3_8 <= p4il_7_5))) OR (pb1_8_1 <= pb2_3_6)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p1il_9_8 <= pbl_7_5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((p1il_9_8 <= pbl_7_5))
lola: processed formula length: 25
lola: 5 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pb3_8_2 <= pbl_6_3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: SUBRESULTstate equation: write sara problem file to SquareGrid-PT-080408-CTLCardinality-8.sara

lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: lola: ...considering subproblem: A (F (NOT(A (F ((pb4_7_8 <= p4o_8_1))))))
========================================lola:
========================================
state equation: calling and running sara
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (pb4_7_8 <= p4o_8_1))))
lola: processed formula length: 45
lola: 6 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file SquareGrid-PT-080408-CTLCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 421 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (((2 <= pb3_3_4) U (p1i_4_7 <= p1o_9_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(E((2 <= pb3_3_4) U (p1i_4_7 <= p1o_9_7)))))
lola: processed formula length: 60
lola: 2 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

lola: 221226 markings, 796340 edges, 2966512333431504896 markings/sec, 0 secs
lola: 429434 markings, 1550141 edges, 41642 markings/sec, 5 secs
lola: 620769 markings, 2227662 edges, 38267 markings/sec, 10 secs
lola: 828080 markings, 2929539 edges, 41462 markings/sec, 15 secs
lola: 1045232 markings, 3592800 edges, 43430 markings/sec, 20 secs
lola: 1234727 markings, 4232356 edges, 37899 markings/sec, 25 secs
lola: 1322205 markings, 4723468 edges, 17496 markings/sec, 30 secs
lola: 1396828 markings, 5218603 edges, 14925 markings/sec, 35 secs
lola: 1568452 markings, 5874777 edges, 34325 markings/sec, 40 secs
lola: 1738025 markings, 6511656 edges, 33915 markings/sec, 45 secs
lola: 1918274 markings, 7138401 edges, 36050 markings/sec, 50 secs
lola: 2075255 markings, 7735120 edges, 31396 markings/sec, 55 secs
lola: 2276212 markings, 8333867 edges, 40191 markings/sec, 60 secs
lola: 2461695 markings, 8907997 edges, 37097 markings/sec, 65 secs
lola: 2612229 markings, 9463596 edges, 30107 markings/sec, 70 secs
lola: 2690468 markings, 9918296 edges, 15648 markings/sec, 75 secs
lola: 2760894 markings, 10391307 edges, 14085 markings/sec, 80 secs
lola: 2923565 markings, 11021615 edges, 32534 markings/sec, 85 secs
lola: 3078095 markings, 11586392 edges, 30906 markings/sec, 90 secs
lola: 3237784 markings, 12142182 edges, 31938 markings/sec, 95 secs
lola: 3369281 markings, 12654099 edges, 26299 markings/sec, 100 secs
lola: 3548644 markings, 13198277 edges, 35873 markings/sec, 105 secs
lola: 3718208 markings, 13717241 edges, 33913 markings/sec, 110 secs
lola: 3886940 markings, 14254920 edges, 33746 markings/sec, 115 secs
lola: 3981835 markings, 14710819 edges, 18979 markings/sec, 120 secs
lola: 4050765 markings, 15142381 edges, 13786 markings/sec, 125 secs
lola: 4162055 markings, 15698415 edges, 22258 markings/sec, 130 secs
lola: 4347956 markings, 16418018 edges, 37180 markings/sec, 135 secs
lola: 4555456 markings, 17138681 edges, 41500 markings/sec, 140 secs
lola: 4735979 markings, 17804013 edges, 36105 markings/sec, 145 secs
lola: 4954814 markings, 18460150 edges, 43767 markings/sec, 150 secs
lola: 5155866 markings, 19087388 edges, 40210 markings/sec, 155 secs
lola: 5283075 markings, 19632213 edges, 25442 markings/sec, 160 secs
lola: 5360295 markings, 20109528 edges, 15444 markings/sec, 165 secs
lola: 5461514 markings, 20673211 edges, 20244 markings/sec, 170 secs
lola: 5583550 markings, 21298174 edges, 24407 markings/sec, 175 secs
lola: 5719272 markings, 21919709 edges, 27144 markings/sec, 180 secs
lola: 5836555 markings, 22444486 edges, 23457 markings/sec, 185 secs
lola: 5936143 markings, 22971038 edges, 19918 markings/sec, 190 secs
lola: 6099043 markings, 23587590 edges, 32580 markings/sec, 195 secs
lola: 6259971 markings, 24174401 edges, 32186 markings/sec, 200 secs
lola: 6417435 markings, 24763682 edges, 31493 markings/sec, 205 secs
lola: 6530099 markings, 25304491 edges, 22533 markings/sec, 210 secs
lola: 6595946 markings, 25760565 edges, 13169 markings/sec, 215 secs
lola: 6653406 markings, 26215638 edges, 11492 markings/sec, 220 secs
lola: 6801884 markings, 26839949 edges, 29696 markings/sec, 225 secs
lola: 6979254 markings, 27471758 edges, 35474 markings/sec, 230 secs
lola: 7139826 markings, 28043476 edges, 32114 markings/sec, 235 secs
lola: 7317009 markings, 28658992 edges, 35437 markings/sec, 240 secs
lola: 7506207 markings, 29231664 edges, 37840 markings/sec, 245 secs
lola: 7685870 markings, 29793853 edges, 35933 markings/sec, 250 secs
lola: 7802271 markings, 30295976 edges, 23280 markings/sec, 255 secs
lola: 7875970 markings, 30745761 edges, 14740 markings/sec, 260 secs
lola: 7972586 markings, 31277883 edges, 19323 markings/sec, 265 secs
lola: 8175747 markings, 32027280 edges, 40632 markings/sec, 270 secs
lola: 8372976 markings, 32719303 edges, 39446 markings/sec, 275 secs
lola: 8575324 markings, 33418780 edges, 40470 markings/sec, 280 secs
lola: 8789669 markings, 34071938 edges, 42869 markings/sec, 285 secs
lola: 8984897 markings, 34705015 edges, 39046 markings/sec, 290 secs
lola: 9076362 markings, 35199255 edges, 18293 markings/sec, 295 secs
lola: 9152283 markings, 35695628 edges, 15184 markings/sec, 300 secs
lola: 9255430 markings, 36252905 edges, 20629 markings/sec, 305 secs
lola: 9375789 markings, 36762108 edges, 24072 markings/sec, 310 secs
lola: 9492241 markings, 37262823 edges, 23290 markings/sec, 315 secs
lola: 9605373 markings, 37757830 edges, 22626 markings/sec, 320 secs
lola: 9709508 markings, 38205467 edges, 20827 markings/sec, 325 secs
lola: 9802126 markings, 38635149 edges, 18524 markings/sec, 330 secs
lola: 9915932 markings, 39085486 edges, 22761 markings/sec, 335 secs
lola: 10035537 markings, 39548849 edges, 23921 markings/sec, 340 secs
lola: 10151136 markings, 40003139 edges, 23120 markings/sec, 345 secs
lola: 10256872 markings, 40452002 edges, 21147 markings/sec, 350 secs
lola: 10369055 markings, 40872579 edges, 22437 markings/sec, 355 secs
lola: 10481129 markings, 41311363 edges, 22415 markings/sec, 360 secs
lola: 10591606 markings, 41744241 edges, 22095 markings/sec, 365 secs
lola: 10699535 markings, 42194337 edges, 21586 markings/sec, 370 secs
lola: 10825525 markings, 42675599 edges, 25198 markings/sec, 375 secs
lola: 10946017 markings, 43147975 edges, 24098 markings/sec, 380 secs
lola: 11060207 markings, 43639896 edges, 22838 markings/sec, 385 secs
lola: 11136235 markings, 44019995 edges, 15206 markings/sec, 390 secs
lola: 11208702 markings, 44408809 edges, 14493 markings/sec, 395 secs
lola: 11282082 markings, 44815600 edges, 14676 markings/sec, 400 secs
lola: 11349154 markings, 45190441 edges, 13414 markings/sec, 405 secs
lola: 11418427 markings, 45583525 edges, 13855 markings/sec, 410 secs
lola: 11474160 markings, 45980888 edges, 11147 markings/sec, 415 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 421 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((p4i_4_9 + 1 <= p4i_8_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((p4i_4_9 + 1 <= p4i_8_4)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((3 <= p4i_8_2) OR E (F ((2 <= p1i_2_6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p4i_8_2 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p4i_8_2 <= 2)
lola: processed formula length: 14
lola: 5 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 632 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1i_2_6 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SquareGrid-PT-080408-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file SquareGrid-PT-080408-CTLCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 12 will run for 631 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pb3_3_1) AND (pbl_4_5 <= p1o_8_5))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SquareGrid-PT-080408-CTLCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 842 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p4il_3_5 <= p1ol_7_8) AND E (X (E (X ((pbl_4_7 <= p4i_6_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 842 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p4il_3_5 <= p1ol_7_8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p4il_3_5 <= p1ol_7_8)
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1263 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (X ((pbl_4_7 <= p4i_6_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(EX((pbl_4_7 <= p4i_6_2)))
lola: processed formula length: 28
lola: 2 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1263 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G ((3 <= pbl_5_8)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U (pbl_5_8 <= 2))))
lola: processed formula length: 39
lola: 4 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 2527 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((2 <= pb3_5_4) U ((3 <= p1i_3_3) AND (1 <= pbl_8_7)))) AND NOT(E (F ((pbl_2_7 <= p1il_7_6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2527 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= pb3_5_4) U ((3 <= p1i_3_3) AND (1 <= pbl_8_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((2 <= pb3_5_4) U ((3 <= p1i_3_3) AND (1 <= pbl_8_7)))
lola: processed formula length: 55
lola: 4 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: lola: result: no
========================================
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no unknown unknown yes no yes unknown yes yes yes no no no
FORMULA SquareGrid-PT-080408-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494934795495

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="SquareGrid-PT-080408"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/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/SquareGrid-PT-080408.tgz
mv SquareGrid-PT-080408 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is SquareGrid-PT-080408, 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 r078-ebro-149441008300138"
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 ;