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

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

=== Now, execution of the tool begins

BK_START 1463698627809

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLFireability @ QuasiCertifProtocol-PT-06
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-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: 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-CTLFireability.task
lola: read: AF (EG ((FIREABLE(malA3) OR ((((((FIREABLE(malS3_4) OR FIREABLE(malS3_3)) OR FIREABLE(malS3_6)) OR FIREABLE(malS3_5)) OR FIREABLE(malS3_0)) OR FIREABLE(malS3_1)) OR FIREABLE(malS3_2))))) : EG (!((AG (FIREABLE(AreqTS)) AND ((FIREABLE(malA5) OR ((((((FIREABLE(malS2_1) OR FIREABLE(malS2_0)) OR FIREABLE(malS2_3)) OR FIREABLE(malS2_2)) OR FIREABLE(malS2_5)) OR FIREABLE(malS2_4)) OR FIREABLE(malS2_6))) ... (shortened)
lola: formula length: 5941
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EG ((FIREABLE(malA3) OR (FIREABLE(malS3_4) OR (FIREABLE(malS3_3) OR (FIREABLE(malS3_6) OR (FIREABLE(malS3_5) OR (FIREABLE(malS3_0) OR (FIREABLE(malS3_1) OR FIREABLE(malS3_2))))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(A(TRUE U !((FIREABLE(malA3) OR (FIREABLE(malS3_4) OR (FIREABLE(malS3_3) OR (FIREABLE(malS3_6) OR (FIREABLE(malS3_5) OR (FIREABLE(malS3_0) OR (FIREABLE(malS3_1) OR FIREABLE(malS3_2))))))))))))
lola: processed formula length: 202
lola: 794 rewrites
lola: formula mentions 0 of 270 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-06-CTLFireability.task
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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((EF (! FIREABLE(AreqTS)) OR ((! FIREABLE(malA5) AND (! 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 (FIREABLE(malS5_0) OR (FIREABLE(malS5_1) OR (FIREABLE(malS5_2) OR (FIREABLE(malS5_3) OR (FIREABLE(malS5_4) OR (FIREABLE(malS5_5) OR FIREABLE(malS5_6))))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((E(TRUE U ! FIREABLE(AreqTS)) OR ((! FIREABLE(malA5) AND (! 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 (FIREABLE(malS5_0) OR (FIREABLE(malS5_1) OR (FIREABLE(malS5_2) OR (FIREABLE(malS5_3) OR (FIREABLE(malS5_4) OR (FIREABLE(malS5_5) OR FIREABLE(malS5_6))... (shortened)
lola: processed formula length: 410
lola: 794 rewrites
lola: formula mentions 0 of 270 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-06-CTLFireability.task
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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((! 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))))))) U ((FIREABLE(malS1_0) OR (FIREABLE(malS1_2) OR (FIREABLE(malS1_1) OR (FIREABLE(malS1_4) OR (FIREABLE(malS1_3) OR (FIREABLE(malS1_5) OR FIREABLE(malS1_6))))))) AND FIREABLE(malA5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((! 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))))))) U ((FIREABLE(malS1_0) OR (FIREABLE(malS1_2) OR (FIREABLE(malS1_1) OR (FIREABLE(malS1_4) OR (FIREABLE(malS1_3) OR (FIREABLE(malS1_5) OR FIREABLE(malS1_6))))))) AND FIREABLE(malA5)))
lola: processed formula length: 358
lola: 793 rewrites
lola: formula mentions 0 of 270 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-06-CTLFireability.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(AF (((FIREABLE(malS6_3) OR (FIREABLE(malS6_2) OR (FIREABLE(malS6_1) OR (FIREABLE(malS6_0) OR (FIREABLE(malS6_6) OR (FIREABLE(malS6_5) OR FIREABLE(malS6_4))))))) AND FIREABLE(malA2))) U (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))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U ((FIREABLE(malS6_3) OR (FIREABLE(malS6_2) OR (FIREABLE(malS6_1) OR (FIREABLE(malS6_0) OR (FIREABLE(malS6_6) OR (FIREABLE(malS6_5) OR FIREABLE(malS6_4))))))) AND FIREABLE(malA2))) U (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))))))))
lola: processed formula length: 362
lola: 794 rewrites
lola: formula mentions 0 of 270 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-06-CTLFireability.task
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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (FIREABLE(AstartCS)) AND AF ((FIREABLE(malS4_0) OR (FIREABLE(malS4_1) OR (FIREABLE(malS4_2) OR (FIREABLE(malS4_3) OR (FIREABLE(malS4_4) OR (FIREABLE(malS4_5) OR FIREABLE(malS4_6)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (FIREABLE(AstartCS))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(AstartCS))
lola: processed formula length: 28
lola: 793 rewrites
lola: formula mentions 0 of 270 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-06-CTLFireability.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((EG ((! 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 AF (! FIREABLE(AstartCS))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((!(A(TRUE U !((! 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 A(TRUE U ! FIREABLE(AstartCS))))))
lola: processed formula length: 257
lola: 795 rewrites
lola: formula mentions 0 of 270 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-06-CTLFireability.task
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: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(malS6_3) OR (FIREABLE(malS6_2) OR (FIREABLE(malS6_1) OR (FIREABLE(malS6_0) OR (FIREABLE(malS6_6) OR (FIREABLE(malS6_5) OR (FIREABLE(malS6_4) OR (FIREABLE(malA3) OR (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))))))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E((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))))))) U FIREABLE(malA2)) OR A(EF ((FIREABLE(malS2_1) OR (FIREABLE(malS2_0) OR (FIREABLE(malS2_3) OR (FIREABLE(malS2_2) OR (FIREABLE(malS2_5) OR (FIREABLE(malS2_4) OR FIREABLE(malS2_6)))))))) U ((FIREABLE(malA1) AND (FIREABLE(malS1_0) OR (FIREABLE(... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((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))))))) U FIREABLE(malA2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((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))))))) U FIREABLE(malA2))
lola: processed formula length: 176
lola: 793 rewrites
lola: formula mentions 0 of 270 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-06-CTLFireability.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(EF ((FIREABLE(malS2_1) OR (FIREABLE(malS2_0) OR (FIREABLE(malS2_3) OR (FIREABLE(malS2_2) OR (FIREABLE(malS2_5) OR (FIREABLE(malS2_4) OR FIREABLE(malS2_6)))))))) U ((FIREABLE(malA1) AND (FIREABLE(malS1_0) OR (FIREABLE(malS1_2) OR (FIREABLE(malS1_1) OR (FIREABLE(malS1_4) OR (FIREABLE(malS1_3) OR (FIREABLE(malS1_5) OR FIREABLE(malS1_6)))))))) OR (FIREABLE(malS5_0) OR (FIREABLE(malS5_1) OR (FIREABLE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (FIREABLE(malS2_1) OR (FIREABLE(malS2_0) OR (FIREABLE(malS2_3) OR (FIREABLE(malS2_2) OR (FIREABLE(malS2_5) OR (FIREABLE(malS2_4) OR FIREABLE(malS2_6)))))))) U ((FIREABLE(malA1) AND (FIREABLE(malS1_0) OR (FIREABLE(malS1_2) OR (FIREABLE(malS1_1) OR (FIREABLE(malS1_4) OR (FIREABLE(malS1_3) OR (FIREABLE(malS1_5) OR FIREABLE(malS1_6)))))))) OR (FIREABLE(malS5_0) OR (FIREABLE(malS5_1) OR (FIR... (shortened)
lola: processed formula length: 509
lola: 794 rewrites
lola: formula mentions 0 of 270 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-06-CTLFireability.task
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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(AstartCS))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF ((! 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)))))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U (! 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)))))))))))
lola: processed formula length: 201
lola: 794 rewrites
lola: formula mentions 0 of 270 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-06-CTLFireability.task
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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 586 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (EF ((FIREABLE(malS3_4) OR (FIREABLE(malS3_3) OR (FIREABLE(malS3_6) OR (FIREABLE(malS3_5) OR (FIREABLE(malS3_0) OR (FIREABLE(malS3_1) OR (FIREABLE(malS3_2) OR FIREABLE(malA5)))))))))) AND (E(((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))))))) AND (FIREABLE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 586 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF ((FIREABLE(malS3_4) OR (FIREABLE(malS3_3) OR (FIREABLE(malS3_6) OR (FIREABLE(malS3_5) OR (FIREABLE(malS3_0) OR (FIREABLE(malS3_1) OR (FIREABLE(malS3_2) OR FIREABLE(malA5))))))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U (FIREABLE(malS3_4) OR (FIREABLE(malS3_3) OR (FIREABLE(malS3_6) OR (FIREABLE(malS3_5) OR (FIREABLE(malS3_0) OR (FIREABLE(malS3_1) OR (FIREABLE(malS3_2) OR FIREABLE(malA5))))))))))))
lola: processed formula length: 202
lola: 794 rewrites
lola: formula mentions 0 of 270 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-06-CTLFireability.task
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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A(! FIREABLE(malA5) R (! 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 EG (((! 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 ! FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(! FIREABLE(malA5) R (! 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))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!(! FIREABLE(malA5)) U !((! 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))))))))))
lola: processed formula length: 207
lola: 793 rewrites
lola: formula mentions 0 of 270 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-06-CTLFireability.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 878 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (((! 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(malA5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(((! 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(malA5)))))
lola: processed formula length: 221
lola: 793 rewrites
lola: formula mentions 0 of 270 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-06-CTLFireability.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 878 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AX (FIREABLE(AackCS)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(FIREABLE(AackCS)))
lola: processed formula length: 30
lola: 794 rewrites
lola: formula mentions 0 of 270 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-06-CTLFireability.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 1171 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(AG ((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)))))))) U AF ((FIREABLE(AreqCS) OR (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))))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(!(E(TRUE U !((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)))))))))) U A(TRUE U (FIREABLE(AreqCS) OR (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))))))))))
lola: processed formula length: 385
lola: 795 rewrites
lola: formula mentions 0 of 270 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-06-CTLFireability.task
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: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1757 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG ((AF ((FIREABLE(malS2_1) OR (FIREABLE(malS2_0) OR (FIREABLE(malS2_3) OR (FIREABLE(malS2_2) OR (FIREABLE(malS2_5) OR (FIREABLE(malS2_4) OR FIREABLE(malS2_6)))))))) AND (! FIREABLE(AendCS) OR (! FIREABLE(CgenCertif_0) AND (! FIREABLE(CgenCertif_5) AND (! FIREABLE(CgenCertif_6) AND (! FIREABLE(CgenCertif_3) AND (! FIREABLE(CgenCertif_4) AND (! FIREABLE(CgenCertif_1) AND ! FIREABLE(CgenCertif_2)))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1757 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((AF ((FIREABLE(malS2_1) OR (FIREABLE(malS2_0) OR (FIREABLE(malS2_3) OR (FIREABLE(malS2_2) OR (FIREABLE(malS2_5) OR (FIREABLE(malS2_4) OR FIREABLE(malS2_6)))))))) AND (! FIREABLE(AendCS) OR (! FIREABLE(CgenCertif_0) AND (! FIREABLE(CgenCertif_5) AND (! FIREABLE(CgenCertif_6) AND (! FIREABLE(CgenCertif_3) AND (! FIREABLE(CgenCertif_4) AND (! FIREABLE(CgenCertif_1) AND ! FIREABLE(CgenCertif_2))))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((A(TRUE U (FIREABLE(malS2_1) OR (FIREABLE(malS2_0) OR (FIREABLE(malS2_3) OR (FIREABLE(malS2_2) OR (FIREABLE(malS2_5) OR (FIREABLE(malS2_4) OR FIREABLE(malS2_6)))))))) AND (! FIREABLE(AendCS) OR (! FIREABLE(CgenCertif_0) AND (! FIREABLE(CgenCertif_5) AND (! FIREABLE(CgenCertif_6) AND (! FIREABLE(CgenCertif_3) AND (! FIREABLE(CgenCertif_4) AND (! FIREABLE(CgenCertif_1) AND ! FIREABLE(Cg... (shortened)
lola: processed formula length: 422
lola: 794 rewrites
lola: formula mentions 0 of 270 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-06-CTLFireability.task
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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3515 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((FIREABLE(CsendTS1_6) OR (FIREABLE(CsendTS1_5) OR (FIREABLE(CsendTS1_4) OR (FIREABLE(CsendTS1_3) OR (FIREABLE(CsendTS1_2) OR (FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_1))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(CsendTS1_6) OR (FIREABLE(CsendTS1_5) OR (FIREABLE(CsendTS1_4) OR (FIREABLE(CsendTS1_3) OR (FIREABLE(CsendTS1_2) OR (FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_1))))))))
lola: processed formula length: 186
lola: 793 rewrites
lola: formula mentions 0 of 270 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-06-CTLFireability.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: RESULT
lola: summary: no yes no no no yes yes no yes yes no yes yes no no no
lola: ========================================

BK_STOP 1463698652117

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