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 QuasiCertifProtocol-PT-06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098kn-smll-146369140300088
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463698708665

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ QuasiCertifProtocol-PT-06
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-15 TRUE 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: 386/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 270 places, 116 transitions, 115 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 151 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-06-ReachabilityCardinality.task
lola: read: AG (a2 <= n9_2_0 + n9_1_0 + n9_0_0 + n9_0_1 + n9_1_1 + n9_2_1 + n9_3_1 + n9_3_0 + n9_4_0 + n9_5_0 + n9_6_0 + n9_1_2 + n9_2_2 + n9_3_2 + n9_4_2 + n9_4_1 + n9_5_1 + n9_6_1 + n9_0_2 + n9_3_3 + n9_2_3 + n9_5_3 + n9_4_3 + n9_6_2 + n9_5_2 + n9_1_3 + n9_0_3 + n9_4_4 + n9_3_4 + n9_6_4 + n9_5_4 + n9_0_4 + n9_6_3 + n9_2_4 + n9_1_4 + n9_6_5 + n9_0_6 + n9_4_5 + n9_5_5 + n9_2_5 + n9_3_5 + n9_0_5 + n9_1_5 + n9_... (shortened)
lola: formula length: 5763
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 (-n9_6_6 + -n9_6_5 + -n9_6_4 + -n9_6_3 + -n9_6_2 + -n9_6_1 + -n9_6_0 + -n9_5_6 + -n9_5_5 + -n9_5_4 + -n9_5_3 + -n9_5_2 + -n9_5_1 + -n9_5_0 + -n9_1_0 + -n9_1_1 + -n9_4_6 + -n9_4_5 + -n9_4_4 + -n9_4_3 + -n9_4_2 + -n9_4_1 + -n9_4_0 + -n9_3_6 + -n9_3_5 + -n9_3_4 + -n9_3_3 + -n9_3_2 + -n9_3_1 + -n9_3_0 + -n9_1_2 + -n9_2_6 + -n9_2_5 + -n9_2_4 + -n9_2_3 + -n9_2_2 + -n9_2_1 + -n9_2_0 + -n9_1_6 + -n9_1_... (shortened)
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 460 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((-n9_6_6 + -n9_6_5 + -n9_6_4 + -n9_6_3 + -n9_6_2 + -n9_6_1 + -n9_6_0 + -n9_5_6 + -n9_5_5 + -n9_5_4 + -n9_5_3 + -n9_5_2 + -n9_5_1 + -n9_5_0 + -n9_1_0 + -n9_1_1 + -n9_4_6 + -n9_4_5 + -n9_4_4 + -n9_4_3 + -n9_4_2 + -n9_4_1 + -n9_4_0 + -n9_3_6 + -n9_3_5 + -n9_3_4 + -n9_3_3 + -n9_3_2 + -n9_3_1 + -n9_3_0 + -n9_1_2 + -n9_2_6 + -n9_2_5 + -n9_2_4 + -n9_2_3 + -n9_2_2 + -n9_2_1 + -n9_2_0 + -n9_1_6 + -n9... (shortened)
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 460 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: write sara problem file to QuasiCertifProtocol-COL-06-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-06-ReachabilityCardinality.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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-n5_6 + -n5_5 + -n5_4 + -n5_3 + -n5_2 + -n5_1 + -n5_0 <= -3 OR (-n3_0 + -n3_1 + -n3_2 + -n3_3 + -n3_4 + -n3_5 + -n3_6 + a2 <= 0 OR -Astart <= -2)) AND -n7_5_6 + -n7_5_5 + -n7_5_4 + -n7_5_3 + -n7_5_2 + -n7_5_1 + -n7_4_6 + -n7_4_5 + -n7_4_4 + -n7_4_3 + -n7_4_2 + -n7_4_1 + -n7_3_6 + -n7_3_5 + -n7_3_4 + -n7_3_3 + -n7_3_2 + -n7_3_1 + -n7_2_6 + -n7_2_5 + -n7_2_4 + -n7_2_3 + -n7_2_2 + -n7_2_1 + -n7... (shortened)
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 460 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: SUBRESULT
lola: result: no
lola: write sara problem file to QuasiCertifProtocol-COL-06-ReachabilityCardinality-2.sara
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((n5_6 + n5_5 + n5_4 + n5_3 + n5_2 + n5_1 + -s5_6 + -s5_5 + -s5_4 + -s5_3 + -s5_2 + -s5_1 + -s5_0 + n5_0 > 0 OR SstopOK_6 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_2 + SstopOK_1 + SstopOK_0 + -n6_6 + -n6_5 + -n6_4 + -n6_3 + -n6_2 + -n6_1 + -n6_0 > 0) AND -SstopAbort <= -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 460 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 QuasiCertifProtocol-COL-06-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: yes
lola: lola: calling and running sara
The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-n9_6_6 + -n9_6_5 + -n9_6_4 + -n9_6_3 + -n9_6_2 + -n9_6_1 + -n9_6_0 + -n9_5_6 + -n9_5_5 + -n9_5_4 + -n9_5_3 + -n9_5_2 + -n9_5_1 + -n9_5_0 + -n9_1_0 + -n9_1_1 + -n9_4_6 + -n9_4_5 + -n9_4_4 + -n9_4_3 + -n9_4_2 + -n9_4_1 + -n9_4_0 + -n9_3_6 + -n9_3_5 + -n9_3_4 + -n9_3_3 + -n9_3_2 + -n9_3_1 + -n9_3_0 + -n9_1_2 + -n9_2_6 + -n9_2_5 + -n9_2_4 + -n9_2_3 + -n9_2_2 + -n9_2_1 + -n9_2_0 + -n9_1_6 + -n9_1_... (shortened)
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 460 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 QuasiCertifProtocol-COL-06-ReachabilityCardinality-4.sara
sara: try reading problem file QuasiCertifProtocol-COL-06-ReachabilityCardinality-3.sara.
lola: lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Astart <= -3 OR -Sstart_0 + -Sstart_1 + -Sstart_2 + -Sstart_3 + -Sstart_4 + -Sstart_5 + -Sstart_6 + s5_6 + s5_5 + s5_4 + s5_3 + s5_2 + s5_1 + s5_0 <= 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 460 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 QuasiCertifProtocol-COL-06-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-06-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic

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 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-a3 <= -3 OR -AstopAbort <= -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 460 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 QuasiCertifProtocol-COL-06-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-06-ReachabilityCardinality-6.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 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-SstopOK_6 + -SstopOK_5 + -SstopOK_4 + -SstopOK_3 + -SstopOK_2 + -SstopOK_1 + -SstopOK_0 <= -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 460 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 QuasiCertifProtocol-COL-06-ReachabilityCardinality-7.sara
lola: lola: SUBRESULT
calling and running saralola:
result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-SstopOK_6 + -SstopOK_5 + -SstopOK_4 + -SstopOK_3 + -SstopOK_2 + -SstopOK_1 + -SstopOK_0 <= -3 OR (-n6_6 + -n6_5 + -n6_4 + -n6_3 + -n6_2 + -n6_1 + -n6_0 > -3 OR AstopOK + -a5 > 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 460 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 3 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
sara: try reading problem file QuasiCertifProtocol-COL-06-ReachabilityCardinality-7.sara.
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (a4 + -a1 <= 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 460 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: SUBRESULT
lola: result: no
lola: write sara problem file to QuasiCertifProtocol-COL-06-ReachabilityCardinality-9.sara
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-n7_5_6 + -n7_5_5 + -n7_5_4 + -n7_5_3 + -n7_5_2 + -n7_5_1 + -n7_4_6 + -n7_4_5 + -n7_4_4 + -n7_4_3 + -n7_4_2 + -n7_4_1 + -n7_3_6 + -n7_3_5 + -n7_3_4 + -n7_3_3 + -n7_3_2 + -n7_3_1 + -n7_2_6 + -n7_2_5 + -n7_2_4 + -n7_2_3 + -n7_2_2 + -n7_2_1 + -n7_1_6 + -n7_1_5 + -n7_1_4 + -n7_1_3 + -n7_1_2 + -n7_1_1 + -n7_0_6 + -n7_0_5 + -n7_0_4 + -n7_0_3 + -n7_0_2 + -n7_0_1 + -n7_0_0 + -n7_1_0 + -n7_2_0 + -n7_3_... (shortened)
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 460 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: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: write sara problem file to QuasiCertifProtocol-COL-06-ReachabilityCardinality-10.sara
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-n6_6 + -n6_5 + -n6_4 + -n6_3 + -n6_2 + -n6_1 + -n6_0 <= -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 460 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: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-s5_6 + -s5_5 + -s5_4 + -s5_3 + -s5_2 + -s5_1 + -s5_0 <= -2 OR (-n4_6 + -n4_5 + -n4_4 + -n4_3 + -n4_2 + -n4_1 + AstopOK + -n4_0 > 0 AND -a2 > -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 460 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 3 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((a1 + -s5_6 + -s5_5 + -s5_4 + -s5_3 + -s5_2 + -s5_1 + -s5_0 <= 0 OR -AstopAbort <= -3) AND (-n8_0_1 + -n8_0_2 + -n8_0_3 + -n8_0_4 + -n8_0_5 + -n8_0_6 + -n8_1_1 + -n8_1_2 + -n8_1_3 + -n8_1_4 + -n8_1_5 + -n8_1_6 + -n8_2_1 + -n8_2_2 + -n8_2_3 + -n8_2_4 + -n8_2_5 + -n8_2_6 + -n8_3_1 + -n8_3_2 + -n8_3_3 + -n8_3_4 + -n8_3_5 + -n8_3_6 + -n8_4_1 + -n8_4_2 + -n8_4_3 + -n8_4_4 + -n8_4_5 + -n8_4_6 + -n... (shortened)
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 460 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: write sara problem file to QuasiCertifProtocol-COL-06-ReachabilityCardinality-13.sara
sara: place or transition ordering is non-deterministic
lola: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-06-ReachabilityCardinality-13.sara.

sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-a2 + s5_6 + s5_5 + s5_4 + s5_3 + s5_2 + s5_1 + s5_0 > 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 460 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 QuasiCertifProtocol-COL-06-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: calling and running sara
lola: ...considering subproblem: AG ((-n7_5_6 + -n7_5_5 + -n7_5_4 + -n7_5_3 + -n7_5_2 + -n7_5_1 + -n7_4_6 + -n7_4_5 + -n7_4_4 + -n7_4_3 + -n7_4_2 + -n7_4_1 + -n7_3_6 + -n7_3_5 + -n7_3_4 + -n7_3_3 + -n7_3_2 + -n7_3_1 + -n7_2_6 + -n7_2_5 + -n7_2_4 + -n7_2_3 + -n7_2_2 + -n7_2_1 + -n7_1_6 + -n7_1_5 + -n7_1_4 + -n7_1_3 + -n7_1_2 + -n7_1_1 + -n7_0_6 + -n7_0_5 + -n7_0_4 + -n7_0_3 + -n7_0_2 + -n7_0_1 + -n7_0_0 + -n7_1_0 + -n7_2_0 + -n7_3... (shortened)
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 460 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 QuasiCertifProtocol-COL-06-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-06-ReachabilityCardinality-14.sara.
sara: try reading problem file QuasiCertifProtocol-COL-06-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola: summary: no no no yes yes no no yes no no yes yes yes yes yes yes

BK_STOP 1463698709128

--------------------
content from 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="QuasiCertifProtocol-PT-06"
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/QuasiCertifProtocol-PT-06.tgz
mv QuasiCertifProtocol-PT-06 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 QuasiCertifProtocol-PT-06, 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 r098kn-smll-146369140300088"
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 ;