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 604K
-rw-r--r-- 1 mcc users 3.1K May 29 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 29 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 28 11:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 28 11:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 28 09:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 09:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 28 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 28 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.9K May 27 05:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 27 05:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.3K May 26 06:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 26 06:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 436K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ASLink-PT-04a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145200057
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527807225219

info: Time: 3600 - MCC
===========================================================================================
prep: translating ASLink-PT-04a 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 ASLink-PT-04a formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ ASLink-PT-04a @ 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: 2570/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: Size of bit vector: 1016
lola: finding significant places
lola: 1016 places, 1554 transitions, 822 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1760 transition conflict sets
lola: TASK
lola: reading formula from ASLink-PT-04a-CTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p944)
lola: LP says that atomic proposition is always false: (2 <= p887)
lola: LP says that atomic proposition is always false: (3 <= p529)
lola: LP says that atomic proposition is always false: (3 <= p766)
lola: LP says that atomic proposition is always false: (3 <= p206)
lola: LP says that atomic proposition is always false: (3 <= p440)
lola: LP says that atomic proposition is always false: (3 <= p287)
lola: LP says that atomic proposition is always false: (3 <= p82)
lola: E (G (((p595 + 1 <= p41) OR (p289 <= 0) OR ((p298 + 1 <= p413))))) : A (F (((p309 + 1 <= p5) AND (p280 <= p612)))) : E (F (E (G ((p568 <= p100))))) : NOT((E (F ((1 <= p99))) OR (E (G (FALSE)) AND A (F ((1 <= p553)))))) : (E (F (E (X ((1 <= p643))))) AND (A (X ((p351 <= p509))) OR ((p912 <= p806) AND ((p332 <= 0) OR (p463 <= 0))))) : A (F ((((p929 <= 0) AND (p100 + 1 <= p34)) OR ((p544 + 1 <= p995) AND (p276 + 1 <= p683))))) : A (X (A (G ((p872 <= p252))))) : E (((p882 <= p610) U A (G ((p836 <= p284))))) : A (F (E (X ((1 <= p321))))) : NOT(E (F (E (G ((p276 <= p85)))))) : E (F (NOT(E (X ((p396 <= p46)))))) : A (G (A (F ((p581 + 1 <= p63))))) : (E (F (FALSE)) OR ((A (F ((p637 <= p175))) AND FALSE) OR E (G (())))) : ((A (G (((p532 <= p165)))) OR E (G ((1 <= p555)))) OR E (X (E (X ((1 <= p856)))))) : NOT(E (F ((((1 <= p654)) AND (p695 <= 0))))) : ((p140 <= p521) AND (E (G ((p431 <= p1003))) AND (p239 <= p192)))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
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: 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:395
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:117
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 216 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: 31 rewrites
lola: closed formula file ASLink-PT-04a-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 ASLink-PT-04a-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 231 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p872 <= p252)))))
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: (p252 + 1 <= p872)
lola: processed formula length: 18
lola: 33 rewrites
lola: closed formula file ASLink-PT-04a-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: 8 markings, 7 edges
lola: ========================================

FORMULA ASLink-PT-04a-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((1 <= p321)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U EX((1 <= p321)))
lola: processed formula length: 25
lola: 33 rewrites
lola: closed formula file ASLink-PT-04a-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: 43 markings, 42 edges
lola: ========================================

FORMULA ASLink-PT-04a-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 266 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((p46 + 1 <= p396)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX((p46 + 1 <= p396)))
lola: processed formula length: 31
lola: 33 rewrites
lola: closed formula file ASLink-PT-04a-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 43 markings, 42 edges
lola: ========================================

FORMULA ASLink-PT-04a-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((1 <= p643))))) AND (A (X ((p351 <= p509))) OR ((p912 <= p806) AND ((p332 <= 0) OR (p463 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p912 <= p806) AND ((p332 <= 0) OR (p463 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p912 <= p806) AND ((p332 <= 0) OR (p463 <= 0)))
lola: processed formula length: 50
lola: 31 rewrites
lola: closed formula file ASLink-PT-04a-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 5 will run for 315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((1 <= p643)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (1 <= p643)
lola: processed formula length: 11
lola: 32 rewrites
lola: closed formula file ASLink-PT-04a-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: 186428 markings, 209761 edges, 37286 markings/sec, 0 secs
lola: 387052 markings, 436746 edges, 40125 markings/sec, 5 secs
lola: 589623 markings, 663419 edges, 40514 markings/sec, 10 secs
lola: 790306 markings, 890910 edges, 40137 markings/sec, 15 secs
lola: 992789 markings, 1115672 edges, 40497 markings/sec, 20 secs
lola: 1192218 markings, 1341511 edges, 39886 markings/sec, 25 secs
lola: 1392643 markings, 1566847 edges, 40085 markings/sec, 30 secs
lola: 1554806 markings, 1817770 edges, 32433 markings/sec, 35 secs
lola: 1738822 markings, 2053344 edges, 36803 markings/sec, 40 secs
lola: 1926862 markings, 2289270 edges, 37608 markings/sec, 45 secs
lola: 2114174 markings, 2525767 edges, 37462 markings/sec, 50 secs
lola: 2298041 markings, 2759955 edges, 36773 markings/sec, 55 secs
lola: 2472491 markings, 2993676 edges, 34890 markings/sec, 60 secs
lola: 2644902 markings, 3234290 edges, 34482 markings/sec, 65 secs
lola: 2827025 markings, 3467122 edges, 36425 markings/sec, 70 secs
lola: 3006029 markings, 3705425 edges, 35801 markings/sec, 75 secs
lola: 3191293 markings, 3938570 edges, 37053 markings/sec, 80 secs
lola: 3369673 markings, 4173880 edges, 35676 markings/sec, 85 secs
lola: 3551170 markings, 4410928 edges, 36299 markings/sec, 90 secs
lola: 3744177 markings, 4640259 edges, 38601 markings/sec, 95 secs
lola: 3926629 markings, 4875474 edges, 36490 markings/sec, 100 secs
lola: 4119009 markings, 5104131 edges, 38476 markings/sec, 105 secs
lola: 4300270 markings, 5337984 edges, 36252 markings/sec, 110 secs
lola: 4481299 markings, 5574238 edges, 36206 markings/sec, 115 secs
lola: 4666174 markings, 5809050 edges, 36975 markings/sec, 120 secs
lola: 4854261 markings, 6041522 edges, 37617 markings/sec, 125 secs
lola: 5041209 markings, 6273764 edges, 37390 markings/sec, 130 secs
lola: 5227581 markings, 6508197 edges, 37274 markings/sec, 135 secs
lola: 5414452 markings, 6740113 edges, 37374 markings/sec, 140 secs
lola: 5595347 markings, 6982179 edges, 36179 markings/sec, 145 secs
lola: 5787027 markings, 7214478 edges, 38336 markings/sec, 150 secs
lola: 5986140 markings, 7441885 edges, 39823 markings/sec, 155 secs
lola: 6188279 markings, 7668020 edges, 40428 markings/sec, 160 secs
lola: 6372794 markings, 7898619 edges, 36903 markings/sec, 165 secs
lola: 6557123 markings, 8136389 edges, 36866 markings/sec, 170 secs
lola: 6744874 markings, 8368619 edges, 37550 markings/sec, 175 secs
lola: 6947083 markings, 8595198 edges, 40442 markings/sec, 180 secs
lola: 7147941 markings, 8819851 edges, 40172 markings/sec, 185 secs
lola: 7315249 markings, 9062781 edges, 33462 markings/sec, 190 secs
lola: 7503800 markings, 9292154 edges, 37710 markings/sec, 195 secs
lola: 7739462 markings, 9557594 edges, 47132 markings/sec, 200 secs
lola: 7985599 markings, 9826908 edges, 49227 markings/sec, 205 secs
lola: 8223106 markings, 10092485 edges, 47501 markings/sec, 210 secs
lola: 8462783 markings, 10351512 edges, 47935 markings/sec, 215 secs
lola: 8706198 markings, 10618186 edges, 48683 markings/sec, 220 secs
lola: 8949165 markings, 10882914 edges, 48593 markings/sec, 225 secs
lola: 9189836 markings, 11146259 edges, 48134 markings/sec, 230 secs
lola: 9434369 markings, 11415903 edges, 48907 markings/sec, 235 secs
lola: 9679595 markings, 11686734 edges, 49045 markings/sec, 240 secs
lola: 9922475 markings, 11951661 edges, 48576 markings/sec, 245 secs
lola: 10164432 markings, 12217992 edges, 48391 markings/sec, 250 secs
lola: 10405281 markings, 12482582 edges, 48170 markings/sec, 255 secs
lola: 10648698 markings, 12750824 edges, 48683 markings/sec, 260 secs
lola: 10892766 markings, 13020616 edges, 48814 markings/sec, 265 secs
lola: 11137599 markings, 13291537 edges, 48967 markings/sec, 270 secs
lola: 11381916 markings, 13558129 edges, 48863 markings/sec, 275 secs
lola: 11624600 markings, 13825860 edges, 48537 markings/sec, 280 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown no unknown no unknown yes unknown no unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown no unknown no unknown yes unknown no unknown unknown unknown
lola: memory consumption: 773556 KB
lola: time consumption: 391 seconds
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown no unknown no unknown yes unknown no unknown unknown unknown
lola: memory consumption: 773912 KB
lola: time consumption: 391 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p532 <= p165)))) OR (E (G ((1 <= p555))) OR E (X (E (X ((1 <= p856)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p555)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((1 <= p555)))
lola: processed formula length: 19
lola: 31 rewrites
lola: closed formula file ASLink-PT-04a-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 6 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p532 <= p165))))
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 (((p532 <= p165))))
lola: processed formula length: 24
lola: 33 rewrites
lola: closed formula file ASLink-PT-04a-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: ((p165 + 1 <= p532))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (X ((1 <= p856)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(EX((1 <= p856)))
lola: processed formula length: 19
lola: 33 rewrites
lola: closed formula file ASLink-PT-04a-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 ASLink-PT-04a-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p99 <= 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:695
lola: processed formula: A (G ((p99 <= 0)))
lola: processed formula length: 18
lola: 33 rewrites
lola: closed formula file ASLink-PT-04a-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: (1 <= p99)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ASLink-PT-04a-CTLCardinality-6-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 28 markings, 27 edges
lola:
FORMULA ASLink-PT-04a-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 7 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p654 <= 0)) OR (1 <= p695))))
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 ((((p654 <= 0)) OR (1 <= p695))))
lola: processed formula length: 39
lola: 33 rewrites
lola: closed formula file ASLink-PT-04a-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: (((1 <= p654)) AND (p695 <= 0))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ASLink-PT-04a-CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ASLink-PT-04a-CTLCardinality-7-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 ASLink-PT-04a-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 397 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p85 + 1 <= p276)))))
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:695
lola: processed formula: (p276 <= p85)
lola: processed formula length: 13
lola: 33 rewrites
lola: closed formula file ASLink-PT-04a-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: 129 markings, 128 edges
lola: ========================================

FORMULA ASLink-PT-04a-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 454 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p568 <= p100)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (p568 <= p100)
lola: processed formula length: 14
lola: 32 rewrites
lola: closed formula file ASLink-PT-04a-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: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 129 markings, 128 edges
lola: ========================================

FORMULA ASLink-PT-04a-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 529 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p581 + 1 <= p63)))))
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: (p63 <= p581)
lola: processed formula length: 13
lola: 33 rewrites
lola: closed formula file ASLink-PT-04a-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: 129 markings, 128 edges
lola: ========================================

FORMULA ASLink-PT-04a-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 635 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p309 + 1 <= p5) AND (p280 <= p612))))
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: ((p5 <= p309) OR (p612 + 1 <= p280))
lola: processed formula length: 37
lola: 33 rewrites
lola: closed formula file ASLink-PT-04a-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: 129 markings, 128 edges
lola: ========================================

FORMULA ASLink-PT-04a-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 794 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p595 + 1 <= p41) OR (p289 <= 0) OR ((p298 + 1 <= p413)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p595 + 1 <= p41) OR (p289 <= 0) OR ((p298 + 1 <= p413)))))
lola: processed formula length: 68
lola: 31 rewrites
lola: closed formula file ASLink-PT-04a-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: 129 markings, 128 edges
lola: ========================================

FORMULA ASLink-PT-04a-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1059 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p929 <= 0) AND (p100 + 1 <= p34)) OR ((p544 + 1 <= p995) AND (p276 + 1 <= p683)))))
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: (((1 <= p929) OR (p34 <= p100)) AND ((p995 <= p544) OR (p683 <= p276)))
lola: processed formula length: 73
lola: 33 rewrites
lola: closed formula file ASLink-PT-04a-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: 129 markings, 128 edges
lola: ========================================

FORMULA ASLink-PT-04a-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p882 <= p610) U A (G ((p836 <= p284)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E((p882 <= p610) U NOT(E(TRUE U (p284 + 1 <= p836))))
lola: processed formula length: 53
lola: 34 rewrites
lola: closed formula file ASLink-PT-04a-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: 350265 markings, 591644 edges, 70053 markings/sec, 0 secs
lola: 590875 markings, 1208901 edges, 48122 markings/sec, 5 secs
lola: 874997 markings, 1810165 edges, 56824 markings/sec, 10 secs
lola: 1112268 markings, 2418437 edges, 47454 markings/sec, 15 secs
lola: 1361229 markings, 3019879 edges, 49792 markings/sec, 20 secs
lola: 1547750 markings, 3640152 edges, 37304 markings/sec, 25 secs
lola: 1811256 markings, 4240734 edges, 52701 markings/sec, 30 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1956638 markings, 4653237 edges

FORMULA ASLink-PT-04a-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3140 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p140 <= p521) AND (E (G ((p431 <= p1003))) AND (p239 <= p192)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: time limit reached - aborting
lola:
preliminary result: yes no yes no unknown no no yes no no yes no no no no unknown
lola:
preliminary result: yes no yes no unknown no no yes no no yes no no no no unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: yes no yes no unknown no no yes no no yes no no no no unknown
lola: memory consumption: 24896 KB
lola: time consumption: 3570 seconds
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 24896 KB
lola: time consumption: 3570 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="ASLink-PT-04a"
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/ASLink-PT-04a.tgz
mv ASLink-PT-04a 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 ASLink-PT-04a, 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 r268-smll-152749145200057"
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 ;