About the Execution of LoLA for JoinFreeModules-PT-2000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15919.330 | 2753628.00 | 2822229.00 | 13441.60 | ??TTFF??FFTF?TFT | 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 12M
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 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.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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 2.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 12M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is JoinFreeModules-PT-2000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658631000297
=====================================================================
--------------------
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 JoinFreeModules-PT-2000-CTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526865502791
info: Time: 3600 - MCC
===========================================================================================
prep: translating JoinFreeModules-PT-2000 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating JoinFreeModules-PT-2000 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ JoinFreeModules-PT-2000 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 26002/65536 symbol table entries, 10032 collisions
lola: preprocessing...
lola: Size of bit vector: 320032
lola: finding significant places
lola: 10001 places, 16001 transitions, 8000 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 18001 transition conflict sets
lola: TASK
lola: reading formula from JoinFreeModules-PT-2000-CTLCardinality.task
lola: E (G (E (F ((p2421 <= 0))))) : E (F ((A (X ((3 <= p4486))) AND A (F ((2 <= p1996)))))) : ((E (G (((p2828 <= p6801) AND (1 <= p1816)))) AND (((p3915 <= p4469) OR (p62 + 1 <= p2471)) OR A (G ((p5502 <= p717))))) OR NOT(A (G ((1 <= p6316))))) : (E (G ((1 <= p1343))) OR (3 <= p5379)) : A (X ((A (X ((2 <= p39))) AND E (F ((3 <= p315)))))) : NOT(E (F (E (G ((2 <= p2664)))))) : E (X ((A (G ((2 <= p4847))) AND (p7103 <= p2382)))) : A (X ((((p2860 <= p9757) AND (p3520 + 1 <= p3785)) OR E (F ((p2696 <= p6032)))))) : E (G (A (G ((2 <= p1931))))) : (NOT(E (X (((p5460 <= p5247) AND (p7956 <= p3346))))) OR NOT(E (F ((1 <= p8764))))) : A (X (((2 <= p9996) OR ((p9925 <= p1391) AND (p9388 <= p8009) AND ((p740 <= p1866) OR (p6179 <= p9573)))))) : E (X (((p6717 + 1 <= p9137) AND (p8510 + 1 <= p3665) AND (p417 <= p4349)))) : E (((2 <= p7198) U ((3 <= p2772) AND (p5514 <= p4606) AND (p1540 <= p1659) AND (1 <= p7094)))) : (((A (G ((p5585 <= p4613))) OR A (X ((p4907 <= p9352)))) OR (((3 <= p8869) OR ((p8994 <= p826) AND (3 <= p1097))) OR E (G ((1 <= p8952))))) AND (A (X ((3 <= p2207))) OR ((2 <= p7291) AND (p1159 <= p3847) AND (1 <= p9143) AND ((3 <= p6389) OR (3 <= p1953) OR (p5906 <= 1))))) : ((2 <= p7347) OR A (G (A (F ((p9190 <= p548)))))) : E (F (E (G (((p1771 <= p5170) AND (2 <= p86))))))
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:551
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:476
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X ((3 <= p4486))) AND A (F ((2 <= p1996))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (AX((3 <= p4486)) AND A(TRUE U (2 <= p1996))))
lola: processed formula length: 55
lola: 20 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 15796 markings, 21784 edges, 3159 markings/sec, 0 secs
lola: 32510 markings, 44487 edges, 3343 markings/sec, 5 secs
lola: 48869 markings, 67536 edges, 3272 markings/sec, 10 secs
lola: 64906 markings, 91095 edges, 3207 markings/sec, 15 secs
lola: 80860 markings, 114521 edges, 3191 markings/sec, 20 secs
lola: 96815 markings, 137945 edges, 3191 markings/sec, 25 secs
lola: 113111 markings, 161017 edges, 3259 markings/sec, 30 secs
lola: 129870 markings, 183768 edges, 3352 markings/sec, 35 secs
lola: 146414 markings, 206759 edges, 3309 markings/sec, 40 secs
lola: 162388 markings, 230222 edges, 3195 markings/sec, 45 secs
lola: 178394 markings, 253729 edges, 3201 markings/sec, 50 secs
lola: 194443 markings, 277318 edges, 3210 markings/sec, 55 secs
lola: 210742 markings, 300570 edges, 3260 markings/sec, 60 secs
lola: 226942 markings, 322757 edges, 3240 markings/sec, 65 secs
lola: 243125 markings, 344928 edges, 3237 markings/sec, 70 secs
lola: 259540 markings, 368754 edges, 3283 markings/sec, 75 secs
lola: 275684 markings, 392513 edges, 3229 markings/sec, 80 secs
lola: 291954 markings, 416482 edges, 3254 markings/sec, 85 secs
lola: 308392 markings, 440137 edges, 3288 markings/sec, 90 secs
lola: 325464 markings, 463196 edges, 3414 markings/sec, 95 secs
lola: 342098 markings, 486246 edges, 3327 markings/sec, 100 secs
lola: 358054 markings, 509672 edges, 3191 markings/sec, 105 secs
lola: 374003 markings, 533088 edges, 3190 markings/sec, 110 secs
lola: 390022 markings, 556630 edges, 3204 markings/sec, 115 secs
lola: 406243 markings, 579903 edges, 3244 markings/sec, 120 secs
lola: 423388 markings, 603038 edges, 3429 markings/sec, 125 secs
lola: 440031 markings, 626160 edges, 3329 markings/sec, 130 secs
lola: 456004 markings, 649609 edges, 3195 markings/sec, 135 secs
lola: 472256 markings, 673553 edges, 3250 markings/sec, 140 secs
lola: 488275 markings, 697089 edges, 3204 markings/sec, 145 secs
lola: 490435 markings, 700025 edges, 432 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (X ((2 <= p39))))) AND A (X (E (F ((3 <= p315))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((3 <= p315)))))
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 (3 <= p315)))
lola: processed formula length: 25
lola: 19 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 24863 markings, 28081 edges, 4973 markings/sec, 0 secs
lola: 50419 markings, 57029 edges, 5111 markings/sec, 5 secs
lola: 77079 markings, 87359 edges, 5332 markings/sec, 10 secs
lola: 103716 markings, 117712 edges, 5327 markings/sec, 15 secs
lola: 130245 markings, 148241 edges, 5306 markings/sec, 20 secs
lola: 156772 markings, 178767 edges, 5305 markings/sec, 25 secs
lola: 183308 markings, 209301 edges, 5307 markings/sec, 30 secs
lola: 209819 markings, 239801 edges, 5302 markings/sec, 35 secs
lola: 236521 markings, 270181 edges, 5340 markings/sec, 40 secs
lola: 263219 markings, 300557 edges, 5340 markings/sec, 45 secs
lola: 289921 markings, 330938 edges, 5340 markings/sec, 50 secs
lola: 316618 markings, 361312 edges, 5339 markings/sec, 55 secs
lola: 343317 markings, 391691 edges, 5340 markings/sec, 60 secs
lola: 370002 markings, 422052 edges, 5337 markings/sec, 65 secs
lola: 396567 markings, 452550 edges, 5313 markings/sec, 70 secs
lola: 422702 markings, 482683 edges, 5227 markings/sec, 75 secs
lola: 448418 markings, 512398 edges, 5143 markings/sec, 80 secs
lola: 475043 markings, 542867 edges, 5325 markings/sec, 85 secs
lola: 501746 markings, 573251 edges, 5341 markings/sec, 90 secs
lola: 528435 markings, 603616 edges, 5338 markings/sec, 95 secs
lola: 555134 markings, 633993 edges, 5340 markings/sec, 100 secs
lola: 581833 markings, 664371 edges, 5340 markings/sec, 105 secs
lola: 608533 markings, 694749 edges, 5340 markings/sec, 110 secs
lola: 635173 markings, 725145 edges, 5328 markings/sec, 115 secs
lola: 661712 markings, 755683 edges, 5308 markings/sec, 120 secs
lola: 688246 markings, 786215 edges, 5307 markings/sec, 125 secs
lola: 714791 markings, 816758 edges, 5309 markings/sec, 130 secs
lola: 741363 markings, 847303 edges, 5314 markings/sec, 135 secs
lola: 768076 markings, 877697 edges, 5343 markings/sec, 140 secs
lola: 794788 markings, 908092 edges, 5342 markings/sec, 145 secs
lola: 821496 markings, 938482 edges, 5342 markings/sec, 150 secs
lola: 848212 markings, 968878 edges, 5343 markings/sec, 155 secs
lola: 874933 markings, 999284 edges, 5344 markings/sec, 160 secs
lola: 901658 markings, 1029693 edges, 5345 markings/sec, 165 secs
lola: 928256 markings, 1060214 edges, 5320 markings/sec, 170 secs
lola: 954812 markings, 1090768 edges, 5311 markings/sec, 175 secs
lola: 981347 markings, 1121302 edges, 5307 markings/sec, 180 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 277576 KB
lola: time consumption: 965 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((A (G ((2 <= p4847))) AND (p7103 <= p2382))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX((NOT(E(TRUE U (p4847 <= 1))) AND (p7103 <= p2382)))
lola: processed formula length: 54
lola: 20 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 21425 markings, 23424 edges, 4285 markings/sec, 0 secs
lola: 42256 markings, 47604 edges, 4166 markings/sec, 5 secs
lola: 63468 markings, 71465 edges, 4242 markings/sec, 10 secs
lola: 84279 markings, 95637 edges, 4162 markings/sec, 15 secs
lola: 105510 markings, 119505 edges, 4246 markings/sec, 20 secs
lola: 125684 markings, 142901 edges, 4035 markings/sec, 25 secs
lola: 147041 markings, 167035 edges, 4271 markings/sec, 30 secs
lola: 168077 markings, 191398 edges, 4207 markings/sec, 35 secs
lola: 189473 markings, 215466 edges, 4279 markings/sec, 40 secs
lola: 209479 markings, 238655 edges, 4001 markings/sec, 45 secs
lola: 230619 markings, 262609 edges, 4228 markings/sec, 50 secs
lola: 251542 markings, 286737 edges, 4185 markings/sec, 55 secs
lola: 272704 markings, 310691 edges, 4232 markings/sec, 60 secs
lola: 293605 markings, 334822 edges, 4180 markings/sec, 65 secs
lola: 314765 markings, 358750 edges, 4232 markings/sec, 70 secs
lola: 335646 markings, 382879 edges, 4176 markings/sec, 75 secs
lola: 356823 markings, 406806 edges, 4235 markings/sec, 80 secs
lola: 376896 markings, 429949 edges, 4015 markings/sec, 85 secs
lola: 397785 markings, 453768 edges, 4178 markings/sec, 90 secs
lola: 418519 markings, 477483 edges, 4147 markings/sec, 95 secs
lola: 439272 markings, 501253 edges, 4151 markings/sec, 100 secs
lola: 460346 markings, 525273 edges, 4215 markings/sec, 105 secs
lola: 481328 markings, 549308 edges, 4196 markings/sec, 110 secs
lola: 502353 markings, 573288 edges, 4205 markings/sec, 115 secs
lola: 523343 markings, 597322 edges, 4198 markings/sec, 120 secs
lola: 544365 markings, 621310 edges, 4204 markings/sec, 125 secs
lola: 565360 markings, 645338 edges, 4199 markings/sec, 130 secs
lola: 585071 markings, 667698 edges, 3942 markings/sec, 135 secs
lola: 605628 markings, 691602 edges, 4111 markings/sec, 140 secs
lola: 625769 markings, 714074 edges, 4028 markings/sec, 145 secs
lola: 645591 markings, 737354 edges, 3964 markings/sec, 150 secs
lola: 666947 markings, 761052 edges, 4271 markings/sec, 155 secs
lola: 687565 markings, 785326 edges, 4124 markings/sec, 160 secs
lola: 708894 markings, 808992 edges, 4266 markings/sec, 165 secs
lola: 729507 markings, 833259 edges, 4123 markings/sec, 170 secs
lola: 750840 markings, 856930 edges, 4267 markings/sec, 175 secs
lola: 771449 markings, 881193 edges, 4122 markings/sec, 180 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 7792824 KB
lola: time consumption: 1151 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((p2860 <= p9757) AND (p3520 + 1 <= p3785)) OR E (F ((p2696 <= p6032))))))
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((((p2860 <= p9757) AND (p3520 + 1 <= p3785)) OR E(TRUE U (p2696 <= p6032))))
lola: processed formula length: 79
lola: 19 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 24913 markings, 28143 edges, 4983 markings/sec, 0 secs
lola: 51631 markings, 58543 edges, 5344 markings/sec, 5 secs
lola: 77249 markings, 87571 edges, 5124 markings/sec, 10 secs
lola: 103949 markings, 117950 edges, 5340 markings/sec, 15 secs
lola: 130518 markings, 148513 edges, 5314 markings/sec, 20 secs
lola: 157080 markings, 179075 edges, 5312 markings/sec, 25 secs
lola: 183645 markings, 209638 edges, 5313 markings/sec, 30 secs
lola: 210213 markings, 240204 edges, 5314 markings/sec, 35 secs
lola: 236905 markings, 270662 edges, 5338 markings/sec, 40 secs
lola: 263635 markings, 301076 edges, 5346 markings/sec, 45 secs
lola: 290373 markings, 331502 edges, 5348 markings/sec, 50 secs
lola: 316039 markings, 360588 edges, 5133 markings/sec, 55 secs
lola: 342797 markings, 391042 edges, 5352 markings/sec, 60 secs
lola: 369525 markings, 421509 edges, 5346 markings/sec, 65 secs
lola: 396128 markings, 452110 edges, 5321 markings/sec, 70 secs
lola: 422723 markings, 482705 edges, 5319 markings/sec, 75 secs
lola: 449314 markings, 513295 edges, 5318 markings/sec, 80 secs
lola: 475914 markings, 543893 edges, 5320 markings/sec, 85 secs
lola: 502639 markings, 574366 edges, 5345 markings/sec, 90 secs
lola: 529388 markings, 604808 edges, 5350 markings/sec, 95 secs
lola: 556138 markings, 635249 edges, 5350 markings/sec, 100 secs
lola: 582883 markings, 665683 edges, 5349 markings/sec, 105 secs
lola: 609632 markings, 696122 edges, 5350 markings/sec, 110 secs
lola: 636330 markings, 726498 edges, 5340 markings/sec, 115 secs
lola: 662945 markings, 756916 edges, 5323 markings/sec, 120 secs
lola: 689519 markings, 787488 edges, 5315 markings/sec, 125 secs
lola: 716096 markings, 818063 edges, 5315 markings/sec, 130 secs
lola: 742680 markings, 848647 edges, 5317 markings/sec, 135 secs
lola: 769283 markings, 879207 edges, 5321 markings/sec, 140 secs
lola: 796021 markings, 909634 edges, 5348 markings/sec, 145 secs
lola: 822763 markings, 940066 edges, 5348 markings/sec, 150 secs
lola: 849501 markings, 970491 edges, 5348 markings/sec, 155 secs
lola: 876251 markings, 1000932 edges, 5350 markings/sec, 160 secs
lola: 903005 markings, 1031377 edges, 5351 markings/sec, 165 secs
lola: 929750 markings, 1061811 edges, 5349 markings/sec, 170 secs
lola: 956395 markings, 1092351 edges, 5329 markings/sec, 175 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((p5247 + 1 <= p5460) OR (p3346 + 1 <= p7956)))) OR A (G ((p8764 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p8764 <= 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 ((p8764 <= 0)))
lola: processed formula length: 20
lola: 19 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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 <= p8764)
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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 202 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p5247 + 1 <= p5460) OR (p3346 + 1 <= p7956))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(((p5247 + 1 <= p5460) OR (p3346 + 1 <= p7956)))
lola: processed formula length: 51
lola: 18 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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 JoinFreeModules-PT-2000-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 202 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= p9996) OR ((p9925 <= p1391) AND (p9388 <= p8009) AND ((p740 <= p1866) OR (p6179 <= p9573))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(((2 <= p9996) OR ((p9925 <= p1391) AND (p9388 <= p8009) AND ((p740 <= p1866) OR (p6179 <= p9573)))))
lola: processed formula length: 105
lola: 18 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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:
========================================
FORMULA JoinFreeModules-PT-2000-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p6717 + 1 <= p9137) AND (p8510 + 1 <= p3665) AND (p417 <= p4349))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(((p6717 + 1 <= p9137) AND (p8510 + 1 <= p3665) AND (p417 <= p4349)))
lola: processed formula length: 71
lola: 18 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA JoinFreeModules-PT-2000-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G ((p5585 <= p4613))) OR (A (X ((p4907 <= p9352))) OR (((3 <= p8869) OR ((p8994 <= p826) AND (3 <= p1097))) OR E (G ((1 <= p8952)))))) AND (A (X ((3 <= p2207))) OR ((2 <= p7291) AND (p1159 <= p3847) AND (1 <= p9143) AND ((3 <= p6389) OR (3 <= p1953) OR (p5906 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p7291) AND (p1159 <= p3847) AND (1 <= p9143) AND ((3 <= p6389) OR (3 <= p1953) OR (p5906 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p7291) AND (p1159 <= p3847) AND (1 <= p9143) AND ((3 <= p6389) OR (3 <= p1953) OR (p5906 <= 1)))
lola: processed formula length: 105
lola: 17 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLCardinality.task
lola: processed formula with 6 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 8 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p8869) OR ((p8994 <= p826) AND (3 <= p1097)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p8869) OR ((p8994 <= p826) AND (3 <= p1097)))
lola: processed formula length: 53
lola: 17 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLCardinality.task
lola: processed formula with 3 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 9 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p8952)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((1 <= p8952)))
lola: processed formula length: 20
lola: 17 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 12 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA JoinFreeModules-PT-2000-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p1931)))
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 ((2 <= p1931)))
lola: processed formula length: 20
lola: 19 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: (p1931 <= 1)
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: 4 markings, 3 edges
lola: state equation: write sara problem file to JoinFreeModules-PT-2000-CTLCardinality-8-0.sara
lola: ========================================
FORMULA JoinFreeModules-PT-2000-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p2664 <= 1)))))
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: (2 <= p2664)
lola: processed formula length: 12
lola: 19 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 225 markings, 225 edges
lola: ========================================
FORMULA JoinFreeModules-PT-2000-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((p1771 <= p5170) AND (2 <= p86))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: ((p1771 <= p5170) AND (2 <= p86))
lola: processed formula length: 33
lola: 18 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 226 markings, 226 edges
lola: ========================================
FORMULA JoinFreeModules-PT-2000-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((1 <= p1343))) OR (3 <= p5379))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p5379)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p5379)
lola: processed formula length: 12
lola: 17 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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 12 will run for 557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p1343)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((1 <= p1343)))
lola: processed formula length: 20
lola: 17 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 214 markings, 214 edges
lola: lola: SUBRESULT
lola: result: yes
lola: ========================================
The Boolean predicate is true.
lola: ========================================
FORMULA JoinFreeModules-PT-2000-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((2 <= p7198) U ((3 <= p2772) AND (p5514 <= p4606) AND (p1540 <= p1659) AND (1 <= p7094))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((2 <= p7198) U ((3 <= p2772) AND (p5514 <= p4606) AND (p1540 <= p1659) AND (1 <= p7094))))
lola: processed formula length: 94
lola: 20 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((3 <= p2772) AND (p5514 <= p4606) AND (p1540 <= p1659) AND (1 <= p7094))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-2000-CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-2000-CTLCardinality-12-0.sara.
lola: sara is running 0 secs || 19695 markings, 25683 edges, 3939 markings/sec, 0 secs
lola: sara is running 5 secs || 38786 markings, 54381 edges, 3818 markings/sec, 5 secs
lola: sara is running 10 secs || 58750 markings, 82702 edges, 3993 markings/sec, 10 secs
lola: sara is running 15 secs || 78814 markings, 110940 edges, 4013 markings/sec, 15 secs
lola: sara is running 20 secs || 97795 markings, 139663 edges, 3796 markings/sec, 20 secs
lola: sara is running 25 secs || 118829 markings, 167474 edges, 4207 markings/sec, 25 secs
lola: sara is running 30 secs || 137849 markings, 196267 edges, 3804 markings/sec, 30 secs
lola: sara is running 35 secs || 158477 markings, 224353 edges, 4126 markings/sec, 35 secs
lola: sara is running 40 secs || 177926 markings, 252908 edges, 3890 markings/sec, 40 secs
lola: sara is running 45 secs || 197713 markings, 281553 edges, 3957 markings/sec, 45 secs
lola: sara is running 50 secs || 218243 markings, 309981 edges, 4106 markings/sec, 50 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 55 secs || 237380 markings, 338967 edges, 3827 markings/sec, 55 secs
lola: sara is running 60 secs || 258563 markings, 367045 edges, 4237 markings/sec, 60 secs
lola: sara is running 65 secs || 277765 markings, 396157 edges, 3840 markings/sec, 65 secs
lola: state equation 0: solution produced
lola: sara is running 70 secs || 297539 markings, 423295 edges, 3955 markings/sec, 70 secs
lola: sara is running 75 secs || 317460 markings, 452127 edges, 3984 markings/sec, 75 secs
lola: sara is running 80 secs || 336159 markings, 479877 edges, 3740 markings/sec, 80 secs
lola: sara is running 85 secs || 357227 markings, 508226 edges, 4214 markings/sec, 85 secs
lola: sara is running 90 secs || 376420 markings, 537320 edges, 3839 markings/sec, 90 secs
lola: sara is running 95 secs || 395350 markings, 563020 edges, 3786 markings/sec, 95 secs
lola: sara is running 100 secs || 413826 markings, 589287 edges, 3695 markings/sec, 100 secs
lola: sara is running 105 secs || 432858 markings, 618097 edges, 3806 markings/sec, 105 secs
lola: sara is running 110 secs || 454105 markings, 646284 edges, 4249 markings/sec, 110 secs
lola: sara is running 115 secs || 473259 markings, 675308 edges, 3831 markings/sec, 115 secs
lola: sara is running 120 secs || 494027 markings, 703618 edges, 4154 markings/sec, 120 secs
lola: sara is running 125 secs || 513671 markings, 732538 edges, 3929 markings/sec, 125 secs
lola: sara is running 130 secs || 533734 markings, 761288 edges, 4013 markings/sec, 130 secs
lola: sara is running 135 secs || 554155 markings, 789901 edges, 4084 markings/sec, 135 secs
lola: sara is running 140 secs || 573474 markings, 818993 edges, 3864 markings/sec, 140 secs
lola: sara is running 145 secs || 594663 markings, 847294 edges, 4238 markings/sec, 145 secs
lola: sara is running 150 secs || 613881 markings, 876436 edges, 3844 markings/sec, 150 secs
lola: sara is running 155 secs || 635133 markings, 904625 edges, 4250 markings/sec, 155 secs
lola: sara is running 160 secs || 654357 markings, 933772 edges, 3845 markings/sec, 160 secs
lola: sara is running 165 secs || 674929 markings, 962363 edges, 4114 markings/sec, 165 secs
lola: sara is running 170 secs || 694854 markings, 991151 edges, 3985 markings/sec, 170 secs
lola: sara is running 175 secs || 714530 markings, 1019932 edges, 3935 markings/sec, 175 secs
lola: sara is running 180 secs || 735217 markings, 1048293 edges, 4137 markings/sec, 180 secs
lola: sara is running 185 secs || 754377 markings, 1077329 edges, 3832 markings/sec, 185 secs
lola: sara is running 190 secs || 775577 markings, 1105440 edges, 4240 markings/sec, 190 secs
lola: sara is running 195 secs || 794671 markings, 1134351 edges, 3819 markings/sec, 195 secs
lola: sara is running 200 secs || 815394 markings, 1162713 edges, 4145 markings/sec, 200 secs
lola: sara is running 205 secs || 835023 markings, 1191484 edges, 3926 markings/sec, 205 secs
lola: sara is running 210 secs || 854876 markings, 1220158 edges, 3971 markings/sec, 210 secs
lola: sara is running 215 secs || 875363 markings, 1248583 edges, 4097 markings/sec, 215 secs
lola: sara is running 220 secs || 894511 markings, 1277601 edges, 3830 markings/sec, 220 secs
lola: sara is running 225 secs || 915709 markings, 1305696 edges, 4240 markings/sec, 225 secs
lola: sara is running 230 secs || 934874 markings, 1334740 edges, 3833 markings/sec, 230 secs
lola: sara is running 235 secs || 955743 markings, 1362939 edges, 4174 markings/sec, 235 secs
lola: Child process aborted or communication problem between parent and child process
lola: Cannot launch process for handling subproblem
FORMULA JoinFreeModules-PT-2000-CTLCardinality-0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p7347) OR A (G (A (F ((p9190 <= p548))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p7347)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p7347)
lola: processed formula length: 12
lola: 17 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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 994 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p9190 <= p548)))))
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: (p548 + 1 <= p9190)
lola: processed formula length: 19
lola: 19 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 1465 markings, 1465 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA JoinFreeModules-PT-2000-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 994 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (G (((p2828 <= p6801) AND (1 <= p1816)))) AND (((p3915 <= p4469) OR (p62 + 1 <= p2471)) OR A (G ((p5502 <= p717))))) OR E (F ((p6316 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 994 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p3915 <= p4469) OR (p62 + 1 <= p2471))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p3915 <= p4469) OR (p62 + 1 <= p2471))
lola: processed formula length: 41
lola: 17 rewrites
lola: closed formula file JoinFreeModules-PT-2000-CTLCardinality.task
lola: processed formula with 2 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 15 will run for 1989 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p6316 <= 0)))
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 ((p6316 <= 0)))
lola: processed formula length: 20
lola: 18 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: (p6316 <= 0)
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
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA JoinFreeModules-PT-2000-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: E (F ((A (X ((3 <= p4486))) AND A (F ((2 <= p1996))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (AX((3 <= p4486)) AND A(TRUE U (2 <= p1996))))
lola: processed formula length: 55
lola: 20 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 16368 markings, 22356 edges, 3274 markings/sec, 0 secs
lola: 32956 markings, 44933 edges, 3318 markings/sec, 5 secs
lola: 49117 markings, 67967 edges, 3232 markings/sec, 10 secs
lola: 64936 markings, 91149 edges, 3164 markings/sec, 15 secs
lola: 80977 markings, 114725 edges, 3208 markings/sec, 20 secs
lola: 96819 markings, 137954 edges, 3168 markings/sec, 25 secs
lola: 112508 markings, 160415 edges, 3138 markings/sec, 30 secs
lola: 128485 markings, 182384 edges, 3195 markings/sec, 35 secs
lola: 144505 markings, 204393 edges, 3204 markings/sec, 40 secs
lola: 160071 markings, 226168 edges, 3113 markings/sec, 45 secs
lola: 175402 markings, 248493 edges, 3066 markings/sec, 50 secs
lola: 190647 markings, 270674 edges, 3049 markings/sec, 55 secs
lola: 205976 markings, 293005 edges, 3066 markings/sec, 60 secs
lola: 221268 markings, 315274 edges, 3058 markings/sec, 65 secs
lola: 236532 markings, 337481 edges, 3053 markings/sec, 70 secs
lola: 252586 markings, 360379 edges, 3211 markings/sec, 75 secs
lola: 269636 markings, 383417 edges, 3410 markings/sec, 80 secs
lola: 286247 markings, 406496 edges, 3322 markings/sec, 85 secs
lola: 302328 markings, 430140 edges, 3216 markings/sec, 90 secs
lola: 318466 markings, 453887 edges, 3228 markings/sec, 95 secs
lola: 334521 markings, 477490 edges, 3211 markings/sec, 100 secs
lola: 351032 markings, 500740 edges, 3302 markings/sec, 105 secs
lola: 367909 markings, 523606 edges, 3375 markings/sec, 110 secs
lola: 384357 markings, 546717 edges, 3290 markings/sec, 115 secs
lola: 400432 markings, 570344 edges, 3215 markings/sec, 120 secs
lola: 416406 markings, 593803 edges, 3195 markings/sec, 125 secs
lola: 432529 markings, 617522 edges, 3225 markings/sec, 130 secs
lola: 449200 markings, 640823 edges, 3334 markings/sec, 135 secs
lola: 465947 markings, 663559 edges, 3349 markings/sec, 140 secs
lola: 482397 markings, 686804 edges, 3290 markings/sec, 145 secs
lola: 490413 markings, 700003 edges, 1603 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA JoinFreeModules-PT-2000-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (A (X (A (X ((2 <= p39))))) AND A (X (E (F ((3 <= p315))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((3 <= p315)))))
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 (3 <= p315)))
lola: processed formula length: 25
lola: 19 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 26212 markings, 29766 edges, 5242 markings/sec, 0 secs
lola: 52705 markings, 59886 edges, 5299 markings/sec, 5 secs
lola: 79255 markings, 90079 edges, 5310 markings/sec, 10 secs
lola: 105832 markings, 120304 edges, 5315 markings/sec, 15 secs
lola: 132279 markings, 150368 edges, 5289 markings/sec, 20 secs
lola: 158893 markings, 180888 edges, 5323 markings/sec, 25 secs
lola: 185447 markings, 211440 edges, 5311 markings/sec, 30 secs
lola: 212026 markings, 242016 edges, 5316 markings/sec, 35 secs
lola: 238584 markings, 272573 edges, 5312 markings/sec, 40 secs
lola: 265245 markings, 303088 edges, 5332 markings/sec, 45 secs
lola: 291996 markings, 333531 edges, 5350 markings/sec, 50 secs
lola: 318747 markings, 363974 edges, 5350 markings/sec, 55 secs
lola: 345499 markings, 394419 edges, 5350 markings/sec, 60 secs
lola: 372244 markings, 424854 edges, 5349 markings/sec, 65 secs
lola: 398990 markings, 455290 edges, 5349 markings/sec, 70 secs
lola: 425739 markings, 485732 edges, 5350 markings/sec, 75 secs
lola: 452338 markings, 516319 edges, 5320 markings/sec, 80 secs
lola: 478933 markings, 546913 edges, 5319 markings/sec, 85 secs
lola: 505511 markings, 577490 edges, 5316 markings/sec, 90 secs
lola: 532098 markings, 608076 edges, 5317 markings/sec, 95 secs
lola: 558790 markings, 638562 edges, 5338 markings/sec, 100 secs
lola: 585534 markings, 668998 edges, 5349 markings/sec, 105 secs
lola: 612274 markings, 699426 edges, 5348 markings/sec, 110 secs
lola: 639017 markings, 729857 edges, 5349 markings/sec, 115 secs
lola: 665761 markings, 760291 edges, 5349 markings/sec, 120 secs
lola: 692501 markings, 790719 edges, 5348 markings/sec, 125 secs
lola: 719220 markings, 821187 edges, 5344 markings/sec, 130 secs
lola: 745802 markings, 851768 edges, 5316 markings/sec, 135 secs
lola: 772384 markings, 882350 edges, 5316 markings/sec, 140 secs
lola: 798959 markings, 912924 edges, 5315 markings/sec, 145 secs
lola: 825535 markings, 943500 edges, 5315 markings/sec, 150 secs
lola: 852276 markings, 973959 edges, 5348 markings/sec, 155 secs
lola: 879024 markings, 1004398 edges, 5350 markings/sec, 160 secs
lola: 905768 markings, 1034831 edges, 5349 markings/sec, 165 secs
lola: 932514 markings, 1065267 edges, 5349 markings/sec, 170 secs
lola: 959259 markings, 1095701 edges, 5349 markings/sec, 175 secs
lola: 986007 markings, 1126140 edges, 5350 markings/sec, 180 secs
lola: 1012692 markings, 1156646 edges, 5337 markings/sec, 185 secs
lola: 1039273 markings, 1187227 edges, 5316 markings/sec, 190 secs
lola: 1065861 markings, 1217814 edges, 5318 markings/sec, 195 secs
lola: 1092426 markings, 1248379 edges, 5313 markings/sec, 200 secs
lola: 1119028 markings, 1278939 edges, 5320 markings/sec, 205 secs
lola: 1145784 markings, 1309391 edges, 5351 markings/sec, 210 secs
lola: 1172529 markings, 1339831 edges, 5349 markings/sec, 215 secs
lola: 1199282 markings, 1370276 edges, 5351 markings/sec, 220 secs
lola: 1226031 markings, 1400715 edges, 5350 markings/sec, 225 secs
lola: 1252776 markings, 1431151 edges, 5349 markings/sec, 230 secs
lola: 1279520 markings, 1461586 edges, 5349 markings/sec, 235 secs
lola: 1306148 markings, 1492106 edges, 5326 markings/sec, 240 secs
lola: 1332728 markings, 1522687 edges, 5316 markings/sec, 245 secs
lola: 1359285 markings, 1553243 edges, 5311 markings/sec, 250 secs
lola: 1385856 markings, 1583814 edges, 5314 markings/sec, 255 secs
lola: 1412500 markings, 1614335 edges, 5329 markings/sec, 260 secs
lola: 1439236 markings, 1644760 edges, 5347 markings/sec, 265 secs
lola: 1465971 markings, 1675188 edges, 5347 markings/sec, 270 secs
lola: 1492704 markings, 1705608 edges, 5347 markings/sec, 275 secs
lola: 1519435 markings, 1736026 edges, 5346 markings/sec, 280 secs
lola: 1546169 markings, 1766450 edges, 5347 markings/sec, 285 secs
lola: 1572903 markings, 1796871 edges, 5347 markings/sec, 290 secs
lola: 1593910 markings, 1821631 edges, 4201 markings/sec, 295 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (A (X ((2 <= p39)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(AX((2 <= p39)))
lola: processed formula length: 18
lola: 19 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
FORMULA JoinFreeModules-PT-2000-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: E (X ((A (G ((2 <= p4847))) AND (p7103 <= p2382))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX((NOT(E(TRUE U (p4847 <= 1))) AND (p7103 <= p2382)))
lola: processed formula length: 54
lola: 20 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 22080 markings, 24078 edges, 4416 markings/sec, 0 secs
lola: 42650 markings, 48096 edges, 4114 markings/sec, 5 secs
lola: 63710 markings, 71707 edges, 4212 markings/sec, 10 secs
lola: 84320 markings, 95688 edges, 4122 markings/sec, 15 secs
lola: 105362 markings, 119358 edges, 4208 markings/sec, 20 secs
lola: 126067 markings, 143379 edges, 4141 markings/sec, 25 secs
lola: 147121 markings, 167116 edges, 4211 markings/sec, 30 secs
lola: 167814 markings, 191069 edges, 4139 markings/sec, 35 secs
lola: 188806 markings, 214799 edges, 4198 markings/sec, 40 secs
lola: 209544 markings, 238737 edges, 4148 markings/sec, 45 secs
lola: 230511 markings, 262501 edges, 4193 markings/sec, 50 secs
lola: 251274 markings, 286403 edges, 4153 markings/sec, 55 secs
lola: 272206 markings, 310193 edges, 4186 markings/sec, 60 secs
lola: 292986 markings, 334048 edges, 4156 markings/sec, 65 secs
lola: 313863 markings, 357848 edges, 4175 markings/sec, 70 secs
lola: 334680 markings, 381672 edges, 4163 markings/sec, 75 secs
lola: 355533 markings, 405517 edges, 4171 markings/sec, 80 secs
lola: 375686 markings, 428436 edges, 4031 markings/sec, 85 secs
lola: 396633 markings, 452615 edges, 4189 markings/sec, 90 secs
lola: 417808 markings, 476595 edges, 4235 markings/sec, 95 secs
lola: 438743 markings, 500724 edges, 4187 markings/sec, 100 secs
lola: 459923 markings, 524744 edges, 4236 markings/sec, 105 secs
lola: 480886 markings, 548866 edges, 4193 markings/sec, 110 secs
lola: 502006 markings, 572854 edges, 4224 markings/sec, 115 secs
lola: 522985 markings, 596964 edges, 4196 markings/sec, 120 secs
lola: 544094 markings, 620971 edges, 4222 markings/sec, 125 secs
lola: 565089 markings, 645067 edges, 4199 markings/sec, 130 secs
lola: 586169 markings, 669071 edges, 4216 markings/sec, 135 secs
lola: 607164 markings, 693138 edges, 4199 markings/sec, 140 secs
lola: 628260 markings, 717189 edges, 4219 markings/sec, 145 secs
lola: 649308 markings, 741280 edges, 4210 markings/sec, 150 secs
lola: 670369 markings, 765329 edges, 4212 markings/sec, 155 secs
lola: 691408 markings, 789377 edges, 4208 markings/sec, 160 secs
lola: 712430 markings, 813412 edges, 4204 markings/sec, 165 secs
lola: 733475 markings, 837442 edges, 4209 markings/sec, 170 secs
lola: 754489 markings, 861490 edges, 4203 markings/sec, 175 secs
lola: 775551 markings, 885517 edges, 4212 markings/sec, 180 secs
lola: 796553 markings, 909578 edges, 4200 markings/sec, 185 secs
lola: 817628 markings, 933592 edges, 4215 markings/sec, 190 secs
lola: 838608 markings, 957652 edges, 4196 markings/sec, 195 secs
lola: 859683 markings, 981646 edges, 4215 markings/sec, 200 secs
lola: 880653 markings, 1005712 edges, 4194 markings/sec, 205 secs
lola: 901752 markings, 1029712 edges, 4220 markings/sec, 210 secs
lola: 922711 markings, 1053789 edges, 4192 markings/sec, 215 secs
lola: 943779 markings, 1077736 edges, 4214 markings/sec, 220 secs
lola: 964720 markings, 1101806 edges, 4188 markings/sec, 225 secs
lola: 985816 markings, 1125771 edges, 4219 markings/sec, 230 secs
lola: 1006761 markings, 1149862 edges, 4189 markings/sec, 235 secs
lola: 1027892 markings, 1173845 edges, 4226 markings/sec, 240 secs
lola: 1048839 markings, 1197968 edges, 4189 markings/sec, 245 secs
lola: 1069970 markings, 1221922 edges, 4226 markings/sec, 250 secs
lola: 1090893 markings, 1246042 edges, 4185 markings/sec, 255 secs
lola: 1112015 markings, 1269970 edges, 4224 markings/sec, 260 secs
lola: 1132945 markings, 1294119 edges, 4186 markings/sec, 265 secs
lola: 1154116 markings, 1318074 edges, 4234 markings/sec, 270 secs
lola: 1175024 markings, 1342228 edges, 4182 markings/sec, 275 secs
lola: 1196216 markings, 1366175 edges, 4238 markings/sec, 280 secs
lola: 1217114 markings, 1390346 edges, 4180 markings/sec, 285 secs
lola: 1238309 markings, 1414267 edges, 4239 markings/sec, 290 secs
lola: 1259174 markings, 1438428 edges, 4173 markings/sec, 295 secs
lola: 1280374 markings, 1462331 edges, 4240 markings/sec, 300 secs
lola: 1301198 markings, 1486464 edges, 4165 markings/sec, 305 secs
lola: 1322371 markings, 1510330 edges, 4235 markings/sec, 310 secs
lola: 1343229 markings, 1534513 edges, 4172 markings/sec, 315 secs
lola: 1364393 markings, 1558351 edges, 4233 markings/sec, 320 secs
lola: 1385206 markings, 1582493 edges, 4163 markings/sec, 325 secs
lola: 1406391 markings, 1606351 edges, 4237 markings/sec, 330 secs
lola: 1427209 markings, 1630503 edges, 4164 markings/sec, 335 secs
lola: 1448392 markings, 1654352 edges, 4237 markings/sec, 340 secs
lola: 1469205 markings, 1678508 edges, 4163 markings/sec, 345 secs
lola: 1490411 markings, 1702376 edges, 4241 markings/sec, 350 secs
lola: 1511206 markings, 1726518 edges, 4159 markings/sec, 355 secs
lola: 1532387 markings, 1750351 edges, 4236 markings/sec, 360 secs
lola: 1553183 markings, 1774496 edges, 4159 markings/sec, 365 secs
lola: 1574360 markings, 1798323 edges, 4235 markings/sec, 370 secs
lola: 1593599 markings, 1820525 edges, 3848 markings/sec, 375 secs
lola: 1594297 markings, 1821394 edges, 140 markings/sec, 380 secs
lola: 1595054 markings, 1822341 edges, 151 markings/sec, 385 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA JoinFreeModules-PT-2000-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X ((((p2860 <= p9757) AND (p3520 + 1 <= p3785)) OR E (F ((p2696 <= p6032))))))
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((((p2860 <= p9757) AND (p3520 + 1 <= p3785)) OR E(TRUE U (p2696 <= p6032))))
lola: processed formula length: 79
lola: 19 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 24788 markings, 27986 edges, 4958 markings/sec, 0 secs
lola: 51403 markings, 58259 edges, 5323 markings/sec, 5 secs
lola: 77997 markings, 88506 edges, 5319 markings/sec, 10 secs
lola: 104622 markings, 118791 edges, 5325 markings/sec, 15 secs
lola: 131217 markings, 149212 edges, 5319 markings/sec, 20 secs
lola: 157735 markings, 179730 edges, 5304 markings/sec, 25 secs
lola: 184256 markings, 210249 edges, 5304 markings/sec, 30 secs
lola: 210768 markings, 240759 edges, 5302 markings/sec, 35 secs
lola: 235292 markings, 268645 edges, 4905 markings/sec, 40 secs
lola: 262048 markings, 299092 edges, 5351 markings/sec, 45 secs
lola: 288808 markings, 329546 edges, 5352 markings/sec, 50 secs
lola: 315562 markings, 359993 edges, 5351 markings/sec, 55 secs
lola: 342317 markings, 390441 edges, 5351 markings/sec, 60 secs
lola: 368983 markings, 420967 edges, 5333 markings/sec, 65 secs
lola: 395581 markings, 451563 edges, 5320 markings/sec, 70 secs
lola: 422172 markings, 482153 edges, 5318 markings/sec, 75 secs
lola: 448766 markings, 512747 edges, 5319 markings/sec, 80 secs
lola: 475396 markings, 543308 edges, 5326 markings/sec, 85 secs
lola: 502138 markings, 573741 edges, 5348 markings/sec, 90 secs
lola: 528887 markings, 604181 edges, 5350 markings/sec, 95 secs
lola: 555638 markings, 634624 edges, 5350 markings/sec, 100 secs
lola: 582389 markings, 665065 edges, 5350 markings/sec, 105 secs
lola: 609128 markings, 695494 edges, 5348 markings/sec, 110 secs
lola: 635877 markings, 725933 edges, 5350 markings/sec, 115 secs
lola: 662505 markings, 756476 edges, 5326 markings/sec, 120 secs
lola: 689091 markings, 787060 edges, 5317 markings/sec, 125 secs
lola: 715677 markings, 817645 edges, 5317 markings/sec, 130 secs
lola: 742267 markings, 848234 edges, 5318 markings/sec, 135 secs
lola: 768926 markings, 878760 edges, 5332 markings/sec, 140 secs
lola: 795675 markings, 909200 edges, 5350 markings/sec, 145 secs
lola: 822417 markings, 939632 edges, 5348 markings/sec, 150 secs
lola: 849172 markings, 970079 edges, 5351 markings/sec, 155 secs
lola: 875926 markings, 1000525 edges, 5351 markings/sec, 160 secs
lola: 902681 markings, 1030971 edges, 5351 markings/sec, 165 secs
lola: 929436 markings, 1061419 edges, 5351 markings/sec, 170 secs
lola: 956045 markings, 1092001 edges, 5322 markings/sec, 175 secs
lola: 982636 markings, 1122590 edges, 5318 markings/sec, 180 secs
lola: 1009229 markings, 1153183 edges, 5319 markings/sec, 185 secs
lola: 1035819 markings, 1183773 edges, 5318 markings/sec, 190 secs
lola: 1062508 markings, 1214276 edges, 5338 markings/sec, 195 secs
lola: 1089249 markings, 1244707 edges, 5348 markings/sec, 200 secs
lola: 1115996 markings, 1275148 edges, 5349 markings/sec, 205 secs
lola: 1142760 markings, 1305611 edges, 5353 markings/sec, 210 secs
lola: 1169516 markings, 1336064 edges, 5351 markings/sec, 215 secs
lola: 1196274 markings, 1366515 edges, 5352 markings/sec, 220 secs
lola: 1223019 markings, 1396977 edges, 5349 markings/sec, 225 secs
lola: 1249616 markings, 1427573 edges, 5319 markings/sec, 230 secs
lola: 1276213 markings, 1458169 edges, 5319 markings/sec, 235 secs
lola: 1302795 markings, 1488753 edges, 5316 markings/sec, 240 secs
lola: 1329384 markings, 1519342 edges, 5318 markings/sec, 245 secs
lola: 1356088 markings, 1549809 edges, 5341 markings/sec, 250 secs
lola: 1382818 markings, 1580229 edges, 5346 markings/sec, 255 secs
lola: 1409561 markings, 1610662 edges, 5349 markings/sec, 260 secs
lola: 1436305 markings, 1641096 edges, 5349 markings/sec, 265 secs
lola: 1463044 markings, 1671529 edges, 5348 markings/sec, 270 secs
lola: 1489788 markings, 1701963 edges, 5349 markings/sec, 275 secs
lola: 1516472 markings, 1732436 edges, 5337 markings/sec, 280 secs
lola: 1543044 markings, 1763007 edges, 5314 markings/sec, 285 secs
lola: 1569620 markings, 1793583 edges, 5315 markings/sec, 290 secs
lola: 1592065 markings, 1819325 edges, 4489 markings/sec, 295 secs
lola: 1592943 markings, 1820423 edges, 176 markings/sec, 300 secs
lola: 1593233 markings, 1820785 edges, 58 markings/sec, 305 secs
lola: 1593671 markings, 1821332 edges, 88 markings/sec, 310 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA JoinFreeModules-PT-2000-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: Cannot launch process for handling subproblem
FORMULA JoinFreeModules-PT-2000-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: unknown yes yes no no unknown unknown no no yes no unknown yes no yes
lola:
preliminary result: unknown yes yes no no unknown unknown no no yes no unknown yes no yes
BK_STOP 1526868256419
--------------------
content from stderr:
Segmentation fault
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="JoinFreeModules-PT-2000"
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/JoinFreeModules-PT-2000.tgz
mv JoinFreeModules-PT-2000 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 JoinFreeModules-PT-2000, 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 r100-smll-152658631000297"
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 ;