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_CircularTrains-PT-384, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074700628
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496356727620


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


checking for too many tokens
===========================================================================================
S_CircularTrains-PT-384: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_CircularTrains-PT-384 @ 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: 1152/65536 symbol table entries, 116 collisions
lola: preprocessing...
lola: finding significant places
lola: 768 places, 384 transitions, 383 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 768 transition conflict sets
lola: TASK
lola: reading formula from CircularTrains-PT-384-ReachabilityCardinality.task
lola: A (G ((((Section_180 <= 2) AND (F24 <= 2)) OR ((Section_71 <= 1) AND (F247 + 1 <= Section_144))))) : A (G (((F38 <= 2) OR (F338 <= Section_374) OR (F179 <= Section_332)))) : A (G (((Section_206 <= Section_179) OR ((Section_96 <= 0) AND (Section_92 <= 0))))) : E (F (((Section_253 <= Section_23) AND (2 <= Section_304)))) : E (F (((Section_382 + 1 <= Section_302) AND (Section_11 + 1 <= Section_115)))) : A (G (((F140 + 1 <= Section_295) OR (Section_7 <= 2) OR (F113 <= 1)))) : E (F ((((Section_236 <= F377) OR (1 <= Section_350) OR (F23 <= 2)) AND (3 <= F276)))) : E (F (((3 <= Section_12) AND (Section_332 <= 0) AND ((F83 + 1 <= F44) OR ((Section_183 <= Section_62) AND (Section_311 <= Section_52)))))) : E (F ((2 <= Section_62))) : E (F ((2 <= F300))) : A (G (((F270 + 1 <= F212) AND (F127 <= 2) AND (F339 <= Section_213)))) : E (F (((Section_213 <= 0) AND (F205 + 1 <= Section_265) AND ((Section_264 <= 2) OR (Section_22 <= 1))))) : E (F (((Section_33 + 1 <= F207) AND (F298 + 1 <= F309) AND ((2 <= F146) OR (Section_97 + 1 <= Section_163))))) : A (G (((F103 <= F371) OR (Section_41 <= Section_132) OR (1 <= F240) OR (Section_106 <= F133)))) : E (F (((2 <= F209) AND (Section_213 + 1 <= Section_116) AND (2 <= F270)))) : E (F (((F127 <= 1) AND (Section_223 <= 0) AND (((3 <= F338) AND (F306 <= F364)) OR ((3 <= Section_243) AND (2 <= F104))))))
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 ((((Section_180 <= 2) AND (F24 <= 2)) OR ((Section_71 <= 1) AND (F247 + 1 <= Section_144)))))
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 1532 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 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-384-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CircularTrains-PT-384-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((F38 <= 2) OR (F338 <= Section_374) OR (F179 <= Section_332))))
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 1532 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 CircularTrains-PT-384-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CircularTrains-PT-384-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Section_206 <= Section_179) OR ((Section_96 <= 0) AND (Section_92 <= 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 1532 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 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to CircularTrains-PT-384-ReachabilityCardinality-2.sara
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Section_253 <= Section_23) AND (2 <= Section_304))))
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 1532 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 CircularTrains-PT-384-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file CircularTrains-PT-384-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Section_382 + 1 <= Section_302) AND (Section_11 + 1 <= Section_115))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1532 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to CircularTrains-PT-384-ReachabilityCardinality-4.sara
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((F140 + 1 <= Section_295) OR (Section_7 <= 2) OR (F113 <= 1))))
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 1532 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 CircularTrains-PT-384-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file CircularTrains-PT-384-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((Section_236 <= F377) OR (1 <= Section_350) OR (F23 <= 2)) AND (3 <= F276))))
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 1532 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 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-384-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file CircularTrains-PT-384-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= Section_12) AND (Section_332 <= 0) AND ((F83 + 1 <= F44) OR ((Section_183 <= Section_62) AND (Section_311 <= Section_52))))))
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 1532 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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-384-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file CircularTrains-PT-384-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= Section_62)))
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 1532 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 CircularTrains-PT-384-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file CircularTrains-PT-384-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= F300)))
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 1532 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 CircularTrains-PT-384-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file CircularTrains-PT-384-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((F270 + 1 <= F212) AND (F127 <= 2) AND (F339 <= Section_213))))
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 1532 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to CircularTrains-PT-384-ReachabilityCardinality-10.sara
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Section_213 <= 0) AND (F205 + 1 <= Section_265) AND ((Section_264 <= 2) OR (Section_22 <= 1)))))
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 1532 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 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to CircularTrains-PT-384-ReachabilityCardinality-11.sara
lola: The predicate is reachable.
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: lola: state equation: calling and running sara
========================================
lola: ========================================
lola: ...considering subproblem: E (F (((Section_33 + 1 <= F207) AND (F298 + 1 <= F309) AND ((2 <= F146) OR (Section_97 + 1 <= Section_163)))))
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 1532 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
sara: try reading problem file CircularTrains-PT-384-ReachabilityCardinality-11.sara.
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-384-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((F103 <= F371) OR (Section_41 <= Section_132) OR (1 <= F240) OR (Section_106 <= F133))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: state equation: calling and running sara
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1532 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: ========================================
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: state equation: write sara problem file to CircularTrains-PT-384-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file CircularTrains-PT-384-ReachabilityCardinality-12.sara.
sara: try reading problem file CircularTrains-PT-384-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= F209) AND (Section_213 + 1 <= Section_116) AND (2 <= F270))))
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 1532 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 CircularTrains-PT-384-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file CircularTrains-PT-384-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((F127 <= 1) AND (Section_223 <= 0) AND (((3 <= F338) AND (F306 <= F364)) OR ((3 <= Section_243) AND (2 <= F104))))))
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 1532 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-384-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file CircularTrains-PT-384-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no yes yes no no no no no yes yes no no no
FORMULA CircularTrains-PT-384-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496356729754

--------------------
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_CircularTrains-PT-384"
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_CircularTrains-PT-384.tgz
mv S_CircularTrains-PT-384 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_CircularTrains-PT-384, 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 r088-csrt-149441074700628"
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 ;