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 irma4mcc-full
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 r138-qhx2-152673580400011
=====================================================================

--------------------
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 1527139117631


BK_STOP 1527139169714

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using QuasiCertifProtocol-COL-02 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool voting-classifier.
Model characteristics are: {'Examination': 'CTLFireability', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
/usr/local/lib/python3.6/dist-packages/sklearn/preprocessing/label.py:151: DeprecationWarning: The truth value of an empty array is ambiguous. Returning False, but in future this will result in an error. Use `array.size > 0` to check that an array is not empty.
if diff:
Known tools are: [{'Time': 140, 'Memory': 107.13, 'Tool': 'lola'}, {'Time': 169, 'Memory': 107.51, 'Tool': 'lola'}, {'Time': 1748, 'Memory': 136.4, 'Tool': 'gspn'}, {'Time': 3468, 'Memory': 164.74, 'Tool': 'gspn'}, {'Time': 4205, 'Memory': 2228.57, 'Tool': 'marcie'}, {'Time': 4297, 'Memory': 2228.82, 'Tool': 'marcie'}, {'Time': 5815, 'Memory': 296.44, 'Tool': 'itstools'}, {'Time': 6097, 'Memory': 311.06, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola QuasiCertifProtocol-COL-02...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
QuasiCertifProtocol-COL-02: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
QuasiCertifProtocol-COL-02: translating COL formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ QuasiCertifProtocol-COL-02 @ 3540 seconds
----- Start make result stderr -----
----- 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-CTLFireability.task
lola: (FIREABLE(t8) OR A (F (((FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t46) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)))))) : NOT((A (F (((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18)) AND FIREABLE(t27) AND (FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30))))) AND NOT(A (G ((FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50))))))) : (A (F ((((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)) AND FIREABLE(t9) AND NOT FIREABLE(t17)) AND E (F ((FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47))))))) AND A (((FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR (NOT FIREABLE(t44) AND NOT FIREABLE(t43) AND NOT FIREABLE(t42))) U (((FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4)) AND (FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50))) OR (NOT FIREABLE(t44) AND NOT FIREABLE(t43) AND NOT FIREABLE(t42)))))) : ((((FIREABLE(t46) AND A (G (FIREABLE(t17)))) OR (E (X (FIREABLE(t45))) AND FIREABLE(t7))) OR NOT(A (F ((FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21)))))) OR NOT((NOT(A (X ((FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50))))) OR (((NOT FIREABLE(t15) AND NOT FIREABLE(t14) AND NOT FIREABLE(t13)) OR NOT FIREABLE(t16)) AND E (X ((FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36)))))))) : (A ((E (G ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)))) U A (F (FIREABLE(t29))))) AND (FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t28))) : (E (F ((A (F ((FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21)))) OR (FIREABLE(t8) OR FIREABLE(t0))))) AND A (((NOT FIREABLE(t49) AND NOT FIREABLE(t48) AND NOT FIREABLE(t47) AND (FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47)) AND (FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24))) U A (F ((FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42))))))) : (((((NOT FIREABLE(t52) AND NOT FIREABLE(t51) AND NOT FIREABLE(t50) AND (FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t45))) AND E (F ((FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42))))) AND NOT(A (F ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)))))) OR E (X ((((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18)) AND (FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36))) OR ((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)) AND (FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50))))))) OR ((A (X ((FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t28)))) OR E (X ((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t29))))) OR A (F ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)))))) : A (X (E (G (A (F ((FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50)))))))) : ((() OR A (F ((FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR NOT FIREABLE(t27))))) AND A (X (A (F ((FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42))))))) : ((E ((FIREABLE(t29) U (FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t8)))) AND (((FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t7) OR NOT FIREABLE(t27)) OR E (X ((FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39))))) AND ((FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33)) OR E (X ((FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39))))))) OR A ((A (X ((FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33)))) U A (F ((FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21))))))) : E (X (NOT(A (F (((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)) AND (FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)))))))) : A ((((NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4)) OR (NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1)) OR (NOT FIREABLE(t12) AND NOT FIREABLE(t11) AND NOT FIREABLE(t10))) U ((FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t45) OR ((FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33)) AND FIREABLE(t29))) AND A (G ((FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21))))))) : E (G ((NOT FIREABLE(t49) AND NOT FIREABLE(t48) AND NOT FIREABLE(t47)))) : A (F (A (F (A (G ((FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47)))))))) : E (G (((NOT FIREABLE(t15) AND NOT FIREABLE(t14) AND NOT FIREABLE(t13)) OR NOT(A (X ((FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36)))))))) : A ((E (G (NOT FIREABLE(t46))) U E (X ((FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t8) OR A (F (((FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t46) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t8)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
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 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t46) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t46) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)))))
lola: processed formula: A (F (((FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t46) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)))))
lola: processed formula length: 133
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: the resulting B\xfcchi 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F (((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18)) AND FIREABLE(t27) AND (FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30))))) AND NOT(A (G ((FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((NOT FIREABLE(t20) AND NOT FIREABLE(t19) AND NOT FIREABLE(t18)) OR NOT FIREABLE(t27) OR (NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18)) AND FIREABLE(t27) AND (FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)))))
lola: processed formula length: 142
lola: 12 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: 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: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)) AND FIREABLE(t9) AND NOT FIREABLE(t17)) AND E (F ((FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47))))))) AND A (((FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR (NOT FIREABLE(t44) AND NOT FIREABLE(t43) AND NOT FIREABLE(t42))) U (((FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4)) AND (FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)) AND FIREABLE(t9) AND NOT FIREABLE(t17)) AND E (F ((FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)) AND FIREABLE(t9) AND NOT FIREABLE(t17)) AND E(TRUE U (FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47)))))
lola: processed formula length: 170
lola: 2 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: 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: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((FIREABLE(t46) AND A (G (FIREABLE(t17)))) OR (E (X (FIREABLE(t45))) AND FIREABLE(t7))) OR NOT(A (F ((FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21)))))) OR NOT((NOT(A (X ((FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50))))) OR (((NOT FIREABLE(t15) AND NOT FIREABLE(t14) AND NOT FIREABLE(t13)) OR NOT FIREABLE(t16)) AND E (X ((FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t46)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t46)
lola: processed formula length: 13
lola: 18 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (FIREABLE(t45)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(FIREABLE(t45))
lola: processed formula length: 17
lola: 19 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: Formula contains EX or AX operators, stubborn sets not applicable
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 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(t23) AND NOT FIREABLE(t22) AND NOT FIREABLE(t21))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21))))
lola: processed formula length: 66
lola: 20 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: 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: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((E (G ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)))) U A (F (FIREABLE(t29))))) AND (FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t28)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (G ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)))) U A (F (FIREABLE(t29)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(A(TRUE U (NOT FIREABLE(t15) AND NOT FIREABLE(t14) AND NOT FIREABLE(t13)))) U A(TRUE U FIREABLE(t29)))
lola: processed formula length: 107
lola: 4 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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 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: 6 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((A (F ((FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21)))) OR (FIREABLE(t8) OR FIREABLE(t0))))) AND A (((NOT FIREABLE(t49) AND NOT FIREABLE(t48) AND NOT FIREABLE(t47) AND (FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47)) AND (FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24))) U A (F ((FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F ((FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21))))
lola: processed formula length: 71
lola: 3 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: 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 167 markings, 618 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((NOT FIREABLE(t49) AND NOT FIREABLE(t48) AND NOT FIREABLE(t47) AND (FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47)) AND (FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24))) U A (F ((FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((NOT FIREABLE(t49) AND NOT FIREABLE(t48) AND NOT FIREABLE(t47) AND (FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47)) AND (FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24))) U A(TRUE U (FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42))))
lola: processed formula length: 242
lola: 3 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: 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((NOT FIREABLE(t52) AND NOT FIREABLE(t51) AND NOT FIREABLE(t50) AND (FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t45))) AND E (F ((FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42))))) AND NOT(A (F ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)))))) OR E (X ((((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18)) AND (FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36))) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t52) AND NOT FIREABLE(t51) AND NOT FIREABLE(t50) AND (FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t45)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(t52) AND NOT FIREABLE(t51) AND NOT FIREABLE(t50) AND (FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t45)))
lola: processed formula length: 137
lola: 6 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18)) AND (FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36))) OR ((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)) AND (FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18)) AND (FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36))) OR ((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)) AND (FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50)))))
lola: processed formula length: 229
lola: 7 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: Formula contains EX or AX operators, stubborn sets not applicable
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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t28))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t28))))
lola: processed formula: A (X ((FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t28))))
lola: processed formula length: 77
lola: 6 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: the resulting B\xfcchi 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t29))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t29)))
lola: processed formula length: 73
lola: 7 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: Formula contains EX or AX operators, stubborn sets not applicable
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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13))))
lola: processed formula: A (F ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13))))
lola: processed formula length: 59
lola: 6 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: the resulting B\xfcchi 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: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (A (F ((FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U NOT(A(TRUE U (FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50)))))))
lola: processed formula length: 85
lola: 3 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: Formula contains EX or AX operators, stubborn sets not applicable
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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((() OR A (F ((FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR NOT FIREABLE(t27))))) AND A (X (A (F ((FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR NOT FIREABLE(t27))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR NOT FIREABLE(t27))))
lola: processed formula: A (F ((FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR NOT FIREABLE(t27))))
lola: processed formula length: 129
lola: 2 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: the resulting B\xfcchi 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42))))
lola: processed formula length: 65
lola: 4 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: Formula contains EX or AX operators, stubborn sets not applicable
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E ((FIREABLE(t29) U (FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t8)))) AND (((FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t7) OR NOT FIREABLE(t27)) OR E (X ((FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39))))) AND ((FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33)) OR E (X ((FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39))))))) OR A ((A (X ((FIREABLE(t35... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(t29) U (FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t8))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(FIREABLE(t29) U (FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t8)))
lola: processed formula length: 84
lola: 1 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: 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (X ((FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33)))) U A (F ((FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(AX((FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33))) U A(TRUE U (FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21))))
lola: processed formula length: 122
lola: 3 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: Formula contains EX or AX operators, stubborn sets not applicable
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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(A (F (((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)) AND (FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)) AND (FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30))))))
lola: processed formula length: 128
lola: 6 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: Formula contains EX or AX operators, stubborn sets not applicable
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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4)) OR (NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1)) OR (NOT FIREABLE(t12) AND NOT FIREABLE(t11) AND NOT FIREABLE(t10))) U ((FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t45) OR ((FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33)) AND FIREABLE(t29))) AND A (G ((FIREABLE(t23) OR FIREABLE(t22) OR FIRE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4)) OR (NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1)) OR (NOT FIREABLE(t12) AND NOT FIREABLE(t11) AND NOT FIREABLE(t10))) U ((FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t45) OR ((FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33)) AND FIREABLE(t29))) AND A (G ((FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21)))))))
lola: processed formula: A ((((NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4)) OR (NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1)) OR (NOT FIREABLE(t12) AND NOT FIREABLE(t11) AND NOT FIREABLE(t10))) U ((FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t45) OR ((FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33)) AND FIREABLE(t29))) AND A (G ((FIREABLE(t23) OR FIREABLE(t22) OR FIRE... (shortened)
lola: processed formula length: 415
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: the resulting B\xfcchi 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: 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(t49) AND NOT FIREABLE(t48) AND NOT FIREABLE(t47))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47))))
lola: processed formula length: 66
lola: 2 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: 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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (F (A (G ((FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47))))))
lola: processed formula: A (F (A (G ((FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47))))))
lola: processed formula length: 67
lola: 1 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-02-CTLFireability.task
lola: the resulting B\xfcchi 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: 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: 7 markings, 8 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((NOT FIREABLE(t15) AND NOT FIREABLE(t14) AND NOT FIREABLE(t13)) OR NOT(A (X ((FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13)) AND NOT(EX((NOT FIREABLE(t38) AND NOT FIREABLE(t37) AND NOT FIREABLE(t36)))))))
lola: processed formula length: 145
lola: 7 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: Formula contains EX or AX operators, stubborn sets not applicable
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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (G (NOT FIREABLE(t46))) U E (X ((FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(A(TRUE U FIREABLE(t46))) U EX((FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30))))
lola: processed formula length: 143
lola: 4 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: Formula contains EX or AX operators, stubborn sets not applicable
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: 6 markings, 16 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes no no no no no no yes no yes no yes no
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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="irma4mcc-full"
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 irma4mcc-full"
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 r138-qhx2-152673580400011"
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 ;