About the Execution of LoLA for DrinkVendingMachine-COL-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
148.360 | 261.00 | 228.00 | 7.50 | TTFTFFTFFFFFTFFF | normal |
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 184K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 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.1K 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.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K 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.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 22K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DrinkVendingMachine-COL-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649937100318
=====================================================================
--------------------
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 DrinkVendingMachine-COL-02-CTLCardinality-00
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-01
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-02
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-03
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-04
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-05
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-06
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-07
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-08
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-09
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-10
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-11
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-12
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-13
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-14
FORMULA_NAME DrinkVendingMachine-COL-02-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526716965586
info: Time: 3600 - MCC
===========================================================================================
prep: translating DrinkVendingMachine-COL-02 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating DrinkVendingMachine-COL-02 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ DrinkVendingMachine-COL-02 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 96/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 24
lola: finding significant places
lola: 24 places, 72 transitions, 12 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 90 transition conflict sets
lola: TASK
lola: reading formula from DrinkVendingMachine-COL-02-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p3 + p2)
lola: LP says that atomic proposition is always false: (3 <= p22 + p23)
lola: LP says that atomic proposition is always false: (3 <= p21 + p20)
lola: LP says that atomic proposition is always false: (3 <= p21 + p20)
lola: LP says that atomic proposition is always false: (3 <= p22 + p23)
lola: always true
lola: always true
lola: LP says that atomic proposition is always false: (3 <= p21 + p20)
lola: always true
lola: (3 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) : NOT(((A (X ((p21 + p20 <= p22 + p23))) OR A (G ((1 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11)))) AND (() AND E (G ((2 <= p3 + p2)))))) : NOT(A (((p0 + p1 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11) U TRUE))) : (E (X (((p22 + p23 <= 0) AND (p0 + p1 <= 1)))) OR ((((p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 <= 0)) OR ((p3 + p2 + 1 <= p0 + p1) AND (p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p22 + p23))) AND (1 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))) : (E (F (((p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p0 + p1)))) OR ((p3 + p2 <= p22 + p23) AND (2 <= p0 + p1) AND (p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 1) AND ((p3 + p2 <= p0 + p1)) AND (p3 + p2 <= p21 + p20))) : E (X ((FALSE AND E (F ((p22 + p23 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))))) : (E (G (((p3 + p2 <= p22 + p23) OR (p0 + p1 <= p22 + p23)))) OR A (F (((p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p3 + p2) AND (p22 + p23 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11) AND (p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 2))))) : (p0 + p1 <= p3 + p2) : A (X ((p21 + p20 <= p0 + p1))) : NOT(((A (G ((p3 + p2 <= p21 + p20))) AND E (X ((p3 + p2 <= p21 + p20)))) OR A (((p3 + p2 <= p22 + p23) U (p3 + p2 <= p21 + p20))))) : E (G (A (X ((p3 + p2 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11))))) : NOT((E (X ((p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))) OR (A (X ((p0 + p1 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11))) AND (2 <= p0 + p1)))) : E (G (E (F ((2 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))))) : A (G (A (((p22 + p23 <= p21 + p20) U (1 <= p0 + p1))))) : A (X (E (G ((1 <= p0 + p1))))) : (((p21 + p20 + 1 <= p22 + p23) OR (3 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11)) AND E (F (E (G (TRUE)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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: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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)
lola: processed formula length: 52
lola: 47 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-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:
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 47 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-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 DrinkVendingMachine-COL-02-CTLCardinality-2 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 47 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-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 DrinkVendingMachine-COL-02-CTLCardinality-5 FALSE 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: (p0 + p1 <= p3 + p2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 + p1 <= p3 + p2)
lola: processed formula length: 20
lola: 47 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: processed formula with 1 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 DrinkVendingMachine-COL-02-CTLCardinality-7 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: ((p21 + p20 + 1 <= p22 + p23) OR (3 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p21 + p20 + 1 <= p22 + p23) OR (3 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11))
lola: processed formula length: 81
lola: 47 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-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: ========================================
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (((p22 + p23 <= 0) AND (p0 + p1 <= 1)))) OR ((((p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 <= 0)) OR ((p3 + p2 + 1 <= p0 + p1) AND (p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p22 + p23))) AND (1 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p22 + p23 <= 0) AND (p0 + p1 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(((p22 + p23 <= 0) AND (p0 + p1 <= 1)))
lola: processed formula length: 41
lola: 48 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 <= 0)) OR ((p3 + p2 + 1 <= p0 + p1) AND (p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p22 + p23))) AND (1 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 <= 0)) OR ((p3 + p2 + 1 <= p0 + p1) AND (p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p22 + p23))) AND (1 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))
lola: processed formula length: 209
lola: 47 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: processed formula with 4 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
========================================
lola: ========================================
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p21 + p20 <= p0 + p1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((p21 + p20 <= p0 + p1))
lola: processed formula length: 26
lola: 48 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola:
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-8 FALSE 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: ((E (F ((p21 + p20 + 1 <= p3 + p2))) OR A (X ((p21 + p20 + 1 <= p3 + p2)))) AND E (((p22 + p23 + 1 <= p3 + p2) R (p21 + p20 + 1 <= p3 + p2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p21 + p20 + 1 <= p3 + p2)))
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 ((p21 + p20 + 1 <= p3 + p2)))
lola: processed formula length: 34
lola: 48 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-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: (p21 + p20 + 1 <= p3 + p2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p22 + p23 + 1 <= p3 + p2) R (p21 + p20 + 1 <= p3 + p2)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:646
lola: rewrite Frontend/Parser/formula_rewrite.k:610
lola: processed formula: E (((p22 + p23 + 1 <= p3 + p2) R (p21 + p20 + 1 <= p3 + p2)))
lola: processed formula length: 61
lola: 49 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: There is no path where Predicate Phi releases Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-9 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 (A (X ((p3 + p2 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(AX((p3 + p2 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11)))))
lola: processed formula length: 76
lola: 49 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11))) AND (E (X ((p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + 1 <= p0 + p1))) OR (p0 + p1 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p0 + p1 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 + p1 <= 1)
lola: processed formula length: 14
lola: 47 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: processed formula with 1 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 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + 1 <= p0 + p1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + 1 <= p0 + p1))
lola: processed formula length: 60
lola: 48 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11))
lola: processed formula length: 98
lola: 48 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((1 <= p0 + p1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: AX(NOT(A(TRUE U (p0 + p1 <= 0))))
lola: processed formula length: 33
lola: 50 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 24 markings, 35 edges
lola: ========================================
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (X ((p22 + p23 + 1 <= p21 + p20))) AND E (F ((p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 <= 0)))) OR A (F ((p3 + p2 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p3 + p2 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (2 <= p3 + p2)
lola: processed formula length: 14
lola: 49 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-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 eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (((p22 + p23 <= p21 + p20) U (1 <= p0 + p1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(A((p22 + p23 <= p21 + p20) U (1 <= p0 + p1)))))
lola: processed formula length: 64
lola: 49 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 55 markings, 152 edges
lola: ========================================
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((2 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (2 <= p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)
lola: processed formula length: 52
lola: 48 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-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: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 3 markings, 3 edges
lola: ========================================
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p0 + p1)))) OR ((p3 + p2 <= p22 + p23) AND (2 <= p0 + p1) AND (p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 1) AND ((p3 + p2 <= p0 + p1)) AND (p3 + p2 <= p21 + p20)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p0 + p1))))
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 (((p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p0 + p1))))
lola: processed formula length: 72
lola: 48 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-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: ((p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p0 + p1))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-02-CTLCardinality-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1008 markings, 6487 edges
lola: ========================================
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p3 + p2 <= p22 + p23) AND (2 <= p0 + p1) AND (p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 1) AND ((p3 + p2 <= p0 + p1)) AND (p3 + p2 <= p21 + p20))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p3 + p2 <= p22 + p23) AND (2 <= p0 + p1) AND (p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 1) AND ((p3 + p2 <= p0 + p1)) AND (p3 + p2 <= p21 + p20))
lola: processed formula length: 154
lola: 47 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: processed formula with 5 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((p3 + p2 <= p22 + p23) OR (p0 + p1 <= p22 + p23)))) OR A (F (((p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p3 + p2) AND (p22 + p23 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11) AND (p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p3 + p2 <= p22 + p23) OR (p0 + p1 <= p22 + p23))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p3 + p2 <= p22 + p23) OR (p0 + p1 <= p22 + p23))))
lola: processed formula length: 59
lola: 47 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-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: 3 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no yes no no yes no no no no no yes no no no
lola:
preliminary result: yes yes no yes no no yes no no no no no yes no no no
lola: memory consumption: 23972 KB
lola: time consumption: 0 seconds
BK_STOP 1526716965847
--------------------
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="DrinkVendingMachine-COL-02"
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/DrinkVendingMachine-COL-02.tgz
mv DrinkVendingMachine-COL-02 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is DrinkVendingMachine-COL-02, 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 r076-blw3-152649937100318"
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 '
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 ;