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 824K
-rw-r--r-- 1 mcc users 3.9K 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.7K 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.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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.2K 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 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 118 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 356 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 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 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 660K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is CloudReconfiguration-PT-316, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r052-smll-152646379900108
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526529550721

info: Time: 3600 - MCC
===========================================================================================
prep: translating CloudReconfiguration-PT-316 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating CloudReconfiguration-PT-316 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ CloudReconfiguration-PT-316 @ 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: 5680/65536 symbol table entries, 639 collisions
lola: preprocessing...
lola: Size of bit vector: 2585
lola: finding significant places
lola: 2585 places, 3095 transitions, 2581 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2708 transition conflict sets
lola: TASK
lola: reading formula from CloudReconfiguration-PT-316-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p95)
lola: LP says that atomic proposition is always false: (2 <= p2048)
lola: LP says that atomic proposition is always false: (2 <= p548)
lola: LP says that atomic proposition is always false: (3 <= p210)
lola: LP says that atomic proposition is always false: (3 <= p2458)
lola: LP says that atomic proposition is always false: (2 <= p170)
lola: LP says that atomic proposition is always false: (3 <= p1058)
lola: LP says that atomic proposition is always false: (3 <= p180)
lola: LP says that atomic proposition is always false: (2 <= p2420)
lola: LP says that atomic proposition is always false: (3 <= p1591)
lola: LP says that atomic proposition is always false: (2 <= p1295)
lola: LP says that atomic proposition is always false: (2 <= p1798)
lola: LP says that atomic proposition is always false: (2 <= p1192)
lola: A (G ((p1726 <= p1849))) : (A (F (A (X (FALSE)))) AND E (F (E (X ((p1150 <= p1407)))))) : E (G ((p1982 <= p477))) : A (G ((p986 <= p2024))) : A (G (((p2167 <= p1792) OR (p2446 + 1 <= p1409) OR ((p337 + 1 <= p987) AND (p869 <= 0))))) : E (X (E (G (((p1358 <= p681) OR (p2240 <= p129)))))) : A (X (A (G (((p150 <= p417)))))) : (((((p1981 <= 0)) AND ((1 <= p680) OR (p519 <= p260))) AND A (X ((p1961 <= 0)))) AND A (F (A (G ((p482 <= p492)))))) : E (((p1431 <= p581) U (1 <= p2170))) : (E (F (FALSE)) OR FALSE) : ((((1 <= p269) AND ((p2450 <= p1258) OR (p2490 <= p950)) AND ((p1916 <= p406) OR ((p393 <= p1650) AND (p458 <= p1326))))) OR E (F ((((p1729 <= p1367) AND (1 <= p1002)))))) : A (G ((p438 <= p111))) : (A (G (A (F (FALSE)))) AND NOT(A (X (((1 <= p748) AND (p398 <= p1286)))))) : ((E (G ((p2218 + 1 <= p980))) OR E (G (((p1965 <= p2315) AND (p1623 <= p322))))) AND (p741 <= 0)) : (NOT(A (F (((1 <= p2369) AND (p2392 <= p622))))) OR (E (((1 <= p1460) U FALSE)) AND ((p2490 + 1 <= p153) OR (p1866 + 1 <= p778)))) : (A (G (((1 <= p2531) OR (p2144 <= p913)))) AND A (G (A (F ((p317 <= p2211))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 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: 26 rewrites
lola: closed formula file CloudReconfiguration-PT-316-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 CloudReconfiguration-PT-316-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 234 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: 26 rewrites
lola: closed formula file CloudReconfiguration-PT-316-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 CloudReconfiguration-PT-316-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((p150 <= p417))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((p417 + 1 <= p150))
lola: processed formula length: 20
lola: 28 rewrites
lola: closed formula file CloudReconfiguration-PT-316-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef 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 /EXEF
lola: The predicate is not invariant from successors.
lola: 8239 markings, 9434 edges
lola: ========================================

FORMULA CloudReconfiguration-PT-316-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p1981 <= 0)) AND ((1 <= p680) OR (p519 <= p260))) AND (A (X ((p1961 <= 0))) AND A (F (A (G ((p482 <= p492)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p1981 <= 0)) AND ((1 <= p680) OR (p519 <= p260)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p1981 <= 0)) AND ((1 <= p680) OR (p519 <= p260)))
lola: processed formula length: 53
lola: 26 rewrites
lola: closed formula file CloudReconfiguration-PT-316-CTLCardinality.task
lola: processed formula with 3 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 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p482 <= p492)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p492 + 1 <= p482)
lola: processed formula length: 18
lola: 28 rewrites
lola: closed formula file CloudReconfiguration-PT-316-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 473 markings, 515 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA CloudReconfiguration-PT-316-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (DEADLOCK)) AND E (X (E (F ((p1150 <= p1407))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:683
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 28 rewrites
lola: closed formula file CloudReconfiguration-PT-316-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: 60 markings, 60 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA CloudReconfiguration-PT-316-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((p1358 <= p681) OR (p2240 <= p129))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:627
lola: processed formula: ((p1358 <= p681) OR (p2240 <= p129))
lola: processed formula length: 37
lola: 27 rewrites
lola: closed formula file CloudReconfiguration-PT-316-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 58 markings, 58 edges
lola: ========================================

FORMULA CloudReconfiguration-PT-316-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p986 <= p2024)))
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 ((p986 <= p2024)))
lola: processed formula length: 23
lola: 28 rewrites
lola: closed formula file CloudReconfiguration-PT-316-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: (p2024 + 1 <= p986)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-316-CTLCardinality-6-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: 51 markings, 50 edges
lola: ========================================

FORMULA CloudReconfiguration-PT-316-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p438 <= p111)))
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 ((p438 <= p111)))
lola: processed formula length: 22
lola: 28 rewrites
lola: closed formula file CloudReconfiguration-PT-316-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: (p111 + 1 <= p438)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-316-CTLCardinality-7-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: 78 markings, 77 edges
lola: ========================================

FORMULA CloudReconfiguration-PT-316-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p1726 <= p1849)))
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 ((p1726 <= p1849)))
lola: processed formula length: 24
lola: 28 rewrites
lola: closed formula file CloudReconfiguration-PT-316-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: (p1849 + 1 <= p1726)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-316-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-316-CTLCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA CloudReconfiguration-PT-316-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p2167 <= p1792) OR (p2446 + 1 <= p1409) OR ((p337 + 1 <= p987) AND (p869 <= 0)))))
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 (((p2167 <= p1792) OR (p2446 + 1 <= p1409) OR ((p337 + 1 <= p987) AND (p869 <= 0)))))
lola: processed formula length: 92
lola: 28 rewrites
lola: closed formula file CloudReconfiguration-PT-316-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: ((p1792 + 1 <= p2167) AND (p1409 <= p2446) AND ((p987 <= p337) OR (1 <= p869)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-316-CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-316-CTLCardinality-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 52 markings, 51 edges
lola: ========================================

FORMULA CloudReconfiguration-PT-316-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 585 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p1982 <= p477)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p1982 <= p477)))
lola: processed formula length: 23
lola: 26 rewrites
lola: closed formula file CloudReconfiguration-PT-316-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: 59 markings, 59 edges
lola: ========================================

FORMULA CloudReconfiguration-PT-316-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 702 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p2369 <= 0) OR (p622 + 1 <= p2392))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p2369 <= 0) OR (p622 + 1 <= p2392))))
lola: processed formula length: 46
lola: 26 rewrites
lola: closed formula file CloudReconfiguration-PT-316-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: 59 markings, 59 edges

FORMULA CloudReconfiguration-PT-316-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 877 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p1431 <= p581) U (1 <= p2170)))
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 (((p1431 <= p581) U (1 <= p2170)))
lola: processed formula length: 36
lola: 29 rewrites
lola: closed formula file CloudReconfiguration-PT-316-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: (1 <= p2170)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-316-CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-316-CTLCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 59554 markings, 159420 edges, 11911 markings/sec, 0 secs
lola: sara is running 5 secs || 113265 markings, 325071 edges, 10742 markings/sec, 5 secs
lola: sara is running 10 secs || 160177 markings, 494881 edges, 9382 markings/sec, 10 secs
lola: sara is running 15 secs || 212395 markings, 652343 edges, 10444 markings/sec, 15 secs
lola: sara is running 20 secs || 257768 markings, 813262 edges, 9075 markings/sec, 20 secs
lola: sara is running 25 secs || 310112 markings, 977906 edges, 10469 markings/sec, 25 secs
lola: sara is running 30 secs || 362387 markings, 1143203 edges, 10455 markings/sec, 30 secs
lola: sara is running 35 secs || 409368 markings, 1312125 edges, 9396 markings/sec, 35 secs
lola: sara is running 40 secs || 457543 markings, 1480947 edges, 9635 markings/sec, 40 secs
lola: sara is running 45 secs || 507994 markings, 1647772 edges, 10090 markings/sec, 45 secs
lola: sara is running 50 secs || 553544 markings, 1816978 edges, 9110 markings/sec, 50 secs
lola: sara is running 55 secs || 596970 markings, 1990097 edges, 8685 markings/sec, 55 secs
lola: sara is running 60 secs || 632209 markings, 2169612 edges, 7048 markings/sec, 60 secs
lola: sara is running 65 secs || 673971 markings, 2333565 edges, 8352 markings/sec, 65 secs
lola: sara is running 70 secs || 712043 markings, 2499433 edges, 7614 markings/sec, 70 secs
lola: sara is running 75 secs || 749463 markings, 2663257 edges, 7484 markings/sec, 75 secs
lola: sara is running 80 secs || 792413 markings, 2834475 edges, 8590 markings/sec, 80 secs
lola: sara is running 85 secs || 835622 markings, 3009573 edges, 8642 markings/sec, 85 secs
lola: sara is running 90 secs || 876022 markings, 3188640 edges, 8080 markings/sec, 90 secs
lola: sara is running 95 secs || 912113 markings, 3371139 edges, 7218 markings/sec, 95 secs
lola: sara is running 100 secs || 953335 markings, 3547324 edges, 8244 markings/sec, 100 secs
lola: sara is running 105 secs || 997530 markings, 3700362 edges, 8839 markings/sec, 105 secs
lola: sara is running 110 secs || 1057026 markings, 3850514 edges, 11899 markings/sec, 110 secs
lola: sara is running 115 secs || 1107646 markings, 4007134 edges, 10124 markings/sec, 115 secs
lola: sara is running 120 secs || 1165125 markings, 4155927 edges, 11496 markings/sec, 120 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 1190516 markings, 4239503 edges
lola: ========================================

FORMULA CloudReconfiguration-PT-316-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1127 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p269) AND ((p2450 <= p1258) OR (p2490 <= p950)) AND ((p1916 <= p406) OR ((p393 <= p1650) AND (p458 <= p1326))))) OR E (F ((((p1729 <= p1367) AND (1 <= p1002))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1127 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p269) AND ((p2450 <= p1258) OR (p2490 <= p950)) AND ((p1916 <= p406) OR ((p393 <= p1650) AND (p458 <= p1326)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p269) AND ((p2450 <= p1258) OR (p2490 <= p950)) AND ((p1916 <= p406) OR ((p393 <= p1650) AND (p458 <= p1326)))))
lola: processed formula length: 122
lola: 26 rewrites
lola: closed formula file CloudReconfiguration-PT-316-CTLCardinality.task
lola: processed formula with 6 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 1691 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1729 <= p1367) AND (1 <= p1002)))))
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 ((((p1729 <= p1367) AND (1 <= p1002)))))
lola: processed formula length: 45
lola: 27 rewrites
lola: closed formula file CloudReconfiguration-PT-316-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: (((p1729 <= p1367) AND (1 <= p1002)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-316-CTLCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-316-CTLCardinality-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 55 markings, 54 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
========================================

FORMULA CloudReconfiguration-PT-316-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1691 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (G ((p2218 + 1 <= p980))) OR E (G (((p1965 <= p2315) AND (p1623 <= p322))))) AND (p741 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1691 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p2218 + 1 <= p980)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p2218 + 1 <= p980)))
lola: processed formula length: 27
lola: 26 rewrites
lola: closed formula file CloudReconfiguration-PT-316-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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p741 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p741 <= 0)
lola: processed formula length: 11
lola: 26 rewrites
lola: closed formula file CloudReconfiguration-PT-316-CTLCardinality.task
lola: processed formula with 1 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: 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: subprocess 15 will run for 3383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((1 <= p2531) OR (p2144 <= p913)))) AND A (G (A (F ((p317 <= p2211))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p2531) OR (p2144 <= p913))))
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 <= p2531) OR (p2144 <= p913))))
lola: processed formula length: 42
lola: 28 rewrites
lola: closed formula file CloudReconfiguration-PT-316-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: ((p2531 <= 0) AND (p913 + 1 <= p2144))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-316-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-316-CTLCardinality-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 217 markings, 222 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.

FORMULA CloudReconfiguration-PT-316-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================lola: ========================================
lola: ...considering subproblem: ((E (G ((p2218 + 1 <= p980))) OR E (G (((p1965 <= p2315) AND (p1623 <= p322))))) AND (p741 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING

lola: ========================================
lola: ...considering subproblem: E (G ((p2218 + 1 <= p980)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p2218 + 1 <= p980)))
lola: processed formula length: 27
lola: 26 rewrites
lola: closed formula file CloudReconfiguration-PT-316-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: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (p741 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p741 <= 0)
lola: processed formula length: 11
lola: 26 rewrites
lola: closed formula file CloudReconfiguration-PT-316-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: ...considering subproblem: E (G (((p1965 <= p2315) AND (p1623 <= p322))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p1965 <= p2315) AND (p1623 <= p322))))
lola: processed formula length: 46
lola: 26 rewrites
lola: closed formula file CloudReconfiguration-PT-316-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: 59 markings, 59 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA CloudReconfiguration-PT-316-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no no yes no no yes no yes no no yes yes no
lola:
preliminary result: no no yes no no yes no no yes no yes no no yes yes no
lola: memory consumption: 29492 KB
lola: time consumption: 187 seconds

BK_STOP 1526529737741

--------------------
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="CloudReconfiguration-PT-316"
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/CloudReconfiguration-PT-316.tgz
mv CloudReconfiguration-PT-316 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 CloudReconfiguration-PT-316, 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 r052-smll-152646379900108"
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 ;