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)
......................
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 34K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is QuasiCertifProtocol-COL-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578700011
=====================================================================

--------------------
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-00
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-09
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

=== Now, execution of the tool begins

BK_START 1526905453769

info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-COL-02 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-COL-02 formula CTLFireability into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLFireability @ QuasiCertifProtocol-COL-02 @ 3570 seconds
lola: LoLA will run for 3570 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: Size of bit vector: 2752
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: (FIREABLE(t1) OR A (F (((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t12) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27)))))) : NOT((A (F (((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)) AND FIREABLE(t0) AND (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27))))) AND NOT(A (G ((FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19))))))) : (A (F ((((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27)) AND FIREABLE(t33) AND NOT FIREABLE(t26)) AND E (F ((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30))))))) AND A (((FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR (NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23))) U (((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9)) AND (FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19))) OR (NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23)))))) : ((((FIREABLE(t12) AND A (G (FIREABLE(t26)))) OR (E (X (FIREABLE(t38))) AND FIREABLE(t22))) OR NOT(A (F ((FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44)))))) OR NOT((NOT(A (X ((FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19))))) OR (((NOT FIREABLE(t55) AND NOT FIREABLE(t54) AND NOT FIREABLE(t53)) OR NOT FIREABLE(t39)) AND E (X ((FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16)))))))) : (A ((E (G ((FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53)))) U A (F (FIREABLE(t8))))) AND (FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t40))) : (E (F ((A (F ((FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44)))) OR (FIREABLE(t1) OR FIREABLE(t34))))) AND A (((NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND (FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)) AND (FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50))) U A (F ((FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23))))))) : (((((NOT FIREABLE(t21) AND NOT FIREABLE(t20) AND NOT FIREABLE(t19) AND (FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t38))) AND E (F ((FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23))))) AND NOT(A (F ((FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53)))))) OR E (X ((((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)) AND (FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16))) OR ((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27)) AND (FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19))))))) OR ((A (X ((FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t40)))) OR E (X ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t8))))) OR A (F ((FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53)))))) : A (X (E (G (A (F ((FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19)))))))) : ((() OR A (F ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR NOT FIREABLE(t0))))) AND A (X (A (F ((FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23))))))) : ((E ((FIREABLE(t8) U (FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t1)))) AND (((FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t22) OR NOT FIREABLE(t0)) OR E (X ((FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35))))) AND ((FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41)) OR E (X ((FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35))))))) OR A ((A (X ((FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41)))) U A (F ((FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44))))))) : E (X (NOT(A (F (((FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53)) AND (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27)))))))) : A ((((NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9)) OR (NOT FIREABLE(t49) AND NOT FIREABLE(t48) AND NOT FIREABLE(t47)) OR (NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5))) U ((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t38) OR ((FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41)) AND FIREABLE(t8))) AND A (G ((FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44))))))) : E (G ((NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30)))) : A (F (A (F (A (G ((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)))))))) : E (G (((NOT FIREABLE(t55) AND NOT FIREABLE(t54) AND NOT FIREABLE(t53)) OR NOT(A (X ((FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16)))))))) : A ((E (G (NOT FIREABLE(t12))) U E (X ((FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(t12) AND A (G (FIREABLE(t26)))) OR ((E (X (FIREABLE(t38))) AND FIREABLE(t22)) OR (E (G ((NOT FIREABLE(t46) AND NOT FIREABLE(t45) AND NOT FIREABLE(t44)))) OR (A (X ((FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19)))) AND (((FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53)) AND FIREABLE(t39)) OR A (X ((NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND NOT FIREABLE(t16)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53)) AND FIREABLE(t39))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53)) AND FIREABLE(t39))
lola: processed formula length: 71
lola: 48 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t22)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t22)
lola: processed formula length: 13
lola: 48 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t12)
lola: processed formula length: 13
lola: 48 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(t46) AND NOT FIREABLE(t45) AND NOT FIREABLE(t44))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((NOT FIREABLE(t46) AND NOT FIREABLE(t45) AND NOT FIREABLE(t44))))
lola: processed formula length: 71
lola: 48 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 8 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((NOT FIREABLE(t21) AND NOT FIREABLE(t20) AND NOT FIREABLE(t19) AND (FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t38))) AND (E (F ((FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23)))) AND E (G ((NOT FIREABLE(t55) AND NOT FIREABLE(t54) AND NOT FIREABLE(t53)))))) OR (E (X ((((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)) AND (FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (NOT FIREABLE(t55) AND NOT FIREABLE(t54) AND NOT FIREABLE(t53))
lola: processed formula length: 63
lola: 50 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t21) AND NOT FIREABLE(t20) AND NOT FIREABLE(t19) AND (FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t38)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(t21) AND NOT FIREABLE(t20) AND NOT FIREABLE(t19) AND (FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t38)))
lola: processed formula length: 137
lola: 48 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t8))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t8)))
lola: processed formula length: 72
lola: 49 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t40))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t40)))
lola: processed formula length: 73
lola: 49 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)) AND (FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16))) OR ((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27)) AND (FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)) AND (FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16))) OR ((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27)) AND (FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19)))))
lola: processed formula length: 229
lola: 49 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (A (F ((FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(NOT(A(TRUE U NOT(A(TRUE U (FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19)))))))
lola: processed formula length: 85
lola: 51 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 86 markings, 193 edges

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR NOT FIREABLE(t0)))) AND A (X (A (F ((FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR NOT FIREABLE(t0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND FIREABLE(t0))
lola: processed formula length: 144
lola: 50 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:664
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23))
lola: processed formula length: 63
lola: 50 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 7 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E ((FIREABLE(t8) U (FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t1)))) AND (((FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t22) OR NOT FIREABLE(t0)) OR E (X ((FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35))))) AND ((FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41)) OR E (X ((FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35))))))) OR A (F ((FIREABLE(t46) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t22) OR NOT FIREABLE(t0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t22) OR NOT FIREABLE(t0))
lola: processed formula length: 90
lola: 48 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41))
lola: processed formula length: 51
lola: 48 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (NOT FIREABLE(t46) AND NOT FIREABLE(t45) AND NOT FIREABLE(t44))
lola: processed formula length: 63
lola: 50 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(t8) U (FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t1))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((FIREABLE(t8) U (FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t1))))
lola: processed formula length: 88
lola: 51 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: formula 0: (FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t1))
lola: state equation: Generated DNF with 13 literals and 4 conjunctive subformulas
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-02-CTLFireability-7-0.sara
lola: lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
========================================
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((NOT FIREABLE(t55) AND NOT FIREABLE(t54) AND NOT FIREABLE(t53)) OR (NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:627
lola: processed formula: ((NOT FIREABLE(t55) AND NOT FIREABLE(t54) AND NOT FIREABLE(t53)) OR (NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27)))
lola: processed formula length: 133
lola: 49 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((NOT FIREABLE(t55) AND NOT FIREABLE(t54) AND NOT FIREABLE(t53)) OR E (X ((NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND NOT FIREABLE(t16)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U ((FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53)) AND NOT(EX((NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND NOT FIREABLE(t16)))))))
lola: processed formula length: 145
lola: 52 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 12 markings, 11 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (G (NOT FIREABLE(t12))) U E (X ((FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(NOT(A(TRUE U FIREABLE(t12))) U EX((FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27))))
lola: processed formula length: 143
lola: 52 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 17 markings, 27 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30))))
lola: processed formula length: 71
lola: 48 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9)) OR (NOT FIREABLE(t49) AND NOT FIREABLE(t48) AND NOT FIREABLE(t47)) OR (NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5))) U ((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t38) OR ((FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41)) AND FIREABLE(t8))) AND A (G ((FIREABLE(t46) OR FIREABLE(t45) OR FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(((NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9)) OR (NOT FIREABLE(t49) AND NOT FIREABLE(t48) AND NOT FIREABLE(t47)) OR (NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5))) U ((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t38) OR ((FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41)) AND FIREABLE(t8))) AND NOT(E(TRUE U (NOT FIREABLE(t46) AND NOT FIREABLE... (shortened)
lola: processed formula length: 432
lola: 51 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 12 markings, 12 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (FIREABLE(t8))) AND (FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t40)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t40))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t40))
lola: processed formula length: 69
lola: 48 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t8)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(t8)
lola: processed formula length: 16
lola: 50 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t1) OR A (F (((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t12) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t1)
lola: processed formula length: 12
lola: 48 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t12) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t12) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27)))
lola: processed formula length: 150
lola: 50 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 11 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30))
lola: processed formula length: 63
lola: 50 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 12 markings, 11 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((NOT FIREABLE(t15) AND NOT FIREABLE(t14) AND NOT FIREABLE(t13)) OR NOT FIREABLE(t0) OR (NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27))))) OR A (G ((FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19))))
lola: processed formula length: 59
lola: 50 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(t21) AND NOT FIREABLE(t20) AND NOT FIREABLE(t19))
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((NOT FIREABLE(t15) AND NOT FIREABLE(t14) AND NOT FIREABLE(t13)) OR NOT FIREABLE(t0) OR (NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((NOT FIREABLE(t15) AND NOT FIREABLE(t14) AND NOT FIREABLE(t13)) OR NOT FIREABLE(t0) OR (NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27)))))
lola: processed formula length: 162
lola: 48 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 11 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (F ((FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44)))) OR E (F ((FIREABLE(t1) OR FIREABLE(t34))))) AND A (F ((FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1) OR FIREABLE(t34))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t1) OR FIREABLE(t34))))
lola: processed formula length: 40
lola: 49 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t1) OR FIREABLE(t34))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23))
lola: processed formula length: 63
lola: 50 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27)) AND FIREABLE(t33) AND NOT FIREABLE(t26)) AND E (F ((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30))))))) AND A (((FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR (NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23))) U (((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9)) AND (FIREABLE(t21) OR FIREABLE(t20) OR FIREABL... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR (NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23))) U (((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9)) AND (FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19))) OR (NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23)))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR (NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23))) U (((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9)) AND (FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19))) OR (NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23)))))
lola: processed formula length: 306
lola: 52 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F ((((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27)) AND FIREABLE(t33) AND NOT FIREABLE(t26)) AND E (F ((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30))))))) AND A (((FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR (NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23))) U (((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9)) AND (FIREABLE(t21) OR FIREABLE(t20) OR FIREABL... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR (NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23))) U (((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9)) AND (FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19))) OR (NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23)))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR (NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23))) U (((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9)) AND (FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19))) OR (NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23)))))
lola: processed formula length: 306
lola: 52 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27)) AND FIREABLE(t33) AND NOT FIREABLE(t26)) AND E (F ((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U (((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27)) AND FIREABLE(t33) AND NOT FIREABLE(t26)) AND E(TRUE U (FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)))))
lola: processed formula length: 171
lola: 50 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no yes no no no no no no yes no yes no yes no
lola:
preliminary result: no yes no yes no no no no no no yes no yes no yes no
lola: memory consumption: 15068 KB
lola: time consumption: 0 seconds

BK_STOP 1526905474619

--------------------
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-COL-02"
export BK_EXAMINATION="CTLFireability"
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/QuasiCertifProtocol-COL-02.tgz
mv QuasiCertifProtocol-COL-02 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is QuasiCertifProtocol-COL-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 r136-qhx2-152673578700011"
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 ;