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

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

=== Now, execution of the tool begins

BK_START 1463709674674

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ QuasiCertifProtocol-PT-22
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-8 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-14 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-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: 2322/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1966 places, 356 transitions, 355 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 471 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-22-ReachabilityFireability.task
lola: read: AG ((FIREABLE(malA2) OR !(((((((((((((((((((((((FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_7)) OR FIREABLE(ScertCS_4)) OR FIREABLE(ScertCS_5)) OR FIREABLE(ScertCS_2)) OR FIREABLE(ScertCS_3)) OR FIREABLE(ScertCS_0)) OR FIREABLE(ScertCS_1)) OR FIREABLE(ScertCS_10)) OR FIREABLE(ScertCS_11)) OR FIREABLE(ScertCS_8)) OR FIREABLE(ScertCS_9)) OR FIREABLE(ScertCS_14)) OR FIREABLE(ScertCS_15)) OR FIREABLE(Scer... (shortened)
lola: formula length: 16182
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 ((FIREABLE(malA2) OR (! FIREABLE(ScertCS_6) AND (! FIREABLE(ScertCS_7) AND (! FIREABLE(ScertCS_4) AND (! FIREABLE(ScertCS_5) AND (! FIREABLE(ScertCS_2) AND (! FIREABLE(ScertCS_3) AND (! FIREABLE(ScertCS_0) AND (! FIREABLE(ScertCS_1) AND (! FIREABLE(ScertCS_10) AND (! FIREABLE(ScertCS_11) AND (! FIREABLE(ScertCS_8) AND (! FIREABLE(ScertCS_9) AND (! FIREABLE(ScertCS_14) AND (! FIREABLE(ScertCS_15... (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 1420 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 46 literals
lola: write sara problem file to QuasiCertifProtocol-COL-22-ReachabilityFireability.sara
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: EF ((FIREABLE(SgetTS_21) OR (FIREABLE(SgetTS_22) OR (FIREABLE(SgetTS_19) OR (FIREABLE(SgetTS_20) OR (FIREABLE(SgetTS_17) OR (FIREABLE(SgetTS_18) OR (FIREABLE(SgetTS_15) OR (FIREABLE(SgetTS_16) OR (FIREABLE(SgetTS_14) OR (FIREABLE(SgetTS_13) OR (FIREABLE(SgetTS_12) OR (FIREABLE(SgetTS_11) OR (FIREABLE(SgetTS_10) OR (FIREABLE(SgetTS_9) OR (FIREABLE(SgetTS_8) OR (FIREABLE(SgetTS_7) OR (FIREABLE(SgetT... (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 1420 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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(malS1_0) OR (FIREABLE(malS1_4) OR (FIREABLE(malS1_3) OR (FIREABLE(malS1_2) OR (FIREABLE(malS1_1) OR (FIREABLE(malS1_22) OR (FIREABLE(malS1_21) OR (FIREABLE(malS1_9) OR (FIREABLE(malS1_10) OR (FIREABLE(malS1_11) OR (FIREABLE(malS1_12) OR (FIREABLE(malS1_5) OR (FIREABLE(malS1_6) OR (FIREABLE(malS1_7) OR (FIREABLE(malS1_8) OR (FIREABLE(malS1_17) OR (FIREABLE(malS1_18) OR (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 1420 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 15242102852 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(malA3) OR ((! FIREABLE(Sperform_7) AND (! FIREABLE(Sperform_8) AND (! FIREABLE(Sperform_5) AND (! FIREABLE(Sperform_6) AND (! FIREABLE(Sperform_11) AND (! FIREABLE(Sperform_12) AND (! FIREABLE(Sperform_9) AND (! FIREABLE(Sperform_10) AND (! FIREABLE(Sperform_0) AND (! FIREABLE(Sperform_3) AND (! FIREABLE(Sperform_4) AND (! FIREABLE(Sperform_1) AND (! FIREABLE(Sperform_2) AND (! FIR... (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 1420 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 92 literals
lola: write sara problem file to QuasiCertifProtocol-COL-22-ReachabilityFireability-3.sara
lola: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-22-ReachabilityFireability-3.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 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(AreqCS))
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 1420 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-22-ReachabilityFireability-4.sara
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: EF ((((FIREABLE(CsendTS1_19) OR (FIREABLE(CsendTS1_18) OR (FIREABLE(CsendTS1_21) OR (FIREABLE(CsendTS1_20) OR (FIREABLE(CsendTS1_22) OR (FIREABLE(CsendTS1_9) OR (FIREABLE(CsendTS1_8) OR (FIREABLE(CsendTS1_7) OR (FIREABLE(CsendTS1_6) OR (FIREABLE(CsendTS1_5) OR (FIREABLE(CsendTS1_4) OR (FIREABLE(CsendTS1_3) OR (FIREABLE(CsendTS1_2) OR (FIREABLE(CsendTS1_17) OR (FIREABLE(CsendTS1_16) OR (FIREABLE(Cs... (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 1420 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 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(AreqTS) AND (FIREABLE(malA3) OR (FIREABLE(malA3) AND ((FIREABLE(malS6_10) OR (FIREABLE(malS6_11) OR (FIREABLE(malS6_8) OR (FIREABLE(malS6_9) OR (FIREABLE(malS6_14) OR (FIREABLE(malS6_15) OR (FIREABLE(malS6_12) OR (FIREABLE(malS6_13) OR (FIREABLE(malS6_18) OR (FIREABLE(malS6_19) OR (FIREABLE(malS6_16) OR (FIREABLE(malS6_17) OR (FIREABLE(malS6_22) OR (FIREABLE(malS6_20) 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 1420 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 2208 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(AstartCS) OR (! FIREABLE(malA2) OR ((! FIREABLE(CgenCertif_0) AND (! FIREABLE(CgenCertif_6) AND (! FIREABLE(CgenCertif_5) AND (! FIREABLE(CgenCertif_8) AND (! FIREABLE(CgenCertif_7) AND (! FIREABLE(CgenCertif_2) AND (! FIREABLE(CgenCertif_1) AND (! FIREABLE(CgenCertif_4) AND (! FIREABLE(CgenCertif_3) AND (! FIREABLE(CgenCertif_15) AND (! FIREABLE(CgenCertif_16) AND (! FIREABLE(Cge... (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 1420 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 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(malA2) AND ((FIREABLE(malS6_10) OR (FIREABLE(malS6_11) OR (FIREABLE(malS6_8) OR (FIREABLE(malS6_9) OR (FIREABLE(malS6_14) OR (FIREABLE(malS6_15) OR (FIREABLE(malS6_12) OR (FIREABLE(malS6_13) OR (FIREABLE(malS6_18) OR (FIREABLE(malS6_19) OR (FIREABLE(malS6_16) OR (FIREABLE(malS6_17) OR (FIREABLE(malS6_22) OR (FIREABLE(malS6_20) OR (FIREABLE(malS6_21) OR (FIREABLE(malS6_3) 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 1420 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 36272364267 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 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(malS2_15) OR (FIREABLE(malS2_14) OR (FIREABLE(malS2_13) OR (FIREABLE(malS2_12) OR (FIREABLE(malS2_19) OR (FIREABLE(malS2_18) OR (FIREABLE(malS2_17) OR (FIREABLE(malS2_16) OR (FIREABLE(malS2_22) OR (FIREABLE(malS2_21) OR (FIREABLE(malS2_20) OR (FIREABLE(malS2_2) OR (FIREABLE(malS2_3) OR (FIREABLE(malS2_0) OR (FIREABLE(malS2_1) OR (FIREABLE(malS2_6) OR (FIREABLE(malS2_7) 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 1420 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: Transformation into DNF: expect 23152547040 literals
lola: DNF formula is too big, sara cannot be used
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 514 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(Sperform_7) OR (FIREABLE(Sperform_8) OR (FIREABLE(Sperform_5) OR (FIREABLE(Sperform_6) OR (FIREABLE(Sperform_11) OR (FIREABLE(Sperform_12) OR (FIREABLE(Sperform_9) OR (FIREABLE(Sperform_10) OR (FIREABLE(Sperform_0) OR (FIREABLE(Sperform_3) OR (FIREABLE(Sperform_4) OR (FIREABLE(Sperform_1) OR (FIREABLE(Sperform_2) OR (FIREABLE(Sperform_22) OR (FIREABLE(Sperform_21) OR (FIREABLE(Sperfo... (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 1420 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 46 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 617 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(malA3) OR (! FIREABLE(malS2_15) AND (! FIREABLE(malS2_14) AND (! FIREABLE(malS2_13) AND (! FIREABLE(malS2_12) AND (! FIREABLE(malS2_19) AND (! FIREABLE(malS2_18) AND (! FIREABLE(malS2_17) AND (! FIREABLE(malS2_16) AND (! FIREABLE(malS2_22) AND (! FIREABLE(malS2_21) AND (! FIREABLE(malS2_20) AND (! FIREABLE(malS2_2) AND (! FIREABLE(malS2_3) AND (! FIREABLE(malS2_0) 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 1420 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 772 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(malS4_10) AND (! FIREABLE(malS4_11) AND (! FIREABLE(malS4_12) AND (! FIREABLE(malS4_13) AND (! FIREABLE(malS4_14) AND (! FIREABLE(malS4_15) AND (! FIREABLE(malS4_16) AND (! FIREABLE(malS4_17) AND (! FIREABLE(malS4_18) AND (! FIREABLE(malS4_19) AND (! FIREABLE(malS4_20) AND (! FIREABLE(malS4_21) AND (! FIREABLE(malS4_22) AND (! FIREABLE(malS4_0) AND (! FIREABLE(malS4_1) AND (! FIREA... (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 1420 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 46 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1029 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(malA4))
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 1420 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-22-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1544 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(malA2) AND (! FIREABLE(AgetTS) AND (! FIREABLE(malS2_15) AND (! FIREABLE(malS2_14) AND (! FIREABLE(malS2_13) AND (! FIREABLE(malS2_12) AND (! FIREABLE(malS2_19) AND (! FIREABLE(malS2_18) AND (! FIREABLE(malS2_17) AND (! FIREABLE(malS2_16) AND (! FIREABLE(malS2_22) AND (! FIREABLE(malS2_21) AND (! FIREABLE(malS2_20) AND (! FIREABLE(malS2_2) AND (! FIREABLE(malS2_3) AND (! FIREABLE(m... (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 1420 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 23349259007107847422962629134186518151168 literals
lola: DNF formula is too big, sara cannot be used
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1776 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (! FIREABLE(malA2))
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 1420 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: RESULT
lola: summary: no yes no yes yes yes yes no unknown yes yes no no yes unknown no
lola: ========================================

BK_STOP 1463711438652

--------------------
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-22"
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-22.tgz
mv QuasiCertifProtocol-PT-22 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-22, 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-146369140300117"
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 ;