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

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

=== Now, execution of the tool begins

BK_START 1496340607728


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


checking for too many tokens
===========================================================================================
RobotManipulation-PT-00050: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ RobotManipulation-PT-00050 @ 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-00050-CTLCardinality.task
lola: E ((((3 <= r_stopped) OR (p_m <= off)) U (2 <= p_rel))) : A (X ((E (F ((p_i1 <= p_m))) OR A (F ((r_stopped <= p_rdy)))))) : E (F ((3 <= p_rel))) : ((E (G ((p_m <= 2))) OR E (X ((p_rdy + 1 <= off)))) AND E ((((3 <= p_rel) OR (off <= p_sc)) U (r_stopped <= 1)))) : (E ((((access <= r_active) AND (moved <= p_rdy)) U ((p_i2 <= off) AND (1 <= p_sc)))) OR A (G ((((r_moving <= access) OR (1 <= initialized)) AND (p_rel <= 2))))) : ((((p_m <= 1) AND (initialized <= 0) AND ((1 <= r_active) OR (move <= moved) OR ((1 <= access) AND (2 <= p_i1)))) OR (r_active <= p_sc)) AND E (G (E (F ((r_stopped <= p_rel)))))) : A (G (E (F ((3 <= p_rel))))) : E (X (NOT(A (G ((2 <= access)))))) : E ((E (X ((move <= p_sc))) U A (G ((2 <= p_i1))))) : A (G ((3 <= access))) : E (F ((access <= initialized))) : E (F ((E (X ((p_i1 <= p_i2))) AND A (X ((move <= off)))))) : A (F ((initialize <= 0))) : NOT((A (X (((p_i2 <= access) OR (3 <= p_i2)))) AND (E (G ((r_moving <= p_rel))) OR ((p_rdy <= 1) AND (1 <= p_rel))))) : E (G (((off <= p_rdy) AND (3 <= r_moving) AND ((1 <= p_i1) OR (1 <= r_active)) AND ((moved <= p_i1) OR ((3 <= r_stopped)))))) : (A (X (A (G ((2 <= p_i1))))) OR (NOT(E (G ((p_i2 <= r_stopped)))) AND ()))
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 ((((3 <= r_stopped) OR (p_m <= off)) U (2 <= p_rel)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((3 <= r_stopped) OR (p_m <= off)) U (2 <= p_rel))
lola: processed formula length: 53
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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: A (X ((E (F ((p_i1 <= p_m))) OR A (F ((r_stopped <= p_rdy))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((E(TRUE U (p_i1 <= p_m)) OR A(TRUE U (r_stopped <= p_rdy))))
lola: processed formula length: 63
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= 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: state equation: write sara problem file to RobotManipulation-PT-00050-CTLCardinality-2.sara
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: ((E (G ((p_m <= 2))) OR E (X ((p_rdy + 1 <= off)))) AND E ((((3 <= p_rel) OR (off <= p_sc)) U (r_stopped <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p_m <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= p_m)))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((3 <= p_rel) OR (off <= p_sc)) U (r_stopped <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((3 <= p_rel) OR (off <= p_sc)) U (r_stopped <= 1))
lola: processed formula length: 54
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((access <= r_active) AND (moved <= p_rdy)) U ((p_i2 <= off) AND (1 <= p_sc)))) OR A (G ((((r_moving <= access) OR (1 <= initialized)) AND (p_rel <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((access <= r_active) AND (moved <= p_rdy)) U ((p_i2 <= off) AND (1 <= p_sc))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((access <= r_active) AND (moved <= p_rdy)) U ((p_i2 <= off) AND (1 <= p_sc)))
lola: processed formula length: 80
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((r_moving <= access) OR (1 <= initialized)) AND (p_rel <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00050-CTLCardinality-5.sara
lola: state equation: calling and running 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p_m <= 1) AND (initialized <= 0) AND ((1 <= r_active) OR (move <= moved) OR ((1 <= access) AND (2 <= p_i1)))) OR (r_active <= p_sc)) AND E (G (E (F ((r_stopped <= p_rel))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p_m <= 1) AND (initialized <= 0) AND ((1 <= r_active) OR (move <= moved) OR ((1 <= access) AND (2 <= p_i1)))) OR (r_active <= p_sc))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p_m <= 1) AND (initialized <= 0) AND ((1 <= r_active) OR (move <= moved) OR ((1 <= access) AND (2 <= p_i1)))) OR (r_active <= p_sc))
lola: processed formula length: 138
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-CTLCardinality.task
lola: processed formula with 7 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((r_stopped <= p_rel)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (r_stopped <= p_rel)))))
lola: processed formula length: 50
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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: SUBRESULT
lola: lola: result: yes
========================================
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((3 <= p_rel)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (3 <= p_rel)))))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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: 2030561 markings, 5943562 edges, 3110617900780617728 markings/sec, 0 secs
lola: 3985072 markings, 11508955 edges, 390902 markings/sec, 5 secs
lola: 5907725 markings, 16953541 edges, 384531 markings/sec, 10 secs
lola: 7790007 markings, 22269414 edges, 376456 markings/sec, 15 secs
lola: 9681701 markings, 27596263 edges, 378339 markings/sec, 20 secs
lola: 11572179 markings, 32923236 edges, 378096 markings/sec, 25 secs
lola: 13441607 markings, 38201917 edges, 373886 markings/sec, 30 secs
lola: 15253393 markings, 43449492 edges, 362357 markings/sec, 35 secs
lola: 16713224 markings, 47869517 edges, 291966 markings/sec, 40 secs
lola: 18165229 markings, 52241486 edges, 290401 markings/sec, 45 secs
lola: 19598491 markings, 56556214 edges, 286652 markings/sec, 50 secs
lola: 21028099 markings, 60865722 edges, 285922 markings/sec, 55 secs
lola: 22479935 markings, 65261756 edges, 290367 markings/sec, 60 secs
lola: 23920659 markings, 69636547 edges, 288145 markings/sec, 65 secs
lola: 25336327 markings, 73987418 edges, 283134 markings/sec, 70 secs
lola: 26704802 markings, 78374463 edges, 273695 markings/sec, 75 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 7 will run for 384 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(A (G ((2 <= access))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (access <= 1)))
lola: processed formula length: 27
lola: 5 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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: ========================================
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 432 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((move <= p_sc))) U A (G ((2 <= p_i1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX((move <= p_sc)) U NOT(E(TRUE U (p_i1 <= 1))))
lola: processed formula length: 50
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1097511 markings, 4942071 edges, 3092824778986225664 markings/sec, 0 secs
lola: 2017479 markings, 9386681 edges, 183994 markings/sec, 5 secs
lola: 2858348 markings, 13549699 edges, 168174 markings/sec, 10 secs
lola: 3665178 markings, 17612659 edges, 161366 markings/sec, 15 secs
lola: 4448337 markings, 21570163 edges, 156632 markings/sec, 20 secs
lola: 5206758 markings, 25447566 edges, 151684 markings/sec, 25 secs
lola: 5935301 markings, 29224239 edges, 145709 markings/sec, 30 secs
lola: 6653961 markings, 32949710 edges, 143732 markings/sec, 35 secs
lola: 7363730 markings, 36631638 edges, 141954 markings/sec, 40 secs
lola: 8051920 markings, 40251293 edges, 137638 markings/sec, 45 secs
lola: 8751239 markings, 43882935 edges, 139864 markings/sec, 50 secs
lola: 9426664 markings, 47446464 edges, 135085 markings/sec, 55 secs
lola: 10088935 markings, 50975319 edges, 132454 markings/sec, 60 secs
lola: 10757247 markings, 54493742 edges, 133662 markings/sec, 65 secs
lola: 11415510 markings, 57987012 edges, 131653 markings/sec, 70 secs
lola: 12061361 markings, 61432968 edges, 129170 markings/sec, 75 secs
lola: 12714989 markings, 64893152 edges, 130726 markings/sec, 80 secs
lola: 13353277 markings, 68312342 edges, 127658 markings/sec, 85 secs
lola: 13977813 markings, 71654182 edges, 124907 markings/sec, 90 secs
lola: 14580308 markings, 74882422 edges, 120499 markings/sec, 95 secs
lola: 15199221 markings, 78214370 edges, 123783 markings/sec, 100 secs
lola: 15815935 markings, 81529507 edges, 123343 markings/sec, 105 secs
lola: 16431710 markings, 84847170 edges, 123155 markings/sec, 110 secs
lola: 17028658 markings, 88053601 edges, 119390 markings/sec, 115 secs
lola: 17616233 markings, 91242066 edges, 117515 markings/sec, 120 secs
lola: 18201443 markings, 94441752 edges, 117042 markings/sec, 125 secs
lola: 18788122 markings, 97646960 edges, 117336 markings/sec, 130 secs
lola: 19381152 markings, 100863034 edges, 118606 markings/sec, 135 secs
lola: 19963952 markings, 104037339 edges, 116560 markings/sec, 140 secs
lola: 20548342 markings, 107226696 edges, 116878 markings/sec, 145 secs
lola: 21117559 markings, 110342058 edges, 113843 markings/sec, 150 secs
lola: 21700760 markings, 113519399 edges, 116640 markings/sec, 155 secs
lola: 22280176 markings, 116686046 edges, 115883 markings/sec, 160 secs
lola: 22846490 markings, 119795494 edges, 113263 markings/sec, 165 secs
lola: 23431485 markings, 122973115 edges, 116999 markings/sec, 170 secs
lola: 24001272 markings, 126102826 edges, 113957 markings/sec, 175 secs
lola: 24564189 markings, 129195243 edges, 112583 markings/sec, 180 secs
lola: 25130384 markings, 132313502 edges, 113239 markings/sec, 185 secs
lola: 25709184 markings, 135461431 edges, 115760 markings/sec, 190 secs
lola: 26268725 markings, 138560076 edges, 111908 markings/sec, 195 secs
lola: 26820845 markings, 141632617 edges, 110424 markings/sec, 200 secs
lola: 27391595 markings, 144750035 edges, 114150 markings/sec, 205 secs
lola: 27956498 markings, 147847728 edges, 112981 markings/sec, 210 secs
lola: 28520925 markings, 150936761 edges, 112885 markings/sec, 215 secs
lola: 29076749 markings, 154020027 edges, 111165 markings/sec, 220 secs
lola: 29630611 markings, 157078826 edges, 110772 markings/sec, 225 secs
lola: 30177468 markings, 160116178 edges, 109371 markings/sec, 230 secs
lola: 30735742 markings, 163179760 edges, 111655 markings/sec, 235 secs
lola: 31286915 markings, 166219697 edges, 110235 markings/sec, 240 secs
lola: 31828862 markings, 169238853 edges, 108389 markings/sec, 245 secs
lola: 32372141 markings, 172252598 edges, 108656 markings/sec, 250 secs
lola: 32911824 markings, 175258400 edges, 107937 markings/sec, 255 secs
lola: 33449677 markings, 178247501 edges, 107571 markings/sec, 260 secs
lola: 33976018 markings, 181182455 edges, 105268 markings/sec, 265 secs
lola: 34491847 markings, 184066174 edges, 103166 markings/sec, 270 secs
lola: 35022236 markings, 186990233 edges, 106078 markings/sec, 275 secs
lola: 35531899 markings, 189846878 edges, 101933 markings/sec, 280 secs
lola: 36061654 markings, 192769582 edges, 105951 markings/sec, 285 secs
lola: 36576567 markings, 195647826 edges, 102983 markings/sec, 290 secs
lola: 37088390 markings, 198494642 edges, 102365 markings/sec, 295 secs
lola: 37599418 markings, 201350659 edges, 102206 markings/sec, 300 secs
lola: 38108425 markings, 204202176 edges, 101801 markings/sec, 305 secs
lola: 38623810 markings, 207085791 edges, 103077 markings/sec, 310 secs
lola: 39143782 markings, 209953836 edges, 103994 markings/sec, 315 secs
lola: 39659322 markings, 212812882 edges, 103108 markings/sec, 320 secs
lola: 40159367 markings, 215631003 edges, 100009 markings/sec, 325 secs
lola: 40662365 markings, 218461502 edges, 100600 markings/sec, 330 secs
lola: 41162263 markings, 221267205 edges, 99980 markings/sec, 335 secs
lola: 41673654 markings, 224127285 edges, 102278 markings/sec, 340 secs
lola: 42178839 markings, 226954673 edges, 101037 markings/sec, 345 secs
lola: 42682506 markings, 229783202 edges, 100733 markings/sec, 350 secs
lola: 43180450 markings, 232581395 edges, 99589 markings/sec, 355 secs
lola: 43686143 markings, 235409580 edges, 101139 markings/sec, 360 secs
lola: 44193362 markings, 238239654 edges, 101444 markings/sec, 365 secs
lola: 44690590 markings, 241048805 edges, 99446 markings/sec, 370 secs
lola: 45188320 markings, 243847393 edges, 99546 markings/sec, 375 secs
lola: 45685235 markings, 246639948 edges, 99383 markings/sec, 380 secs
lola: 46175580 markings, 249414973 edges, 98069 markings/sec, 385 secs
lola: 46681650 markings, 252237606 edges, 101214 markings/sec, 390 secs
lola: 47177513 markings, 255033556 edges, 99173 markings/sec, 395 secs
lola: 47658076 markings, 257770610 edges, 96113 markings/sec, 400 secs
lola: 48157868 markings, 260572786 edges, 99958 markings/sec, 405 secs
lola: 48650141 markings, 263350280 edges, 98455 markings/sec, 410 secs
lola: 49129897 markings, 266083889 edges, 95951 markings/sec, 415 secs
lola: 49624206 markings, 268850648 edges, 98862 markings/sec, 420 secs
lola: 50117829 markings, 271640337 edges, 98725 markings/sec, 425 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 432 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-00050-CTLCardinality-9.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((access <= initialized)))
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: state equation: write sara problem file to RobotManipulation-PT-00050-CTLCardinality-10.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 605 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (X ((p_i1 <= p_i2))) AND A (X ((move <= off))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (EX((p_i1 <= p_i2)) AND AX((move <= off))))
lola: processed formula length: 52
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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 12 will run for 756 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((initialize <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (initialize <= 0))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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 13 will run for 1008 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (X (((p_i2 <= access) OR (3 <= p_i2)))) AND (E (G ((r_moving <= p_rel))) OR ((p_rdy <= 1) AND (1 <= p_rel)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1008 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((access + 1 <= p_i2) AND (p_i2 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((access + 1 <= p_i2) AND (p_i2 <= 2)))
lola: processed formula length: 42
lola: 10 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1513 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p_rel + 1 <= r_moving)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p_rel + 1 <= r_moving))
lola: processed formula length: 33
lola: 10 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1513 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((off <= p_rdy) AND (3 <= r_moving) AND ((1 <= p_i1) OR (1 <= r_active)) AND ((moved <= p_i1) OR ((3 <= r_stopped))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p_rdy + 1 <= off) OR (r_moving <= 2) OR ((p_i1 <= 0) AND (r_active <= 0)) OR ((p_i1 + 1 <= moved) AND ((r_stopped <= 2))))))
lola: processed formula length: 142
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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 15 will run for 3026 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G ((2 <= p_i1))))) OR (NOT(E (G ((p_i2 <= r_stopped)))) AND ()))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3026 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((2 <= p_i1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(E(TRUE U (p_i1 <= 1))))
lola: processed formula length: 30
lola: 8 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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: 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: RESULT
lola:
SUMMARY: yes yes yes yes no yes yes yes unknown no yes yes yes no no unknown
lola: ========================================
FORMULA RobotManipulation-PT-00050-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496341121178

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