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-3254
Executing tool lola
Input is S_QuasiCertifProtocol-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-149479231700195
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496365225754


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_QuasiCertifProtocol-COL-02: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_QuasiCertifProtocol-COL-02: translating COL formula LTLFireability into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
LTLFireability @ S_QuasiCertifProtocol-COL-02 @ 3540 seconds
----- Start make result stdout -----
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-LTLFireability.task
lola: A (X (G ((FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3))))) : A (X (F (X ((FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16)))))) : A (G ((X (FIREABLE(t27)) U F (F ((FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3))))))) : A (FIREABLE(t12)) : A ((F (F (G (FIREABLE(t35)))) U F ((FIREABLE(t28) U (FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24)))))) : A (X (X (FIREABLE(t19)))) : A (F ((FIREABLE(t28) U F (X ((FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37))))))) : A (G (G (G (((FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51)) U (FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13))))))) : A (X ((FIREABLE(t36) U X (F (FIREABLE(t43)))))) : A (G (F (X ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9)))))) : A (X (FIREABLE(t43))) : A (G (FIREABLE(t54))) : A (F (F ((F (FIREABLE(t43)) U X ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13))))))) : A (F ((G (F (FIREABLE(t27))) U ((FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45)) U (FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48)))))) : A (G (X ((FIREABLE(t54) U X ((FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32))))))) : A ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3)))))
lola: processed formula: A (X (G ((FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3)))))
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X ((FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (X ((FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16))))))
lola: processed formula: A (X (F (X ((FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16))))))
lola: processed formula length: 67
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X (FIREABLE(t27)) U F (F ((FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X (FIREABLE(t27)) U F ((FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3))))))
lola: processed formula: A (G ((X (FIREABLE(t27)) U F ((FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3))))))
lola: processed formula length: 82
lola: 1 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(t12))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t12)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F (G (FIREABLE(t35)))) U F ((FIREABLE(t28) U (FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G (FIREABLE(t35))) U F ((FIREABLE(t28) U (FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24))))))
lola: processed formula: A ((F (G (FIREABLE(t35))) U F ((FIREABLE(t28) U (FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24))))))
lola: processed formula length: 103
lola: 1 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-LTLFireability.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (FIREABLE(t19))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (FIREABLE(t19))))
lola: processed formula: A (X (X (FIREABLE(t19))))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t28) U F (X ((FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((FIREABLE(t28) U F (X ((FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37)))))))
lola: processed formula: A (F ((FIREABLE(t28) U F (X ((FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37)))))))
lola: processed formula length: 85
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (G (((FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51)) U (FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (G (((FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51)) U (FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)))))))
lola: processed formula: A (G (G (G (((FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51)) U (FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)))))))
lola: processed formula length: 123
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(t36) U X (F (FIREABLE(t43))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((FIREABLE(t36) U X (F (FIREABLE(t43))))))
lola: processed formula: A (X ((FIREABLE(t36) U X (F (FIREABLE(t43))))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (X ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (X ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9))))))
lola: processed formula: A (G (F (X ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9))))))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(t43)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (FIREABLE(t43)))
lola: processed formula: A (X (FIREABLE(t43)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t54)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F ((F (FIREABLE(t43)) U X ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F (FIREABLE(t43)) U X ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13))))))
lola: processed formula: A (F ((F (FIREABLE(t43)) U X ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13))))))
lola: processed formula length: 85
lola: 1 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G (F (FIREABLE(t27))) U ((FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45)) U (FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G (F (FIREABLE(t27))) U ((FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45)) U (FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48))))))
lola: processed formula: A (F ((G (F (FIREABLE(t27))) U ((FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45)) U (FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48))))))
lola: processed formula length: 141
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-LTLFireability.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((FIREABLE(t54) U X ((FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X ((FIREABLE(t54) U X ((FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32)))))))
lola: processed formula: A (G (X ((FIREABLE(t54) U X ((FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32)))))))
lola: processed formula length: 85
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-LTLFireability.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13))
lola: processed formula length: 51
lola: 1 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: RESULT
lola:
SUMMARY: no no no no yes no no no no no no no no no no no
lola: ========================================
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496365225929

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="S_QuasiCertifProtocol-COL-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/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/S_QuasiCertifProtocol-COL-02.tgz
mv S_QuasiCertifProtocol-COL-02 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_QuasiCertifProtocol-COL-02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r138-smll-149479231700195"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;