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-00020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-149581172700228
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496340283801


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


checking for too many tokens
===========================================================================================
RobotManipulation-PT-00020: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ RobotManipulation-PT-00020 @ 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-00020-CTLCardinality.task
lola: E (((initialize <= r_stopped) U ((1 <= p_sc) AND (3 <= r_stopped) AND (access <= p_sc)))) : E (F ((((p_sc + 1 <= p_rel) AND (access + 1 <= p_i2))))) : (((E (F ((p_i1 <= p_rel))) OR ((3 <= initialize) AND (p_sc <= r_moving) AND (3 <= r_moving))) AND A (X ((off + 1 <= r_stopped)))) OR E (F (A (G ((1 <= move)))))) : E (F (A (G ((initialize + 1 <= p_rdy))))) : NOT(A (F ((1 <= p_rdy)))) : A ((((initialized <= p_i2) OR (p_i1 <= off) OR (initialized + 1 <= initialize)) U E (X ((1 <= p_sc))))) : E (((p_m <= 2) U A (G ((2 <= move))))) : (E (X (((move + 1 <= access) AND (2 <= r_stopped)))) AND NOT(A (((initialized <= access) U (1 <= initialized))))) : (NOT(E (F (((2 <= initialized) AND (r_moving <= off))))) OR A (((2 <= r_stopped) U ((3 <= r_stopped) AND (1 <= p_rdy))))) : (A (X (((r_moving <= p_i1) OR ((3 <= r_stopped) AND (initialized <= r_stopped))))) AND NOT(A (G (((p_sc <= r_stopped) OR (3 <= r_active)))))) : A (G ((move <= p_m))) : E (F (A (G (((p_i2 <= access) AND (access <= p_i1)))))) : (((E (F ((r_stopped <= initialize))) OR (2 <= p_rdy)) AND (A (F ((3 <= p_sc))) OR ((r_stopped <= move) OR (p_i1 <= access) OR (off <= moved)))) OR NOT(E (((p_i1 <= p_m) U (p_rdy <= p_m))))) : (A (G (((2 <= p_i1) OR (1 <= p_sc) OR ((3 <= off) AND (1 <= p_i2))))) AND (p_rel <= initialize)) : A (G (((1 <= off) OR (r_active <= access)))) : NOT(NOT(A (G (((r_stopped <= r_moving) OR (moved <= r_stopped))))))
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 (((initialize <= r_stopped) U ((1 <= p_sc) AND (3 <= r_stopped) AND (access <= p_sc))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((initialize <= r_stopped) U ((1 <= p_sc) AND (3 <= r_stopped) AND (access <= p_sc)))
lola: processed formula length: 86
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p_sc + 1 <= p_rel) AND (access + 1 <= p_i2)))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00020-CTLCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (F ((p_i1 <= p_rel))) OR ((3 <= initialize) AND (p_sc <= r_moving) AND (3 <= r_moving))) AND A (X ((off + 1 <= r_stopped)))) OR E (F (A (G ((1 <= move))))))
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: E (F ((p_i1 <= p_rel)))
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: state equation: write sara problem file to RobotManipulation-PT-00020-CTLCardinality-2.sara
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((off + 1 <= r_stopped)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((off + 1 <= r_stopped))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((initialize + 1 <= p_rdy)))))
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_rdy <= initialize))))
lola: processed formula length: 46
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-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: 1415599 markings, 6094568 edges, 3096159597753270272 markings/sec, 0 secs
lola: 2657977 markings, 11648337 edges, 248476 markings/sec, 5 secs
lola: 3801903 markings, 16794055 edges, 228785 markings/sec, 10 secs
lola: 4866131 markings, 21612366 edges, 212846 markings/sec, 15 secs
lola: 5934864 markings, 26461391 edges, 213747 markings/sec, 20 secs
lola: 6974833 markings, 31183600 edges, 207994 markings/sec, 25 secs
lola: 7995251 markings, 35831319 edges, 204084 markings/sec, 30 secs
lola: 9011178 markings, 40462571 edges, 203185 markings/sec, 35 secs
lola: 10020085 markings, 45072595 edges, 201781 markings/sec, 40 secs
lola: 11022657 markings, 49652568 edges, 200514 markings/sec, 45 secs
lola: 12016236 markings, 54191360 edges, 198716 markings/sec, 50 secs
lola: 13006497 markings, 58724028 edges, 198052 markings/sec, 55 secs
lola: 13993637 markings, 63240181 edges, 197428 markings/sec, 60 secs
lola: 14984447 markings, 67775320 edges, 198162 markings/sec, 65 secs
lola: 15969381 markings, 72284743 edges, 196987 markings/sec, 70 secs
lola: 16960773 markings, 76824543 edges, 198278 markings/sec, 75 secs
lola: 17953166 markings, 81360804 edges, 198479 markings/sec, 80 secs
lola: 18948059 markings, 85910011 edges, 198979 markings/sec, 85 secs
lola: 19963963 markings, 90545265 edges, 203181 markings/sec, 90 secs
lola: 20984248 markings, 95189578 edges, 204057 markings/sec, 95 secs
lola: 22028045 markings, 99921779 edges, 208759 markings/sec, 100 secs
lola: 23116467 markings, 104825860 edges, 217684 markings/sec, 105 secs
lola: 24367238 markings, 110218230 edges, 250154 markings/sec, 110 secs
lola: 25507713 markings, 114551266 edges, 228095 markings/sec, 115 secs
lola: 26586738 markings, 118626017 edges, 215805 markings/sec, 120 secs
lola: 27646374 markings, 122618051 edges, 211927 markings/sec, 125 secs
lola: 28691890 markings, 126547434 edges, 209103 markings/sec, 130 secs
lola: 29727250 markings, 130434994 edges, 207072 markings/sec, 135 secs
lola: 30755815 markings, 134288282 edges, 205713 markings/sec, 140 secs
lola: 31781625 markings, 138136035 edges, 205162 markings/sec, 145 secs
lola: 32804419 markings, 141969741 edges, 204559 markings/sec, 150 secs
lola: 33832061 markings, 145812364 edges, 205528 markings/sec, 155 secs
lola: 34841887 markings, 149580360 edges, 201965 markings/sec, 160 secs
lola: 35888427 markings, 153493820 edges, 209308 markings/sec, 165 secs
lola: 36928133 markings, 157377588 edges, 207941 markings/sec, 170 secs
lola: 37967558 markings, 161248877 edges, 207885 markings/sec, 175 secs
lola: 39001753 markings, 165111380 edges, 206839 markings/sec, 180 secs
lola: 40039807 markings, 168985243 edges, 207611 markings/sec, 185 secs
lola: 41083923 markings, 172859148 edges, 208823 markings/sec, 190 secs
lola: 42085782 markings, 176591272 edges, 200372 markings/sec, 195 secs
lola: 43100316 markings, 180391122 edges, 202907 markings/sec, 200 secs
lola: 44137746 markings, 184243545 edges, 207486 markings/sec, 205 secs
lola: 45156384 markings, 188032286 edges, 203728 markings/sec, 210 secs
lola: 46181039 markings, 191849284 edges, 204931 markings/sec, 215 secs
lola: 47206490 markings, 195668034 edges, 205090 markings/sec, 220 secs
lola: 48241976 markings, 199522893 edges, 207097 markings/sec, 225 secs
lola: 49260530 markings, 203317352 edges, 203711 markings/sec, 230 secs
lola: 50290879 markings, 207165435 edges, 206070 markings/sec, 235 secs
lola: 51327035 markings, 211011443 edges, 207231 markings/sec, 240 secs
lola: 52332730 markings, 214761859 edges, 201139 markings/sec, 245 secs
lola: 53354772 markings, 218571487 edges, 204408 markings/sec, 250 secs
lola: 54393902 markings, 222448788 edges, 207826 markings/sec, 255 secs
lola: 55430742 markings, 226312649 edges, 207368 markings/sec, 260 secs
lola: 56453561 markings, 230133866 edges, 204564 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((1 <= p_rdy))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= p_rdy)))
lola: processed formula length: 27
lola: 5 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-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: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((initialized <= p_i2) OR (p_i1 <= off) OR (initialized + 1 <= initialize)) U E (X ((1 <= p_sc)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((initialized <= p_i2) OR (p_i1 <= off) OR (initialized + 1 <= initialize)) U EX((1 <= p_sc)))
lola: processed formula length: 98
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p_m <= 2) U A (G ((2 <= move)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p_m <= 2) U NOT(E(TRUE U (move <= 1))))
lola: processed formula length: 42
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-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 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (((move + 1 <= access) AND (2 <= r_stopped)))) AND NOT(A (((initialized <= access) U (1 <= initialized)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((move + 1 <= access) AND (2 <= r_stopped))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((move + 1 <= access) AND (2 <= r_stopped)))
lola: processed formula length: 47
lola: 5 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((access + 1 <= initialized) R (initialized <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((initialized <= access) U (1 <= initialized)))
lola: processed formula length: 52
lola: 7 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-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 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (((2 <= initialized) AND (r_moving <= off))))) OR A (((2 <= r_stopped) U ((3 <= r_stopped) AND (1 <= p_rdy)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((initialized <= 1) OR (off + 1 <= r_moving))))
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 2 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 RobotManipulation-PT-00020-CTLCardinality-8.sara
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= r_stopped) U ((3 <= r_stopped) AND (1 <= p_rdy))))
lola: ========================================
lola: SUBTASK
lola: lola: checking CTL
========================================
lola: processed formula: A((2 <= r_stopped) U ((3 <= r_stopped) AND (1 <= p_rdy)))
lola: processed formula length: 57
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-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: state equation: calling and running sara
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (((r_moving <= p_i1) OR ((3 <= r_stopped) AND (initialized <= r_stopped))))) AND NOT(A (G (((p_sc <= r_stopped) OR (3 <= r_active))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((r_moving <= p_i1) OR ((3 <= r_stopped) AND (initialized <= r_stopped)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((r_moving <= p_i1) OR ((3 <= r_stopped) AND (initialized <= r_stopped))))
lola: processed formula length: 78
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((r_stopped + 1 <= p_sc) AND (r_active <= 2))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00020-CTLCardinality-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((move <= p_m)))
lola: ========================================
lola: sara: try reading problem file RobotManipulation-PT-00020-CTLCardinality-8.sara.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-00020-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-00020-CTLCardinality-10.sara.


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p_i2 <= access) AND (access <= p_i1))))))
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 ((access + 1 <= p_i2) OR (p_i1 + 1 <= access)))))
lola: processed formula length: 72
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-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: 2180744 markings, 6860601 edges, 2806861595810988032 markings/sec, 0 secs
lola: 4127843 markings, 13128555 edges, 389420 markings/sec, 5 secs
lola: 5989182 markings, 19189296 edges, 372268 markings/sec, 10 secs
lola: 7585834 markings, 24284257 edges, 319330 markings/sec, 15 secs
lola: 9167131 markings, 29285515 edges, 316259 markings/sec, 20 secs
lola: 10794639 markings, 34383965 edges, 325502 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 809 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (F ((r_stopped <= initialize))) OR (2 <= p_rdy)) AND (A (F ((3 <= p_sc))) OR ((r_stopped <= move) OR (p_i1 <= access) OR (off <= moved)))) OR NOT(E (((p_i1 <= p_m) U (p_rdy <= p_m)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 809 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((r_stopped <= initialize)))
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 13 will run for 1078 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p_sc)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (3 <= p_sc))
lola: processed formula length: 21
lola: 5 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-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: subprocess 14 will run for 1618 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((r_stopped <= move) OR (p_i1 <= access) OR (off <= moved))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((r_stopped <= move) OR (p_i1 <= access) OR (off <= moved))
lola: processed formula length: 61
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLCardinality.task
lola: processed formula with 3 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 1078 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((2 <= p_i1) OR (1 <= p_sc) OR ((3 <= off) AND (1 <= p_i2))))) AND (p_rel <= initialize))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1078 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p_i1) OR (1 <= p_sc) OR ((3 <= off) AND (1 <= p_i2)))))
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1618 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= off) OR (r_active <= 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 15 will run for 3236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(A (G (((r_stopped <= r_moving) OR (moved <= r_stopped))))))
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 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes unknown no yes no no no yes yes no yes no no no
FORMULA RobotManipulation-PT-00020-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496340587658

--------------------
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-00020"
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-00020.tgz
mv RobotManipulation-PT-00020 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-00020, 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-149581172700228"
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 ;