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 180K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 5.9K 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 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 17K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is FMS-PT-005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998000053
=====================================================================

--------------------
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 FMS-PT-005-CTLFireability-00
FORMULA_NAME FMS-PT-005-CTLFireability-01
FORMULA_NAME FMS-PT-005-CTLFireability-02
FORMULA_NAME FMS-PT-005-CTLFireability-03
FORMULA_NAME FMS-PT-005-CTLFireability-04
FORMULA_NAME FMS-PT-005-CTLFireability-05
FORMULA_NAME FMS-PT-005-CTLFireability-06
FORMULA_NAME FMS-PT-005-CTLFireability-07
FORMULA_NAME FMS-PT-005-CTLFireability-08
FORMULA_NAME FMS-PT-005-CTLFireability-09
FORMULA_NAME FMS-PT-005-CTLFireability-10
FORMULA_NAME FMS-PT-005-CTLFireability-11
FORMULA_NAME FMS-PT-005-CTLFireability-12
FORMULA_NAME FMS-PT-005-CTLFireability-13
FORMULA_NAME FMS-PT-005-CTLFireability-14
FORMULA_NAME FMS-PT-005-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1526609736852

info: Time: 3600 - MCC
===========================================================================================
prep: translating FMS-PT-005 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating FMS-PT-005 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ FMS-PT-005 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 42/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 20 transitions, 16 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from FMS-PT-005-CTLFireability.task
lola: E (F (E (X (E (G (FIREABLE(tM3))))))) : A (G (NOT(NOT(E (F (FIREABLE(tP12))))))) : (E (F ((FIREABLE(tP1j) AND E (F (FIREABLE(tP12s)))))) OR E (X (FIREABLE(tP1M1)))) : E (X (E ((FIREABLE(tP2) U (FIREABLE(tM3) AND FIREABLE(tP1M1)))))) : E (((FIREABLE(tP2s) OR NOT FIREABLE(tP1e)) U A (X ((FIREABLE(tP2e) AND FIREABLE(tP2M2)))))) : (((A ((FIREABLE(tP2j) U FIREABLE(tP12))) AND (FIREABLE(tP1j) AND FIREABLE(tP1))) OR NOT(E (F (FIREABLE(tM3))))) AND (E (F (NOT FIREABLE(tP2))) OR E ((NOT FIREABLE(tM3) U NOT FIREABLE(tP3))))) : A (G (E (X (E (F (FIREABLE(tx))))))) : A (F (NOT(A (G (NOT FIREABLE(tP12s)))))) : A (G ((FIREABLE(tP3) OR (NOT FIREABLE(tP1e) AND NOT FIREABLE(tP12)) OR NOT FIREABLE(tP12M3)))) : (E (G (A (G (FIREABLE(tP12))))) OR E (F (A (G ((FIREABLE(tP2j) AND FIREABLE(tP12M3))))))) : E (G (E ((NOT FIREABLE(tP2e) U FIREABLE(tP2s))))) : E (X (FIREABLE(tP3s))) : (E (G (FIREABLE(tM1))) OR FIREABLE(tP12)) : ((A (((FIREABLE(tP1j) AND FIREABLE(tP3s)) U (FIREABLE(tP2) OR FIREABLE(tP1)))) OR ((NOT FIREABLE(tP3) AND (NOT FIREABLE(tP1) OR NOT FIREABLE(tP2j))) AND (E (X (FIREABLE(tM3))) OR (NOT FIREABLE(tP2M2) AND NOT FIREABLE(tM1))))) OR FIREABLE(tP12)) : NOT(E (G (((FIREABLE(tP1M1) AND (FIREABLE(tP1j) OR FIREABLE(tP1e))) OR (FIREABLE(tP12s) AND FIREABLE(tP1s) AND (FIREABLE(tP2j) OR FIREABLE(tP2e))))))) : NOT((NOT((E (X (FIREABLE(tP12))) OR FIREABLE(tP1e))) OR (A (G (FIREABLE(tP1))) OR (FIREABLE(tP12M3) OR FIREABLE(tP2e)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:449
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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: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: E (X (E (F (E (G (FIREABLE(tM3)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX(E(TRUE U NOT(A(TRUE U NOT FIREABLE(tM3)))))
lola: processed formula length: 46
lola: 39 rewrites
lola: closed formula file FMS-PT-005-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 195 markings, 436 edges
lola: ========================================

FORMULA FMS-PT-005-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(tP1j) AND E (F (FIREABLE(tP12s)))))) OR E (X (FIREABLE(tP1M1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tP1j) AND E (F (FIREABLE(tP12s))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (FIREABLE(tP1j) AND E(TRUE U FIREABLE(tP12s))))
lola: processed formula length: 56
lola: 37 rewrites
lola: closed formula file FMS-PT-005-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 223 markings, 356 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA FMS-PT-005-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E ((FIREABLE(tP2) U (FIREABLE(tM3) AND FIREABLE(tP1M1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(E(FIREABLE(tP2) U (FIREABLE(tM3) AND FIREABLE(tP1M1))))
lola: processed formula length: 58
lola: 37 rewrites
lola: closed formula file FMS-PT-005-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: 3867 markings, 5857 edges
lola: ========================================

FORMULA FMS-PT-005-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(tP2s) OR NOT FIREABLE(tP1e)) U A (X ((FIREABLE(tP2e) AND FIREABLE(tP2M2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E((FIREABLE(tP2s) OR NOT FIREABLE(tP1e)) U AX((FIREABLE(tP2e) AND FIREABLE(tP2M2))))
lola: processed formula length: 85
lola: 37 rewrites
lola: closed formula file FMS-PT-005-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: 1778239 markings, 6397550 edges, 355648 markings/sec, 0 secs
lola: 2682053 markings, 12257968 edges, 180763 markings/sec, 5 secs
lola: 2779707 markings, 17708898 edges, 19531 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2779707 markings, 17708898 edges
lola: ========================================

FORMULA FMS-PT-005-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (E (F (FIREABLE(tx)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX(E(TRUE U FIREABLE(tx))))))
lola: processed formula length: 46
lola: 38 rewrites
lola: closed formula file FMS-PT-005-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: 1243070 markings, 6673574 edges, 248614 markings/sec, 0 secs
lola: 2124583 markings, 12352160 edges, 176303 markings/sec, 5 secs
lola: 2748697 markings, 17203252 edges, 124823 markings/sec, 10 secs
lola: 2893927 markings, 22099260 edges, 29046 markings/sec, 15 secs
lola: 2894763 markings, 26159709 edges, 167 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2895018 markings, 28017672 edges

FORMULA FMS-PT-005-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (FIREABLE(tP3s)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(FIREABLE(tP3s))
lola: processed formula length: 18
lola: 36 rewrites
lola: closed formula file FMS-PT-005-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: ========================================

FORMULA FMS-PT-005-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((FIREABLE(tP1j) AND FIREABLE(tP3s)) U (FIREABLE(tP2) OR FIREABLE(tP1)))) OR (((NOT FIREABLE(tP3) AND (NOT FIREABLE(tP1) OR NOT FIREABLE(tP2j))) AND (E (X (FIREABLE(tM3))) OR (NOT FIREABLE(tP2M2) AND NOT FIREABLE(tM1)))) OR FIREABLE(tP12)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(tP1j) AND FIREABLE(tP3s)) U (FIREABLE(tP2) OR FIREABLE(tP1))))
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(tP1j) AND FIREABLE(tP3s)) U (FIREABLE(tP2) OR FIREABLE(tP1))))
lola: processed formula length: 77
lola: 39 rewrites
lola: closed formula file FMS-PT-005-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA FMS-PT-005-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (X (FIREABLE(tP12))) OR FIREABLE(tP1e)) AND (E (F (NOT FIREABLE(tP1))) AND (NOT FIREABLE(tP12M3) AND NOT FIREABLE(tP2e))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(tP1e)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(tP1e)
lola: processed formula length: 14
lola: 35 rewrites
lola: closed formula file FMS-PT-005-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 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(tP12M3) AND NOT FIREABLE(tP2e))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(tP12M3) AND NOT FIREABLE(tP2e))
lola: processed formula length: 45
lola: 35 rewrites
lola: closed formula file FMS-PT-005-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 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(tP1)))
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 (NOT FIREABLE(tP1)))
lola: processed formula length: 25
lola: 36 rewrites
lola: closed formula file FMS-PT-005-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: formula 0: NOT FIREABLE(tP1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-005-CTLFireability-9-0.sara
lola: lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
========================================
lola: ...considering subproblem: E (X (FIREABLE(tP12)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: lola: rewrite Frontend/Parser/formula_rewrite.k:721
state equation: calling and running sara
lola: processed formula: EX(FIREABLE(tP12))
lola: processed formula length: 18
lola: 36 rewrites
lola: closed formula file FMS-PT-005-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA FMS-PT-005-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tP12s)))
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(tP12s)))
lola: processed formula length: 23
lola: 36 rewrites
lola: closed formula file FMS-PT-005-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(tP12s)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 13 markings, 12 edges
sara: try reading problem file FMS-PT-005-CTLFireability-9-0.sara.
lola: state equation: write sara problem file to FMS-PT-005-CTLFireability-8-0.sara
lola: ========================================

FORMULA FMS-PT-005-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara

sara: try reading problem file FMS-PT-005-CTLFireability-8-0.sara.
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(tP3) OR (NOT FIREABLE(tP1e) AND NOT FIREABLE(tP12)) OR NOT FIREABLE(tP12M3))))
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(tP3) OR (NOT FIREABLE(tP1e) AND NOT FIREABLE(tP12)) OR NOT FIREABLE(tP12M3))))
lola: processed formula length: 96
lola: 37 rewrites
lola: closed formula file FMS-PT-005-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(tP3) AND (FIREABLE(tP1e) OR FIREABLE(tP12)) AND FIREABLE(tP12M3))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-005-CTLFireability-9-0.sara
lola: state equation: calling and running sara

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================

FORMULA FMS-PT-005-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(tP12)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: FIREABLE(tP12)
lola: processed formula length: 14
lola: 36 rewrites
lola: closed formula file FMS-PT-005-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 1187608 markings, 5851974 edges
lola: ========================================

FORMULA FMS-PT-005-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((NOT FIREABLE(tP1M1) OR (NOT FIREABLE(tP1j) AND NOT FIREABLE(tP1e))) AND (NOT FIREABLE(tP12s) OR NOT FIREABLE(tP1s) OR (NOT FIREABLE(tP2j) AND NOT FIREABLE(tP2e))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: ((FIREABLE(tP1M1) AND (FIREABLE(tP1j) OR FIREABLE(tP1e))) OR (FIREABLE(tP12s) AND FIREABLE(tP1s) AND (FIREABLE(tP2j) OR FIREABLE(tP2e))))
lola: processed formula length: 140
lola: 37 rewrites
lola: closed formula file FMS-PT-005-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: ========================================

FORMULA FMS-PT-005-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 881 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E ((NOT FIREABLE(tP2e) U FIREABLE(tP2s)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(E(NOT FIREABLE(tP2e) U FIREABLE(tP2s)))))
lola: processed formula length: 58
lola: 37 rewrites
lola: closed formula file FMS-PT-005-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: 19800 markings, 54506 edges
lola: ========================================

FORMULA FMS-PT-005-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1174 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (FIREABLE(tM1))) OR FIREABLE(tP12))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1174 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(tP12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(tP12)
lola: processed formula length: 14
lola: 35 rewrites
lola: closed formula file FMS-PT-005-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 14 will run for 1762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(tM1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (FIREABLE(tM1)))
lola: processed formula length: 21
lola: 35 rewrites
lola: closed formula file FMS-PT-005-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 is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA FMS-PT-005-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (FIREABLE(tP12))) OR E (F (A (G ((FIREABLE(tP2j) AND FIREABLE(tP12M3)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(tP12)))
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(tP12)))
lola: processed formula length: 22
lola: 37 rewrites
lola: closed formula file FMS-PT-005-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(tP12)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-005-CTLFireability-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 15 will run for 3524 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((FIREABLE(tP2j) AND FIREABLE(tP12M3))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (NOT FIREABLE(tP2j) OR NOT FIREABLE(tP12M3))
lola: processed formula length: 45
lola: 37 rewrites
lola: sara: try reading problem file FMS-PT-005-CTLFireability-14-0.sara.
closed formula file FMS-PT-005-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING

lola: 2007538 markings, 8376204 edges, 401508 markings/sec, 0 secs
lola: 2838251 markings, 15640604 edges, 166143 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 2880612 markings, 21947265 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.

FORMULA FMS-PT-005-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((A ((FIREABLE(tP2j) U FIREABLE(tP12))) AND (FIREABLE(tP1j) AND FIREABLE(tP1))) OR A (G (NOT FIREABLE(tM3)))) AND (E (F (NOT FIREABLE(tP2))) OR E ((NOT FIREABLE(tM3) U NOT FIREABLE(tP3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(tP2)))
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 (NOT FIREABLE(tP2)))
lola: processed formula length: 25
lola: 36 rewrites
lola: closed formula file FMS-PT-005-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: NOT FIREABLE(tP2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: state equation: write sara problem file to FMS-PT-005-CTLFireability-15-0.sara
lola: lola: ========================================
state equation: calling and running sara
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(tM3)))
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:695
lola: processed formula: A (G (NOT FIREABLE(tM3)))
lola: processed formula length: 25
lola: 37 rewrites
lola: closed formula file FMS-PT-005-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: sara: using a prefix tree store (--store=prefix)
try reading problem file FMS-PT-005-CTLFireability-15-0.sara.
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: FIREABLE(tM3)
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: 11 markings, 10 edges
lola: state equation: write sara problem file to FMS-PT-005-CTLFireability-17-0.sara
lola: ========================================

lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(tP2j) U FIREABLE(tP12)))
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(tP2j) U FIREABLE(tP12)))
lola: processed formula length: 37
lola: 39 rewrites
lola: closed formula file FMS-PT-005-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: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA FMS-PT-005-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no yes yes no no no no no yes yes no
lola:
preliminary result: yes yes yes yes no no yes yes no no no no no yes yes no
lola: memory consumption: 14564 KB
lola: time consumption: 60 seconds

BK_STOP 1526609797177

--------------------
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="FMS-PT-005"
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/FMS-PT-005.tgz
mv FMS-PT-005 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 FMS-PT-005, 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 r088-blw7-152649998000053"
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 ;