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-18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098kn-smll-146369140300108
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463705161796

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ QuasiCertifProtocol-PT-18
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-0 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-4 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-8 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-18-ReachabilityFireability-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: 1694/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1398 places, 296 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 391 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-18-ReachabilityFireability.task
lola: read: EF ((!((!(FIREABLE(malA1)) AND !(((((((((((((((((((FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_4)) OR FIREABLE(ScertCS_7)) OR FIREABLE(ScertCS_6)) OR FIREABLE(ScertCS_1)) OR FIREABLE(ScertCS_0)) OR FIREABLE(ScertCS_3)) OR FIREABLE(ScertCS_2)) OR FIREABLE(ScertCS_12)) OR FIREABLE(ScertCS_13)) OR FIREABLE(ScertCS_14)) OR FIREABLE(ScertCS_15)) OR FIREABLE(ScertCS_8)) OR FIREABLE(ScertCS_9)) OR FIREABLE(S... (shortened)
lola: formula length: 20355
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(malA1) OR (FIREABLE(ScertCS_5) OR (FIREABLE(ScertCS_4) OR (FIREABLE(ScertCS_7) OR (FIREABLE(ScertCS_6) OR (FIREABLE(ScertCS_1) OR (FIREABLE(ScertCS_0) OR (FIREABLE(ScertCS_3) OR (FIREABLE(ScertCS_2) OR (FIREABLE(ScertCS_12) OR (FIREABLE(ScertCS_13) OR (FIREABLE(ScertCS_14) OR (FIREABLE(ScertCS_15) OR (FIREABLE(ScertCS_8) OR (FIREABLE(ScertCS_9) OR (FIREABLE(ScertCS_10) OR (FIREABLE(... (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 1180 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 44820 literals
lola: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityFireability.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 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(AreqCS) AND ((FIREABLE(ScertCS_5) OR (FIREABLE(ScertCS_4) OR (FIREABLE(ScertCS_7) OR (FIREABLE(ScertCS_6) OR (FIREABLE(ScertCS_1) OR (FIREABLE(ScertCS_0) OR (FIREABLE(ScertCS_3) OR (FIREABLE(ScertCS_2) OR (FIREABLE(ScertCS_12) OR (FIREABLE(ScertCS_13) OR (FIREABLE(ScertCS_14) OR (FIREABLE(ScertCS_15) OR (FIREABLE(ScertCS_8) OR (FIREABLE(ScertCS_9) OR (FIREABLE(ScertCS_10) OR (FIREAB... (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 1180 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 44062 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(malC1_4) AND (! FIREABLE(malC1_3) AND (! FIREABLE(malC1_6) AND (! FIREABLE(malC1_5) AND (! FIREABLE(malC1_0) AND (! FIREABLE(malC1_2) AND (! FIREABLE(malC1_1) AND (! FIREABLE(malC1_10) AND (! FIREABLE(malC1_9) AND (! FIREABLE(malC1_8) AND (! FIREABLE(malC1_7) AND (! FIREABLE(malC1_14) AND (! FIREABLE(malC1_13) AND (! FIREABLE(malC1_12) AND (! FIREABLE(malC1_11) AND (! FIREABLE(mal... (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 1180 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(malS6_6) AND (! FIREABLE(malS6_7) AND (! FIREABLE(malS6_4) AND (! FIREABLE(malS6_5) AND (! FIREABLE(malS6_10) AND (! FIREABLE(malS6_11) AND (! FIREABLE(malS6_8) AND (! FIREABLE(malS6_9) AND (! FIREABLE(malS6_14) AND (! FIREABLE(malS6_15) AND (! FIREABLE(malS6_12) AND (! FIREABLE(malS6_13) AND (! FIREABLE(malS6_18) AND (! FIREABLE(malS6_16) AND (! FIREABLE(malS6_17) AND (! FIREABLE... (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 1180 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(malS3_17) OR (FIREABLE(malS3_18) OR (FIREABLE(malS3_15) OR (FIREABLE(malS3_16) OR (FIREABLE(malS3_13) OR (FIREABLE(malS3_14) OR (FIREABLE(malS3_11) OR (FIREABLE(malS3_12) OR (FIREABLE(malS3_2) OR (FIREABLE(malS3_1) OR (FIREABLE(malS3_0) OR (FIREABLE(malS3_10) OR (FIREABLE(malS3_9) OR (FIREABLE(malS3_8) OR (FIREABLE(malS3_7) OR (FIREABLE(malS3_6) OR (FIREABLE(malS3_5) OR (FIREABLE(ma... (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 1180 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 757081258 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(AendCS))
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 1180 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 20 literals
lola: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityFireability-5.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((((! FIREABLE(SsendTS_5) AND (! FIREABLE(SsendTS_6) AND (! FIREABLE(SsendTS_3) AND (! FIREABLE(SsendTS_4) AND (! FIREABLE(SsendTS_1) AND (! FIREABLE(SsendTS_2) AND (! FIREABLE(SsendTS_0) AND (! FIREABLE(SsendTS_18) AND (! FIREABLE(SsendTS_17) AND (! FIREABLE(SsendTS_16) AND (! FIREABLE(SsendTS_15) AND (! FIREABLE(SsendTS_14) AND (! FIREABLE(SsendTS_13) AND (! FIREABLE(SsendTS_12) AND (! FIREA... (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 1180 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 7 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(AreqCS) OR ((! FIREABLE(malC1_4) AND (! FIREABLE(malC1_3) AND (! FIREABLE(malC1_6) AND (! FIREABLE(malC1_5) AND (! FIREABLE(malC1_0) AND (! FIREABLE(malC1_2) AND (! FIREABLE(malC1_1) AND (! FIREABLE(malC1_10) AND (! FIREABLE(malC1_9) AND (! FIREABLE(malC1_8) AND (! FIREABLE(malC1_7) AND (! FIREABLE(malC1_14) AND (! FIREABLE(malC1_13) AND (! FIREABLE(malC1_12) AND (! FIREABLE(malC1_11... (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 1180 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((((! FIREABLE(ScertCS_5) AND (! FIREABLE(ScertCS_4) AND (! FIREABLE(ScertCS_7) AND (! FIREABLE(ScertCS_6) AND (! FIREABLE(ScertCS_1) AND (! FIREABLE(ScertCS_0) AND (! FIREABLE(ScertCS_3) AND (! FIREABLE(ScertCS_2) AND (! FIREABLE(ScertCS_12) AND (! FIREABLE(ScertCS_13) AND (! FIREABLE(ScertCS_14) AND (! FIREABLE(ScertCS_15) AND (! FIREABLE(ScertCS_8) AND (! FIREABLE(ScertCS_9) AND (! FIREABLE... (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 1180 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 41781441882127 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(malA3))
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 1180 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-18-ReachabilityFireability-9.sara
lola: SUBRESULT
lola: result: yeslola:
calling and running sara
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(malA3))
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 1180 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
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityFireability-9.sara.
lola: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 532 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(Sperform_17) AND (! FIREABLE(Sperform_18) AND (! FIREABLE(Sperform_0) AND (! FIREABLE(Sperform_10) AND (! FIREABLE(Sperform_9) AND (! FIREABLE(Sperform_12) AND (! FIREABLE(Sperform_11) AND (! FIREABLE(Sperform_14) AND (! FIREABLE(Sperform_13) AND (! FIREABLE(Sperform_16) AND (! FIREABLE(Sperform_15) AND (! FIREABLE(Sperform_2) AND (! FIREABLE(Sperform_1) AND (! FIREABLE(Sperform_4... (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 1180 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 665 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (! FIREABLE(AgetTS))
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 1180 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 20 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(malA3) AND (((! FIREABLE(malS3_17) AND (! FIREABLE(malS3_18) AND (! FIREABLE(malS3_15) AND (! FIREABLE(malS3_16) AND (! FIREABLE(malS3_13) AND (! FIREABLE(malS3_14) AND (! FIREABLE(malS3_11) AND (! FIREABLE(malS3_12) AND (! FIREABLE(malS3_2) AND (! FIREABLE(malS3_1) AND (! FIREABLE(malS3_0) AND (! FIREABLE(malS3_10) AND (! FIREABLE(malS3_9) AND (! FIREABLE(malS3_8) AND (! FIREABLE(... (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 1180 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(AstartCS))
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 1180 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-18-ReachabilityFireability-14.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2662 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(SgetTS_6) AND (! FIREABLE(SgetTS_5) AND (! FIREABLE(SgetTS_4) AND (! FIREABLE(SgetTS_3) AND (! FIREABLE(SgetTS_10) AND (! FIREABLE(SgetTS_9) AND (! FIREABLE(SgetTS_8) AND (! FIREABLE(SgetTS_7) AND (! FIREABLE(SgetTS_2) AND (! FIREABLE(SgetTS_1) AND (! FIREABLE(SgetTS_0) AND (! FIREABLE(SgetTS_16) AND (! FIREABLE(SgetTS_15) AND (! FIREABLE(SgetTS_18) AND (! FIREABLE(SgetTS_17) AND (... (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 1180 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola: summary: unknown yes no no unknown yes yes no unknown yes yes no no no yes no

BK_STOP 1463706039688

--------------------
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-18"
export BK_EXAMINATION="ReachabilityFireability"
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-18.tgz
mv QuasiCertifProtocol-PT-18 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-18, examination is ReachabilityFireability"
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-146369140300108"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;