Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_GPPP-PT-C0100N0000000100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612600538
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496394779169


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


checking for too many tokens
===========================================================================================
S_GPPP-PT-C0100N0000000100: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_GPPP-PT-C0100N0000000100 @ 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: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C0100N0000000100-ReachabilityCardinality.task
lola: A (G ((((NADPplus <= c1) AND (PEP <= Pi)) OR (F6P <= start) OR (Xu5P <= _1_3_BPG) OR (F6P <= GSSG) OR ((b2 <= Ru5P) AND (2 <= Lac))))) : E (F ((2 <= PEP))) : E (F ((1 <= _2PG))) : E (F ((((2 <= NADH) OR (2 <= S7P)) AND (GAP <= 0) AND ((1 <= PEP) OR (2 <= FBP)) AND (ATP <= 0)))) : A (G (((G6P + 1 <= F6P) OR (_3PG <= 0) OR (2 <= a1)))) : A (G (((2 <= Xu5P) OR (NADplus <= ATP)))) : A (G (((NADPH <= ATP) OR (3 <= Pyr)))) : E (F (())) : A (G ((Pyr <= ATP))) : A (G (((PEP <= Gluc) AND (1 <= ATP) AND (2 <= NADPplus)))) : A (G ((3 <= ATP))) : A (G (((R5P + 1 <= F6P) OR (Xu5P <= 2) OR (c1 <= 1) OR (NADPplus <= 0)))) : E (F (((NADplus + 1 <= ADP) AND (Xu5P <= 1) AND (3 <= R5P)))) : E (F ((GSSG <= Pyr))) : A (G ((Pyr <= GSSG))) : A (G (((Pyr + 1 <= Pi) OR (Xu5P <= 0) OR (3 <= c1))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((NADPplus <= c1) AND (PEP <= Pi)) OR (F6P <= start) OR (Xu5P <= _1_3_BPG) OR (F6P <= GSSG) OR ((b2 <= Ru5P) AND (2 <= Lac)))))
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 84 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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= PEP)))
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 84 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: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityCardinality.sara
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= _2PG)))
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 84 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 GPPP-PT-C0100N0000000100-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= NADH) OR (2 <= S7P)) AND (GAP <= 0) AND ((1 <= PEP) OR (2 <= FBP)) AND (ATP <= 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 84 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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((G6P + 1 <= F6P) OR (_3PG <= 0) OR (2 <= a1))))
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 84 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 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 GPPP-PT-C0100N0000000100-ReachabilityCardinality-4.sara
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= Xu5P) OR (NADplus <= ATP))))
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 84 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 GPPP-PT-C0100N0000000100-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: sara: result: notry reading problem file GPPP-PT-C0100N0000000100-ReachabilityCardinality-2.sara.

lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NADPH <= ATP) OR (3 <= Pyr))))
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 84 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 GPPP-PT-C0100N0000000100-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: sara: place or transition ordering is non-deterministic
...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-ReachabilityCardinality.task
lola: processed formula with 0 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: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Pyr <= ATP)))
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 84 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: ========================================

lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((PEP <= Gluc) AND (1 <= ATP) AND (2 <= NADPplus))))
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 84 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 3 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= ATP)))
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 84 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 GPPP-PT-C0100N0000000100-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((R5P + 1 <= F6P) OR (Xu5P <= 2) OR (c1 <= 1) OR (NADPplus <= 0))))
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 84 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityCardinality-11.sara
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NADplus + 1 <= ADP) AND (Xu5P <= 1) AND (3 <= R5P))))
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 84 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 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4004240 markings, 8779415 edges, 800848 markings/sec, 0 secs
lola: sara is running 5 secs || 7465167 markings, 17431670 edges, 692185 markings/sec, 5 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1175 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((GSSG <= Pyr)))
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 84 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 GPPP-PT-C0100N0000000100-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1763 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Pyr <= GSSG)))
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 84 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 GPPP-PT-C0100N0000000100-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3526 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Pyr + 1 <= Pi) OR (Xu5P <= 0) OR (3 <= c1))))
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 84 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 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4018304 markings, 8743160 edges, 803661 markings/sec, 0 secs
lola: sara is running 5 secs || 7746969 markings, 17497417 edges, 745733 markings/sec, 5 secs
lola: sara is running 10 secs || 11157877 markings, 26334100 edges, 682182 markings/sec, 10 secs
lola: sara is running 15 secs || 14615721 markings, 35303155 edges, 691569 markings/sec, 15 secs
lola: sara is running 20 secs || 18058817 markings, 44208317 edges, 688619 markings/sec, 20 secs
lola: sara is running 25 secs || 21433771 markings, 52954438 edges, 674991 markings/sec, 25 secs
lola: sara is running 30 secs || 24807242 markings, 61667282 edges, 674694 markings/sec, 30 secs
lola: sara is running 35 secs || 28652825 markings, 70789304 edges, 769117 markings/sec, 35 secs
lola: sara is running 40 secs || 31905233 markings, 78535709 edges, 650482 markings/sec, 40 secs
lola: sara is running 45 secs || 35133421 markings, 86253926 edges, 645638 markings/sec, 45 secs
lola: sara is running 50 secs || 38390864 markings, 94048226 edges, 651489 markings/sec, 50 secs
lola: sara is running 55 secs || 41606552 markings, 101748211 edges, 643138 markings/sec, 55 secs
lola: sara is running 60 secs || 44731081 markings, 109214408 edges, 624906 markings/sec, 60 secs
lola: sara is running 65 secs || 47645729 markings, 116186900 edges, 582930 markings/sec, 65 secs
lola: sara is running 70 secs || 50518981 markings, 123069225 edges, 574650 markings/sec, 70 secs
lola: sara is running 75 secs || 53401670 markings, 129976804 edges, 576538 markings/sec, 75 secs
lola: sara is running 80 secs || 56294182 markings, 136909536 edges, 578502 markings/sec, 80 secs
lola: sara is running 85 secs || 59150216 markings, 143747090 edges, 571207 markings/sec, 85 secs
lola: sara is running 90 secs || 62049017 markings, 150680634 edges, 579760 markings/sec, 90 secs
lola: sara is running 95 secs || 64916879 markings, 157545896 edges, 573572 markings/sec, 95 secs
lola: sara is running 100 secs || 67763421 markings, 164365173 edges, 569308 markings/sec, 100 secs
lola: sara is running 105 secs || 70625155 markings, 171223783 edges, 572347 markings/sec, 105 secs
lola: sara is running 110 secs || 73415253 markings, 177911139 edges, 558020 markings/sec, 110 secs
lola: sara is running 115 secs || 76157750 markings, 184478058 edges, 548499 markings/sec, 115 secs
lola: sara is running 120 secs || 78943820 markings, 191137506 edges, 557214 markings/sec, 120 secs
lola: sara is running 125 secs || 81714335 markings, 197772380 edges, 554103 markings/sec, 125 secs
lola: sara is running 130 secs || 84497037 markings, 204440113 edges, 556540 markings/sec, 130 secs
lola: sara is running 135 secs || 87364296 markings, 211311620 edges, 573452 markings/sec, 135 secs
lola: sara is running 140 secs || 90290979 markings, 218326599 edges, 585337 markings/sec, 140 secs
lola: sara is running 145 secs || 93164427 markings, 225193622 edges, 574690 markings/sec, 145 secs
lola: sara is running 150 secs || 95998979 markings, 231978203 edges, 566910 markings/sec, 150 secs
lola: sara is running 155 secs || 98831307 markings, 238763927 edges, 566466 markings/sec, 155 secs
lola: sara is running 160 secs || 101668442 markings, 245562340 edges, 567427 markings/sec, 160 secs
lola: sara is running 165 secs || 104471260 markings, 252279938 edges, 560564 markings/sec, 165 secs
lola: sara is running 170 secs || 107264024 markings, 258961691 edges, 558553 markings/sec, 170 secs
lola: sara is running 175 secs || 110040038 markings, 265602472 edges, 555203 markings/sec, 175 secs
lola: sara is running 180 secs || 112824727 markings, 272271065 edges, 556938 markings/sec, 180 secs
lola: sara is running 185 secs || 115595072 markings, 278909068 edges, 554069 markings/sec, 185 secs
lola: sara is running 190 secs || 118348487 markings, 285508145 edges, 550683 markings/sec, 190 secs
lola: sara is running 195 secs || 121053526 markings, 291992124 edges, 541008 markings/sec, 195 secs
lola: sara is running 200 secs || 123791518 markings, 298532337 edges, 547598 markings/sec, 200 secs
lola: sara is running 205 secs || 126552041 markings, 305141191 edges, 552105 markings/sec, 205 secs
lola: sara is running 210 secs || 129308151 markings, 311744069 edges, 551222 markings/sec, 210 secs
lola: sara is running 215 secs || 132074668 markings, 318373752 edges, 553303 markings/sec, 215 secs
lola: sara is running 220 secs || 134781239 markings, 324861379 edges, 541314 markings/sec, 220 secs
lola: sara is running 225 secs || 137470855 markings, 331290037 edges, 537923 markings/sec, 225 secs
lola: sara is running 230 secs || 140175601 markings, 337763343 edges, 540949 markings/sec, 230 secs
lola: sara is running 235 secs || 142897893 markings, 344284104 edges, 544458 markings/sec, 235 secs
lola: sara is running 240 secs || 145634509 markings, 350840978 edges, 547323 markings/sec, 240 secs
lola: sara is running 245 secs || 148295446 markings, 357218086 edges, 532187 markings/sec, 245 secs
lola: sara is running 250 secs || 150965800 markings, 363608059 edges, 534071 markings/sec, 250 secs
lola: sara is running 255 secs || 153679752 markings, 370098864 edges, 542790 markings/sec, 255 secs
lola: sara is running 260 secs || 156418051 markings, 376656033 edges, 547660 markings/sec, 260 secs
lola: sara is running 265 secs || 159113914 markings, 383115241 edges, 539173 markings/sec, 265 secs
lola: sara is running 270 secs || 161821551 markings, 389604529 edges, 541527 markings/sec, 270 secs
lola: sara is running 275 secs || 164500607 markings, 396020587 edges, 535811 markings/sec, 275 secs
lola: sara is running 280 secs || 167177217 markings, 402417314 edges, 535322 markings/sec, 280 secs
lola: sara is running 285 secs || 169887912 markings, 408908439 edges, 542139 markings/sec, 285 secs
lola: sara is running 290 secs || 172592189 markings, 415386708 edges, 540855 markings/sec, 290 secs
lola: sara is running 295 secs || 175321745 markings, 421928809 edges, 545911 markings/sec, 295 secs
lola: sara is running 300 secs || 177871445 markings, 428039814 edges, 509940 markings/sec, 300 secs
lola: sara is running 305 secs || 180539026 markings, 434410166 edges, 533516 markings/sec, 305 secs
lola: sara is running 310 secs || 183226920 markings, 440845590 edges, 537579 markings/sec, 310 secs
lola: sara is running 315 secs || 185900253 markings, 447250745 edges, 534667 markings/sec, 315 secs
lola: sara is running 320 secs || 188586739 markings, 453688372 edges, 537297 markings/sec, 320 secs
lola: sara is running 325 secs || 189145460 markings, 455027367 edges, 111744 markings/sec, 325 secs
lola: sara is running 330 secs || 189159963 markings, 455062254 edges, 2901 markings/sec, 330 secs
lola: sara is running 335 secs || 189188110 markings, 455129872 edges, 5629 markings/sec, 335 secs
lola: sara is running 340 secs || 189198675 markings, 455155107 edges, 2113 markings/sec, 340 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes yes yes no no no no no no no no no yes no unknown
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496395144626

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_GPPP-PT-C0100N0000000100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_GPPP-PT-C0100N0000000100.tgz
mv S_GPPP-PT-C0100N0000000100 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_GPPP-PT-C0100N0000000100, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r108-blw3-149441612600538"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;