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.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K 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 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K 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 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 8 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 9.1K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ClientsAndServers-PT-N1000P0, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r040-smll-152646357300171
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526565950307

info: Time: 3600 - MCC
===========================================================================================
prep: translating ClientsAndServers-PT-N1000P0 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating ClientsAndServers-PT-N1000P0 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ ClientsAndServers-PT-N1000P0 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 43/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from ClientsAndServers-PT-N1000P0-CTLCardinality.task
lola: LP says that atomic proposition is always true: (SpG <= Mi)
lola: LP says that atomic proposition is always true: (SA <= CwA)
lola: LP says that atomic proposition is always true: (1 <= Mi)
lola: LP says that atomic proposition is always true: (SpG <= CwG)
lola: LP says that atomic proposition is always true: (3 <= Mi)
lola: LP says that atomic proposition is always true: (3 <= Mi)
lola: (A (G (((2 <= SpA) OR (SpG <= MwU) OR ((StR <= Ci) AND (1 <= Si))))) AND A (X (A (F ((3 <= Si)))))) : A (G (((1 <= SF) OR (CwG + 1 <= Si) OR ((CwA <= MpG))))) : (NOT(E (((MpG <= CR) U (Uf <= StF)))) AND E (((StR <= 1) U ((2 <= MwU) AND (SR <= Ci))))) : A (G (E (X (TRUE)))) : A ((A (F ((3 <= StR))) U E (F ((Uf <= CG))))) : (((1 <= MpG) AND (SwG <= SF)) OR NOT((A (G ((3 <= StF))) OR E (F ((3 <= SpG)))))) : A (G ((E (X ((3 <= Ci))) AND ((MpA <= 2) AND (SpA <= 2))))) : (E (F (((Ci <= Mi) AND (SG <= 0)))) OR (E (X ((CwG <= MpA))) AND A (G (((3 <= CG) OR (Cb <= SwA)))))) : NOT(NOT(E (G ((SG <= CR))))) : E (G (((SA <= 0) AND (MwU <= 0) AND ((SA <= 1) OR (CF + 1 <= SR))))) : (E (G (((SF <= 1) AND (CwA <= MtF)))) AND A (((SpA + 1 <= SR) U ((MwU <= StR))))) : E (G ((CF <= 0))) : (A (F (((Uf <= 1) AND (SG <= 1)))) OR E ((((1 <= Si) OR (CwA <= CwG)) U FALSE))) : A (G (A (F (((2 <= MwU) OR (SF <= StF)))))) : E (F ((2 <= MtF))) : E ((((SpA <= 2) OR (CwG <= 1)) U ()))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:452
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 28 rewrites
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.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: ========================================

FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X ((3 <= Ci))))) AND A (G (((MpA <= 2) AND (SpA <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((MpA <= 2) AND (SpA <= 2))))
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 (((MpA <= 2) AND (SpA <= 2))))
lola: processed formula length: 35
lola: 30 rewrites
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.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: ((3 <= MpA) OR (3 <= SpA))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N1000P0-CTLCardinality-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 49 markings, 48 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((Ci <= Mi) AND (SG <= 0)))) OR (E (X ((CwG <= MpA))) AND A (G (((3 <= CG) OR (Cb <= SwA))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= CG) OR (Cb <= SwA))))
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 (((3 <= CG) OR (Cb <= SwA))))
lola: processed formula length: 35
lola: 30 rewrites
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: formula 0: ((CG <= 2) AND (SwA + 1 <= Cb))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Ci <= Mi) AND (SG <= 0))))
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 (((Ci <= Mi) AND (SG <= 0))))
lola: processed formula length: 34
lola: 29 rewrites
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.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: ((Ci <= Mi) AND (SG <= 0))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N1000P0-CTLCardinality-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5001 markings, 5000 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-7 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: (A (G (((2 <= SpA) OR (SpG <= MwU) OR ((StR <= Ci) AND (1 <= Si))))) AND A (X (A (F ((3 <= Si))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= SpA) OR (SpG <= MwU) OR ((StR <= Ci) AND (1 <= Si)))))
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 (((2 <= SpA) OR (SpG <= MwU) OR ((StR <= Ci) AND (1 <= Si)))))
lola: processed formula length: 69
lola: 30 rewrites
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.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: ((SpA <= 1) AND (MwU + 1 <= SpG) AND ((Ci + 1 <= StR) OR (Si <= 0)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N1000P0-CTLCardinality-3-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: 4006 markings, 4005 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking absence of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The net is not deadlock-free.
lola: 97985 markings, 99984 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= MtF)))
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 ((2 <= MtF)))
lola: processed formula length: 18
lola: 29 rewrites
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.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: (2 <= MtF)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N1000P0-CTLCardinality-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: lola: ========================================

FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: calling and running sara
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Uf <= CG)))
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 ((Uf <= CG)))
lola: processed formula length: 18
lola: 29 rewrites
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.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: (Uf <= CG)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N1000P0-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N1000P0-CTLCardinality-5-0.sara.
sara: try reading problem file ClientsAndServers-PT-N1000P0-CTLCardinality-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16001 markings, 16000 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= SF) OR (CwG + 1 <= Si) OR ((CwA <= MpG)))))
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 (((1 <= SF) OR (CwG + 1 <= Si) OR ((CwA <= MpG)))))
lola: processed formula length: 58
lola: 30 rewrites
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.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: ((SF <= 0) AND (Si <= CwG) AND ((MpG + 1 <= CwA)))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N1000P0-CTLCardinality-7-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2011 markings, 2010 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((CF <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((CF <= 0)))
lola: processed formula length: 17
lola: 28 rewrites
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.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: 3440807 markings, 5138209 edges, 688161 markings/sec, 0 secs
lola: 7916372 markings, 10468567 edges, 895113 markings/sec, 5 secs
lola: 12439801 markings, 15638200 edges, 904686 markings/sec, 10 secs
lola: 16787884 markings, 20607438 edges, 869617 markings/sec, 15 secs
lola: 21224500 markings, 25677857 edges, 887323 markings/sec, 20 secs
lola: 25585271 markings, 30661594 edges, 872154 markings/sec, 25 secs
lola: 29826767 markings, 35509019 edges, 848299 markings/sec, 30 secs
lola: 34206235 markings, 40514126 edges, 875894 markings/sec, 35 secs
lola: 38596736 markings, 45531841 edges, 878100 markings/sec, 40 secs
lola: 42968083 markings, 50527666 edges, 874269 markings/sec, 45 secs
lola: 47331415 markings, 55514331 edges, 872666 markings/sec, 50 secs
lola: 51698481 markings, 60505263 edges, 873413 markings/sec, 55 secs
lola: 56116797 markings, 65554768 edges, 883663 markings/sec, 60 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 60002008 markings, 69995008 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 500 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((SG <= CR)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((SG <= CR)))
lola: processed formula length: 18
lola: 28 rewrites
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 50001 markings, 50000 edges

FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 583 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((Uf <= 1) AND (SG <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((2 <= Uf) OR (2 <= SG))
lola: processed formula length: 25
lola: 30 rewrites
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 18013 markings, 18013 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 700 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((2 <= MwU) OR (SF <= StF))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((MwU <= 1) AND (StF + 1 <= SF))
lola: processed formula length: 32
lola: 30 rewrites
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 131866 markings, 133867 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 875 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((SA <= 0) AND (MwU <= 0) AND ((SA <= 1) OR (CF + 1 <= SR)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((SA <= 0) AND (MwU <= 0) AND ((SA <= 1) OR (CF + 1 <= SR)))))
lola: processed formula length: 69
lola: 28 rewrites
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.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: 12001 markings, 12000 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1166 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= MpG) AND (SwG <= SF)) OR (E (F ((StF <= 2))) AND A (G ((SpG <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1166 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= MpG) AND (SwG <= SF))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= MpG) AND (SwG <= SF))
lola: processed formula length: 28
lola: 28 rewrites
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.task
lola: processed formula with 2 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 1750 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((SpG <= 2)))
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 ((SpG <= 2)))
lola: processed formula length: 18
lola: 30 rewrites
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.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:695
lola: formula 0: (3 <= SpG)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N1000P0-CTLCardinality-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1750 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((SF <= 1) AND (CwA <= MtF)))) AND A (((SpA + 1 <= SR) U ((MwU <= StR)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1750 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((SF <= 1) AND (CwA <= MtF))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((SF <= 1) AND (CwA <= MtF))))
lola: processed formula length: 36
lola: 28 rewrites
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.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: 3471813 markings, 5184718 edges, 694363 markings/sec, 0 secs
lola: 7906952 markings, 10457802 edges, 887028 markings/sec, 5 secs
lola: 12385178 markings, 15575774 edges, 895645 markings/sec, 10 secs
lola: 16498387 markings, 20276584 edges, 822642 markings/sec, 15 secs
lola: 20865543 markings, 25267620 edges, 873431 markings/sec, 20 secs
lola: 25187424 markings, 30206912 edges, 864376 markings/sec, 25 secs
lola: 29421152 markings, 35045459 edges, 846746 markings/sec, 30 secs
lola: 33777849 markings, 40024542 edges, 871339 markings/sec, 35 secs
lola: 38171370 markings, 45045708 edges, 878704 markings/sec, 40 secs
lola: 42544589 markings, 50043672 edges, 874644 markings/sec, 45 secs
lola: 46905480 markings, 55027548 edges, 872178 markings/sec, 50 secs
lola: 51271286 markings, 60017040 edges, 873161 markings/sec, 55 secs
lola: 55699137 markings, 65077442 edges, 885570 markings/sec, 60 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 60002008 markings, 69995008 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((CR + 1 <= MpG) R (StF + 1 <= Uf))) AND E (((StR <= 1) U ((2 <= MwU) AND (SR <= Ci)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((StR <= 1) U ((2 <= MwU) AND (SR <= Ci))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((StR <= 1) U ((2 <= MwU) AND (SR <= Ci))))
lola: processed formula length: 46
lola: 31 rewrites
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((2 <= MwU) AND (SR <= Ci))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N1000P0-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N1000P0-CTLCardinality-15-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 36014 markings, 36013 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (((CR + 1 <= MpG) R (StF + 1 <= Uf))) AND E (((StR <= 1) U ((2 <= MwU) AND (SR <= Ci)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (((StR <= 1) U ((2 <= MwU) AND (SR <= Ci))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((StR <= 1) U ((2 <= MwU) AND (SR <= Ci))))
lola: processed formula length: 46
lola: 31 rewrites
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((2 <= MwU) AND (SR <= Ci))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N1000P0-CTLCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N1000P0-CTLCardinality-16-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 36014 markings, 36013 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (((CR + 1 <= MpG) R (StF + 1 <= Uf)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (((CR + 1 <= MpG) R (StF + 1 <= Uf)))
lola: processed formula length: 39
lola: 34 rewrites
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (Uf <= StF)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N1000P0-CTLCardinality-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N1000P0-CTLCardinality-17-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 35999 markings, 35998 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no yes no no yes yes no no no no no yes no
lola:
preliminary result: no no no no yes no no yes yes no no no no no yes no
lola: memory consumption: 24736 KB
lola: time consumption: 140 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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="ClientsAndServers-PT-N1000P0"
export BK_EXAMINATION="CTLCardinality"
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/ClientsAndServers-PT-N1000P0.tgz
mv ClientsAndServers-PT-N1000P0 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 ClientsAndServers-PT-N1000P0, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r040-smll-152646357300171"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;