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

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

=== Now, execution of the tool begins

BK_START 1463698566023

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLFireability @ QuasiCertifProtocol-PT-02
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-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: 142/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 86 places, 56 transitions, 55 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 71 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-02-CTLFireability.task
lola: read: AX (EG (!((FIREABLE(AendCS) AND ((FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_1)) OR FIREABLE(SsendTS_0)))))) : ((EF (((FIREABLE(malC1_0) OR FIREABLE(malC1_2)) OR FIREABLE(malC1_1))) AND !(((!(FIREABLE(AstartCS)) AND (((FIREABLE(malS6_1) OR FIREABLE(malS6_0)) OR FIREABLE(malS6_2)) OR FIREABLE(malA5))) OR AF (((FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_2)) OR FIREABLE(SgetTS_1)))))) AND E((((FIREABLE(malS6... (shortened)
lola: formula length: 3426
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (EG ((! FIREABLE(AendCS) OR (! FIREABLE(SsendTS_2) AND (! FIREABLE(SsendTS_1) AND ! FIREABLE(SsendTS_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(!(A(TRUE U !((! FIREABLE(AendCS) OR (! FIREABLE(SsendTS_2) AND (! FIREABLE(SsendTS_1) AND ! FIREABLE(SsendTS_0))))))))
lola: processed formula length: 121
lola: 177 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((FIREABLE(malC1_0) OR (FIREABLE(malC1_2) OR FIREABLE(malC1_1)))) AND ((FIREABLE(AstartCS) OR (! FIREABLE(malS6_1) AND (! FIREABLE(malS6_0) AND (! FIREABLE(malS6_2) AND ! FIREABLE(malA5))))) AND (EG ((! FIREABLE(SgetTS_0) AND (! FIREABLE(SgetTS_2) AND ! FIREABLE(SgetTS_1)))) AND E((FIREABLE(malS6_1) OR (FIREABLE(malS6_0) OR (FIREABLE(malS6_2) OR ((FIREABLE(malC1_0) OR (FIREABLE(malC1_2) OR FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(malC1_0) OR (FIREABLE(malC1_2) OR FIREABLE(malC1_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 220 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: (FIREABLE(AstartCS) OR (! FIREABLE(malS6_1) AND (! FIREABLE(malS6_0) AND (! FIREABLE(malS6_2) AND ! FIREABLE(malA5)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((! FIREABLE(SgetTS_0) AND (! FIREABLE(SgetTS_2) AND ! FIREABLE(SgetTS_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((! FIREABLE(SgetTS_0) AND (! FIREABLE(SgetTS_2) AND ! FIREABLE(SgetTS_1))))))
lola: processed formula length: 90
lola: 176 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((FIREABLE(malS6_1) OR (FIREABLE(malS6_0) OR (FIREABLE(malS6_2) OR ((FIREABLE(malC1_0) OR (FIREABLE(malC1_2) OR FIREABLE(malC1_1))) AND FIREABLE(malA2))))) U AF (FIREABLE(malA4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((FIREABLE(malS6_1) OR (FIREABLE(malS6_0) OR (FIREABLE(malS6_2) OR ((FIREABLE(malC1_0) OR (FIREABLE(malC1_2) OR FIREABLE(malC1_1))) AND FIREABLE(malA2))))) U A(TRUE U FIREABLE(malA4)))
lola: processed formula length: 185
lola: 177 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((AG ((FIREABLE(CsendTS1_1) OR (FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_2)))) AND (FIREABLE(malS5_0) OR (FIREABLE(malS5_1) OR FIREABLE(malS5_2))))) OR (FIREABLE(SsendTS_2) OR (FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((AG ((FIREABLE(CsendTS1_1) OR (FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_2)))) AND (FIREABLE(malS5_0) OR (FIREABLE(malS5_1) OR FIREABLE(malS5_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (!(E(TRUE U !((FIREABLE(CsendTS1_1) OR (FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_2)))))) AND (FIREABLE(malS5_0) OR (FIREABLE(malS5_1) OR FIREABLE(malS5_2)))))
lola: processed formula length: 168
lola: 177 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(SsendTS_2) OR (FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (((! FIREABLE(SgetTS_0) AND (! FIREABLE(SgetTS_2) AND (! FIREABLE(SgetTS_1) AND ! FIREABLE(malA2)))) OR (! FIREABLE(AreqCS) OR ((! FIREABLE(SackCS_2) AND (! FIREABLE(SackCS_1) AND ! FIREABLE(SackCS_0))) OR (! FIREABLE(AendCS) OR ((! FIREABLE(SreqTS_1) AND (! FIREABLE(SreqTS_0) AND ! FIREABLE(SreqTS_2))) OR ! FIREABLE(AgetTS)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(((! FIREABLE(SgetTS_0) AND (! FIREABLE(SgetTS_2) AND (! FIREABLE(SgetTS_1) AND ! FIREABLE(malA2)))) OR (! FIREABLE(AreqCS) OR ((! FIREABLE(SackCS_2) AND (! FIREABLE(SackCS_1) AND ! FIREABLE(SackCS_0))) OR (! FIREABLE(AendCS) OR ((! FIREABLE(SreqTS_1) AND (! FIREABLE(SreqTS_0) AND ! FIREABLE(SreqTS_2))) OR ! FIREABLE(AgetTS)))))))))
lola: processed formula length: 346
lola: 176 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AG ((FIREABLE(malS1_1) OR (FIREABLE(malS1_2) OR (FIREABLE(malS1_0) OR (FIREABLE(SgetTS_0) OR (FIREABLE(SgetTS_2) OR (FIREABLE(SgetTS_1) OR FIREABLE(AackCS)))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(E(TRUE U !((FIREABLE(malS1_1) OR (FIREABLE(malS1_2) OR (FIREABLE(malS1_0) OR (FIREABLE(SgetTS_0) OR (FIREABLE(SgetTS_2) OR (FIREABLE(SgetTS_1) OR FIREABLE(AackCS)))))))))))
lola: processed formula length: 183
lola: 177 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A(((! FIREABLE(malS5_0) AND (! FIREABLE(malS5_1) AND ! FIREABLE(malS5_2))) OR (! FIREABLE(Sperform_2) AND (! FIREABLE(Sperform_1) AND ! FIREABLE(Sperform_0)))) U (FIREABLE(SackCS_2) OR (FIREABLE(SackCS_1) OR FIREABLE(SackCS_0)))) OR AF ((EG ((FIREABLE(malS4_2) OR (FIREABLE(malS4_0) OR FIREABLE(malS4_1)))) AND AX ((FIREABLE(malS1_1) OR (FIREABLE(malS1_2) OR FIREABLE(malS1_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(((! FIREABLE(malS5_0) AND (! FIREABLE(malS5_1) AND ! FIREABLE(malS5_2))) OR (! FIREABLE(Sperform_2) AND (! FIREABLE(Sperform_1) AND ! FIREABLE(Sperform_0)))) U (FIREABLE(SackCS_2) OR (FIREABLE(SackCS_1) OR FIREABLE(SackCS_0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((! FIREABLE(malS5_0) AND (! FIREABLE(malS5_1) AND ! FIREABLE(malS5_2))) OR (! FIREABLE(Sperform_2) AND (! FIREABLE(Sperform_1) AND ! FIREABLE(Sperform_0)))) U (FIREABLE(SackCS_2) OR (FIREABLE(SackCS_1) OR FIREABLE(SackCS_0))))
lola: processed formula length: 229
lola: 176 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((EG ((FIREABLE(malS4_2) OR (FIREABLE(malS4_0) OR FIREABLE(malS4_1)))) AND AX ((FIREABLE(malS1_1) OR (FIREABLE(malS1_2) OR FIREABLE(malS1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (!(A(TRUE U !((FIREABLE(malS4_2) OR (FIREABLE(malS4_0) OR FIREABLE(malS4_1)))))) AND AX((FIREABLE(malS1_1) OR (FIREABLE(malS1_2) OR FIREABLE(malS1_0))))))
lola: processed formula length: 163
lola: 178 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AG (AF (FIREABLE(malA1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(E(TRUE U !(A(TRUE U FIREABLE(malA1))))))
lola: processed formula length: 51
lola: 178 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EG (! FIREABLE(malA5)) AND AX (! FIREABLE(malA3))) OR (A((FIREABLE(malA1) OR (FIREABLE(ScertCS_1) OR (FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_2)))) U (FIREABLE(malC1_0) OR (FIREABLE(malC1_2) OR (FIREABLE(malC1_1) OR (FIREABLE(SgetTS_0) OR (FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1))))))) OR A(AG (FIREABLE(AreqCS)) U (FIREABLE(SreqTS_1) OR (FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_2))))))
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: EG (! FIREABLE(malA5))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(! FIREABLE(malA5))))
lola: processed formula length: 33
lola: 176 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (! FIREABLE(malA3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(! FIREABLE(malA3))
lola: processed formula length: 21
lola: 176 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((EG (FIREABLE(malA5)) AND EF (FIREABLE(malA5))) U AF ((FIREABLE(malS6_1) OR (FIREABLE(malS6_0) OR FIREABLE(malS6_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((!(A(TRUE U !(FIREABLE(malA5)))) AND E(TRUE U FIREABLE(malA5))) U A(TRUE U (FIREABLE(malS6_1) OR (FIREABLE(malS6_0) OR FIREABLE(malS6_2)))))
lola: processed formula length: 142
lola: 179 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 4 significant temporal operators and needs 17 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AF (AG ((FIREABLE(CsendTS1_1) OR (FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U !(E(TRUE U !((FIREABLE(CsendTS1_1) OR (FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_2))))))))
lola: processed formula length: 108
lola: 178 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((A((FIREABLE(CgenCertif_2) OR (FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_0))) U (FIREABLE(CsendTS1_1) OR (FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_2)))) AND (FIREABLE(malS1_1) OR (FIREABLE(malS1_2) OR FIREABLE(malS1_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A((FIREABLE(CgenCertif_2) OR (FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_0))) U (FIREABLE(CsendTS1_1) OR (FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_2)))) AND (FIREABLE(malS1_1) OR (FIREABLE(malS1_2) OR FIREABLE(malS1_0)))))
lola: processed formula length: 236
lola: 177 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((! FIREABLE(AgetTS) AND (! FIREABLE(malS6_1) AND (! FIREABLE(malS6_0) AND ! FIREABLE(malS6_2))))) AND (((FIREABLE(AreqTS) AND ! FIREABLE(AgetTS)) OR ((FIREABLE(Sperform_2) OR (FIREABLE(Sperform_1) OR FIREABLE(Sperform_0))) AND ((! FIREABLE(CgenCertif_2) AND (! FIREABLE(CgenCertif_1) AND ! FIREABLE(CgenCertif_0))) OR ! FIREABLE(AreqCS)))) AND AX (EF ((FIREABLE(malS2_2) OR (FIREABLE(malS2_0) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(AgetTS) AND (! FIREABLE(malS6_1) AND (! FIREABLE(malS6_0) AND ! FIREABLE(malS6_2)))))
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 220 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 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(AreqTS) AND ! FIREABLE(AgetTS)) OR ((FIREABLE(Sperform_2) OR (FIREABLE(Sperform_1) OR FIREABLE(Sperform_0))) AND ((! FIREABLE(CgenCertif_2) AND (! FIREABLE(CgenCertif_1) AND ! FIREABLE(CgenCertif_0))) OR ! FIREABLE(AreqCS))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (EF ((FIREABLE(malS2_2) OR (FIREABLE(malS2_0) OR (FIREABLE(malS2_1) OR FIREABLE(AreqCS))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (FIREABLE(malS2_2) OR (FIREABLE(malS2_0) OR (FIREABLE(malS2_1) OR FIREABLE(AreqCS))))))
lola: processed formula length: 99
lola: 177 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (E(! FIREABLE(malA2) U ((FIREABLE(CsendTS1_1) OR (FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_2))) AND (FIREABLE(malS2_2) OR (FIREABLE(malS2_0) OR FIREABLE(malS2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(! FIREABLE(malA2) U ((FIREABLE(CsendTS1_1) OR (FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_2))) AND (FIREABLE(malS2_2) OR (FIREABLE(malS2_0) OR FIREABLE(malS2_1))))))
lola: processed formula length: 169
lola: 177 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EX (EF ((FIREABLE(SgetTS_0) OR (FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(EX(E(TRUE U (FIREABLE(SgetTS_0) OR (FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1))))))))
lola: processed formula length: 96
lola: 178 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AF ((FIREABLE(malA2) AND (FIREABLE(malS6_1) OR (FIREABLE(malS6_0) OR (FIREABLE(malS6_2) OR (FIREABLE(SsendTS_2) OR (FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(A(TRUE U (FIREABLE(malA2) AND (FIREABLE(malS6_1) OR (FIREABLE(malS6_0) OR (FIREABLE(malS6_2) OR (FIREABLE(SsendTS_2) OR (FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_0)))))))))))
lola: processed formula length: 186
lola: 177 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (! FIREABLE(AreqCS))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(! FIREABLE(AreqCS))))
lola: processed formula length: 34
lola: 176 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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: RESULT
lola: summary: yes no no yes no no no yes no no no no no no no yes

BK_STOP 1463698566220

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