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

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

=== Now, execution of the tool begins

BK_START 1463698725536

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ QuasiCertifProtocol-PT-06
FORMULA QuasiCertifProtocol-COL-06-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-ReachabilityFireability-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-ReachabilityFireability.task
lola: read: EF (((!(!(FIREABLE(malA5))) OR ((((((((FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_1)) OR FIREABLE(SsendTS_0)) OR FIREABLE(SsendTS_6)) OR FIREABLE(SsendTS_5)) OR FIREABLE(SsendTS_4)) OR FIREABLE(SsendTS_3)) AND ((((((FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3)) OR FIREABLE(SgetTS_6)) OR FIREABLE(SgetTS_5)) OR FIREABLE(SgetTS_0)) OR FIREABLE(SgetTS_2)) OR FIREABLE(SgetTS_1))) OR FIREABLE(malA4))) OR (((((... (shortened)
lola: formula length: 6887
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(malA5) OR (((FIREABLE(SsendTS_2) OR (FIREABLE(SsendTS_1) OR (FIREABLE(SsendTS_0) OR (FIREABLE(SsendTS_6) OR (FIREABLE(SsendTS_5) OR (FIREABLE(SsendTS_4) OR FIREABLE(SsendTS_3))))))) AND (FIREABLE(SgetTS_4) OR (FIREABLE(SgetTS_3) OR (FIREABLE(SgetTS_6) OR (FIREABLE(SgetTS_5) OR (FIREABLE(SgetTS_0) OR (FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1)))))))) OR (FIREABLE(malA4) OR (FIREABLE(Spe... (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 506 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(SackCS_3) OR (FIREABLE(SackCS_2) OR (FIREABLE(SackCS_1) OR (FIREABLE(SackCS_0) OR (FIREABLE(SackCS_4) OR (FIREABLE(SackCS_5) OR FIREABLE(SackCS_6))))))))
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 14 literals
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: EF ((FIREABLE(SreqTS_6) OR (FIREABLE(SreqTS_2) OR (FIREABLE(SreqTS_3) OR (FIREABLE(SreqTS_4) OR (FIREABLE(SreqTS_5) OR (FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_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 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: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(ScertCS_5) AND (! FIREABLE(ScertCS_4) AND (! FIREABLE(ScertCS_6) AND (! FIREABLE(ScertCS_1) AND (! FIREABLE(ScertCS_0) AND (! FIREABLE(ScertCS_3) AND ! FIREABLE(ScertCS_2))))))) OR (! FIREABLE(malS4_0) AND (! FIREABLE(malS4_1) AND (! FIREABLE(malS4_2) AND (! FIREABLE(malS4_3) AND (! FIREABLE(malS4_4) AND (! FIREABLE(malS4_5) AND ! FIREABLE(malS4_6)))))))) AND (! FIREABLE(malA1) A... (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: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(malS4_0) AND (! FIREABLE(malS4_1) AND (! FIREABLE(malS4_2) AND (! FIREABLE(malS4_3) AND (! FIREABLE(malS4_4) AND (! FIREABLE(malS4_5) AND (! FIREABLE(malS4_6) AND (! FIREABLE(SackCS_3) AND (! FIREABLE(SackCS_2) AND (! FIREABLE(SackCS_1) AND (! FIREABLE(SackCS_0) AND (! FIREABLE(SackCS_4) AND (! FIREABLE(SackCS_5) AND ! FIREABLE(SackCS_6)))))))))))))))
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 28 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (! FIREABLE(AreqCS))
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 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(CsendTS1_6) AND (! FIREABLE(CsendTS1_5) AND (! FIREABLE(CsendTS1_4) AND (! FIREABLE(CsendTS1_3) AND (! FIREABLE(CsendTS1_2) AND (! FIREABLE(CsendTS1_0) AND ! FIREABLE(CsendTS1_1))))))) OR FIREABLE(AreqTS)))
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 63 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(AgetTS) AND (FIREABLE(AgetTS) AND FIREABLE(malA4))) OR 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 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 18 literals
lola: SUBRESULT
lola: 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 ((! FIREABLE(malS3_4) AND (! FIREABLE(malS3_3) AND (! FIREABLE(malS3_6) AND (! FIREABLE(malS3_5) AND (! FIREABLE(malS3_0) AND (! FIREABLE(malS3_1) AND (! FIREABLE(malS3_2) AND ((! FIREABLE(malS3_4) AND (! FIREABLE(malS3_3) AND (! FIREABLE(malS3_6) AND (! FIREABLE(malS3_5) AND (! FIREABLE(malS3_0) AND (! FIREABLE(malS3_1) AND ! FIREABLE(malS3_2))))))) OR (FIREABLE(CgenCertif_0) OR (FIREABLE(Cgen... (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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(malA5) AND ((! FIREABLE(SreqTS_6) AND (! FIREABLE(SreqTS_2) AND (! FIREABLE(SreqTS_3) AND (! FIREABLE(SreqTS_4) AND (! FIREABLE(SreqTS_5) AND (! FIREABLE(SreqTS_0) AND ! FIREABLE(SreqTS_1))))))) OR (! FIREABLE(AgetTS) OR (! FIREABLE(malS1_0) AND (! FIREABLE(malS1_2) AND (! FIREABLE(malS1_1) AND (! FIREABLE(malS1_4) AND (! FIREABLE(malS1_3) AND (! FIREABLE(malS1_5) AND ! FIREABLE(ma... (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 540 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(CgenCertif_0) OR (FIREABLE(CgenCertif_5) OR (FIREABLE(CgenCertif_6) OR (FIREABLE(CgenCertif_3) OR (FIREABLE(CgenCertif_4) OR (FIREABLE(CgenCertif_1) OR (FIREABLE(CgenCertif_2) OR (! FIREABLE(AreqTS) OR ((! FIREABLE(malS2_1) AND (! FIREABLE(malS2_0) AND (! FIREABLE(malS2_3) AND (! FIREABLE(malS2_2) AND (! FIREABLE(malS2_5) AND (! FIREABLE(malS2_4) AND ! FIREABLE(malS2_6))))))) OR ((FI... (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: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((((FIREABLE(malA4) AND (FIREABLE(malC1_2) OR (FIREABLE(malC1_1) OR (FIREABLE(malC1_0) OR (FIREABLE(malC1_6) OR (FIREABLE(malC1_5) OR (FIREABLE(malC1_4) OR FIREABLE(malC1_3)))))))) OR (! FIREABLE(malS5_0) AND (! FIREABLE(malS5_1) AND (! FIREABLE(malS5_2) AND (! FIREABLE(malS5_3) AND (! FIREABLE(malS5_4) AND (! FIREABLE(malS5_5) AND ! FIREABLE(malS5_6)))))))) AND (FIREABLE(AreqCS) AND ((FIREABL... (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 5109 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(malA3) OR (FIREABLE(ScertCS_5) OR (FIREABLE(ScertCS_4) OR (FIREABLE(ScertCS_6) OR (FIREABLE(ScertCS_1) OR (FIREABLE(ScertCS_0) OR (FIREABLE(ScertCS_3) OR (FIREABLE(ScertCS_2) OR ((! FIREABLE(SgetTS_4) AND (! FIREABLE(SgetTS_3) AND (! FIREABLE(SgetTS_6) AND (! FIREABLE(SgetTS_5) AND (! FIREABLE(SgetTS_0) AND (! FIREABLE(SgetTS_2) AND ! FIREABLE(SgetTS_1))))))) OR ((FIREABLE(malA3) O... (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 33557693 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (! FIREABLE(AendCS))
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 8 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: write sara problem file to QuasiCertifProtocol-COL-06-ReachabilityFireability-13.sara
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(SackCS_3) AND (! FIREABLE(SackCS_2) AND (! FIREABLE(SackCS_1) AND (! FIREABLE(SackCS_0) AND (! FIREABLE(SackCS_4) AND (! FIREABLE(SackCS_5) AND ! FIREABLE(SackCS_6))))))))
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 14 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(malS1_0) AND (! FIREABLE(malS1_2) AND (! FIREABLE(malS1_1) AND (! FIREABLE(malS1_4) AND (! FIREABLE(malS1_3) AND (! FIREABLE(malS1_5) AND ! FIREABLE(malS1_6))))))) OR (! FIREABLE(AreqTS) OR ((! FIREABLE(AstartCS) AND (! FIREABLE(malS4_0) AND (! FIREABLE(malS4_1) AND (! FIREABLE(malS4_2) AND (! FIREABLE(malS4_3) AND (! FIREABLE(malS4_4) AND (! FIREABLE(malS4_5) AND ! FIREABLE(malS4... (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: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola: summary: yes yes yes yes no no no yes no no yes no yes no no yes

BK_STOP 1463698725935

--------------------
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="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-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 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-146369140300090"
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 ;