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-2979
Executing tool lola
Input is GPPP-PT-C0010N0000000100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r218su-smll-146468021200502
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464895972376

bkconf 3600
===========================================================================================
===========================================================================================
GPPP-PT-C0010N0000000100: translating Petri net model.pnml into LoLA format
GPPP-PT-C0010N0000000100: translating formula ReachabilityCardinality into LoLA format
===========================================================================================
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
===========================================================================================
/home/mcc/BenchKit/bin/formula2lola.py ReachabilityCardinality.xml
touch formulae;


in benchkit_head lolaszeit 3540
ReachabilityCardinality @ GPPP-PT-C0010N0000000100
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-6 CANNOT_COMPUTE
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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-C0010N0000000100-ReachabilityCardinality.task
lola: read: AG (1 <= NADPplus) : EF (((!(_3PG <= G6P) OR (2 <= S7P AND 1 <= _1_3_BPG)) AND ((ADP <= _2PG AND a1 <= GSSG) OR 2 <= E4P))) : AG (((Pyr <= c2 AND (1 <= b1 OR DHAP <= _3PG)) OR ((FBP <= c2 AND Pyr <= F6P) AND _3PG <= S7P))) : EF ((((3 <= PEP OR b2 <= start) AND (2 <= F6P OR a2 <= Pi)) AND (!(Pyr <= FBP) OR (b1 <= Xu5P OR 3 <= E4P)))) : EF ((a2 <= NADH AND (1 <= E4P AND (1 <= Lac AND 2 <= R5P)))) : ... (shortened)
lola: formula length: 1064
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-NADPplus <= -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 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to GPPP-PT-C0010N0000000100-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file GPPP-PT-C0010N0000000100-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-G6P + _3PG > 0 OR (-S7P <= -2 AND -_1_3_BPG <= -1)) AND ((-_2PG + ADP <= 0 AND a1 + -GSSG <= 0) OR -E4P <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 12 literals
lola: write sara problem file to GPPP-PT-C0010N0000000100-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file GPPP-PT-C0010N0000000100-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((Pyr + -c2 <= 0 AND (-b1 <= -1 OR DHAP + -_3PG <= 0)) OR (-c2 + FBP <= 0 AND (Pyr + -F6P <= 0 AND _3PG + -S7P <= 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 15 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: write sara problem file to GPPP-PT-C0010N0000000100-ReachabilityCardinality-2.sara
lola: ========================================
lola: subprocess 3 will run for 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-PEP <= -3 OR b2 + -start <= 0) AND ((-F6P <= -2 OR a2 + -Pi <= 0) AND (Pyr + -FBP > 0 OR (-Xu5P + b1 <= 0 OR -E4P <= -3)))))
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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 32 literals
lola: write sara problem file to GPPP-PT-C0010N0000000100-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((a2 + -NADH <= 0 AND (-E4P <= -1 AND (-Lac <= -1 AND -R5P <= -2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4 literals
lola: write sara problem file to GPPP-PT-C0010N0000000100-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file GPPP-PT-C0010N0000000100-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (NADPplus + -_1_3_BPG <= 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to GPPP-PT-C0010N0000000100-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file GPPP-PT-C0010N0000000100-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (E4P + -GSSG <= 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to GPPP-PT-C0010N0000000100-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file GPPP-PT-C0010N0000000100-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (NADPplus + -GAP <= 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to GPPP-PT-C0010N0000000100-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file GPPP-PT-C0010N0000000100-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FBP + -R5P <= 0 OR -F6P <= -3) AND (NADPplus + -GSH <= 0 OR -G6P <= -2)) OR E4P + -Gluc <= 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 6 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 416 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((GAP + -a1 <= 0 OR (-GSH + S7P <= 0 OR ((-b2 <= -3 AND -ATP <= -3) OR -NADPH <= -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 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 8 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((GSH + -FBP > 0 AND (-NADH <= -2 AND (-NADH <= -1 AND (b2 + -G6P <= 0 AND NADPH + -c1 <= 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 583 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-DHAP + _1_3_BPG <= 0 AND ((b2 + -ADP <= 0 AND -Gluc <= -2) OR -NADH > -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 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 5 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 729 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-ADP <= -1 OR -Gluc + b1 > 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2 literals
lola: write sara problem file to GPPP-PT-C0010N0000000100-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file GPPP-PT-C0010N0000000100-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 964 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-GSH + R5P <= 0 OR (Pyr + -a1 <= 0 OR (-Gluc <= -3 AND -_2PG <= -2))) AND Lac + -R5P <= 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 7 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-start + b1 > 0 OR ((Xu5P + -GSH <= 0 AND -b2 <= -3) OR -start <= -3)))
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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 6 literals
lola: write sara problem file to GPPP-PT-C0010N0000000100-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file GPPP-PT-C0010N0000000100-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2893 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-NADH + E4P <= 0 AND (-Ru5P <= -1 AND (-E4P + Pi <= 0 AND (-GSH <= -3 AND NADH + -NADPH > 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 5 literals
lola: write sara problem file to GPPP-PT-C0010N0000000100-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file GPPP-PT-C0010N0000000100-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola: summary: yes no no yes no no unknown no no no yes no yes no no no

BK_STOP 1464896623972

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

parsing of model.pnml complete

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="GPPP-PT-C0010N0000000100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/GPPP-PT-C0010N0000000100.tgz
mv GPPP-PT-C0010N0000000100 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is GPPP-PT-C0010N0000000100, 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 r218su-smll-146468021200502"
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 ;