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 S_SquareGrid-PT-130613, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464000156
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496563660546


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


checking for too many tokens
===========================================================================================
S_SquareGrid-PT-130613: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_SquareGrid-PT-130613 @ 3540 seconds
Makefile:224: recipe for target 'verify' failed
----- 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: 5057/65536 symbol table entries, 490 collisions
lola: preprocessing...
lola: finding significant places
lola: 2301 places, 2756 transitions, 1403 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3653 transition conflict sets
lola: TASK
lola: reading formula from SquareGrid-PT-130613-CTLCardinality.task
lola: A ((((3 <= pbl_9_12) OR (pbl_7_6 <= pbl_13_13) OR (3 <= p1il_9_2) OR (2 <= p4ol_4_6)) U A (F ((3 <= p1o_2_10))))) : A (G (((p4ol_9_4 <= 2) AND A (G ((3 <= pb2_3_2)))))) : (A (((1 <= p1i_2_4) U ((3 <= pb4_4_3) AND (pbl_7_7 <= p4o_3_14)))) OR A (G (E (X ((1 <= pb1_1_2)))))) : A (F ((A (G ((p4o_9_3 <= pb2_1_7))) OR ((1 <= p1i_9_7) AND (p4il_12_12 <= p1o_3_13) AND (p1o_2_1 <= pb4_10_8) AND (p1ol_12_9 <= pb1_7_8))))) : E ((((2 <= p1i_14_4) OR (p4o_5_10 <= p4o_13_14) OR (pb1_9_10 + 1 <= pb3_12_12)) U (((p4i_6_7 <= p4ol_12_11) OR (pb3_2_5 <= p4i_8_2)) AND (pbl_2_10 <= p1ol_6_12)))) : A (G ((((pb3_10_7 + 1 <= pb4_5_10) AND ((3 <= pbl_4_13) OR (2 <= p1il_13_9))) OR E (F ((3 <= p4o_11_4)))))) : NOT(E ((((p4ol_13_3 <= p4il_13_9) AND (3 <= pbl_8_5)) U ((1 <= p1il_6_6) AND (2 <= p1o_3_5))))) : (E ((((2 <= pb1_3_13) OR (p1il_5_3 <= p1o_13_11)) U (3 <= pb2_3_10))) AND ((pb1_12_11 <= p4o_9_13) OR A (F ((pb4_3_13 <= 2))))) : A (G (NOT(A (G ((1 <= p4i_12_5)))))) : (NOT(E (G (((2 <= p4ol_12_3) OR (pb1_3_7 <= pb4_5_11))))) OR (1 <= p4o_13_10)) : E (G (A (((1 <= p1il_1_8) U (1 <= p4il_1_4))))) : A (F ((pbl_2_8 + 1 <= p4ol_13_8))) : E (F ((3 <= p1ol_4_12))) : A (X (E (X (((1 <= pb4_13_2) AND (p1o_11_12 <= pb1_3_9)))))) : E (F (A (F ((pb4_2_12 <= 0))))) : ((A (F ((2 <= p4o_6_11))) AND E (X ((p1il_13_9 <= 0)))) OR A ((((p1ol_10_3 <= pb4_11_5) OR (1 <= p4o_13_11)) U (p4il_7_11 + 1 <= p4il_10_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 ((((3 <= pbl_9_12) OR (pbl_7_6 <= pbl_13_13) OR (3 <= p1il_9_2) OR (2 <= p4ol_4_6)) U A (F ((3 <= p1o_2_10)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((3 <= pbl_9_12) OR (pbl_7_6 <= pbl_13_13) OR (3 <= p1il_9_2) OR (2 <= p4ol_4_6)) U A(TRUE U (3 <= p1o_2_10)))
lola: processed formula length: 115
lola: 2 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p4ol_9_4 <= 2) AND A (G ((3 <= pb2_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p4ol_9_4 <= 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 5612 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-130613-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SquareGrid-PT-130613-CTLCardinality.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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= pb2_3_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 5612 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: state equation: write sara problem file to SquareGrid-PT-130613-CTLCardinality-2.sara
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: ========================================
========================================
lola: ...considering subproblem: (A (((1 <= p1i_2_4) U ((3 <= pb4_4_3) AND (pbl_7_7 <= p4o_3_14)))) OR A (G (E (X ((1 <= pb1_1_2))))))
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 (((1 <= p1i_2_4) U ((3 <= pb4_4_3) AND (pbl_7_7 <= p4o_3_14))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: state equation: calling and running sara
sara: try reading problem file SquareGrid-PT-130613-CTLCardinality-2.sara.
lola: processed formula: A((1 <= p1i_2_4) U ((3 <= pb4_4_3) AND (pbl_7_7 <= p4o_3_14)))
lola: processed formula length: 62
lola: 1 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((1 <= pb1_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((1 <= pb1_1_2)))))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((p4o_9_3 <= pb2_1_7))) OR ((1 <= p1i_9_7) AND (p4il_12_12 <= p1o_3_13) AND (p1o_2_1 <= pb4_10_8) AND (p1ol_12_9 <= pb1_7_8)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(E(TRUE U (pb2_1_7 + 1 <= p4o_9_3))) OR ((1 <= p1i_9_7) AND (p4il_12_12 <= p1o_3_13) AND (p1o_2_1 <= pb4_10_8) AND (p1ol_12_9 <= pb1_7_8))))
lola: processed formula length: 153
lola: 3 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 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: 316826 markings, 493826 edges, 2934408243167887360 markings/sec, 0 secs
lola: 629146 markings, 1011549 edges, 62464 markings/sec, 5 secs
lola: 951128 markings, 1527862 edges, 64396 markings/sec, 10 secs
lola: 1279374 markings, 2047346 edges, 65649 markings/sec, 15 secs
lola: 1603594 markings, 2569508 edges, 64844 markings/sec, 20 secs
lola: 1923806 markings, 3083009 edges, 64042 markings/sec, 25 secs
lola: 2235809 markings, 3605218 edges, 62401 markings/sec, 30 secs
lola: 2527242 markings, 4061772 edges, 58287 markings/sec, 35 secs
lola: 2790062 markings, 4483456 edges, 52564 markings/sec, 40 secs
lola: 3040973 markings, 4887641 edges, 50182 markings/sec, 45 secs
lola: 3306948 markings, 5314337 edges, 53195 markings/sec, 50 secs
lola: 3564803 markings, 5741422 edges, 51571 markings/sec, 55 secs
lola: 3825826 markings, 6176897 edges, 52205 markings/sec, 60 secs
lola: 4109544 markings, 6628269 edges, 56744 markings/sec, 65 secs
lola: 4419944 markings, 7118810 edges, 62080 markings/sec, 70 secs
lola: 4720555 markings, 7617929 edges, 60122 markings/sec, 75 secs
lola: 4996967 markings, 8049430 edges, 55282 markings/sec, 80 secs
lola: 5278234 markings, 8495273 edges, 56253 markings/sec, 85 secs
lola: 5572406 markings, 8964503 edges, 58834 markings/sec, 90 secs
lola: 5844674 markings, 9387728 edges, 54454 markings/sec, 95 secs
lola: 6113711 markings, 9817073 edges, 53807 markings/sec, 100 secs
lola: 6376065 markings, 10245490 edges, 52471 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= p1i_14_4) OR (p4o_5_10 <= p4o_13_14) OR (pb1_9_10 + 1 <= pb3_12_12)) U (((p4i_6_7 <= p4ol_12_11) OR (pb3_2_5 <= p4i_8_2)) AND (pbl_2_10 <= p1ol_6_12))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((2 <= p1i_14_4) OR (p4o_5_10 <= p4o_13_14) OR (pb1_9_10 + 1 <= pb3_12_12)) U (((p4i_6_7 <= p4ol_12_11) OR (pb3_2_5 <= p4i_8_2)) AND (pbl_2_10 <= p1ol_6_12)))
lola: processed formula length: 163
lola: 1 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 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: 332074 markings, 519395 edges, 66415 markings/sec, 0 secs
lola: 659955 markings, 1058934 edges, 65576 markings/sec, 5 secs
lola: 1000476 markings, 1607549 edges, 68104 markings/sec, 10 secs
lola: 1350026 markings, 2157834 edges, 69910 markings/sec, 15 secs
lola: 1688467 markings, 2708851 edges, 67688 markings/sec, 20 secs
lola: 2005293 markings, 3217829 edges, 63365 markings/sec, 25 secs
lola: 2294231 markings, 3699013 edges, 57788 markings/sec, 30 secs
lola: 2557481 markings, 4110579 edges, 52650 markings/sec, 35 secs
lola: 2824336 markings, 4538006 edges, 53371 markings/sec, 40 secs
lola: 3091078 markings, 4966676 edges, 53348 markings/sec, 45 secs
lola: 3364661 markings, 5407606 edges, 54717 markings/sec, 50 secs
lola: 3629213 markings, 5847275 edges, 52910 markings/sec, 55 secs
lola: 3892427 markings, 6285986 edges, 52643 markings/sec, 60 secs
lola: 4190226 markings, 6754934 edges, 59560 markings/sec, 65 secs
lola: 4494519 markings, 7239621 edges, 60859 markings/sec, 70 secs
lola: 4803172 markings, 7750626 edges, 61731 markings/sec, 75 secs
lola: 5078690 markings, 8183793 edges, 55104 markings/sec, 80 secs
lola: 5385263 markings, 8661810 edges, 61315 markings/sec, 85 secs
lola: 5678292 markings, 9127357 edges, 58606 markings/sec, 90 secs
lola: 5957694 markings, 9567244 edges, 55880 markings/sec, 95 secs
lola: 6233606 markings, 10010098 edges, 55182 markings/sec, 100 secs
lola: 6504094 markings, 10454158 edges, 54098 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((pb3_10_7 + 1 <= pb4_5_10) AND ((3 <= pbl_4_13) OR (2 <= p1il_13_9))) OR E (F ((3 <= p4o_11_4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (((pb4_5_10 <= pb3_10_7) OR ((pbl_4_13 <= 2) AND (p1il_13_9 <= 1))) AND NOT(E(TRUE U (3 <= p4o_11_4))))))
lola: processed formula length: 119
lola: 4 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 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: 334595 markings, 523714 edges, 2474316777891299328 markings/sec, 0 secs
lola: 665810 markings, 1067871 edges, 66243 markings/sec, 5 secs
lola: 1003934 markings, 1613031 edges, 67625 markings/sec, 10 secs
lola: 1351365 markings, 2159831 edges, 69486 markings/sec, 15 secs
lola: 1686527 markings, 2705679 edges, 67032 markings/sec, 20 secs
lola: 2024357 markings, 3248338 edges, 67566 markings/sec, 25 secs
lola: 2353650 markings, 3793691 edges, 65859 markings/sec, 30 secs
lola: 2676452 markings, 4297363 edges, 64560 markings/sec, 35 secs
lola: 2993233 markings, 4807010 edges, 63356 markings/sec, 40 secs
lola: 3312762 markings, 5323447 edges, 63906 markings/sec, 45 secs
lola: 3624594 markings, 5839633 edges, 62366 markings/sec, 50 secs
lola: 3939003 markings, 6360034 edges, 62882 markings/sec, 55 secs
lola: 4247279 markings, 6842840 edges, 61655 markings/sec, 60 secs
lola: 4550357 markings, 7329131 edges, 60616 markings/sec, 65 secs
lola: 4851013 markings, 7822134 edges, 60131 markings/sec, 70 secs
lola: 5153051 markings, 8301470 edges, 60408 markings/sec, 75 secs
lola: 5455024 markings, 8772006 edges, 60395 markings/sec, 80 secs
lola: 5756087 markings, 9247400 edges, 60213 markings/sec, 85 secs
lola: 6058821 markings, 9726933 edges, 60547 markings/sec, 90 secs
lola: 6356005 markings, 10213472 edges, 59437 markings/sec, 95 secs
lola: 6657694 markings, 10705444 edges, 60338 markings/sec, 100 secs
lola: 6962377 markings, 11203440 edges, 60937 markings/sec, 105 secs
lola: 7270022 markings, 11704830 edges, 61529 markings/sec, 110 secs
lola: 7578528 markings, 12209898 edges, 61701 markings/sec, 115 secs
lola: 7882879 markings, 12706430 edges, 60870 markings/sec, 120 secs
lola: 8177031 markings, 13170101 edges, 58830 markings/sec, 125 secs
lola: 8459623 markings, 13621390 edges, 56518 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((((p4ol_13_3 <= p4il_13_9) AND (3 <= pbl_8_5)) U ((1 <= p1il_6_6) AND (2 <= p1o_3_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(((p4ol_13_3 <= p4il_13_9) AND (3 <= pbl_8_5)) U ((1 <= p1il_6_6) AND (2 <= p1o_3_5))))
lola: processed formula length: 92
lola: 7 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 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: 345379 markings, 524412 edges, 3225356612063461376 markings/sec, 0 secs
lola: 675243 markings, 1056443 edges, 65973 markings/sec, 5 secs
lola: 1013440 markings, 1585426 edges, 67639 markings/sec, 10 secs
lola: 1368933 markings, 2134993 edges, 71099 markings/sec, 15 secs
lola: 1718774 markings, 2685342 edges, 69968 markings/sec, 20 secs
lola: 2066544 markings, 3229720 edges, 69554 markings/sec, 25 secs
lola: 2402362 markings, 3777607 edges, 67164 markings/sec, 30 secs
lola: 2714412 markings, 4253231 edges, 62410 markings/sec, 35 secs
lola: 3000712 markings, 4699550 edges, 57260 markings/sec, 40 secs
lola: 3280483 markings, 5139615 edges, 55954 markings/sec, 45 secs
lola: 3564850 markings, 5585398 edges, 56873 markings/sec, 50 secs
lola: 3842250 markings, 6035184 edges, 55480 markings/sec, 55 secs
lola: 4123116 markings, 6491614 edges, 56173 markings/sec, 60 secs
lola: 4432230 markings, 6967101 edges, 61823 markings/sec, 65 secs
lola: 4757239 markings, 7468106 edges, 65002 markings/sec, 70 secs
lola: 5070416 markings, 7975384 edges, 62635 markings/sec, 75 secs
lola: 5360277 markings, 8416330 edges, 57972 markings/sec, 80 secs
lola: 5656030 markings, 8872179 edges, 59151 markings/sec, 85 secs
lola: 5962967 markings, 9349444 edges, 61387 markings/sec, 90 secs
lola: 6250288 markings, 9784961 edges, 57464 markings/sec, 95 secs
lola: 6536596 markings, 10227377 edges, 57262 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 339 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((2 <= pb1_3_13) OR (p1il_5_3 <= p1o_13_11)) U (3 <= pb2_3_10))) AND ((pb1_12_11 <= p4o_9_13) OR A (F ((pb4_3_13 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 339 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= pb1_3_13) OR (p1il_5_3 <= p1o_13_11)) U (3 <= pb2_3_10)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((2 <= pb1_3_13) OR (p1il_5_3 <= p1o_13_11)) U (3 <= pb2_3_10))
lola: processed formula length: 66
lola: 1 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 8 will run for 381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (pb1_12_11 <= p4o_9_13)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: ========================================
lola: processed formula: (pb1_12_11 <= p4o_9_13)
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 436 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pb4_3_13 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (pb4_3_13 <= 2))
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 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: ========================================SUBRESULT

lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (G ((1 <= p4i_12_5))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (p4i_12_5 <= 0)))))
lola: processed formula length: 45
lola: 5 rewrites
lola: formula mentions 0 of 2301 places; total mentions: 0
lola: closed formula file SquareGrid-PT-130613-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5612 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: 263168 markings, 671689 edges, 3689348869717491712 markings/sec, 0 secs
lola: 511558 markings, 1327303 edges, 49678 markings/sec, 5 secs
lola: 754243 markings, 1962012 edges, 48537 markings/sec, 10 secs
lola: 995726 markings, 2595669 edges, 48297 markings/sec, 15 secs
lola: 1247499 markings, 3244355 edges, 50355 markings/sec, 20 secs
lola: 1495331 markings, 3884527 edges, 49566 markings/sec, 25 secs
lola: 1733715 markings, 4512739 edges, 47677 markings/sec, 30 secs
lola: 1977187 markings, 5147490 edges, 48694 markings/sec, 35 secs
lola: 2194558 markings, 5732720 edges, 43474 markings/sec, 40 secs
lola: 2423453 markings, 6322773 edges, 45779 markings/sec, 45 secs
lola: 2625082 markings, 6841561 edges, 40326 markings/sec, 50 secs
lola: 2825244 markings, 7364568 edges, 40032 markings/sec, 55 secs
lola: 3023732 markings, 7882237 edges, 39698 markings/sec, 60 secs
lola: 3223826 markings, 8403100 edges, 40019 markings/sec, 65 secs
lola: 3420342 markings, 8923458 edges, 39303 markings/sec, 70 secs
lola: 3618592 markings, 9448603 edges, 39650 markings/sec, 75 secs
lola: 3813794 markings, 9969962 edges, 39040 markings/sec, 80 secs
lola: 4019498 markings, 10502483 edges, 41141 markings/sec, 85 secs
lola: 4249481 markings, 11095679 edges, 45997 markings/sec, 90 secs
lola: 4475465 markings, 11681763 edges, 45197 markings/sec, 95 secs
lola: 4703643 markings, 12294358 edges, 45636 markings/sec, 100 secs
lola: 4926856 markings, 12866237 edges, 44643 markings/sec, 105 secs
lola: 5130620 markings, 13399625 edges, 40753 markings/sec, 110 secs
lola: 5375645 markings, 14023014 edges, 49005 markings/sec, 115 secs
lola: 5593596 markings, 14591200 edges, 43590 markings/sec, 120 secs
lola: 5798262 markings, 15112538 edges, 40933 markings/sec, 125 secs
lola: 6000422 markings, 15633959 edges, 40432 markings/sec, 130 secs
lola: 6202575 markings, 16163318 edges, 40431 markings/sec, 135 secs
lola: 6401319 markings, 16687565 edges, 39749 markings/sec, 140 secs
Killed
FORMULA SquareGrid-PT-130613-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-130613-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496564294887

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

----- Start make prepare stderr -----
----- Start make result stderr -----
make: [verify] Error 137 (ignored)
----- 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_SquareGrid-PT-130613"
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/S_SquareGrid-PT-130613.tgz
mv S_SquareGrid-PT-130613 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 S_SquareGrid-PT-130613, 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 r158-ebro-149443464000156"
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 ;