fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r208-smll-149581172900300
Last Updated
June 27, 2017

About the Execution of LoLA for RobotManipulation-PT-10000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15951.590 1064066.00 1062754.00 3689.60 TTF?TFTTFFF???TF 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 RobotManipulation-PT-10000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-149581172900300
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496351201663


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


checking for too many tokens
===========================================================================================
RobotManipulation-PT-10000: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ RobotManipulation-PT-10000 @ 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: 26/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 15 places, 11 transitions, 9 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from RobotManipulation-PT-10000-CTLCardinality.task
lola: E (F (((r_active + 1 <= r_moving) AND (moved <= r_moving) AND (move + 1 <= off) AND (initialized <= 0)))) : ((NOT(A (F ((r_stopped <= r_moving)))) AND E (F ((3 <= moved)))) AND ((p_m <= r_stopped) AND (3 <= access))) : NOT(NOT(((1 <= p_rdy) OR A (G ((1 <= access)))))) : A (G ((A (G ((initialize <= p_sc))) OR ((1 <= r_stopped) AND (r_active <= p_i1))))) : ((3 <= p_i1) AND E (((r_active <= 0) U ((1 <= p_i1) AND (2 <= p_rel))))) : E (F ((A (G ((r_stopped <= p_i2))) AND ((move <= r_stopped) OR (r_stopped <= p_rdy) OR (p_i2 <= p_rel) OR (p_m <= off))))) : (((r_active <= initialized) AND (2 <= off) AND (3 <= p_sc) AND ((p_rdy <= move) OR ((p_rdy <= moved) AND (1 <= move))) AND (p_i1 <= initialized)) OR E (F (A (G ((move <= p_rel)))))) : A (F ((A (F ((1 <= p_rdy))) OR ((p_m + 1 <= r_active) AND (p_i1 + 1 <= p_i2))))) : A (F (((r_stopped + 1 <= p_i2) OR (1 <= p_rdy) OR (2 <= initialized)))) : E (X ((A (G ((p_i2 <= p_i1))) AND (((3 <= p_i1) OR (p_sc <= p_m)) AND ((1 <= p_rel) OR (initialized <= initialize)))))) : (A (F (E (X ((2 <= p_rel))))) OR A (G ((3 <= access)))) : (A ((((3 <= p_m) AND (1 <= p_i1)) U (r_active <= p_sc))) AND E (F (A (G ((p_rel <= initialized)))))) : E (F (E (G ((r_active + 1 <= p_m))))) : A (G (A (((3 <= access) U (p_m <= p_i1))))) : E ((E (F ((initialized <= moved))) U ((p_i1 <= move) AND (initialized <= r_active) AND ((moved <= off) OR (p_rdy <= r_stopped))))) : E (F (A (((3 <= p_m) U (p_i1 <= p_rel)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((r_active + 1 <= r_moving) AND (moved <= r_moving) AND (move + 1 <= off) AND (initialized <= 0))))
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 36 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 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to RobotManipulation-PT-10000-CTLCardinality.sara
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(A (F ((r_stopped <= r_moving)))) AND E (F ((3 <= moved)))) AND ((p_m <= r_stopped) AND (3 <= access)))
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: E (G ((r_moving + 1 <= r_stopped)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (r_stopped <= r_moving)))
lola: processed formula length: 38
lola: 6 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-10000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= moved)))
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 36 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p_m <= r_stopped) AND (3 <= access))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_m <= r_stopped) AND (3 <= access))
lola: processed formula length: 38
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-10000-CTLCardinality.task
lola: processed formula with 2 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(((1 <= p_rdy) OR A (G ((1 <= access))))))
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: (1 <= p_rdy)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p_rdy)
lola: processed formula length: 12
lola: 10 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-10000-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= access)))
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 36 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 RobotManipulation-PT-10000-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-10000-CTLCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
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 (G ((A (G ((initialize <= p_sc))) OR ((1 <= r_stopped) AND (r_active <= p_i1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (E(TRUE U (p_sc + 1 <= initialize)) AND ((r_stopped <= 0) OR (p_i1 + 1 <= r_active)))))
lola: processed formula length: 101
lola: 6 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-10000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p_i1) AND E (((r_active <= 0) U ((1 <= p_i1) AND (2 <= p_rel)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p_i1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p_i1)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-10000-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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((r_active <= 0) U ((1 <= p_i1) AND (2 <= p_rel))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((r_active <= 0) U ((1 <= p_i1) AND (2 <= p_rel)))
lola: processed formula length: 51
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-10000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((r_stopped <= p_i2))) AND ((move <= r_stopped) OR (r_stopped <= p_rdy) OR (p_i2 <= p_rel) OR (p_m <= off)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(E(TRUE U (p_i2 + 1 <= r_stopped))) AND ((move <= r_stopped) OR (r_stopped <= p_rdy) OR (p_i2 <= p_rel) OR (p_m <= off))))
lola: processed formula length: 138
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-10000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 1119278 markings, 5399124 edges, 2750780730358366208 markings/sec, 0 secs
lola: 1956598 markings, 10128742 edges, 167464 markings/sec, 5 secs
lola: 2729451 markings, 14562781 edges, 154571 markings/sec, 10 secs
lola: 3464388 markings, 18822794 edges, 146987 markings/sec, 15 secs
lola: 4173698 markings, 22958724 edges, 141862 markings/sec, 20 secs
lola: 4862485 markings, 26999635 edges, 137757 markings/sec, 25 secs
lola: 5532751 markings, 30952634 edges, 134053 markings/sec, 30 secs
lola: 6197386 markings, 34873818 edges, 132927 markings/sec, 35 secs
lola: 6844705 markings, 38710602 edges, 129464 markings/sec, 40 secs
lola: 7486507 markings, 42525598 edges, 128360 markings/sec, 45 secs
lola: 8119179 markings, 46288268 edges, 126534 markings/sec, 50 secs
lola: 8744538 markings, 50011262 edges, 125072 markings/sec, 55 secs
lola: 9362292 markings, 53713979 edges, 123551 markings/sec, 60 secs
lola: 9978093 markings, 57390986 edges, 123160 markings/sec, 65 secs
lola: 10579587 markings, 61010962 edges, 120299 markings/sec, 70 secs
lola: 11178654 markings, 64611688 edges, 119813 markings/sec, 75 secs
lola: 11775826 markings, 68199926 edges, 119434 markings/sec, 80 secs
lola: 12366841 markings, 71763819 edges, 118203 markings/sec, 85 secs
lola: 12955947 markings, 75316038 edges, 117821 markings/sec, 90 secs
lola: 13541093 markings, 78845564 edges, 117029 markings/sec, 95 secs
lola: 14117176 markings, 82328416 edges, 115217 markings/sec, 100 secs
lola: 14695680 markings, 85821490 edges, 115701 markings/sec, 105 secs
lola: 15267615 markings, 89288394 edges, 114387 markings/sec, 110 secs
lola: 15831518 markings, 92697471 edges, 112781 markings/sec, 115 secs
lola: 16386195 markings, 96070078 edges, 110935 markings/sec, 120 secs
lola: 16934344 markings, 99403110 edges, 109630 markings/sec, 125 secs
lola: 17484466 markings, 102742515 edges, 110024 markings/sec, 130 secs
lola: 18031638 markings, 106064709 edges, 109434 markings/sec, 135 secs
lola: 18572130 markings, 109346305 edges, 108098 markings/sec, 140 secs
lola: 19122734 markings, 112708166 edges, 110121 markings/sec, 145 secs
lola: 19672490 markings, 116056178 edges, 109951 markings/sec, 150 secs
lola: 20218319 markings, 119381479 edges, 109166 markings/sec, 155 secs
lola: 20763221 markings, 122703699 edges, 108980 markings/sec, 160 secs
lola: 21305756 markings, 126009672 edges, 108507 markings/sec, 165 secs
lola: 21846506 markings, 129312678 edges, 108150 markings/sec, 170 secs
lola: 22379646 markings, 132572990 edges, 106628 markings/sec, 175 secs
lola: 22910051 markings, 135824453 edges, 106081 markings/sec, 180 secs
lola: 23442574 markings, 139085895 edges, 106505 markings/sec, 185 secs
lola: 23974370 markings, 142334839 edges, 106359 markings/sec, 190 secs
lola: 24500848 markings, 145564645 edges, 105296 markings/sec, 195 secs
lola: 25023778 markings, 148772862 edges, 104586 markings/sec, 200 secs
lola: 25551239 markings, 151999955 edges, 105492 markings/sec, 205 secs
lola: 26073857 markings, 155207456 edges, 104524 markings/sec, 210 secs
lola: 26599915 markings, 158429218 edges, 105212 markings/sec, 215 secs
lola: 27120894 markings, 161626897 edges, 104196 markings/sec, 220 secs
lola: 27637491 markings, 164810895 edges, 103319 markings/sec, 225 secs
lola: 28157132 markings, 168000084 edges, 103928 markings/sec, 230 secs
lola: 28676793 markings, 171184194 edges, 103932 markings/sec, 235 secs
lola: 29182764 markings, 174318431 edges, 101194 markings/sec, 240 secs
lola: 29697022 markings, 177479314 edges, 102852 markings/sec, 245 secs
lola: 30199373 markings, 180581022 edges, 100470 markings/sec, 250 secs
lola: 30710864 markings, 183726981 edges, 102298 markings/sec, 255 secs
lola: 31222958 markings, 186874791 edges, 102419 markings/sec, 260 secs
lola: 31735996 markings, 190024910 edges, 102608 markings/sec, 265 secs
lola: 32238928 markings, 193129250 edges, 100586 markings/sec, 270 secs
lola: 32740995 markings, 196235803 edges, 100413 markings/sec, 275 secs
lola: 33245185 markings, 199343732 edges, 100838 markings/sec, 280 secs
lola: 33750391 markings, 202458188 edges, 101041 markings/sec, 285 secs
lola: 34244177 markings, 205516002 edges, 98757 markings/sec, 290 secs
lola: 34751616 markings, 208638884 edges, 101488 markings/sec, 295 secs
lola: 35246721 markings, 211701737 edges, 99021 markings/sec, 300 secs
lola: 35743313 markings, 214769038 edges, 99318 markings/sec, 305 secs
lola: 36232378 markings, 217807068 edges, 97813 markings/sec, 310 secs
lola: 36725251 markings, 220852035 edges, 98575 markings/sec, 315 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 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((r_active <= initialized) AND (2 <= off) AND (3 <= p_sc) AND ((p_rdy <= move) OR ((p_rdy <= moved) AND (1 <= move))) AND (p_i1 <= initialized)) OR E (F (A (G ((move <= p_rel))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((r_active <= initialized) AND (2 <= off) AND (3 <= p_sc) AND ((p_rdy <= move) OR ((p_rdy <= moved) AND (1 <= move))) AND (p_i1 <= initialized))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((r_active <= initialized) AND (2 <= off) AND (3 <= p_sc) AND ((p_rdy <= move) OR ((p_rdy <= moved) AND (1 <= move))) AND (p_i1 <= initialized))
lola: processed formula length: 145
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-10000-CTLCardinality.task
lola: processed formula with 7 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 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((move <= p_rel)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (p_rel + 1 <= move))))
lola: processed formula length: 44
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-10000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 3382024 markings, 9008015 edges, 2750332954247954432 markings/sec, 0 secs
lola: 6302947 markings, 17242435 edges, 584185 markings/sec, 5 secs
lola: 9468412 markings, 25644054 edges, 633093 markings/sec, 10 secs
lola: 12358389 markings, 33599712 edges, 577995 markings/sec, 15 secs
lola: 15027017 markings, 41094060 edges, 533726 markings/sec, 20 secs
lola: 17222729 markings, 47593330 edges, 439142 markings/sec, 25 secs
lola: 19276881 markings, 53655325 edges, 410830 markings/sec, 30 secs
lola: 21224649 markings, 59339668 edges, 389554 markings/sec, 35 secs
lola: 23683006 markings, 66033047 edges, 491671 markings/sec, 40 secs
lola: 25892599 markings, 72501398 edges, 441919 markings/sec, 45 secs
lola: 27561837 markings, 77623240 edges, 333848 markings/sec, 50 secs
lola: 29712683 markings, 83973747 edges, 430169 markings/sec, 55 secs
lola: 31842032 markings, 90220268 edges, 425870 markings/sec, 60 secs
lola: 33659174 markings, 95681233 edges, 363428 markings/sec, 65 secs
lola: 35682159 markings, 101612219 edges, 404597 markings/sec, 70 secs
lola: 37536483 markings, 107178075 edges, 370865 markings/sec, 75 secs
lola: 39446623 markings, 112882011 edges, 382028 markings/sec, 80 secs
lola: 40981182 markings, 117610534 edges, 306912 markings/sec, 85 secs
lola: 43694194 markings, 124746996 edges, 542602 markings/sec, 90 secs
lola: 45212424 markings, 129417635 edges, 303646 markings/sec, 95 secs
lola: 46691090 markings, 133980981 edges, 295733 markings/sec, 100 secs
lola: 48712991 markings, 139857350 edges, 404380 markings/sec, 105 secs
lola: 50890860 markings, 145860130 edges, 435574 markings/sec, 110 secs
lola: 52988823 markings, 151672401 edges, 419593 markings/sec, 115 secs
lola: 54825555 markings, 157148322 edges, 367346 markings/sec, 120 secs
lola: 56695381 markings, 162706307 edges, 373965 markings/sec, 125 secs
lola: 58139075 markings, 167160171 edges, 288739 markings/sec, 130 secs
lola: 59556101 markings, 171540338 edges, 283405 markings/sec, 135 secs
lola: 61889319 markings, 178235087 edges, 466644 markings/sec, 140 secs
lola: 63326681 markings, 182670065 edges, 287472 markings/sec, 145 secs
lola: 64730135 markings, 187015955 edges, 280691 markings/sec, 150 secs
lola: 66136686 markings, 191361252 edges, 281310 markings/sec, 155 secs
lola: 67540195 markings, 195696554 edges, 280702 markings/sec, 160 secs
lola: 68943614 markings, 200030872 edges, 280684 markings/sec, 165 secs
lola: 70337363 markings, 204339421 edges, 278750 markings/sec, 170 secs
lola: 72261712 markings, 209908134 edges, 384870 markings/sec, 175 secs
lola: 73749754 markings, 214457195 edges, 297608 markings/sec, 180 secs
lola: 75115059 markings, 218688096 edges, 273061 markings/sec, 185 secs
lola: 76475553 markings, 222900055 edges, 272099 markings/sec, 190 secs
lola: 77799579 markings, 226999605 edges, 264805 markings/sec, 195 secs
lola: 79139171 markings, 231139451 edges, 267918 markings/sec, 200 secs
lola: 80455510 markings, 235219779 edges, 263268 markings/sec, 205 secs
lola: 81784007 markings, 239330225 edges, 265699 markings/sec, 210 secs
lola: 83108045 markings, 243423373 edges, 264808 markings/sec, 215 secs
lola: 84417477 markings, 247483670 edges, 261886 markings/sec, 220 secs
lola: 85720396 markings, 251526052 edges, 260584 markings/sec, 225 secs
lola: 87020671 markings, 255559820 edges, 260055 markings/sec, 230 secs
lola: 88324594 markings, 259601297 edges, 260785 markings/sec, 235 secs
lola: 89626271 markings, 263634829 edges, 260335 markings/sec, 240 secs
lola: 90925353 markings, 267659844 edges, 259816 markings/sec, 245 secs
lola: 92205031 markings, 271631959 edges, 255936 markings/sec, 250 secs
lola: 93431777 markings, 275438983 edges, 245349 markings/sec, 255 secs
lola: 94465596 markings, 278642868 edges, 206764 markings/sec, 260 secs
lola: 95496573 markings, 281838728 edges, 206195 markings/sec, 265 secs
lola: 96514015 markings, 284999151 edges, 203488 markings/sec, 270 secs
lola: 97528852 markings, 288149426 edges, 202967 markings/sec, 275 secs
lola: 98529861 markings, 291265138 edges, 200202 markings/sec, 280 secs
lola: 99545766 markings, 294416528 edges, 203181 markings/sec, 285 secs
lola: 100565157 markings, 297572606 edges, 203878 markings/sec, 290 secs
lola: 101588835 markings, 300739258 edges, 204736 markings/sec, 295 secs
lola: 102595091 markings, 303862354 edges, 201251 markings/sec, 300 secs
lola: 103641168 markings, 307104394 edges, 209215 markings/sec, 305 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 7 will run for 322 seconds at most (--localtimelimit=-1)
lola: lola: ========================================
========================================
lola: ...considering subproblem: A (F ((A (F ((1 <= p_rdy))) OR ((p_m + 1 <= r_active) AND (p_i1 + 1 <= p_i2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A(TRUE U (1 <= p_rdy)) OR ((p_m + 1 <= r_active) AND (p_i1 + 1 <= p_i2))))
lola: processed formula length: 84
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-10000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 5772853 markings, 8635864 edges, 3224733188970512384 markings/sec, 0 secs
lola: 11292167 markings, 16912270 edges, 1103863 markings/sec, 5 secs
lola: 16713326 markings, 25044921 edges, 1084232 markings/sec, 10 secs
lola: 22101110 markings, 33125155 edges, 1077557 markings/sec, 15 secs
lola: 27557146 markings, 41312501 edges, 1091207 markings/sec, 20 secs
lola: 32919335 markings, 49350218 edges, 1072438 markings/sec, 25 secs
lola: 38145857 markings, 57190057 edges, 1045304 markings/sec, 30 secs
lola: 43493806 markings, 65210897 edges, 1069590 markings/sec, 35 secs
lola: 48832931 markings, 73221021 edges, 1067825 markings/sec, 40 secs
lola: 54080101 markings, 81098101 edges, 1049434 markings/sec, 45 secs
lola: 59173861 markings, 88733446 edges, 1018752 markings/sec, 50 secs
lola: 64444644 markings, 96639647 edges, 1054157 markings/sec, 55 secs
lola: 69531429 markings, 104276140 edges, 1017357 markings/sec, 60 secs
lola: 74553301 markings, 111802504 edges, 1004374 markings/sec, 65 secs
lola: 79600032 markings, 119378181 edges, 1009346 markings/sec, 70 secs
lola: 84944126 markings, 127393877 edges, 1068819 markings/sec, 75 secs
lola: 90196743 markings, 135265138 edges, 1050523 markings/sec, 80 secs
lola: 95323653 markings, 142959456 edges, 1025382 markings/sec, 85 secs
lola: 100537025 markings, 150778825 edges, 1042674 markings/sec, 90 secs
lola: 105652420 markings, 158455359 edges, 1023079 markings/sec, 95 secs
lola: 110670979 markings, 165984535 edges, 1003712 markings/sec, 100 secs
lola: 115698245 markings, 173519430 edges, 1005453 markings/sec, 105 secs
lola: 120819971 markings, 181207057 edges, 1024345 markings/sec, 110 secs
lola: 125862210 markings, 188763691 edges, 1008448 markings/sec, 115 secs
lola: 130725564 markings, 196066204 edges, 972671 markings/sec, 120 secs
lola: 135844553 markings, 203739745 edges, 1023798 markings/sec, 125 secs
lola: 138406300 markings, 207582173 edges, 512349 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 346 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((r_stopped + 1 <= p_i2) OR (1 <= p_rdy) OR (2 <= initialized))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((r_stopped + 1 <= p_i2) OR (1 <= p_rdy) OR (2 <= initialized)))
lola: processed formula length: 75
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-10000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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 9 will run for 395 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((A (G ((p_i2 <= p_i1))) AND (((3 <= p_i1) OR (p_sc <= p_m)) AND ((1 <= p_rel) OR (initialized <= initialize))))))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking CTL
lola: processed formula: EX((NOT(E(TRUE U (p_i1 + 1 <= p_i2))) AND (((3 <= p_i1) OR (p_sc <= p_m)) AND ((1 <= p_rel) OR (initialized <= initialize)))))
lola: processed formula length: 128
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-10000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: subprocess 10 will run for 461 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (E (X ((2 <= p_rel))))) OR A (G ((3 <= access))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 461 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((2 <= p_rel)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((2 <= p_rel)))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-10000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: subprocess 11 will run for 553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= access)))
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 36 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 RobotManipulation-PT-10000-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-10000-CTLCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================lola:
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((3 <= p_m) AND (1 <= p_i1)) U (r_active <= p_sc))) AND E (F (A (G ((p_rel <= initialized))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= p_m) AND (1 <= p_i1)) U (r_active <= p_sc)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((3 <= p_m) AND (1 <= p_i1)) U (r_active <= p_sc))
lola: processed formula length: 52
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-10000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: ========================================
lola: subprocess 12 will run for 692 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p_rel <= initialized)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (initialized + 1 <= p_rel))))
lola: processed formula length: 51
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-10000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 1859003 markings, 6455223 edges, 2227119488493420544 markings/sec, 0 secs
lola: 3703599 markings, 12910936 edges, 368919 markings/sec, 5 secs
lola: 5546678 markings, 19360876 edges, 368616 markings/sec, 10 secs
lola: 7379437 markings, 25775419 edges, 366552 markings/sec, 15 secs
lola: 9202880 markings, 32157367 edges, 364689 markings/sec, 20 secs
lola: 11016932 markings, 38505940 edges, 362810 markings/sec, 25 secs
lola: 12803104 markings, 44757462 edges, 357234 markings/sec, 30 secs
lola: 14510599 markings, 50733393 edges, 341499 markings/sec, 35 secs
lola: 16208318 markings, 56674517 edges, 339544 markings/sec, 40 secs
lola: 17895679 markings, 62580545 edges, 337472 markings/sec, 45 secs
lola: 19573605 markings, 68453447 edges, 335585 markings/sec, 50 secs
lola: 21250226 markings, 74320510 edges, 335324 markings/sec, 55 secs
lola: 22924663 markings, 80181005 edges, 334887 markings/sec, 60 secs
lola: 24592600 markings, 86018605 edges, 333587 markings/sec, 65 secs
lola: 26256882 markings, 91844261 edges, 332856 markings/sec, 70 secs
lola: 27911728 markings, 97636027 edges, 330969 markings/sec, 75 secs
lola: 29558933 markings, 103400852 edges, 329441 markings/sec, 80 secs
lola: 31198273 markings, 109138414 edges, 327868 markings/sec, 85 secs
lola: 32840801 markings, 114886984 edges, 328506 markings/sec, 90 secs
lola: 34478103 markings, 120611000 edges, 327460 markings/sec, 95 secs
lola: 36108500 markings, 126323516 edges, 326079 markings/sec, 100 secs
lola: 37713993 markings, 131943441 edges, 321099 markings/sec, 105 secs
lola: 39374121 markings, 137752240 edges, 332026 markings/sec, 110 secs
lola: 41028358 markings, 143542842 edges, 330847 markings/sec, 115 secs
lola: 42680647 markings, 149325313 edges, 330458 markings/sec, 120 secs
lola: 44323858 markings, 155076431 edges, 328642 markings/sec, 125 secs
lola: 45961800 markings, 160810170 edges, 327588 markings/sec, 130 secs
lola: 47594976 markings, 166526194 edges, 326635 markings/sec, 135 secs
lola: 49221344 markings, 172217289 edges, 325274 markings/sec, 140 secs
lola: 50840905 markings, 177886040 edges, 323912 markings/sec, 145 secs
lola: 52456973 markings, 183542117 edges, 323214 markings/sec, 150 secs
lola: 54071671 markings, 189193263 edges, 322940 markings/sec, 155 secs
lola: 55686335 markings, 194844427 edges, 322933 markings/sec, 160 secs
lola: 57298863 markings, 200488134 edges, 322506 markings/sec, 165 secs
lola: 58912139 markings, 206134888 edges, 322655 markings/sec, 170 secs
lola: 60521555 markings, 211768204 edges, 321883 markings/sec, 175 secs
lola: 62129712 markings, 217387051 edges, 321631 markings/sec, 180 secs
lola: 63731308 markings, 223001206 edges, 320319 markings/sec, 185 secs
lola: 65334846 markings, 228604710 edges, 320708 markings/sec, 190 secs
lola: 66932753 markings, 234207293 edges, 319581 markings/sec, 195 secs
lola: 68529731 markings, 239796796 edges, 319396 markings/sec, 200 secs
lola: 70099175 markings, 245288199 edges, 313889 markings/sec, 205 secs
lola: 71680232 markings, 250822525 edges, 316211 markings/sec, 210 secs
lola: 73335566 markings, 256616563 edges, 331067 markings/sec, 215 secs
lola: 74989027 markings, 262401981 edges, 330692 markings/sec, 220 secs
lola: 76637809 markings, 268174742 edges, 329756 markings/sec, 225 secs
lola: 78282308 markings, 273930325 edges, 328900 markings/sec, 230 secs
lola: 79926133 markings, 279681733 edges, 328765 markings/sec, 235 secs
lola: 81570800 markings, 285437560 edges, 328933 markings/sec, 240 secs
lola: 83211272 markings, 291179754 edges, 328094 markings/sec, 245 secs
lola: 84846343 markings, 296904076 edges, 327014 markings/sec, 250 secs
lola: 86455083 markings, 302521527 edges, 321748 markings/sec, 255 secs
lola: 88077403 markings, 308210594 edges, 324464 markings/sec, 260 secs
lola: 89695000 markings, 313873920 edges, 323519 markings/sec, 265 secs
lola: 91303506 markings, 319503073 edges, 321701 markings/sec, 270 secs
lola: 92912499 markings, 325123078 edges, 321799 markings/sec, 275 secs
lola: 94510420 markings, 330727452 edges, 319584 markings/sec, 280 secs
lola: 96110647 markings, 336316248 edges, 320045 markings/sec, 285 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 12 will run for 619 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((r_active + 1 <= p_m)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (p_m <= r_active))))
lola: processed formula length: 42
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-10000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 13 will run for 825 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (A (((3 <= access) U (p_m <= p_i1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A((3 <= access) U (p_m <= p_i1)))))
lola: processed formula length: 52
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-10000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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 14 will run for 1238 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((initialized <= moved))) U ((p_i1 <= move) AND (initialized <= r_active) AND ((moved <= off) OR (p_rdy <= r_stopped)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (initialized <= moved)) U ((p_i1 <= move) AND (initialized <= r_active) AND ((moved <= off) OR (p_rdy <= r_stopped))))
lola: processed formula length: 130
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-10000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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 15 will run for 2476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (((3 <= p_m) U (p_i1 <= p_rel)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A((3 <= p_m) U (p_i1 <= p_rel)))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-10000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: RESULT
lola:
SUMMARY: yes yes no no no unknown unknown unknown yes no no unknown yes no yes yes
lola: ========================================
FORMULA RobotManipulation-PT-10000-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-10000-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-10000-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-10000-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-10000-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-10000-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-10000-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-10000-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-10000-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-10000-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-10000-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-10000-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-10000-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-10000-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-10000-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-10000-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496352265729

--------------------
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="RobotManipulation-PT-10000"
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/RobotManipulation-PT-10000.tgz
mv RobotManipulation-PT-10000 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 RobotManipulation-PT-10000, 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 r208-smll-149581172900300"
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 ;