fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r118-blw7-149441649800041
Last Updated
June 27, 2017

About the Execution of LoLA for S_HypertorusGrid-PT-d3k3p2b06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5361.570 295474.00 295866.00 42.60 FFFTTFFFFT?FFTFF 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-3254
Executing tool lola
Input is S_HypertorusGrid-PT-d3k3p2b06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441649800041
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496349837575


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_HypertorusGrid-PT-d3k3p2b06: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_HypertorusGrid-PT-d3k3p2b06: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_HypertorusGrid-PT-d3k3p2b06 @ 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: 1485/65536 symbol table entries, 20 collisions
lola: preprocessing...
lola: finding significant places
lola: 513 places, 972 transitions, 323 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1161 transition conflict sets
lola: TASK
lola: reading formula from HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: A (X (G (F (G ((1 <= pb_d3_n1_1_1_3)))))) : A (F (X ((2 <= pb_d3_n1_2_2_3)))) : A (X (G (((pb_d2_n2_1_3_2 <= pol_d2_n1_1_2_2) U (pb_d2_n1_1_1_2 <= pol_d3_n1_3_2_3))))) : A (X ((1 <= pb_d3_n2_1_3_1))) : A (F (((2 <= pb_d1_n2_2_3_2) U G ((pol_d2_n1_1_1_2 <= pil_d1_n1_1_3_2))))) : A (G ((G ((pbl_2_2_2 <= pol_d3_n1_3_1_3)) U F ((pb_d1_n2_3_2_3 <= pb_d3_n2_3_1_2))))) : A (X (X ((1 <= po_d3_n1_3_2_3)))) : A (F (F (F (F ((1 <= pol_d3_n1_1_1_3)))))) : A ((X (F ((pbl_2_2_1 <= pi_d1_n1_1_3_2))) U ((2 <= pol_d3_n1_2_3_3) U (3 <= pi_d3_n1_2_1_3)))) : A (F (F (X (F ((2 <= po_d1_n1_2_3_2)))))) : A ((X (X ((pb_d2_n1_1_2_3 <= pb_d1_n1_1_2_3))) U (pb_d1_n1_2_3_3 <= pol_d3_n1_1_2_2))) : A ((pb_d2_n2_3_2_1 <= pb_d3_n2_1_2_1)) : A ((F (F ((2 <= pb_d2_n2_1_1_3))) U (3 <= pbl_2_3_2))) : A (X (F (F (X ((3 <= pil_d1_n1_1_2_3)))))) : A (X (((3 <= pi_d2_n1_2_3_2) U (pbl_1_1_1 <= pb_d2_n2_3_3_2)))) : A (G (X ((2 <= po_d3_n1_1_2_3))))
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 (X (G (F (G ((1 <= pb_d3_n1_1_1_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G ((1 <= pb_d3_n1_1_1_3)))))
lola: processed formula: A (X (F (G ((1 <= pb_d3_n1_1_1_3)))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((2 <= pb_d3_n1_2_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((2 <= pb_d3_n1_2_2_3))))
lola: processed formula: A (F (X ((2 <= pb_d3_n1_2_2_3))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((pb_d2_n2_1_3_2 <= pol_d2_n1_1_2_2) U (pb_d2_n1_1_1_2 <= pol_d3_n1_3_2_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((pb_d2_n2_1_3_2 <= pol_d2_n1_1_2_2) U (pb_d2_n1_1_1_2 <= pol_d3_n1_3_2_3)))))
lola: processed formula: A (X (G (((pb_d2_n2_1_3_2 <= pol_d2_n1_1_2_2) U (pb_d2_n1_1_1_2 <= pol_d3_n1_3_2_3)))))
lola: processed formula length: 87
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= pb_d3_n2_1_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= pb_d3_n2_1_3_1)))
lola: processed formula: A (X ((1 <= pb_d3_n2_1_3_1)))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= pb_d1_n2_2_3_2) U G ((pol_d2_n1_1_1_2 <= pil_d1_n1_1_3_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((2 <= pb_d1_n2_2_3_2) U G ((pol_d2_n1_1_1_2 <= pil_d1_n1_1_3_2)))))
lola: processed formula: A (F (((2 <= pb_d1_n2_2_3_2) U G ((pol_d2_n1_1_1_2 <= pil_d1_n1_1_3_2)))))
lola: processed formula length: 74
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 96911 markings, 121533 edges, 19382 markings/sec, 0 secs
lola: 195447 markings, 244633 edges, 19707 markings/sec, 5 secs
lola: 369391 markings, 461805 edges, 34789 markings/sec, 10 secs
lola: 556621 markings, 702502 edges, 37446 markings/sec, 15 secs
lola: 744949 markings, 948258 edges, 37666 markings/sec, 20 secs
lola: 935968 markings, 1197530 edges, 38204 markings/sec, 25 secs
lola: 1103024 markings, 1415542 edges, 33411 markings/sec, 30 secs
lola: 1240165 markings, 1594517 edges, 27428 markings/sec, 35 secs
lola: 1342327 markings, 1727826 edges, 20432 markings/sec, 40 secs
lola: 1444423 markings, 1861042 edges, 20419 markings/sec, 45 secs
lola: 1546764 markings, 1994582 edges, 20468 markings/sec, 50 secs
lola: 1673447 markings, 2159890 edges, 25337 markings/sec, 55 secs
lola: 1832699 markings, 2367675 edges, 31850 markings/sec, 60 secs
lola: 1993744 markings, 2577811 edges, 32209 markings/sec, 65 secs
lola: 2155604 markings, 2789113 edges, 32372 markings/sec, 70 secs
lola: 2326415 markings, 3012040 edges, 34162 markings/sec, 75 secs
lola: 2511098 markings, 3253065 edges, 36937 markings/sec, 80 secs
lola: 2699737 markings, 3499267 edges, 37728 markings/sec, 85 secs
lola: 2874016 markings, 3726711 edges, 34856 markings/sec, 90 secs
lola: 3042522 markings, 3946651 edges, 33701 markings/sec, 95 secs
lola: 3214188 markings, 4170689 edges, 34333 markings/sec, 100 secs
lola: 3385167 markings, 4393852 edges, 34196 markings/sec, 105 secs
lola: 3556362 markings, 4617291 edges, 34239 markings/sec, 110 secs
lola: 3727747 markings, 4840961 edges, 34277 markings/sec, 115 secs
lola: 3899533 markings, 5065167 edges, 34357 markings/sec, 120 secs
lola: 4069671 markings, 5287232 edges, 34028 markings/sec, 125 secs
lola: 4239907 markings, 5509411 edges, 34047 markings/sec, 130 secs
lola: 4410918 markings, 5732591 edges, 34202 markings/sec, 135 secs
lola: 4582289 markings, 5956255 edges, 34274 markings/sec, 140 secs
lola: 4751821 markings, 6177535 edges, 33906 markings/sec, 145 secs
lola: 4908627 markings, 6382175 edges, 31361 markings/sec, 150 secs
lola: 5050970 markings, 6567948 edges, 28469 markings/sec, 155 secs
lola: 5198026 markings, 6759869 edges, 29411 markings/sec, 160 secs
lola: 5349099 markings, 6957028 edges, 30215 markings/sec, 165 secs
lola: 5501636 markings, 7156104 edges, 30507 markings/sec, 170 secs
lola: 5656582 markings, 7358323 edges, 30989 markings/sec, 175 secs
lola: 5805200 markings, 7552305 edges, 29724 markings/sec, 180 secs
lola: 5953755 markings, 7746202 edges, 29711 markings/sec, 185 secs
lola: 6102340 markings, 7940140 edges, 29717 markings/sec, 190 secs
lola: 6253836 markings, 8137861 edges, 30299 markings/sec, 195 secs
lola: 6408434 markings, 8339639 edges, 30920 markings/sec, 200 secs
lola: 6563091 markings, 8541499 edges, 30931 markings/sec, 205 secs
lola: 6718150 markings, 8743886 edges, 31012 markings/sec, 210 secs
lola: 6872749 markings, 8945665 edges, 30920 markings/sec, 215 secs
lola: 7027130 markings, 9147171 edges, 30876 markings/sec, 220 secs
lola: 7181876 markings, 9349149 edges, 30949 markings/sec, 225 secs
lola: 7337205 markings, 9551874 edges, 31066 markings/sec, 230 secs
lola: 7491515 markings, 9753283 edges, 30862 markings/sec, 235 secs
lola: 7646100 markings, 9955052 edges, 30917 markings/sec, 240 secs
lola: 7801346 markings, 10157660 edges, 31049 markings/sec, 245 secs
lola: 7956536 markings, 10360229 edges, 31038 markings/sec, 250 secs
lola: 8113633 markings, 10565242 edges, 31419 markings/sec, 255 secs
lola: 8269829 markings, 10769064 edges, 31239 markings/sec, 260 secs
lola: 8435980 markings, 10985837 edges, 33230 markings/sec, 265 secs
lola: 8623629 markings, 11230870 edges, 37530 markings/sec, 270 secs
lola: 8729996 markings, 11369781 edges, 21273 markings/sec, 275 secs
lola: 8815525 markings, 11481453 edges, 17106 markings/sec, 280 secs
lola: 8910913 markings, 11606036 edges, 19078 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: A (G ((G ((pbl_2_2_2 <= pol_d3_n1_3_1_3)) U F ((pb_d1_n2_3_2_3 <= pb_d3_n2_3_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((G ((pbl_2_2_2 <= pol_d3_n1_3_1_3)) U F ((pb_d1_n2_3_2_3 <= pb_d3_n2_3_1_2)))))
lola: processed formula: A (G ((G ((pbl_2_2_2 <= pol_d3_n1_3_1_3)) U F ((pb_d1_n2_3_2_3 <= pb_d3_n2_3_1_2)))))
lola: processed formula length: 85
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((1 <= po_d3_n1_3_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((1 <= po_d3_n1_3_2_3))))
lola: processed formula: A (X (X ((1 <= po_d3_n1_3_2_3))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (F ((1 <= pol_d3_n1_1_1_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((1 <= pol_d3_n1_1_1_3)))
lola: processed formula: A (F ((1 <= pol_d3_n1_1_1_3)))
lola: processed formula length: 30
lola: 3 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((pbl_2_2_1 <= pi_d1_n1_1_3_2))) U ((2 <= pol_d3_n1_2_3_3) U (3 <= pi_d3_n1_2_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((pbl_2_2_1 <= pi_d1_n1_1_3_2))) U ((2 <= pol_d3_n1_2_3_3) U (3 <= pi_d3_n1_2_1_3))))
lola: processed formula: A ((X (F ((pbl_2_2_1 <= pi_d1_n1_1_3_2))) U ((2 <= pol_d3_n1_2_3_3) U (3 <= pi_d3_n1_2_1_3))))
lola: processed formula length: 94
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X (F ((2 <= po_d1_n1_2_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F ((2 <= po_d1_n1_2_3_2)))))
lola: processed formula: A (F (X (F ((2 <= po_d1_n1_2_3_2)))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((pb_d2_n1_1_2_3 <= pb_d1_n1_1_2_3))) U (pb_d1_n1_2_3_3 <= pol_d3_n1_1_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((pb_d2_n1_1_2_3 <= pb_d1_n1_1_2_3))) U (pb_d1_n1_2_3_3 <= pol_d3_n1_1_2_2)))
lola: processed formula: A ((X (X ((pb_d2_n1_1_2_3 <= pb_d1_n1_1_2_3))) U (pb_d1_n1_2_3_3 <= pol_d3_n1_1_2_2)))
lola: processed formula length: 86
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 11 will run for 649 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pb_d2_n2_3_2_1 <= pb_d3_n2_1_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pb_d2_n2_3_2_1 <= pb_d3_n2_1_2_1)
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.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 811 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((2 <= pb_d2_n2_1_1_3))) U (3 <= pbl_2_3_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((2 <= pb_d2_n2_1_1_3)) U (3 <= pbl_2_3_2)))
lola: processed formula: A ((F ((2 <= pb_d2_n2_1_1_3)) U (3 <= pbl_2_3_2)))
lola: processed formula length: 50
lola: 1 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (X ((3 <= pil_d1_n1_1_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (X ((3 <= pil_d1_n1_1_2_3)))))
lola: processed formula: A (X (F (X ((3 <= pil_d1_n1_1_2_3)))))
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 14 will run for 1622 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((3 <= pi_d2_n1_2_3_2) U (pbl_1_1_1 <= pb_d2_n2_3_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((3 <= pi_d2_n1_2_3_2) U (pbl_1_1_1 <= pb_d2_n2_3_3_2))))
lola: processed formula: A (X (((3 <= pi_d2_n1_2_3_2) U (pbl_1_1_1 <= pb_d2_n2_3_3_2))))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 15 will run for 3244 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((2 <= po_d3_n1_1_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X ((2 <= po_d3_n1_1_2_3))))
lola: processed formula: A (G (X ((2 <= po_d3_n1_1_2_3))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: RESULT
lola:
SUMMARY: no no no yes unknown no no yes no no no yes yes no no no
lola: ========================================
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496350133049

--------------------
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="S_HypertorusGrid-PT-d3k3p2b06"
export BK_EXAMINATION="LTLCardinality"
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/S_HypertorusGrid-PT-d3k3p2b06.tgz
mv S_HypertorusGrid-PT-d3k3p2b06 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_HypertorusGrid-PT-d3k3p2b06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r118-blw7-149441649800041"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;