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 S_QuasiCertifProtocol-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182kn-smll-146444115200097
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464457666696

bkconf 3600
===========================================================================================
===========================================================================================
S_QuasiCertifProtocol-PT-10: translating Petri net model.pnml into LoLA format
S_QuasiCertifProtocol-PT-10: 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 3539
ReachabilityCardinality @ S_QuasiCertifProtocol-PT-10
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 726/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 550 places, 176 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 231 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-10-ReachabilityCardinality.task
lola: read: AG ((((s4_0 + s4_3 + s4_4 + s4_1 + s4_2 + s4_7 + s4_8 + s4_5 + s4_6 + s4_10 + s4_9 <= Cstart_1 + Cstart_0 + Cstart_9 + Cstart_8 + Cstart_7 + Cstart_6 + Cstart_5 + Cstart_4 + Cstart_3 + Cstart_2 + Cstart_10 OR s6_1 + s6_0 + s6_3 + s6_2 + s6_5 + s6_4 + s6_7 + s6_6 + s6_9 + s6_8 + s6_10 <= s6_1 + s6_0 + s6_3 + s6_2 + s6_5 + s6_4 + s6_7 + s6_6 + s6_9 + s6_8 + s6_10) OR !(s3_1 + s3_0 + s3_5 + s3_4 + s3... (shortened)
lola: formula length: 20345
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-n9_2_10 + -n9_9_9 + -n9_9_8 + -n9_9_7 + -n9_9_6 + -n9_9_5 + -n9_9_4 + -n9_9_3 + -n9_9_2 + -n9_9_1 + -n9_9_0 + -n9_8_9 + -n9_8_8 + -n9_8_7 + -n9_8_6 + -n9_8_5 + -n9_8_4 + -n9_8_3 + -n9_8_2 + -n9_8_1 + -n9_8_0 + -n9_8_10 + -n9_7_9 + -n9_7_8 + -n9_7_7 + -n9_7_6 + -n9_7_5 + -n9_7_4 + -n9_7_3 + -n9_7_2 + -n9_7_1 + -n9_7_0 + -n9_3_10 + -n9_6_9 + -n9_6_8 + -n9_6_7 + -n9_6_6 + -n9_6_5 + -n9_6_4 + -n... (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 700 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 QuasiCertifProtocol-COL-10-ReachabilityCardinality.sara
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: EF ((s3_9 + -s5_10 + -s5_9 + -s5_8 + -s5_7 + -s5_6 + -s5_5 + -s5_4 + -s5_3 + -s5_2 + -s5_1 + -s5_0 + s3_10 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s3_7 + s3_8 > 0 AND -SstopAbort > -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 700 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: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-2.sara
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((n5_9 + n5_8 + n5_7 + n5_6 + n5_5 + n5_4 + n5_3 + n5_2 + n5_1 + n5_0 + -CstopAbort + n5_10 <= 0 OR n5_9 + n5_8 + n5_7 + n5_6 + n5_5 + n5_4 + n5_3 + n5_2 + n5_1 + n5_0 + n5_10 + -AstopAbort <= 0) AND (-a5 <= -1 OR n4_9 + n4_8 + n4_7 + n4_6 + n4_5 + n4_4 + n4_3 + n4_2 + n4_1 + n4_0 + -n3_10 + -n3_0 + -n3_1 + -n3_2 + -n3_3 + -n3_4 + -n3_5 + -n3_6 + -n3_7 + -n3_8 + -n3_9 + n4_10 <= 0)) OR -n3_10... (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 700 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 QuasiCertifProtocol-COL-10-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: lola: The predicate is not invariant.calling and running sara

lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-a4 > -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 700 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-10-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-4.sara.
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-n7_5_9 + -n7_5_8 + -n7_5_7 + -n7_5_6 + -n7_5_5 + -n7_5_4 + -n7_5_3 + -n7_5_2 + -n7_5_1 + -n7_5_0 + -n7_9_10 + -n7_7_1 + -n7_7_2 + -n7_7_3 + -n7_7_4 + -n7_7_5 + -n7_7_6 + -n7_7_7 + -n7_7_8 + -n7_7_9 + -n7_4_9 + -n7_4_8 + -n7_4_7 + -n7_4_6 + -n7_4_5 + -n7_4_4 + -n7_4_3 + -n7_4_2 + -n7_4_1 + -n7_4_0 + -n7_8_1 + -n7_8_2 + -n7_8_3 + -n7_8_4 + -n7_8_5 + -n7_8_6 + -n7_8_7 + -n7_8_8 + -n7_8_9 + -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 700 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-10-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: lola: The predicate is reachable.
calling and running sara
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((CstopAbort + -s2_10 + -s2_0 + -s2_1 + -s2_2 + -s2_3 + -s2_4 + -s2_5 + -s2_6 + -s2_7 + -s2_8 + -s2_9 <= 0 AND -a3 <= -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 700 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-10-ReachabilityCardinality-6.sara
lola: SUBRESULT
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-5.sara.
lola: lola: result: yes
calling and running sara
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-n7_5_9 + -n7_5_8 + -n7_5_7 + -n7_5_6 + -n7_5_5 + -n7_5_4 + -n7_5_3 + -n7_5_2 + -n7_5_1 + -n7_5_0 + -n7_9_10 + -n7_7_1 + -n7_7_2 + -n7_7_3 + -n7_7_4 + -n7_7_5 + -n7_7_6 + -n7_7_7 + -n7_7_8 + -n7_7_9 + -n7_4_9 + -n7_4_8 + -n7_4_7 + -n7_4_6 + -n7_4_5 + -n7_4_4 + -n7_4_3 + -n7_4_2 + -n7_4_1 + -n7_4_0 + -n7_8_1 + -n7_8_2 + -n7_8_3 + -n7_8_4 + -n7_8_5 + -n7_8_6 + -n7_8_7 + -n7_8_8 + -n7_8_9 + -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 700 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
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-6.sara.
lola: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-7.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: sara:solution produced
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-n1_10 + -n1_0 + -n1_1 + -n1_2 + -n1_3 + -n1_4 + -n1_5 + -n1_6 + -n1_7 + -n1_8 + -n1_9 <= -1 AND (-s3_9 + -s3_10 + -s3_0 + -s3_1 + -s3_2 + -s3_3 + -s3_4 + -s3_5 + -s3_6 + -s3_7 + -s3_8 <= -3 AND ((-n2_9 + -n2_8 + -n2_7 + -n2_6 + -n2_5 + -n2_4 + -n2_3 + -n2_2 + -n2_1 + -n2_0 + -n2_10 <= -2 OR -Sstart_0 + -Sstart_1 + -Sstart_2 + -Sstart_3 + -Sstart_4 + -Sstart_5 + -Sstart_6 + -Sstart_7 + -Sstar... (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 700 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 26 literals
lola: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-8.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 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-s2_10 + -s2_0 + -s2_1 + -s2_2 + -s2_3 + -s2_4 + -s2_5 + -s2_6 + -s2_7 + -s2_8 + -s2_9 > -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 700 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: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-9.sara
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-n4_9 + -n4_8 + -n4_7 + -n4_6 + -n4_5 + -n4_4 + -n4_3 + -n4_2 + -n4_1 + -n4_0 + malicious_reservoir + -n4_10 > 0 OR (n5_9 + n5_8 + n5_7 + n5_6 + n5_5 + n5_4 + n5_3 + n5_2 + n5_1 + n5_0 + -n1_10 + -n1_0 + -n1_1 + -n1_2 + -n1_3 + -n1_4 + -n1_5 + -n1_6 + -n1_7 + -n1_8 + -n1_9 + n5_10 > 0 OR (-n7_5_9 + -n7_5_8 + -n7_5_7 + -n7_5_6 + -n7_5_5 + -n7_5_4 + -n7_5_3 + -n7_5_2 + -n7_5_1 + -n7_5_0 + -n7_9... (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 700 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-10-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-10.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 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((s2_10 + s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 + s2_7 + s2_8 + s2_9 + -Sstart_0 + -Sstart_1 + -Sstart_2 + -Sstart_3 + -Sstart_4 + -Sstart_5 + -Sstart_6 + -Sstart_7 + -Sstart_8 + -Sstart_9 + -Sstart_10 <= 0 OR n9_2_10 + n9_9_9 + n9_9_8 + n9_9_7 + n9_9_6 + n9_9_5 + n9_9_4 + n9_9_3 + n9_9_2 + n9_9_1 + n9_9_0 + n9_8_9 + n9_8_8 + n9_8_7 + n9_8_6 + n9_8_5 + n9_8_4 + n9_8_3 + n9_8_2 + n9_8_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 700 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((n7_5_9 + n7_5_8 + n7_5_7 + n7_5_6 + n7_5_5 + n7_5_4 + n7_5_3 + n7_5_2 + n7_5_1 + n7_5_0 + n7_9_10 + n7_7_1 + n7_7_2 + n7_7_3 + n7_7_4 + n7_7_5 + n7_7_6 + n7_7_7 + n7_7_8 + n7_7_9 + n7_4_9 + n7_4_8 + n7_4_7 + n7_4_6 + n7_4_5 + n7_4_4 + n7_4_3 + n7_4_2 + n7_4_1 + n7_4_0 + n7_8_1 + n7_8_2 + n7_8_3 + n7_8_4 + n7_8_5 + n7_8_6 + n7_8_7 + n7_8_8 + n7_8_9 + n7_3_9 + n7_3_8 + n7_3_7 + n7_3_6 + n7_3_5... (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 700 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: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-n2_9 + -n2_8 + -n2_7 + -n2_6 + -n2_5 + -n2_4 + -n2_3 + -n2_2 + -n2_1 + -n2_0 + -n2_10 + s5_10 + s5_9 + s5_8 + s5_7 + s5_6 + s5_5 + s5_4 + s5_3 + s5_2 + s5_1 + s5_0 <= 0 AND n9_2_10 + n9_9_9 + n9_9_8 + n9_9_7 + n9_9_6 + n9_9_5 + n9_9_4 + n9_9_3 + n9_9_2 + n9_9_1 + n9_9_0 + n9_8_9 + n9_8_8 + n9_8_7 + n9_8_6 + n9_8_5 + n9_8_4 + n9_8_3 + n9_8_2 + n9_8_1 + n9_8_0 + n9_8_10 + n9_7_9 + n9_7_8 + 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 700 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-10-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-13.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 14 will run for 1768 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((c1_9 + c1_10 + c1_0 + c1_1 + c1_2 + c1_3 + c1_4 + c1_5 + c1_6 + c1_7 + c1_8 + -a5 > 0 OR ((-n6_10 + n3_10 + n3_0 + n3_1 + n3_2 + n3_3 + n3_4 + n3_5 + n3_6 + n3_7 + n3_8 + n3_9 + -n6_9 + -n6_8 + -n6_7 + -n6_6 + -n6_5 + -n6_4 + -n6_3 + -n6_2 + -n6_1 + -n6_0 <= 0 AND -CstopOK_10 + -CstopOK_9 + -CstopOK_8 + -CstopOK_7 + -CstopOK_6 + -CstopOK_5 + -CstopOK_4 + -CstopOK_3 + -CstopOK_2 + -CstopOK_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 700 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-10-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3537 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((n9_2_10 + n9_9_9 + n9_9_8 + n9_9_7 + n9_9_6 + n9_9_5 + n9_9_4 + n9_9_3 + n9_9_2 + n9_9_1 + n9_9_0 + n9_8_9 + n9_8_8 + n9_8_7 + n9_8_6 + n9_8_5 + n9_8_4 + n9_8_3 + n9_8_2 + n9_8_1 + n9_8_0 + n9_8_10 + n9_7_9 + n9_7_8 + n9_7_7 + n9_7_6 + n9_7_5 + n9_7_4 + n9_7_3 + n9_7_2 + n9_7_1 + n9_7_0 + n9_3_10 + n9_6_9 + n9_6_8 + n9_6_7 + n9_6_6 + n9_6_5 + n9_6_4 + n9_6_3 + n9_6_2 + n9_6_1 + n9_6_0 + n9_5... (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 700 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-10-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-15.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: RESULT
lola: summary: yes no yes no yes yes yes no no no no no no yes yes yes

BK_STOP 1464457669775

--------------------
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="S_QuasiCertifProtocol-PT-10"
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/S_QuasiCertifProtocol-PT-10.tgz
mv S_QuasiCertifProtocol-PT-10 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 S_QuasiCertifProtocol-PT-10, 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 r182kn-smll-146444115200097"
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 ;