About the Execution of LoLA for PolyORBLF-COL-S06J04T04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
211.160 | 327055.00 | 333938.00 | 810.00 | FTFFT?FFFFTFTTTT | 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 336K
-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 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 154K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PolyORBLF-COL-S06J04T04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r124-smll-152673526900094
=====================================================================
--------------------
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 PolyORBLF-COL-S06J04T04-CTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526911834519
info: Time: 3600 - MCC
===========================================================================================
prep: translating PolyORBLF-COL-S06J04T04 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PolyORBLF-COL-S06J04T04 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ PolyORBLF-COL-S06J04T04 @ 3568 seconds
lola: LoLA will run for 3568 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7448/65536 symbol table entries, 2235 collisions
lola: preprocessing...
lola: Size of bit vector: 14528
lola: finding significant places
lola: 454 places, 6994 transitions, 404 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1823 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p417)
lola: LP says that atomic proposition is always false: (2 <= p408 + p409 + p410 + p411)
lola: LP says that atomic proposition is always false: (3 <= p235 + p236 + p237 + p238 + p239)
lola: LP says that atomic proposition is always false: (2 <= p314)
lola: LP says that atomic proposition is always false: (3 <= p17 + p18 + p19 + p20)
lola: LP says that atomic proposition is always true: (3 <= p214)
lola: LP says that atomic proposition is always false: (3 <= p321 + p322 + p323 + p324)
lola: LP says that atomic proposition is always false: (3 <= p382)
lola: LP says that atomic proposition is always false: (3 <= p417)
lola: LP says that atomic proposition is always true: (3 <= p214)
lola: LP says that atomic proposition is always false: (3 <= p204 + p205 + p206 + p207 + p208 + p209)
lola: LP says that atomic proposition is always false: (p214 <= p320)
lola: LP says that atomic proposition is always false: (2 <= p269)
lola: A (((p170 + p171 + p172 + p173 <= p8 + p9 + p10 + p11) U ())) : (((3 <= p396 + p397 + p398 + p399) OR (3 <= p315) OR (p17 + p18 + p19 + p20 + 1 <= p416)) AND E (G (((p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 <= p407) OR (p321 + p322 + p323 + p324 <= p144 + p145 + p146 + p147) OR (1 <= p351 + p352 + p353 + p354))))) : A (F ((A (G ((2 <= p427 + p426 + p425 + p424 + p423 + p422))) AND ()))) : ((E (F ((p16 + p15 + p14 + p13 <= 2))) AND ()) AND A (G (A (G ((p351 + p352 + p353 + p354 <= p316 + p317 + p318 + p319)))))) : A (G (TRUE)) : A (G (E (G (((1 <= p450 + p451 + p452 + p453) OR (2 <= p49 + p48 + p47 + p46 + p45)))))) : A ((E (F ((3 <= p306 + p307 + p308 + p309))) U ())) : NOT(E (X (E (F ((1 <= p76 + p75 + p74 + p77)))))) : NOT((E (F (((1 <= p170 + p171 + p172 + p173)))) OR (3 <= p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300))) : A (F ((((p406 <= p130 + p131 + p132 + p133) AND ((1 <= p383 + p384 + p385 + p386) OR (p156 + p157 + p158 + p159 <= p130 + p131 + p132 + p133))) OR E (G (FALSE))))) : (NOT(E (((p408 + p409 + p410 + p411 <= p12) U FALSE))) AND (E (F (((3 <= p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300)))) OR FALSE)) : A (F ((((p265 + p266 + p267 + p268 <= 0) AND (p351 + p352 + p353 + p354 <= 0)) AND E (X ((2 <= p436 + p437 + p438 + p439)))))) : (E (G ((p345 + p346 + p347 + p348 + p349 + p350 <= p270))) AND E (X ((2 <= p427 + p426 + p425 + p424 + p423 + p422)))) : NOT(A (F (FALSE))) : NOT((((1 <= p270)) AND A (F (((p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p73 <= p450 + p451 + p452 + p453) AND (3 <= p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300)))))) : E (((p139 + p140 + p141 + p142 <= p406) U E (G ((p169 <= p306 + p307 + p308 + p309)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 202 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: 45 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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: ========================================
check_solution: Constraint R14 = 0 is above its equality of -1
check_solution: Constraint R126 = 0 is above its equality of -9
check_solution: Constraint R176 = 0 is above its equality of -1
check_solution: Constraint R182 = 0 is above its equality of -10
check_solution: Constraint R215 = 0 is above its equality of -1
check_solution: Constraint R216 = 0 is above its equality of -1
check_solution: Constraint R217 = 0 is above its equality of -1
check_solution: Constraint R232 = 0 is above its equality of -1
check_solution: Constraint R257 = 0 is above its equality of -1
check_solution: Constraint R258 = 0 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Constraint R1 = 0 is below its lower bound 1
check_solution: Constraint R14 = 0 is above its equality of -1
check_solution: Constraint R126 = 0 is above its equality of -9
check_solution: Constraint R176 = 0 is above its equality of -1
check_solution: Constraint R182 = 0 is above its equality of -10
check_solution: Constraint R215 = 0 is above its equality of -1
check_solution: Constraint R216 = 0 is above its equality of -1
check_solution: Constraint R217 = 0 is above its equality of -1
check_solution: Constraint R232 = 0 is above its equality of -1
check_solution: Constraint R257 = 0 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Constraint R1 = 0 is above its upper bound -1
check_solution: Constraint R14 = 0 is above its equality of -1
check_solution: Constraint R126 = 0 is above its equality of -9
check_solution: Constraint R176 = 0 is above its equality of -1
check_solution: Constraint R182 = 0 is above its equality of -10
check_solution: Constraint R215 = 0 is above its equality of -1
check_solution: Constraint R216 = 0 is above its equality of -1
check_solution: Constraint R217 = 0 is above its equality of -1
check_solution: Constraint R232 = 0 is above its equality of -1
check_solution: Constraint R257 = 0 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Constraint R14 = 0 is above its equality of -1
check_solution: Constraint R126 = 0 is above its equality of -9
check_solution: Constraint R176 = 0 is above its equality of -1
check_solution: Constraint R182 = 0 is above its equality of -10
check_solution: Constraint R215 = 0 is above its equality of -1
check_solution: Constraint R216 = 0 is above its equality of -1
check_solution: Constraint R217 = 0 is above its equality of -1
check_solution: Constraint R232 = 0 is above its equality of -1
check_solution: Constraint R257 = 0 is above its equality of -1
check_solution: Constraint R258 = 0 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1)
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 45 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: processed formula with 0 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 PolyORBLF-COL-S06J04T04-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 231 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: 45 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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 PolyORBLF-COL-S06J04T04-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 45 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: processed formula with 0 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 PolyORBLF-COL-S06J04T04-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p265 + p266 + p267 + p268 <= 0) AND (p351 + p352 + p353 + p354 <= 0)) AND E (X ((2 <= p436 + p437 + p438 + p439))))))
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 (((p265 + p266 + p267 + p268 <= 0) AND (p351 + p352 + p353 + p354 <= 0)) AND EX((2 <= p436 + p437 + p438 + p439))))
lola: processed formula length: 124
lola: 47 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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: 94 markings, 93 edges
lola: ========================================
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((p345 + p346 + p347 + p348 + p349 + p350 <= p270))) AND E (X ((2 <= p427 + p426 + p425 + p424 + p423 + p422))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p345 + p346 + p347 + p348 + p349 + p350 <= p270)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p345 + p346 + p347 + p348 + p349 + p350 <= p270)))
lola: processed formula length: 57
lola: 45 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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: 16 markings, 21 edges
lola: ========================================
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((2 <= p427 + p426 + p425 + p424 + p423 + p422)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((2 <= p427 + p426 + p425 + p424 + p423 + p422))
lola: processed formula length: 50
lola: 46 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p76 + p75 + p74 + p77 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (1 <= p76 + p75 + p74 + p77)
lola: processed formula length: 28
lola: 47 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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: 21 markings, 29 edges
lola: ========================================
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p450 + p451 + p452 + p453) OR (2 <= p49 + p48 + p47 + p46 + p45))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((1 <= p450 + p451 + p452 + p453) OR (2 <= p49 + p48 + p47 + p46 + p45))))
lola: processed formula length: 81
lola: 47 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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: ((p450 + p451 + p452 + p453 <= 0) AND (p49 + p48 + p47 + p46 + p45 <= 1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S06J04T04-CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300))))
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 <= p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300))))
lola: processed formula length: 154
lola: 46 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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 <= p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S06J04T04-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p406 <= p130 + p131 + p132 + p133) AND ((1 <= p383 + p384 + p385 + p386) OR (p156 + p157 + p158 + p159 <= p130 + p131 + p132 + p133)))))
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: ((p130 + p131 + p132 + p133 + 1 <= p406) OR ((p383 + p384 + p385 + p386 <= 0) AND (p130 + p131 + p132 + p133 + 1 <= p156 + p157 + p158 + p159)))
lola: processed formula length: 145
lola: 47 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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: 5240 markings, 16634 edges
lola: ========================================
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p139 + p140 + p141 + p142 <= p406) U E (G ((p169 <= p306 + p307 + p308 + p309)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E((p139 + p140 + p141 + p142 <= p406) U NOT(A(TRUE U (p306 + p307 + p308 + p309 + 1 <= p169))))
lola: processed formula length: 95
lola: 48 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 94 markings, 94 edges
lola: ========================================
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p170 + p171 + p172 + p173 <= 0)))) AND (p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 <= 2)
lola: processed formula length: 144
lola: 45 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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 12 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p170 + p171 + p172 + p173 <= 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 (((p170 + p171 + p172 + p173 <= 0))))
lola: processed formula length: 42
lola: 47 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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 <= p170 + p171 + p172 + p173))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S06J04T04-CTLCardinality-12-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((3 <= p396 + p397 + p398 + p399) OR (3 <= p315) OR (p17 + p18 + p19 + p20 + 1 <= p416)) AND E (G (((p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 <= p407) OR (p321 + p322 + p323 + p324 <= p144 + p145 + p146 + p147) OR (1 <= p351 + p352 + p353 + p354)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p396 + p397 + p398 + p399) OR (3 <= p315) OR (p17 + p18 + p19 + p20 + 1 <= p416))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p396 + p397 + p398 + p399) OR (3 <= p315) OR (p17 + p18 + p19 + p20 + 1 <= p416))
lola: processed formula length: 90
lola: 45 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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 13 will run for 1081 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 <= p407) OR (p321 + p322 + p323 + p324 <= p144 + p145 + p146 + p147) OR (1 <= p351 + p352 + p353 + p354))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 <= p407) OR (p321 + p322 + p323 + p324 <= p144 + p145 + p146 + p147) OR (1 <= p351 + p352 + p353 + p354))))
lola: processed formula length: 283
lola: 45 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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: 93 markings, 92 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p270 <= 0)) OR E (G (((p450 + p451 + p452 + p453 + 1 <= p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p73) OR (p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p270 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p270 <= 0))
lola: processed formula length: 13
lola: 45 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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 14 will run for 1621 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p450 + p451 + p452 + p453 + 1 <= p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p73) OR (p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p450 + p451 + p452 + p453 + 1 <= p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p73) OR (p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 <= 2))))
lola: processed formula length: 335
lola: 45 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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: 86 markings, 85 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1621 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((2 <= p427 + p426 + p425 + p424 + p423 + p422)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p427 + p426 + p425 + p424 + p423 + p422 <= 1)
lola: processed formula length: 46
lola: 47 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 94 markings, 93 edges
lola: ========================================
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((p16 + p15 + p14 + p13 <= 2))) AND A (G ((p351 + p352 + p353 + p354 <= p316 + p317 + p318 + p319))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p16 + p15 + p14 + p13 <= 2)))
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 ((p16 + p15 + p14 + p13 <= 2)))
lola: processed formula length: 36
lola: 46 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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: (p16 + p15 + p14 + p13 <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S06J04T04-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-CTLCardinality-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F ((p16 + p15 + p14 + p13 <= 2))) AND A (G ((p351 + p352 + p353 + p354 <= p316 + p317 + p318 + p319))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((p16 + p15 + p14 + p13 <= 2)))
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 ((p16 + p15 + p14 + p13 <= 2)))
lola: processed formula length: 36
lola: 46 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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: (p16 + p15 + p14 + p13 <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S06J04T04-CTLCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-CTLCardinality-16-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((p351 + p352 + p353 + p354 <= p316 + p317 + p318 + p319)))
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 ((p351 + p352 + p353 + p354 <= p316 + p317 + p318 + p319)))
lola: processed formula length: 64
lola: 47 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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: (p316 + p317 + p318 + p319 + 1 <= p351 + p352 + p353 + p354)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S06J04T04-CTLCardinality-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-CTLCardinality-17-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 820 markings, 956 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no yes no no no no no yes no yes yes yes yes
lola:
preliminary result: no yes no no yes no no no no no yes no yes yes yes yes
lola: memory consumption: 45104 KB
lola: time consumption: 325 seconds
BK_STOP 1526912161574
--------------------
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="PolyORBLF-COL-S06J04T04"
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/PolyORBLF-COL-S06J04T04.tgz
mv PolyORBLF-COL-S06J04T04 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 PolyORBLF-COL-S06J04T04, 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 r124-smll-152673526900094"
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 ;