Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033478301043.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldRVt-PT-030B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478301043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 3.8K May 14 02:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 02:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 20:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 20:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.6K May 13 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 09:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 09:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 364K May 12 20:42 model.pnml

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

=== Now, execution of the tool begins

BK_START 1591339004093

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 06:36:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 06:36:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 06:36:45] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2020-06-05 06:36:45] [INFO ] Transformed 1503 places.
[2020-06-05 06:36:45] [INFO ] Transformed 1503 transitions.
[2020-06-05 06:36:45] [INFO ] Found NUPN structural information;
[2020-06-05 06:36:45] [INFO ] Parsed PT model containing 1503 places and 1503 transitions in 159 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 58 ms.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=259 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1]
// Phase 1: matrix 1503 rows 1503 cols
[2020-06-05 06:36:46] [INFO ] Computed 121 place invariants in 45 ms
[2020-06-05 06:36:46] [INFO ] [Real]Absence check using 121 positive place invariants in 129 ms returned sat
[2020-06-05 06:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:36:50] [INFO ] [Real]Absence check using state equation in 3723 ms returned sat
[2020-06-05 06:36:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:36:51] [INFO ] [Nat]Absence check using 121 positive place invariants in 543 ms returned sat
[2020-06-05 06:36:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:36:56] [INFO ] [Nat]Absence check using state equation in 4745 ms returned sat
[2020-06-05 06:36:57] [INFO ] Deduced a trap composed of 33 places in 1016 ms
[2020-06-05 06:36:58] [INFO ] Deduced a trap composed of 25 places in 789 ms
[2020-06-05 06:36:59] [INFO ] Deduced a trap composed of 35 places in 600 ms
[2020-06-05 06:36:59] [INFO ] Deduced a trap composed of 26 places in 731 ms
[2020-06-05 06:37:00] [INFO ] Deduced a trap composed of 25 places in 500 ms
[2020-06-05 06:37:01] [INFO ] Deduced a trap composed of 34 places in 772 ms
[2020-06-05 06:37:01] [INFO ] Deduced a trap composed of 33 places in 631 ms
[2020-06-05 06:37:02] [INFO ] Deduced a trap composed of 28 places in 506 ms
[2020-06-05 06:37:03] [INFO ] Deduced a trap composed of 41 places in 487 ms
[2020-06-05 06:37:03] [INFO ] Deduced a trap composed of 42 places in 446 ms
[2020-06-05 06:37:04] [INFO ] Deduced a trap composed of 47 places in 529 ms
[2020-06-05 06:37:04] [INFO ] Deduced a trap composed of 45 places in 548 ms
[2020-06-05 06:37:05] [INFO ] Deduced a trap composed of 39 places in 505 ms
[2020-06-05 06:37:05] [INFO ] Deduced a trap composed of 39 places in 482 ms
[2020-06-05 06:37:06] [INFO ] Deduced a trap composed of 39 places in 448 ms
[2020-06-05 06:37:06] [INFO ] Deduced a trap composed of 32 places in 492 ms
[2020-06-05 06:37:07] [INFO ] Deduced a trap composed of 46 places in 593 ms
[2020-06-05 06:37:08] [INFO ] Deduced a trap composed of 22 places in 533 ms
[2020-06-05 06:37:08] [INFO ] Deduced a trap composed of 31 places in 489 ms
[2020-06-05 06:37:09] [INFO ] Deduced a trap composed of 37 places in 462 ms
[2020-06-05 06:37:09] [INFO ] Deduced a trap composed of 39 places in 456 ms
[2020-06-05 06:37:10] [INFO ] Deduced a trap composed of 25 places in 385 ms
[2020-06-05 06:37:10] [INFO ] Deduced a trap composed of 31 places in 438 ms
[2020-06-05 06:37:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s1089 s1090 s1091 s1092 s1093 s1094 s1095 s1096 s1097 s1111 s1112 s1113 s1137 s1138 s1139 s1141 s1142 s1143 s1144 s1145 s1146 s1147 s1148) 0)") while checking expression at index 0
[2020-06-05 06:37:11] [INFO ] [Real]Absence check using 121 positive place invariants in 161 ms returned sat
[2020-06-05 06:37:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:37:14] [INFO ] [Real]Absence check using state equation in 3827 ms returned sat
[2020-06-05 06:37:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:37:15] [INFO ] [Nat]Absence check using 121 positive place invariants in 237 ms returned sat
[2020-06-05 06:37:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:37:19] [INFO ] [Nat]Absence check using state equation in 3973 ms returned sat
[2020-06-05 06:37:19] [INFO ] Deduced a trap composed of 44 places in 588 ms
[2020-06-05 06:37:20] [INFO ] Deduced a trap composed of 27 places in 681 ms
[2020-06-05 06:37:21] [INFO ] Deduced a trap composed of 39 places in 689 ms
[2020-06-05 06:37:22] [INFO ] Deduced a trap composed of 32 places in 670 ms
[2020-06-05 06:37:22] [INFO ] Deduced a trap composed of 53 places in 597 ms
[2020-06-05 06:37:23] [INFO ] Deduced a trap composed of 25 places in 752 ms
[2020-06-05 06:37:24] [INFO ] Deduced a trap composed of 25 places in 636 ms
[2020-06-05 06:37:24] [INFO ] Deduced a trap composed of 32 places in 477 ms
[2020-06-05 06:37:25] [INFO ] Deduced a trap composed of 31 places in 399 ms
[2020-06-05 06:37:25] [INFO ] Deduced a trap composed of 54 places in 411 ms
[2020-06-05 06:37:26] [INFO ] Deduced a trap composed of 69 places in 407 ms
[2020-06-05 06:37:26] [INFO ] Deduced a trap composed of 34 places in 413 ms
[2020-06-05 06:37:27] [INFO ] Deduced a trap composed of 33 places in 376 ms
[2020-06-05 06:37:27] [INFO ] Deduced a trap composed of 38 places in 431 ms
[2020-06-05 06:37:28] [INFO ] Deduced a trap composed of 58 places in 489 ms
[2020-06-05 06:37:28] [INFO ] Deduced a trap composed of 34 places in 412 ms
[2020-06-05 06:37:29] [INFO ] Deduced a trap composed of 32 places in 464 ms
[2020-06-05 06:37:29] [INFO ] Deduced a trap composed of 39 places in 448 ms
[2020-06-05 06:37:30] [INFO ] Deduced a trap composed of 41 places in 445 ms
[2020-06-05 06:37:30] [INFO ] Deduced a trap composed of 54 places in 513 ms
[2020-06-05 06:37:31] [INFO ] Deduced a trap composed of 46 places in 375 ms
[2020-06-05 06:37:31] [INFO ] Deduced a trap composed of 58 places in 363 ms
[2020-06-05 06:37:31] [INFO ] Deduced a trap composed of 46 places in 354 ms
[2020-06-05 06:37:32] [INFO ] Deduced a trap composed of 28 places in 386 ms
[2020-06-05 06:37:32] [INFO ] Deduced a trap composed of 75 places in 398 ms
[2020-06-05 06:37:33] [INFO ] Deduced a trap composed of 33 places in 348 ms
[2020-06-05 06:37:33] [INFO ] Deduced a trap composed of 47 places in 326 ms
[2020-06-05 06:37:33] [INFO ] Deduced a trap composed of 56 places in 309 ms
[2020-06-05 06:37:34] [INFO ] Deduced a trap composed of 37 places in 313 ms
[2020-06-05 06:37:34] [INFO ] Deduced a trap composed of 39 places in 336 ms
[2020-06-05 06:37:34] [INFO ] Deduced a trap composed of 45 places in 300 ms
[2020-06-05 06:37:35] [INFO ] Deduced a trap composed of 42 places in 344 ms
[2020-06-05 06:37:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s572 s573 s574 s589 s590 s591 s592 s593 s594 s595 s598 s607 s608 s609 s648 s649 s650 s651 s652 s653 s654 s655 s656) 0)") while checking expression at index 1
[2020-06-05 06:37:35] [INFO ] [Real]Absence check using 121 positive place invariants in 124 ms returned sat
[2020-06-05 06:37:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:37:39] [INFO ] [Real]Absence check using state equation in 3881 ms returned sat
[2020-06-05 06:37:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:37:39] [INFO ] [Nat]Absence check using 121 positive place invariants in 161 ms returned sat
[2020-06-05 06:37:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:37:43] [INFO ] [Nat]Absence check using state equation in 3702 ms returned sat
[2020-06-05 06:37:44] [INFO ] Deduced a trap composed of 31 places in 846 ms
[2020-06-05 06:37:45] [INFO ] Deduced a trap composed of 23 places in 603 ms
[2020-06-05 06:37:45] [INFO ] Deduced a trap composed of 41 places in 563 ms
[2020-06-05 06:37:46] [INFO ] Deduced a trap composed of 34 places in 559 ms
[2020-06-05 06:37:47] [INFO ] Deduced a trap composed of 21 places in 678 ms
[2020-06-05 06:37:47] [INFO ] Deduced a trap composed of 25 places in 524 ms
[2020-06-05 06:37:48] [INFO ] Deduced a trap composed of 25 places in 524 ms
[2020-06-05 06:37:48] [INFO ] Deduced a trap composed of 50 places in 479 ms
[2020-06-05 06:37:49] [INFO ] Deduced a trap composed of 38 places in 636 ms
[2020-06-05 06:37:50] [INFO ] Deduced a trap composed of 47 places in 487 ms
[2020-06-05 06:37:50] [INFO ] Deduced a trap composed of 55 places in 696 ms
[2020-06-05 06:37:51] [INFO ] Deduced a trap composed of 40 places in 649 ms
[2020-06-05 06:37:52] [INFO ] Deduced a trap composed of 31 places in 594 ms
[2020-06-05 06:37:52] [INFO ] Deduced a trap composed of 50 places in 437 ms
[2020-06-05 06:37:53] [INFO ] Deduced a trap composed of 40 places in 563 ms
[2020-06-05 06:37:53] [INFO ] Deduced a trap composed of 31 places in 478 ms
[2020-06-05 06:37:54] [INFO ] Deduced a trap composed of 36 places in 471 ms
[2020-06-05 06:37:54] [INFO ] Deduced a trap composed of 60 places in 384 ms
[2020-06-05 06:37:55] [INFO ] Deduced a trap composed of 42 places in 494 ms
[2020-06-05 06:37:55] [INFO ] Deduced a trap composed of 26 places in 484 ms
[2020-06-05 06:37:56] [INFO ] Deduced a trap composed of 41 places in 431 ms
[2020-06-05 06:37:56] [INFO ] Deduced a trap composed of 53 places in 477 ms
[2020-06-05 06:37:57] [INFO ] Deduced a trap composed of 45 places in 431 ms
[2020-06-05 06:37:57] [INFO ] Deduced a trap composed of 43 places in 364 ms
[2020-06-05 06:37:58] [INFO ] Deduced a trap composed of 33 places in 496 ms
[2020-06-05 06:37:58] [INFO ] Deduced a trap composed of 43 places in 441 ms
[2020-06-05 06:37:59] [INFO ] Deduced a trap composed of 58 places in 409 ms
[2020-06-05 06:37:59] [INFO ] Deduced a trap composed of 48 places in 284 ms
[2020-06-05 06:37:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s474 s475 s476 s491 s492 s493 s494 s495 s496 s497 s500 s509 s510 s511 s541 s546 s552 s558 s562 s563 s564 s565 s566 s567 s568 s569 s570) 0)") while checking expression at index 2
[2020-06-05 06:37:59] [INFO ] [Real]Absence check using 121 positive place invariants in 122 ms returned sat
[2020-06-05 06:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:38:04] [INFO ] [Real]Absence check using state equation in 4219 ms returned sat
[2020-06-05 06:38:05] [INFO ] Deduced a trap composed of 35 places in 820 ms
[2020-06-05 06:38:06] [INFO ] Deduced a trap composed of 57 places in 843 ms
[2020-06-05 06:38:06] [INFO ] Deduced a trap composed of 40 places in 781 ms
[2020-06-05 06:38:07] [INFO ] Deduced a trap composed of 21 places in 625 ms
[2020-06-05 06:38:08] [INFO ] Deduced a trap composed of 37 places in 737 ms
[2020-06-05 06:38:09] [INFO ] Deduced a trap composed of 31 places in 714 ms
[2020-06-05 06:38:09] [INFO ] Deduced a trap composed of 27 places in 714 ms
[2020-06-05 06:38:10] [INFO ] Deduced a trap composed of 32 places in 518 ms
[2020-06-05 06:38:11] [INFO ] Deduced a trap composed of 36 places in 707 ms
[2020-06-05 06:38:11] [INFO ] Deduced a trap composed of 50 places in 689 ms
[2020-06-05 06:38:12] [INFO ] Deduced a trap composed of 46 places in 674 ms
[2020-06-05 06:38:13] [INFO ] Deduced a trap composed of 40 places in 663 ms
[2020-06-05 06:38:14] [INFO ] Deduced a trap composed of 26 places in 656 ms
[2020-06-05 06:38:14] [INFO ] Deduced a trap composed of 40 places in 696 ms
[2020-06-05 06:38:15] [INFO ] Deduced a trap composed of 23 places in 686 ms
[2020-06-05 06:38:16] [INFO ] Deduced a trap composed of 68 places in 667 ms
[2020-06-05 06:38:17] [INFO ] Deduced a trap composed of 52 places in 676 ms
[2020-06-05 06:38:17] [INFO ] Deduced a trap composed of 22 places in 648 ms
[2020-06-05 06:38:18] [INFO ] Deduced a trap composed of 27 places in 643 ms
[2020-06-05 06:38:19] [INFO ] Deduced a trap composed of 24 places in 644 ms
[2020-06-05 06:38:20] [INFO ] Deduced a trap composed of 50 places in 628 ms
[2020-06-05 06:38:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s430 s431 s432 s433 s434 s435 s436 s437 s438 s474 s475 s476 s492 s497 s500 s509 s510 s511 s515 s521 s550 s551 s552 s553 s554 s555 s556 s557 s558) 0)") while checking expression at index 3
[2020-06-05 06:38:20] [INFO ] [Real]Absence check using 121 positive place invariants in 111 ms returned sat
[2020-06-05 06:38:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:38:24] [INFO ] [Real]Absence check using state equation in 3788 ms returned sat
[2020-06-05 06:38:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:38:24] [INFO ] [Nat]Absence check using 121 positive place invariants in 354 ms returned sat
[2020-06-05 06:38:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:38:28] [INFO ] [Nat]Absence check using state equation in 3678 ms returned sat
[2020-06-05 06:38:29] [INFO ] Deduced a trap composed of 27 places in 816 ms
[2020-06-05 06:38:30] [INFO ] Deduced a trap composed of 28 places in 662 ms
[2020-06-05 06:38:30] [INFO ] Deduced a trap composed of 26 places in 605 ms
[2020-06-05 06:38:31] [INFO ] Deduced a trap composed of 31 places in 582 ms
[2020-06-05 06:38:32] [INFO ] Deduced a trap composed of 29 places in 557 ms
[2020-06-05 06:38:32] [INFO ] Deduced a trap composed of 40 places in 584 ms
[2020-06-05 06:38:33] [INFO ] Deduced a trap composed of 44 places in 560 ms
[2020-06-05 06:38:33] [INFO ] Deduced a trap composed of 30 places in 557 ms
[2020-06-05 06:38:34] [INFO ] Deduced a trap composed of 32 places in 602 ms
[2020-06-05 06:38:35] [INFO ] Deduced a trap composed of 27 places in 507 ms
[2020-06-05 06:38:35] [INFO ] Deduced a trap composed of 38 places in 559 ms
[2020-06-05 06:38:36] [INFO ] Deduced a trap composed of 40 places in 529 ms
[2020-06-05 06:38:36] [INFO ] Deduced a trap composed of 32 places in 538 ms
[2020-06-05 06:38:37] [INFO ] Deduced a trap composed of 38 places in 547 ms
[2020-06-05 06:38:38] [INFO ] Deduced a trap composed of 39 places in 539 ms
[2020-06-05 06:38:38] [INFO ] Deduced a trap composed of 38 places in 481 ms
[2020-06-05 06:38:39] [INFO ] Deduced a trap composed of 22 places in 522 ms
[2020-06-05 06:38:39] [INFO ] Deduced a trap composed of 42 places in 469 ms
[2020-06-05 06:38:40] [INFO ] Deduced a trap composed of 64 places in 518 ms
[2020-06-05 06:38:40] [INFO ] Deduced a trap composed of 48 places in 469 ms
[2020-06-05 06:38:41] [INFO ] Deduced a trap composed of 51 places in 455 ms
[2020-06-05 06:38:41] [INFO ] Deduced a trap composed of 45 places in 500 ms
[2020-06-05 06:38:42] [INFO ] Deduced a trap composed of 41 places in 514 ms
[2020-06-05 06:38:42] [INFO ] Deduced a trap composed of 53 places in 457 ms
[2020-06-05 06:38:43] [INFO ] Deduced a trap composed of 45 places in 484 ms
[2020-06-05 06:38:43] [INFO ] Deduced a trap composed of 43 places in 458 ms
[2020-06-05 06:38:44] [INFO ] Deduced a trap composed of 45 places in 420 ms
[2020-06-05 06:38:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s376 s377 s381 s382 s383 s384 s385 s386 s387 s388 s389 s404 s405 s406 s407 s408 s409 s410 s411 s414 s423 s424) 0)") while checking expression at index 4
[2020-06-05 06:38:44] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-05 06:38:44] [INFO ] Flatten gal took : 133 ms
[2020-06-05 06:38:44] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-05 06:38:44] [INFO ] Flatten gal took : 64 ms
FORMULA ShieldRVt-PT-030B-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 06:38:44] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-05 06:38:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ ShieldRVt-PT-030B @ 3570 seconds

FORMULA ShieldRVt-PT-030B-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030B-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030B-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030B-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030B-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030B-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030B-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030B-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030B-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030B-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3560
rslt: Output for CTLCardinality @ ShieldRVt-PT-030B

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 06:38:45 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p817 <= 0)) OR ((1 <= p963)))))",
"processed_size": 41,
"rewrites": 21
},
"result":
{
"edges": 14,
"markings": 15,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX((((1 <= p1144)) AND ((p793 <= 0))))",
"processed_size": 38,
"rewrites": 20
},
"net":
{
"conflict_clusters": 1323,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((p187 <= 0)) OR ((1 <= p699)) OR ((1 <= p1086)))",
"processed_size": 52,
"rewrites": 21
},
"result":
{
"edges": 492,
"markings": 492,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p123)) AND ((p245 <= 0)))))",
"processed_size": 41,
"rewrites": 20
},
"result":
{
"edges": 527,
"markings": 528,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p607 <= 0)) OR ((1 <= p506)))))",
"processed_size": 41,
"rewrites": 21
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p1383)) AND ((p443 <= 0)) AND (((p1436 <= 0)) OR ((1 <= p669))))))",
"processed_size": 81,
"rewrites": 20
},
"result":
{
"edges": 71,
"markings": 72,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (G ((((p622 <= 0)) OR ((1 <= p1290)) OR (((1 <= p1370)) AND ((p1252 <= 0))))))",
"processed_size": 82,
"rewrites": 20
},
"result":
{
"edges": 479,
"markings": 479,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p812 <= 0) OR (((1 <= p977)) AND ((p243 <= 0))) OR (((1 <= p918)) AND ((p1464 <= 0))))",
"processed_size": 90,
"rewrites": 22
},
"result":
{
"edges": 492,
"markings": 492,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 15
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 4
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1186
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(EG((((1 <= p1420)) AND ((p1433 <= 0)))))",
"processed_size": 43,
"rewrites": 21
},
"net":
{
"conflict_clusters": 1323,
"singleton_clusters": 0
},
"result":
{
"edges": 630,
"markings": 315,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1780
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E ((((p577 <= 0)) U (((1 <= p547)) AND ((p1322 <= 0)))))",
"processed_size": 56,
"rewrites": 22
},
"result":
{
"edges": 442,
"markings": 440,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3560
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3560
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p1221 <= 0)) OR ((1 <= p457)))",
"processed_size": 34,
"rewrites": 22
},
"result":
{
"edges": 494,
"markings": 494,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p1221 <= 0)) OR ((1 <= p457)))",
"processed_size": 34,
"rewrites": 22
},
"result":
{
"edges": 494,
"markings": 494,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G ((((p789 <= 0)) AND ((1 <= p484)) AND ((p95 <= 0)))))",
"processed_size": 58,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 46512,
"runtime": 10.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(G(**)) : (E(X(**)) AND (A(G(**)) OR E(X(**)))) : E(X(E(G(**)))) : E(F(*)) : A(F(E(G(*)))) : A(G(**)) : E((** U **)) : A(F(**)) : (A(G(*)) OR A(F(*)))"
},
"net":
{
"arcs": 3546,
"conflict_clusters": 1323,
"places": 1503,
"places_significant": 1382,
"singleton_clusters": 0,
"transitions": 1503
},
"result":
{
"preliminary_value": "yes yes no yes yes no no yes no no ",
"value": "yes yes no yes yes no no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 3006/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 48096
lola: finding significant places
lola: 1503 places, 1503 transitions, 1382 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p443 <= 1)
lola: LP says that atomic proposition is always true: (p669 <= 1)
lola: LP says that atomic proposition is always true: (p1290 <= 1)
lola: LP says that atomic proposition is always true: (p1252 <= 1)
lola: LP says that atomic proposition is always true: (p1059 <= 1)
lola: LP says that atomic proposition is always true: (p963 <= 1)
lola: LP says that atomic proposition is always true: (p793 <= 1)
lola: LP says that atomic proposition is always true: (p699 <= 1)
lola: LP says that atomic proposition is always true: (p1086 <= 1)
lola: LP says that atomic proposition is always true: (p245 <= 1)
lola: LP says that atomic proposition is always true: (p1433 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p577 <= 1)
lola: LP says that atomic proposition is always true: (p1322 <= 1)
lola: LP says that atomic proposition is always true: (p812 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p1464 <= 1)
lola: LP says that atomic proposition is always true: (p789 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p457 <= 1)
lola: E (((0 <= 0) U (((1 <= p1383)) AND ((p443 <= 0)) AND (((p1436 <= 0)) OR ((1 <= p669)))))) : E (G ((((p622 <= 0)) OR ((1 <= p1290)) OR (((1 <= p1370)) AND ((p1252 <= 0)))))) : (E (X ((((p899 <= 0)) OR ((1 <= p1059))))) AND (A (G ((((p817 <= 0)) OR ((1 <= p963))))) OR E (X ((((1 <= p1144)) AND ((p793 <= 0))))))) : E (X (E (G ((((p187 <= 0)) OR ((1 <= p699)) OR ((1 <= p1086))))))) : NOT(A (G ((((p123 <= 0)) OR ((1 <= p245)))))) : NOT(E (G (A (F ((((p1420 <= 0)) OR ((1 <= p1433)))))))) : A (G (A (G ((((p607 <= 0)) OR ((1 <= p506))))))) : E ((((p577 <= 0)) U (((1 <= p547)) AND ((p1322 <= 0))))) : A (((0 <= 0) U ((1 <= p812) AND (((p977 <= 0)) OR ((1 <= p243))) AND (((p918 <= 0)) OR ((1 <= p1464)))))) : (NOT(E (F ((((1 <= p789)) OR ((p484 <= 0)) OR ((1 <= p95)))))) OR NOT(E (G ((((p1221 <= 0)) OR ((1 <= p457)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((((p899 <= 0)) OR ((1 <= p1059))))) AND (A (G ((((p817 <= 0)) OR ((1 <= p963))))) OR E (X ((((1 <= p1144)) AND ((p793 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p817 <= 0)) OR ((1 <= p963)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p817 <= 0)) OR ((1 <= p963)))))
lola: processed formula length: 41
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p817)) AND ((p963 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 1 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((((1 <= p1144)) AND ((p793 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((((1 <= p1144)) AND ((p793 <= 0))))
lola: processed formula length: 38
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
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: ========================================
sara: try reading problem file CTLCardinality-0.sara.
lola: subprocess 1 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((((p187 <= 0)) OR ((1 <= p699)) OR ((1 <= p1086)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: (((p187 <= 0)) OR ((1 <= p699)) OR ((1 <= p1086)))
lola: processed formula length: 52
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p187 <= 0)) OR ((1 <= p699)) OR ((1 <= p1086)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 492 markings, 492 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p123)) AND ((p245 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p123)) AND ((p245 <= 0)))))
lola: processed formula length: 41
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p123)) AND ((p245 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 528 markings, 527 edges
lola: ========================================
lola: subprocess 3 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p607 <= 0)) OR ((1 <= p506)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p607 <= 0)) OR ((1 <= p506)))))
lola: processed formula length: 41
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p607)) AND ((p506 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 25 edges
lola: subprocess 4 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p1383)) AND ((p443 <= 0)) AND (((p1436 <= 0)) OR ((1 <= p669))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p1383)) AND ((p443 <= 0)) AND (((p1436 <= 0)) OR ((1 <= p669))))))
lola: processed formula length: 81
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p1383)) AND ((p443 <= 0)) AND (((p1436 <= 0)) OR ((1 <= p669))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
sara: error: :2655: error: syntax error, unexpected $end, expecting KEY_PRODUCE
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 72 markings, 71 edges
lola: ========================================
lola: subprocess 5 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p622 <= 0)) OR ((1 <= p1290)) OR (((1 <= p1370)) AND ((p1252 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p622 <= 0)) OR ((1 <= p1290)) OR (((1 <= p1370)) AND ((p1252 <= 0))))))
lola: processed formula length: 82
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p622)) AND ((p1290 <= 0)) AND (((p1370 <= 0)) OR ((1 <= p1252))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 479 markings, 479 edges
lola: ========================================
lola: subprocess 6 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p812) AND (((p977 <= 0)) OR ((1 <= p243))) AND (((p918 <= 0)) OR ((1 <= p1464))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p812 <= 0) OR (((1 <= p977)) AND ((p243 <= 0))) OR (((1 <= p918)) AND ((p1464 <= 0))))
lola: processed formula length: 90
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p812) AND (((p977 <= 0)) OR ((1 <= p243))) AND (((p918 <= 0)) OR ((1 <= p1464))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 492 markings, 492 edges
lola: ========================================
lola: subprocess 7 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((((1 <= p1420)) AND ((p1433 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((((1 <= p1420)) AND ((p1433 <= 0)))))
lola: processed formula length: 43
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 315 markings, 630 edges
lola: ========================================
lola: subprocess 8 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p577 <= 0)) U (((1 <= p547)) AND ((p1322 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((p577 <= 0)) U (((1 <= p547)) AND ((p1322 <= 0)))))
lola: processed formula length: 56
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p547)) AND ((p1322 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 440 markings, 442 edges
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 9 will run for 3560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p789 <= 0)) AND ((1 <= p484)) AND ((p95 <= 0))))) OR A (F ((((1 <= p1221)) AND ((p457 <= 0))))))
sara: lola: try reading problem file CTLCardinality-8-0.sara. ========================================

lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p1221)) AND ((p457 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((p1221 <= 0)) OR ((1 <= p457)))
lola: processed formula length: 34
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p1221)) AND ((p457 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 494 markings, 494 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: (A (G ((((p789 <= 0)) AND ((1 <= p484)) AND ((p95 <= 0))))) OR A (F ((((1 <= p1221)) AND ((p457 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p1221)) AND ((p457 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((p1221 <= 0)) OR ((1 <= p457)))
lola: processed formula length: 34
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p1221)) AND ((p457 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 494 markings, 494 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((((p789 <= 0)) AND ((1 <= p484)) AND ((p95 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((((p789 <= 0)) AND ((1 <= p484)) AND ((p95 <= 0)))))
lola: processed formula length: 58
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p789)) OR ((p484 <= 0)) OR ((1 <= p95)))
lola: state equation task get result unparse finished id 0
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes yes no no yes no no
lola:
preliminary result: yes yes no yes yes no no yes no no
lola: memory consumption: 46512 KB
lola: time consumption: 10 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

--------------------
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="ShieldRVt-PT-030B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itslola"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is ShieldRVt-PT-030B, 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 r211-tajo-159033478301043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-030B.tgz
mv ShieldRVt-PT-030B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;