fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r280-csrt-152749170400732
Last Updated
June 26, 2018

About the Execution of LoLA for RefineWMG-PT-050050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.090 680498.00 689801.00 4498.20 ??F?F???T??T?T?T 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 276K
-rw-r--r-- 1 mcc users 3.4K May 30 22:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 30 22:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 16:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 29 16:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.2K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 28 11:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 11:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 09:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K May 28 09:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.6K May 28 07:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 28 07:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 26 06:33 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 26 06:33 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 27 05:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 27 05:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 7 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 109K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RefineWMG-PT-050050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749170400732

=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527825737823

info: Time: 3600 - MCC
===========================================================================================
prep: translating RefineWMG-PT-050050 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RefineWMG-PT-050050 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ RefineWMG-PT-050050 @ 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: 457/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8128
lola: finding significant places
lola: 254 places, 203 transitions, 152 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 254 transition conflict sets
lola: TASK
lola: reading formula from RefineWMG-PT-050-050-CTLCardinality.task
lola: NOT(E ((((p215 <= psecond) AND (p110 <= p231)) U (p3 <= pterce)))) : E (((2 <= p39) U A (G ((2 <= p174))))) : A (X (A (G (((p114 <= p92) OR (p200 <= p13)))))) : NOT(NOT((A (G ((p12 <= p171))) OR A (G ((2 <= p42)))))) : (E (X (((p7 <= p112) AND (p210 <= 0)))) AND (((2 <= p204) AND A (G ((p97 <= p7)))) AND E (F (((p206 <= p242) OR (2 <= p216)))))) : E (F (NOT(E (F ((p117 <= p197)))))) : E ((((1 <= p229) OR (p107 <= p173) OR (p150 <= p102)) U A (G ((p185 <= p221))))) : A (X (E (F (((2 <= p91) AND (p224 <= p174)))))) : (A (X ((p13 + 1 <= p116))) OR E (F (((2 <= p201) AND (3 <= p117) AND (2 <= p121))))) : ((((p207 + 1 <= p109) AND (p55 + 1 <= p205) AND (p154 <= p233)) OR ((p36 + 1 <= p110) AND (3 <= p215))) OR A (G (E (F ((p43 <= p81)))))) : NOT((E (F (((3 <= p116) OR (1 <= p32)))) AND ((p11 + 1 <= p250) OR E (F ((2 <= p244)))))) : E (F ((3 <= p222))) : (A (G (((p194 + 1 <= p173) OR (p131 <= 0)))) OR (3 <= p141)) : E (F ((3 <= p175))) : (NOT(A (((3 <= p160) U (p105 <= p183)))) OR E (F (((p46 + 1 <= p151) AND ((1 <= p80) OR (1 <= p17)))))) : E (F ((1 <= p121)))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:315
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((p114 <= p92) OR (p200 <= p13))))))
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: ((p92 + 1 <= p114) AND (p13 + 1 <= p200))
lola: processed formula length: 41
lola: 37 rewrites
lola: closed formula file RefineWMG-PT-050-050-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: 135 markings, 172 edges
lola: ========================================

FORMULA RefineWMG-PT-050-050-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (((p7 <= p112) AND (p210 <= 0)))) AND ((2 <= p204) AND (A (G ((p97 <= p7))) AND E (F (((p206 <= p242) OR (2 <= p216)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p204)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p204)
lola: processed formula length: 11
lola: 35 rewrites
lola: closed formula file RefineWMG-PT-050-050-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: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p97 <= p7)))
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 ((p97 <= p7)))
lola: processed formula length: 19
lola: 37 rewrites
lola: closed formula file RefineWMG-PT-050-050-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: (p7 + 1 <= p97)
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: 23 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RefineWMG-PT-050-050-CTLCardinality-4 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: A (X (E (F (((2 <= p91) AND (p224 <= p174))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(E(TRUE U ((2 <= p91) AND (p224 <= p174))))
lola: processed formula length: 45
lola: 37 rewrites
lola: closed formula file RefineWMG-PT-050-050-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: 1902115 markings, 2377642 edges, 380423 markings/sec, 0 secs
lola: 3628769 markings, 4535961 edges, 345331 markings/sec, 5 secs
lola: 5479635 markings, 6849543 edges, 370173 markings/sec, 10 secs
lola: 7472403 markings, 9340503 edges, 398554 markings/sec, 15 secs
lola: 9506039 markings, 11882549 edges, 406727 markings/sec, 20 secs
lola: 11482407 markings, 14353009 edges, 395274 markings/sec, 25 secs
lola: 13492463 markings, 16865578 edges, 402011 markings/sec, 30 secs
lola: 15478169 markings, 19347711 edges, 397141 markings/sec, 35 secs
lola: 17422635 markings, 21778294 edges, 388893 markings/sec, 40 secs
lola: 19397089 markings, 24246361 edges, 394891 markings/sec, 45 secs
lola: 21347404 markings, 26684255 edges, 390063 markings/sec, 50 secs
lola: 23300650 markings, 29125812 edges, 390649 markings/sec, 55 secs
lola: 25199914 markings, 31499891 edges, 379853 markings/sec, 60 secs
lola: 27129415 markings, 33911769 edges, 385900 markings/sec, 65 secs
lola: 29189880 markings, 36487350 edges, 412093 markings/sec, 70 secs
lola: 31252277 markings, 39065346 edges, 412479 markings/sec, 75 secs
lola: 33306747 markings, 41633434 edges, 410894 markings/sec, 80 secs
lola: 35390886 markings, 44238606 edges, 416828 markings/sec, 85 secs
lola: 37258336 markings, 46572920 edges, 373490 markings/sec, 90 secs
lola: 39070189 markings, 48837736 edges, 362371 markings/sec, 95 secs
lola: 40832377 markings, 51040471 edges, 352438 markings/sec, 100 secs
lola: 42672732 markings, 53340915 edges, 368071 markings/sec, 105 secs
lola: 44676983 markings, 55846228 edges, 400850 markings/sec, 110 secs
lola: 46712451 markings, 58390562 edges, 407094 markings/sec, 115 secs
lola: 48741227 markings, 60926534 edges, 405755 markings/sec, 120 secs
lola: 50760242 markings, 63450301 edges, 403803 markings/sec, 125 secs
lola: 52796271 markings, 65995338 edges, 407206 markings/sec, 130 secs
lola: 54759888 markings, 68449860 edges, 392723 markings/sec, 135 secs
lola: 56766611 markings, 70958262 edges, 401345 markings/sec, 140 secs
lola: 58657643 markings, 73322053 edges, 378206 markings/sec, 145 secs
lola: 60451979 markings, 75564973 edges, 358867 markings/sec, 150 secs
lola: 62204397 markings, 77755496 edges, 350484 markings/sec, 155 secs
lola: 64030353 markings, 80037941 edges, 365191 markings/sec, 160 secs
lola: 65758733 markings, 82198416 edges, 345676 markings/sec, 165 secs
lola: 67576200 markings, 84470250 edges, 363493 markings/sec, 170 secs
lola: 69339554 markings, 86674442 edges, 352671 markings/sec, 175 secs
lola: 71108343 markings, 88885428 edges, 353758 markings/sec, 180 secs
lola: 72903903 markings, 91129879 edges, 359112 markings/sec, 185 secs
lola: 74678723 markings, 93348404 edges, 354964 markings/sec, 190 secs
lola: 76457382 markings, 95571727 edges, 355732 markings/sec, 195 secs
lola: 78219686 markings, 97774606 edges, 352461 markings/sec, 200 secs
lola: 79965461 markings, 99956826 edges, 349155 markings/sec, 205 secs
lola: 81703998 markings, 102129996 edges, 347707 markings/sec, 210 secs
lola: 83501470 markings, 104376837 edges, 359494 markings/sec, 215 secs
lola: 85246746 markings, 106558432 edges, 349055 markings/sec, 220 secs
lola: 87060075 markings, 108825094 edges, 362666 markings/sec, 225 secs
lola: 88895825 markings, 111119780 edges, 367150 markings/sec, 230 secs
lola: 88972007 markings, 111215007 edges, 15236 markings/sec, 235 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((p13 + 1 <= p116))) OR E (F (((2 <= p201) AND (3 <= p117) AND (2 <= p121)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p201) AND (3 <= p117) AND (2 <= p121))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((2 <= p201) AND (3 <= p117) AND (2 <= p121))))
lola: processed formula length: 53
lola: 36 rewrites
lola: closed formula file RefineWMG-PT-050-050-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((2 <= p201) AND (3 <= p117) AND (2 <= p121))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 90 markings, 89 edges
lola: state equation: write sara problem file to RefineWMG-PT-050-050-CTLCardinality-3-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: state equation: calling and running sara

FORMULA RefineWMG-PT-050-050-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p222)))
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 ((3 <= p222)))
lola: processed formula length: 19
lola: 36 rewrites
lola: closed formula file RefineWMG-PT-050-050-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: (3 <= p222)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: state equation: write sara problem file to RefineWMG-PT-050-050-CTLCardinality-4-0.sara
lola: ========================================

FORMULA RefineWMG-PT-050-050-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p175)))
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 ((3 <= p175)))
lola: processed formula length: 19
lola: 36 rewrites
lola: closed formula file RefineWMG-PT-050-050-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: (3 <= p175)
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: 4 markings, 3 edges
sara: try reading problem file RefineWMG-PT-050-050-CTLCardinality-3-0.sara.
lola:
FORMULA RefineWMG-PT-050-050-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic
lola: subprocess 6 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p121)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: state equation: write sara problem file to RefineWMG-PT-050-050-CTLCardinality-5-0.sara
rewrite Frontend/Parser/formula_rewrite.k:625
lola: ========================================
lola: processed formula: E (F ((1 <= p121)))
lola: processed formula length: 19
lola: 36 rewrites
lola: closed formula file RefineWMG-PT-050-050-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: (1 <= p121)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-050-050-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-050-050-CTLCardinality-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================

FORMULA RefineWMG-PT-050-050-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p197 + 1 <= p117)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (p117 <= p197)
lola: processed formula length: 14
lola: 37 rewrites
lola: closed formula file RefineWMG-PT-050-050-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING

lola: 1883912 markings, 2835171 edges, 376782 markings/sec, 0 secs
lola: 3680224 markings, 5538545 edges, 359262 markings/sec, 5 secs
lola: 5541200 markings, 8339213 edges, 372195 markings/sec, 10 secs
lola: 7374334 markings, 11097997 edges, 366627 markings/sec, 15 secs
lola: 9224325 markings, 13882147 edges, 369998 markings/sec, 20 secs
lola: 11074645 markings, 16666786 edges, 370064 markings/sec, 25 secs
lola: 12955344 markings, 19497135 edges, 376140 markings/sec, 30 secs
lola: 14810322 markings, 22288791 edges, 370996 markings/sec, 35 secs
lola: 16699734 markings, 25132264 edges, 377882 markings/sec, 40 secs
lola: 18587311 markings, 27972968 edges, 377515 markings/sec, 45 secs
lola: 20458360 markings, 30788817 edges, 374210 markings/sec, 50 secs
lola: 22332278 markings, 33608952 edges, 374784 markings/sec, 55 secs
lola: 24025325 markings, 36156899 edges, 338609 markings/sec, 60 secs
lola: 25720078 markings, 38707431 edges, 338951 markings/sec, 65 secs
lola: 27455596 markings, 41319289 edges, 347104 markings/sec, 70 secs
lola: 29236647 markings, 43999691 edges, 356210 markings/sec, 75 secs
lola: 30978231 markings, 46620696 edges, 348317 markings/sec, 80 secs
lola: 32751397 markings, 49289218 edges, 354633 markings/sec, 85 secs
lola: 34570557 markings, 52026960 edges, 363832 markings/sec, 90 secs
lola: 36376140 markings, 54744277 edges, 361117 markings/sec, 95 secs
lola: 38172141 markings, 57447179 edges, 359200 markings/sec, 100 secs
lola: 39714470 markings, 59768286 edges, 308466 markings/sec, 105 secs
lola: 41355127 markings, 62237400 edges, 328131 markings/sec, 110 secs
lola: 43166148 markings, 64962893 edges, 362204 markings/sec, 115 secs
lola: 44969219 markings, 67676434 edges, 360614 markings/sec, 120 secs
lola: 46783832 markings, 70407338 edges, 362923 markings/sec, 125 secs
lola: 47574211 markings, 71596817 edges, 158076 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((2 <= p39) U A (G ((2 <= p174)))))
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((2 <= p39) U NOT(E(TRUE U (p174 <= 1))))
lola: processed formula length: 42
lola: 38 rewrites
lola: closed formula file RefineWMG-PT-050-050-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: 1740206 markings, 2610298 edges, 348041 markings/sec, 0 secs
lola: 3476283 markings, 5214414 edges, 347215 markings/sec, 5 secs
lola: 5200954 markings, 7801416 edges, 344934 markings/sec, 10 secs
lola: 6915698 markings, 10373543 edges, 342949 markings/sec, 15 secs
lola: 8630166 markings, 12945226 edges, 342894 markings/sec, 20 secs
lola: 10300749 markings, 15451108 edges, 334117 markings/sec, 25 secs
lola: 11940631 markings, 17910944 edges, 327976 markings/sec, 30 secs
lola: 13609383 markings, 20414058 edges, 333750 markings/sec, 35 secs
lola: 15269071 markings, 22903593 edges, 331938 markings/sec, 40 secs
lola: 16926892 markings, 25390333 edges, 331564 markings/sec, 45 secs
lola: 18578594 markings, 27867888 edges, 330340 markings/sec, 50 secs
lola: 20229248 markings, 30343869 edges, 330131 markings/sec, 55 secs
lola: 21868720 markings, 32803070 edges, 327894 markings/sec, 60 secs
lola: 23430575 markings, 35145836 edges, 312371 markings/sec, 65 secs
lola: 24853378 markings, 37280044 edges, 284561 markings/sec, 70 secs
lola: 26315331 markings, 39472975 edges, 292391 markings/sec, 75 secs
lola: 27976086 markings, 41964111 edges, 332151 markings/sec, 80 secs
lola: 29495969 markings, 44243946 edges, 303977 markings/sec, 85 secs
lola: 30902564 markings, 46353831 edges, 281319 markings/sec, 90 secs
lola: 32302943 markings, 48454388 edges, 280076 markings/sec, 95 secs
lola: 33813291 markings, 50719928 edges, 302070 markings/sec, 100 secs
lola: 35471196 markings, 53206784 edges, 331581 markings/sec, 105 secs
lola: 37088119 markings, 55632178 edges, 323385 markings/sec, 110 secs
lola: 38736648 markings, 58104969 edges, 329706 markings/sec, 115 secs
lola: 40360521 markings, 60540763 edges, 324775 markings/sec, 120 secs
lola: 42018243 markings, 63027341 edges, 331544 markings/sec, 125 secs
lola: 43692762 markings, 65539122 edges, 334904 markings/sec, 130 secs
lola: 44733328 markings, 67099991 edges, 208113 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 434 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p229) OR (p107 <= p173) OR (p150 <= p102)) U A (G ((p185 <= p221)))))
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(((1 <= p229) OR (p107 <= p173) OR (p150 <= p102)) U NOT(E(TRUE U (p221 + 1 <= p185))))
lola: processed formula length: 90
lola: 38 rewrites
lola: closed formula file RefineWMG-PT-050-050-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: 1788271 markings, 2682404 edges, 357654 markings/sec, 0 secs
lola: 3483623 markings, 5225427 edges, 339070 markings/sec, 5 secs
lola: 5217311 markings, 7825962 edges, 346738 markings/sec, 10 secs
lola: 6943431 markings, 10415137 edges, 345224 markings/sec, 15 secs
lola: 8659780 markings, 12989658 edges, 343270 markings/sec, 20 secs
lola: 10347344 markings, 15520990 edges, 337513 markings/sec, 25 secs
lola: 12081236 markings, 18121830 edges, 346778 markings/sec, 30 secs
lola: 13776156 markings, 20664217 edges, 338984 markings/sec, 35 secs
lola: 15506399 markings, 23259573 edges, 346049 markings/sec, 40 secs
lola: 17217805 markings, 25826707 edges, 342281 markings/sec, 45 secs
lola: 18918805 markings, 28378184 edges, 340200 markings/sec, 50 secs
lola: 20623922 markings, 30935868 edges, 341023 markings/sec, 55 secs
lola: 22333513 markings, 33500269 edges, 341918 markings/sec, 60 secs
lola: 24014055 markings, 36021077 edges, 336108 markings/sec, 65 secs
lola: 25633822 markings, 38450730 edges, 323953 markings/sec, 70 secs
lola: 27274853 markings, 40912254 edges, 328206 markings/sec, 75 secs
lola: 28957557 markings, 43436315 edges, 336541 markings/sec, 80 secs
lola: 30632332 markings, 45948495 edges, 334955 markings/sec, 85 secs
lola: 32292746 markings, 48439095 edges, 332083 markings/sec, 90 secs
lola: 33941008 markings, 50911508 edges, 329652 markings/sec, 95 secs
lola: 35494891 markings, 53242331 edges, 310777 markings/sec, 100 secs
lola: 37098501 markings, 55647739 edges, 320722 markings/sec, 105 secs
lola: 38740483 markings, 58110706 edges, 328396 markings/sec, 110 secs
lola: 40355550 markings, 60533304 edges, 323013 markings/sec, 115 secs
lola: 41945717 markings, 62918550 edges, 318033 markings/sec, 120 secs
lola: 43592367 markings, 65388543 edges, 329330 markings/sec, 125 secs
lola: 44725819 markings, 67088827 edges, 226690 markings/sec, 130 secs
lola: 44738501 markings, 67107737 edges, 2536 markings/sec, 135 secs
lola: 44764064 markings, 67146078 edges, 5113 markings/sec, 140 secs

BK_STOP 1527826418321

--------------------
content from stderr:

Killed

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="RefineWMG-PT-050050"
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/RefineWMG-PT-050050.tgz
mv RefineWMG-PT-050050 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 RefineWMG-PT-050050, 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 r280-csrt-152749170400732"
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 ;