Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r184-oct2-158987928600451.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is JoinFreeModules-PT-0500, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928600451
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 3.6K Apr 7 20:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 7 20:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 6 22:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 6 22:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 6 05:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 6 05:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 5 12:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 5 12:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 2.9M Mar 24 05:37 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 JoinFreeModules-PT-0500-CTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591208453981

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 18:20:57] [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-03 18:20:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 18:20:57] [INFO ] Load time of PNML (sax parser for PT used): 361 ms
[2020-06-03 18:20:57] [INFO ] Transformed 2501 places.
[2020-06-03 18:20:57] [INFO ] Transformed 4001 transitions.
[2020-06-03 18:20:57] [INFO ] Parsed PT model containing 2501 places and 4001 transitions in 574 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 143 ms.
Incomplete random walk after 100239 steps, including 0 resets, run finished after 2015 ms. (steps per millisecond=49 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0]
// Phase 1: matrix 4001 rows 2500 cols
[2020-06-03 18:21:00] [INFO ] Computed 500 place invariants in 69 ms
[2020-06-03 18:21:01] [INFO ] [Real]Absence check using 500 positive place invariants in 691 ms returned sat
[2020-06-03 18:21:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:21:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:21:20] [INFO ] [Real]Absence check using state equation in 18728 ms returned (error "Failed to check-sat")
[2020-06-03 18:21:20] [INFO ] [Real]Absence check using 500 positive place invariants in 462 ms returned sat
[2020-06-03 18:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:21:39] [INFO ] [Real]Absence check using state equation in 19043 ms returned sat
[2020-06-03 18:21:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:21:40] [INFO ] [Nat]Absence check using 500 positive place invariants in 427 ms returned sat
[2020-06-03 18:21:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:22:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:22:00] [INFO ] [Nat]Absence check using state equation in 19458 ms returned (error "Failed to check-sat")
[2020-06-03 18:22:00] [INFO ] [Real]Absence check using 500 positive place invariants in 455 ms returned sat
[2020-06-03 18:22:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:22:18] [INFO ] [Real]Absence check using state equation in 18097 ms returned sat
[2020-06-03 18:22:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:22:19] [INFO ] [Nat]Absence check using 500 positive place invariants in 481 ms returned sat
[2020-06-03 18:22:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:22:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:22:39] [INFO ] [Nat]Absence check using state equation in 19355 ms returned (error "Failed to check-sat")
[2020-06-03 18:22:39] [INFO ] [Real]Absence check using 500 positive place invariants in 443 ms returned sat
[2020-06-03 18:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:22:57] [INFO ] [Real]Absence check using state equation in 18014 ms returned sat
[2020-06-03 18:22:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:22:58] [INFO ] [Nat]Absence check using 500 positive place invariants in 501 ms returned sat
[2020-06-03 18:22:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:23:17] [INFO ] [Nat]Absence check using state equation in 19321 ms returned unknown
[2020-06-03 18:23:18] [INFO ] [Real]Absence check using 500 positive place invariants in 469 ms returned sat
[2020-06-03 18:23:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:36] [INFO ] [Real]Absence check using state equation in 18159 ms returned sat
[2020-06-03 18:23:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:23:37] [INFO ] [Nat]Absence check using 500 positive place invariants in 445 ms returned sat
[2020-06-03 18:23:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:23:49] [INFO ] [Nat]Absence check using state equation in 12022 ms returned unknown
[2020-06-03 18:23:49] [INFO ] [Real]Absence check using 500 positive place invariants in 417 ms returned sat
[2020-06-03 18:23:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:24:07] [INFO ] [Real]Absence check using state equation in 17842 ms returned sat
[2020-06-03 18:24:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:24:08] [INFO ] [Nat]Absence check using 500 positive place invariants in 426 ms returned sat
[2020-06-03 18:24:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:24:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:24:21] [INFO ] [Nat]Absence check using state equation in 13641 ms returned unknown
[2020-06-03 18:24:22] [INFO ] [Real]Absence check using 500 positive place invariants in 454 ms returned sat
[2020-06-03 18:24:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:24:41] [INFO ] [Real]Absence check using state equation in 18883 ms returned sat
[2020-06-03 18:24:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:24:42] [INFO ] [Nat]Absence check using 500 positive place invariants in 440 ms returned sat
[2020-06-03 18:24:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:25:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:25:01] [INFO ] [Nat]Absence check using state equation in 19459 ms returned (error "Failed to check-sat")
[2020-06-03 18:25:02] [INFO ] [Real]Absence check using 500 positive place invariants in 440 ms returned sat
[2020-06-03 18:25:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:25:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:25:21] [INFO ] [Real]Absence check using state equation in 19438 ms returned (error "Failed to check-sat")
[2020-06-03 18:25:22] [INFO ] [Real]Absence check using 500 positive place invariants in 487 ms returned sat
[2020-06-03 18:25:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:25:39] [INFO ] [Real]Absence check using state equation in 17711 ms returned sat
[2020-06-03 18:25:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:25:40] [INFO ] [Nat]Absence check using 500 positive place invariants in 438 ms returned sat
[2020-06-03 18:25:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:25:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:25:59] [INFO ] [Nat]Absence check using state equation in 19428 ms returned (error "Failed to check-sat")
[2020-06-03 18:26:00] [INFO ] [Real]Absence check using 500 positive place invariants in 473 ms returned sat
[2020-06-03 18:26:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:26:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:26:19] [INFO ] [Real]Absence check using state equation in 19406 ms returned unknown
[2020-06-03 18:26:20] [INFO ] [Real]Absence check using 500 positive place invariants in 442 ms returned sat
[2020-06-03 18:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:26:38] [INFO ] [Real]Absence check using state equation in 18312 ms returned sat
[2020-06-03 18:26:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:26:39] [INFO ] [Nat]Absence check using 500 positive place invariants in 437 ms returned sat
[2020-06-03 18:26:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:26:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:26:53] [INFO ] [Nat]Absence check using state equation in 13589 ms returned unknown
[2020-06-03 18:26:53] [INFO ] [Real]Absence check using 500 positive place invariants in 443 ms returned sat
[2020-06-03 18:26:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:27:12] [INFO ] [Real]Absence check using state equation in 18536 ms returned sat
[2020-06-03 18:27:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:27:12] [INFO ] [Nat]Absence check using 500 positive place invariants in 449 ms returned sat
[2020-06-03 18:27:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:27:26] [INFO ] [Nat]Absence check using state equation in 14009 ms returned sat
[2020-06-03 18:27:28] [INFO ] Deduced a trap composed of 3 places in 1089 ms
[2020-06-03 18:27:29] [INFO ] Deduced a trap composed of 3 places in 784 ms
[2020-06-03 18:27:29] [INFO ] Deduced a trap composed of 3 places in 739 ms
[2020-06-03 18:27:30] [INFO ] Deduced a trap composed of 3 places in 972 ms
[2020-06-03 18:27:31] [INFO ] Deduced a trap composed of 3 places in 787 ms
[2020-06-03 18:27:32] [INFO ] Deduced a trap composed of 3 places in 858 ms
[2020-06-03 18:27:32] [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 (> (+ s1016 s1017 s1019) 0)") while checking expression at index 11
[2020-06-03 18:27:33] [INFO ] [Real]Absence check using 500 positive place invariants in 475 ms returned sat
[2020-06-03 18:27:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:27:51] [INFO ] [Real]Absence check using state equation in 17769 ms returned sat
[2020-06-03 18:27:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:27:51] [INFO ] [Nat]Absence check using 500 positive place invariants in 487 ms returned sat
[2020-06-03 18:27:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:28:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:28:11] [INFO ] [Nat]Absence check using state equation in 19393 ms returned (error "Failed to check-sat")
[2020-06-03 18:28:11] [INFO ] [Real]Absence check using 500 positive place invariants in 408 ms returned sat
[2020-06-03 18:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:28:29] [INFO ] [Real]Absence check using state equation in 17698 ms returned sat
[2020-06-03 18:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:28:30] [INFO ] [Nat]Absence check using 500 positive place invariants in 436 ms returned sat
[2020-06-03 18:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:28:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:28:43] [INFO ] [Nat]Absence check using state equation in 13544 ms returned unknown
[2020-06-03 18:28:44] [INFO ] [Real]Absence check using 500 positive place invariants in 438 ms returned sat
[2020-06-03 18:28:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:29:02] [INFO ] [Real]Absence check using state equation in 18417 ms returned sat
[2020-06-03 18:29:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:29:03] [INFO ] [Nat]Absence check using 500 positive place invariants in 442 ms returned sat
[2020-06-03 18:29:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:29:11] [INFO ] [Nat]Absence check using state equation in 8206 ms returned sat
[2020-06-03 18:29:12] [INFO ] Deduced a trap composed of 3 places in 1125 ms
[2020-06-03 18:29:13] [INFO ] Deduced a trap composed of 3 places in 825 ms
[2020-06-03 18:29:14] [INFO ] Deduced a trap composed of 3 places in 626 ms
[2020-06-03 18:29:15] [INFO ] Deduced a trap composed of 3 places in 618 ms
[2020-06-03 18:29:15] [INFO ] Deduced a trap composed of 3 places in 646 ms
[2020-06-03 18:29:16] [INFO ] Deduced a trap composed of 3 places in 641 ms
[2020-06-03 18:29:17] [INFO ] Deduced a trap composed of 3 places in 598 ms
[2020-06-03 18:29:17] [INFO ] Deduced a trap composed of 3 places in 603 ms
[2020-06-03 18:29:18] [INFO ] Deduced a trap composed of 3 places in 625 ms
[2020-06-03 18:29:19] [INFO ] Deduced a trap composed of 3 places in 556 ms
[2020-06-03 18:29:20] [INFO ] Deduced a trap composed of 3 places in 682 ms
[2020-06-03 18:29:20] [INFO ] Deduced a trap composed of 3 places in 568 ms
[2020-06-03 18:29:21] [INFO ] Deduced a trap composed of 3 places in 549 ms
[2020-06-03 18:29:21] [INFO ] Deduced a trap composed of 3 places in 554 ms
[2020-06-03 18:29:22] [INFO ] Deduced a trap composed of 3 places in 565 ms
[2020-06-03 18:29:23] [INFO ] Deduced a trap composed of 3 places in 594 ms
[2020-06-03 18:29:23] [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 (> (+ s196 s197 s199) 0)") while checking expression at index 14
[2020-06-03 18:29:23] [INFO ] [Real]Absence check using 500 positive place invariants in 434 ms returned sat
[2020-06-03 18:29:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:29:41] [INFO ] [Real]Absence check using state equation in 17911 ms returned sat
[2020-06-03 18:29:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:29:42] [INFO ] [Nat]Absence check using 500 positive place invariants in 433 ms returned sat
[2020-06-03 18:29:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:29:57] [INFO ] [Nat]Absence check using state equation in 14977 ms returned sat
[2020-06-03 18:29:58] [INFO ] Deduced a trap composed of 3 places in 703 ms
[2020-06-03 18:29:58] [INFO ] Deduced a trap composed of 3 places in 650 ms
[2020-06-03 18:29:59] [INFO ] Deduced a trap composed of 3 places in 647 ms
[2020-06-03 18:30:00] [INFO ] Deduced a trap composed of 3 places in 646 ms
[2020-06-03 18:30:01] [INFO ] Deduced a trap composed of 3 places in 642 ms
[2020-06-03 18:30:01] [INFO ] Deduced a trap composed of 3 places in 653 ms
[2020-06-03 18:30:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:30:04] [INFO ] Deduced a trap composed of 3 places in 2787 ms
[2020-06-03 18:30:04] [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 (> (+ s1855 s1858 s1859) 0)") while checking expression at index 15
[2020-06-03 18:30:05] [INFO ] [Real]Absence check using 500 positive place invariants in 450 ms returned sat
[2020-06-03 18:30:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:30:23] [INFO ] [Real]Absence check using state equation in 18596 ms returned sat
[2020-06-03 18:30:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:30:24] [INFO ] [Nat]Absence check using 500 positive place invariants in 442 ms returned sat
[2020-06-03 18:30:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:30:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:30:43] [INFO ] [Nat]Absence check using state equation in 19444 ms returned (error "Failed to check-sat")
[2020-06-03 18:30:44] [INFO ] [Real]Absence check using 500 positive place invariants in 438 ms returned sat
[2020-06-03 18:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:31:03] [INFO ] [Real]Absence check using state equation in 18891 ms returned sat
[2020-06-03 18:31:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:31:04] [INFO ] [Nat]Absence check using 500 positive place invariants in 457 ms returned sat
[2020-06-03 18:31:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:31:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:31:23] [INFO ] [Nat]Absence check using state equation in 19422 ms returned (error "Failed to check-sat")
[2020-06-03 18:31:23] [INFO ] [Real]Absence check using 500 positive place invariants in 434 ms returned sat
[2020-06-03 18:31:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:31:42] [INFO ] [Real]Absence check using state equation in 18027 ms returned sat
[2020-06-03 18:31:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:31:42] [INFO ] [Nat]Absence check using 500 positive place invariants in 442 ms returned sat
[2020-06-03 18:31:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:31:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:31:56] [INFO ] [Nat]Absence check using state equation in 13482 ms returned unknown
[2020-06-03 18:31:56] [INFO ] [Real]Absence check using 500 positive place invariants in 405 ms returned sat
[2020-06-03 18:31:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:32:15] [INFO ] [Real]Absence check using state equation in 18836 ms returned sat
[2020-06-03 18:32:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:32:16] [INFO ] [Nat]Absence check using 500 positive place invariants in 467 ms returned sat
[2020-06-03 18:32:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:32:35] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:32:35] [INFO ] [Nat]Absence check using state equation in 19412 ms returned unknown
[2020-06-03 18:32:36] [INFO ] [Real]Absence check using 500 positive place invariants in 501 ms returned sat
[2020-06-03 18:32:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:32:54] [INFO ] [Real]Absence check using state equation in 18151 ms returned sat
[2020-06-03 18:32:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:32:55] [INFO ] [Nat]Absence check using 500 positive place invariants in 484 ms returned sat
[2020-06-03 18:32:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:33:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:33:05] [INFO ] [Nat]Absence check using state equation in 10336 ms returned unknown
[2020-06-03 18:33:06] [INFO ] [Real]Absence check using 500 positive place invariants in 467 ms returned sat
[2020-06-03 18:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:33:23] [INFO ] [Real]Absence check using state equation in 17609 ms returned sat
[2020-06-03 18:33:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:33:24] [INFO ] [Nat]Absence check using 500 positive place invariants in 439 ms returned sat
[2020-06-03 18:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:33:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:33:43] [INFO ] [Nat]Absence check using state equation in 19451 ms returned unknown
[2020-06-03 18:33:44] [INFO ] [Real]Absence check using 500 positive place invariants in 418 ms returned sat
[2020-06-03 18:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:34:02] [INFO ] [Real]Absence check using state equation in 18416 ms returned sat
[2020-06-03 18:34:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:34:03] [INFO ] [Nat]Absence check using 500 positive place invariants in 423 ms returned sat
[2020-06-03 18:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:34:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:34:22] [INFO ] [Nat]Absence check using state equation in 19461 ms returned (error "Failed to check-sat")
[2020-06-03 18:34:23] [INFO ] Flatten gal took : 226 ms
[2020-06-03 18:34:23] [INFO ] Flatten gal took : 152 ms
[2020-06-03 18:34:23] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 14 ms.
[2020-06-03 18:34:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 15 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ JoinFreeModules-PT-0500 @ 3570 seconds

FORMULA JoinFreeModules-PT-0500-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-CTLCardinality-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-CTLCardinality-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2084
rslt: Output for CTLCardinality @ JoinFreeModules-PT-0500

{
"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": "Wed Jun 3 18:34:23 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 226
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "AX(AX((p2015 <= p52)))",
"processed_size": 22,
"rewrites": 14
},
"net":
{
"conflict_clusters": 2001,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"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": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 226
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "EX(AF(((2 <= p1078) AND (p1920 <= p674))))",
"processed_size": 42,
"rewrites": 14
},
"net":
{
"conflict_clusters": 2001,
"singleton_clusters": 0
},
"result":
{
"edges": 1502994,
"markings": 1501994,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 250
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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(EX((p1154 <= p1077)))",
"processed_size": 24,
"rewrites": 14
},
"net":
{
"conflict_clusters": 2001,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"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": null
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 250
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((2 <= p252)))",
"processed_size": 19,
"rewrites": 14
},
"result":
{
"edges": 499,
"markings": 500,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 270
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "AX((p1855 <= p1683))",
"processed_size": 20,
"rewrites": 13
},
"net":
{
"conflict_clusters": 2001,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"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": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 295
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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 (G ((p1099 <= p281)))",
"processed_size": 23,
"rewrites": 13
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 325
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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 (((p497 <= p14) OR (p286 <= p1450))))",
"processed_size": 43,
"rewrites": 13
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 17
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 361
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (G (((p1843 + 1 <= p100) AND ((p789 <= p908) OR ((p271 <= p2451) AND (3 <= p34))))))",
"processed_size": 87,
"rewrites": 13
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 27
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 406
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "EG(A((p1656 <= p1317) U (p1888 <= p1066)))",
"processed_size": 42,
"rewrites": 14
},
"net":
{
"conflict_clusters": 2001,
"singleton_clusters": 0
},
"result":
{
"edges": 3004,
"markings": 1502,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 464
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": "A(((p2288 + 1 <= p1192) AND (1 <= p674)) U EG((p109 <= p1568)))",
"processed_size": 63,
"rewrites": 14
},
"net":
{
"conflict_clusters": 2001,
"singleton_clusters": 0
},
"result":
{
"edges": 1503,
"markings": 1502,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 541
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "A (((p2179 <= p322) U (p866 <= p858)))",
"processed_size": 38,
"rewrites": 17
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 788
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A ((((p39 <= 2) OR (p1739 <= p1732) OR (p659 <= p1890)) U ((p2188 + 1 <= p724) AND ((2 <= p318) OR (3 <= p2395)))))",
"processed_size": 118,
"rewrites": 17
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1523
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "((p356 <= p852) AND (p1602 <= p1117))",
"processed_size": 37,
"rewrites": 15
},
"result":
{
"edges": 1502,
"markings": 1502,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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(EX((p1154 <= p1077)))",
"processed_size": 24,
"rewrites": 14
},
"net":
{
"conflict_clusters": 2001,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3404,
"runtime": 1486.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(F(**)) AND A(X(A(X(**))))) : E(X(A(F(**)))) : E(G(**)) : E(G(*)) : (E((** U **)) AND E(X(E(X(**))))) : A((** U **)) : E(G(*)) : (A(X(**)) OR (A(G(**)) AND A(F(A(X(**)))))) : A((* R *)) : A((** U E(G(**)))) : A((** U **)) : A(G(**)) : E((** U **)) : E(G(E(F(**)))) : E(G(A((** U **)))) : E(F((E(G(**)) AND **)))"
},
"net":
{
"arcs": 11500,
"conflict_clusters": 2001,
"places": 2500,
"places_significant": 2000,
"singleton_clusters": 0,
"transitions": 4001
},
"result":
{
"preliminary_value": "yes no yes yes unknown no yes no unknown yes no no unknown yes yes unknown ",
"value": "yes no yes yes unknown no yes no unknown yes no no unknown yes yes unknown "
},
"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: 6501/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 80000
lola: finding significant places
lola: 2500 places, 4001 transitions, 2000 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: (A (F (E (F ((1 <= p297))))) AND A (X (A (X ((p2015 <= p52)))))) : E (X (A (F (((2 <= p1078) AND (p1920 <= p674)))))) : E (G (((p1843 + 1 <= p100) AND ((p789 <= p908) OR ((p271 <= p2451) AND (3 <= p34)))))) : NOT(A (F ((p281 + 1 <= p1099)))) : (E ((((p649 <= p404) OR (3 <= p233)) U (3 <= p749))) AND E (X (E (X ((p1154 <= p1077)))))) : A (((p2179 <= p322) U (p866 <= p858))) : NOT(A (F (((p14 + 1 <= p497) AND (p1450 + 1 <= p286))))) : A ((A (G ((2 <= p252))) U A (X ((p1855 <= p1683))))) : NOT(E ((((1 <= p490) OR (p986 <= p2065)) U ((1 <= p1078) AND (3 <= p263))))) : A ((((p2288 + 1 <= p1192) AND (1 <= p674)) U E (G ((p109 <= p1568))))) : A ((((p39 <= 2) OR (p1739 <= p1732) OR (p659 <= p1890)) U ((p2188 + 1 <= p724) AND ((2 <= p318) OR (3 <= p2395))))) : A (G ((p2098 <= 1))) : E ((((p1060 <= p245) OR (p2177 <= p1174) OR ((p650 <= p2269) AND (3 <= p479))) U ((p666 + 1 <= p2005) AND ((p2290 <= p1498) OR (p455 <= p294))))) : E (G (E (F (((p356 <= p852) AND (p1602 <= p1117)))))) : E (G (A (((p1656 <= p1317) U (p1888 <= p1066))))) : E (F ((E (G ((p2350 <= p761))) AND ((1 <= p794) OR ((1 <= p1996) AND (1 <= p1702))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:449
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:479
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 212 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((1 <= p297))) AND A (X (A (X ((p2015 <= p52))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 212 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p297)))
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 <= p297)))
lola: processed formula length: 19
lola: 13 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 <= p297)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: subprocess 1 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (X ((p2015 <= p52)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(AX((p2015 <= p52)))
lola: processed formula length: 22
lola: 14 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (((2 <= p1078) AND (p1920 <= p674))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF(((2 <= p1078) AND (p1920 <= p674))))
lola: processed formula length: 42
lola: 14 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 298108 markings, 298305 edges, 59622 markings/sec, 0 secs
lola: 549485 markings, 549850 edges, 50275 markings/sec, 5 secs
lola: 718443 markings, 718921 edges, 33792 markings/sec, 10 secs
lola: 861237 markings, 861810 edges, 28559 markings/sec, 15 secs
lola: 996239 markings, 996902 edges, 27000 markings/sec, 20 secs
lola: 1112388 markings, 1113128 edges, 23230 markings/sec, 25 secs
lola: 1220815 markings, 1221627 edges, 21685 markings/sec, 30 secs
lola: 1416913 markings, 1417855 edges, 39220 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1501994 markings, 1502994 edges
lola: ========================================
lola: subprocess 2 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((p649 <= p404) OR (3 <= p233)) U (3 <= p749))) AND E (X (E (X ((p1154 <= p1077))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p649 <= p404) OR (3 <= p233)) U (3 <= p749)))
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 ((((p649 <= p404) OR (3 <= p233)) U (3 <= p749)))
lola: processed formula length: 52
lola: 15 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: (3 <= p749)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 204130 markings, 291038 edges, 40826 markings/sec, 0 secs
lola: sara is running 5 secs || 412546 markings, 588454 edges, 41683 markings/sec, 5 secs
lola: sara is running 10 secs || 616659 markings, 880073 edges, 40823 markings/sec, 10 secs
lola: sara is running 15 secs || 817085 markings, 1166271 edges, 40085 markings/sec, 15 secs
lola: sara is running 20 secs || 1015531 markings, 1449610 edges, 39689 markings/sec, 20 secs
lola: sara is running 25 secs || 1213634 markings, 1732336 edges, 39621 markings/sec, 25 secs
lola: sara is running 30 secs || 1417082 markings, 2022787 edges, 40690 markings/sec, 30 secs
lola: sara is running 35 secs || 1619089 markings, 2311111 edges, 40401 markings/sec, 35 secs
lola: sara is running 40 secs || 1820465 markings, 2598804 edges, 40275 markings/sec, 40 secs
lola: sara is running 45 secs || 2023067 markings, 2887716 edges, 40520 markings/sec, 45 secs
lola: sara is running 50 secs || 2225410 markings, 3176503 edges, 40469 markings/sec, 50 secs
lola: sara is running 55 secs || 2427594 markings, 3465254 edges, 40437 markings/sec, 55 secs
lola: sara is running 60 secs || 2628449 markings, 3752050 edges, 40171 markings/sec, 60 secs
lola: sara is running 65 secs || 2828453 markings, 4037745 edges, 40001 markings/sec, 65 secs
lola: sara is running 70 secs || 3029256 markings, 4324087 edges, 40161 markings/sec, 70 secs
lola: sara is running 75 secs || 3135362 markings, 4476120 edges, 21221 markings/sec, 75 secs
lola: sara is running 80 secs || 3318580 markings, 4737292 edges, 36644 markings/sec, 80 secs
lola: sara is running 85 secs || 3487565 markings, 4978755 edges, 33797 markings/sec, 85 secs
lola: sara is running 90 secs || 3670905 markings, 5240561 edges, 36668 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (X ((p1154 <= p1077)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(EX((p1154 <= p1077)))
lola: processed formula length: 24
lola: 14 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 3 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((p1855 <= p1683))) OR (A (G ((2 <= p252))) AND A (F (A (X ((p1855 <= p1683)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p252)))
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 ((2 <= p252)))
lola: processed formula length: 19
lola: 14 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: (p252 <= 1)
lola: state equation task get result unparse finished id 0
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: 500 markings, 499 edges
lola: ========================================
lola: subprocess 4 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p1855 <= p1683)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((p1855 <= p1683))
lola: processed formula length: 20
lola: 13 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: ========================================
lola: subprocess 4 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p2098 <= 1)))
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 ((p2098 <= 1)))
lola: processed formula length: 20
lola: 14 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: (2 <= p2098)
lola: state equation task get result unparse finished id 0
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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p1099 <= p281)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p1099 <= p281)))
lola: processed formula length: 23
lola: 13 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p281 + 1 <= p1099)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 65 markings, 65 edges
lola: subprocess 6 will run for 325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (((p497 <= p14) OR (p286 <= p1450))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p497 <= p14) OR (p286 <= p1450))))
lola: processed formula length: 43
lola: 13 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p14 + 1 <= p497) AND (p1450 + 1 <= p286))
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 / EG
lola: The predicate is possibly preserved.
lola: 65 markings, 65 edges
lola: ========================================
lola: subprocess 7 will run for 361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p1843 + 1 <= p100) AND ((p789 <= p908) OR ((p271 <= p2451) AND (3 <= p34))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p1843 + 1 <= p100) AND ((p789 <= p908) OR ((p271 <= p2451) AND (3 <= p34))))))
lola: processed formula length: 87
lola: 13 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: ((p100 <= p1843) OR ((p908 + 1 <= p789) AND ((p2451 + 1 <= p271) OR (p34 <= 2))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 65 markings, 65 edges
lola: ========================================
lola: subprocess 8 will run for 406 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (((p1656 <= p1317) U (p1888 <= p1066)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(A((p1656 <= p1317) U (p1888 <= p1066)))
lola: processed formula length: 42
lola: 14 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1502 markings, 3004 edges
lola: ========================================
lola: subprocess 9 will run for 464 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p2288 + 1 <= p1192) AND (1 <= p674)) U E (G ((p109 <= p1568)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(((p2288 + 1 <= p1192) AND (1 <= p674)) U EG((p109 <= p1568)))
lola: processed formula length: 63
lola: 14 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1502 markings, 1503 edges
lola: ========================================
lola: subprocess 10 will run for 541 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p2179 <= p322) U (p866 <= p858)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((p2179 <= p322) U (p866 <= p858)))
lola: processed formula length: 38
lola: 17 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl 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: (p2179 <= p322)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 65 markings, 65 edges
lola: subprocess 11 will run for 650 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p490 <= 0) AND (p2065 + 1 <= p986)) R ((p1078 <= 0) OR (p263 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((((p490 <= 0) AND (p2065 + 1 <= p986)) R ((p1078 <= 0) OR (p263 <= 2))))
lola: processed formula length: 76
lola: 17 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: ========================================
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: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p1078) AND (3 <= p263))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 201031 markings, 286735 edges, 40206 markings/sec, 0 secs
lola: sara is running 5 secs || 403289 markings, 575626 edges, 40452 markings/sec, 5 secs
lola: sara is running 10 secs || 605694 markings, 864645 edges, 40481 markings/sec, 10 secs
lola: sara is running 15 secs || 806692 markings, 1151454 edges, 40200 markings/sec, 15 secs
lola: sara is running 20 secs || 1005812 markings, 1435904 edges, 39824 markings/sec, 20 secs
lola: sara is running 25 secs || 1205256 markings, 1720178 edges, 39889 markings/sec, 25 secs
lola: sara is running 30 secs || 1404985 markings, 2005511 edges, 39946 markings/sec, 30 secs
lola: sara is running 35 secs || 1604314 markings, 2290383 edges, 39866 markings/sec, 35 secs
lola: sara is running 40 secs || 1806631 markings, 2579014 edges, 40463 markings/sec, 40 secs
lola: sara is running 45 secs || 2005535 markings, 2862742 edges, 39781 markings/sec, 45 secs
lola: sara is running 50 secs || 2206916 markings, 3150445 edges, 40276 markings/sec, 50 secs
lola: sara is running 55 secs || 2406505 markings, 3435087 edges, 39918 markings/sec, 55 secs
lola: sara is running 60 secs || 2604839 markings, 3718220 edges, 39667 markings/sec, 60 secs
lola: sara is running 65 secs || 2803833 markings, 4002515 edges, 39799 markings/sec, 65 secs
lola: sara is running 70 secs || 3004885 markings, 4289296 edges, 40210 markings/sec, 70 secs
lola: sara is running 75 secs || 3194894 markings, 4561077 edges, 38002 markings/sec, 75 secs
lola: sara is running 80 secs || 3373509 markings, 4815588 edges, 35723 markings/sec, 80 secs
lola: sara is running 85 secs || 3547761 markings, 5064326 edges, 34850 markings/sec, 85 secs
lola: sara is running 90 secs || 3721849 markings, 5312883 edges, 34818 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 788 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p39 <= 2) OR (p1739 <= p1732) OR (p659 <= p1890)) U ((p2188 + 1 <= p724) AND ((2 <= p318) OR (3 <= p2395)))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((p39 <= 2) OR (p1739 <= p1732) OR (p659 <= p1890)) U ((p2188 + 1 <= p724) AND ((2 <= p318) OR (3 <= p2395)))))
lola: processed formula length: 118
lola: 17 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl 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: ((p39 <= 2) OR (p1739 <= p1732) OR (p659 <= p1890))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 65 markings, 65 edges
lola: ========================================
lola: subprocess 13 will run for 1050 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p1060 <= p245) OR (p2177 <= p1174) OR ((p650 <= p2269) AND (3 <= p479))) U ((p666 + 1 <= p2005) AND ((p2290 <= p1498) OR (p455 <= p294)))))
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 ((((p1060 <= p245) OR (p2177 <= p1174) OR ((p650 <= p2269) AND (3 <= p479))) U ((p666 + 1 <= p2005) AND ((p2290 <= p1498) OR (p455 <= p294)))))
lola: processed formula length: 148
lola: 15 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: ((p666 + 1 <= p2005) AND ((p2290 <= p1498) OR (p455 <= p294)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 197254 markings, 281247 edges, 39451 markings/sec, 0 secs
lola: sara is running 5 secs || 397348 markings, 567005 edges, 40019 markings/sec, 5 secs
lola: sara is running 10 secs || 595162 markings, 849650 edges, 39563 markings/sec, 10 secs
lola: sara is running 15 secs || 792618 markings, 1131308 edges, 39491 markings/sec, 15 secs
lola: sara is running 20 secs || 988945 markings, 1411596 edges, 39265 markings/sec, 20 secs
lola: sara is running 25 secs || 1185858 markings, 1692704 edges, 39383 markings/sec, 25 secs
lola: sara is running 30 secs || 1382655 markings, 1973476 edges, 39359 markings/sec, 30 secs
lola: sara is running 35 secs || 1579331 markings, 2254521 edges, 39335 markings/sec, 35 secs
lola: sara is running 40 secs || 1775530 markings, 2534518 edges, 39240 markings/sec, 40 secs
lola: sara is running 45 secs || 1969286 markings, 2811296 edges, 38751 markings/sec, 45 secs
lola: sara is running 50 secs || 2165657 markings, 3091328 edges, 39274 markings/sec, 50 secs
lola: sara is running 55 secs || 2361849 markings, 3371518 edges, 39238 markings/sec, 55 secs
lola: sara is running 60 secs || 2557313 markings, 3650755 edges, 39093 markings/sec, 60 secs
lola: sara is running 65 secs || 2747766 markings, 3922345 edges, 38091 markings/sec, 65 secs
lola: sara is running 70 secs || 2942704 markings, 4200666 edges, 38988 markings/sec, 70 secs
lola: sara is running 75 secs || 3134919 markings, 4475345 edges, 38443 markings/sec, 75 secs
lola: sara is running 80 secs || 3310444 markings, 4725735 edges, 35105 markings/sec, 80 secs
lola: sara is running 85 secs || 3480910 markings, 4969121 edges, 34093 markings/sec, 85 secs
lola: sara is running 90 secs || 3659632 markings, 5224205 edges, 35744 markings/sec, 90 secs
lola: sara is running 95 secs || 3835822 markings, 5475834 edges, 35238 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1523 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((p356 <= p852) AND (p1602 <= p1117))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((p356 <= p852) AND (p1602 <= p1117))
lola: processed formula length: 37
lola: 15 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
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 started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: state equation task get result unparse finished++ id 0
lola: formula 1: ((p356 <= p852) AND (p1602 <= p1117))
lola: state equation task get result unparse finished id 1
lola: formula 0: ((p852 + 1 <= p356) OR (p1117 + 1 <= p1602))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 1502 markings, 1502 edges
lola: ========================================
lola: subprocess 15 will run for 3047 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((p2350 <= p761))) AND ((1 <= p794) OR ((1 <= p1996) AND (1 <= p1702))))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p761 + 1 <= p2350)) OR ((p794 <= 0) AND ((p1996 <= 0) OR (p1702 <= 0)))))
lola: processed formula length: 82
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 140119 markings, 230380 edges, 28024 markings/sec, 0 secs
lola: 361639 markings, 595191 edges, 44304 markings/sec, 5 secs
lola: 591695 markings, 973900 edges, 46011 markings/sec, 10 secs
lola: 823454 markings, 1355435 edges, 46352 markings/sec, 15 secs
lola: 1055173 markings, 1736886 edges, 46344 markings/sec, 20 secs
lola: 1284389 markings, 2114306 edges, 45843 markings/sec, 25 secs
lola: 1516069 markings, 2495923 edges, 46336 markings/sec, 30 secs
lola: 1747136 markings, 2876222 edges, 46213 markings/sec, 35 secs
lola: 1978746 markings, 3257486 edges, 46322 markings/sec, 40 secs
lola: 2210065 markings, 3638366 edges, 46264 markings/sec, 45 secs
lola: 2443331 markings, 4022363 edges, 46653 markings/sec, 50 secs
lola: 2675001 markings, 4403793 edges, 46334 markings/sec, 55 secs
lola: 2908160 markings, 4787636 edges, 46632 markings/sec, 60 secs
lola: 3144836 markings, 5177357 edges, 47335 markings/sec, 65 secs
lola: 3381039 markings, 5566334 edges, 47241 markings/sec, 70 secs
lola: 3617209 markings, 5955076 edges, 47234 markings/sec, 75 secs
lola: 3857911 markings, 6351326 edges, 48140 markings/sec, 80 secs
lola: 4090935 markings, 6734919 edges, 46605 markings/sec, 85 secs
lola: 4313787 markings, 7102006 edges, 44570 markings/sec, 90 secs
lola: 4538828 markings, 7472620 edges, 45008 markings/sec, 95 secs
lola: 4763028 markings, 7841588 edges, 44840 markings/sec, 100 secs
lola: 4987866 markings, 8211740 edges, 44968 markings/sec, 105 secs
lola: 5213484 markings, 8583276 edges, 45124 markings/sec, 110 secs
lola: 5438758 markings, 8954013 edges, 45055 markings/sec, 115 secs
lola: 5676995 markings, 9346386 edges, 47647 markings/sec, 120 secs
lola: 5914427 markings, 9737259 edges, 47486 markings/sec, 125 secs
lola: 6145489 markings, 10117570 edges, 46212 markings/sec, 130 secs
lola: 6374007 markings, 10493917 edges, 45704 markings/sec, 135 secs
lola: 6610669 markings, 10883346 edges, 47332 markings/sec, 140 secs
lola: 6846314 markings, 11271286 edges, 47129 markings/sec, 145 secs
lola: 7081982 markings, 11659369 edges, 47134 markings/sec, 150 secs
lola: 7318138 markings, 12048346 edges, 47231 markings/sec, 155 secs
lola: 7550801 markings, 12431272 edges, 46533 markings/sec, 160 secs
lola: 7780991 markings, 12810316 edges, 46038 markings/sec, 165 secs
lola: 8010224 markings, 13187699 edges, 45847 markings/sec, 170 secs
lola: 8241024 markings, 13567581 edges, 46160 markings/sec, 175 secs
lola: 8470634 markings, 13945714 edges, 45922 markings/sec, 180 secs
lola: 8698854 markings, 14321333 edges, 45644 markings/sec, 185 secs
lola: 8928316 markings, 14699289 edges, 45892 markings/sec, 190 secs
lola: 9159959 markings, 15080470 edges, 46329 markings/sec, 195 secs
lola: 9391774 markings, 15462423 edges, 46363 markings/sec, 200 secs
lola: 9626523 markings, 15848728 edges, 46950 markings/sec, 205 secs
lola: 9864465 markings, 16240464 edges, 47588 markings/sec, 210 secs
lola: 10100406 markings, 16628902 edges, 47188 markings/sec, 215 secs
lola: 10337550 markings, 17019400 edges, 47429 markings/sec, 220 secs
lola: 10575178 markings, 17410515 edges, 47526 markings/sec, 225 secs
lola: 10811369 markings, 17799537 edges, 47238 markings/sec, 230 secs
lola: 11049413 markings, 18191269 edges, 47609 markings/sec, 235 secs
lola: 11283790 markings, 18577223 edges, 46875 markings/sec, 240 secs
lola: 11514009 markings, 18956341 edges, 46044 markings/sec, 245 secs
lola: 11741799 markings, 19331337 edges, 45558 markings/sec, 250 secs
lola: 11966390 markings, 19700957 edges, 44918 markings/sec, 255 secs
lola: 12188323 markings, 20066692 edges, 44387 markings/sec, 260 secs
lola: 12409759 markings, 20431123 edges, 44287 markings/sec, 265 secs
lola: 12624716 markings, 20785035 edges, 42991 markings/sec, 270 secs
lola: 12841090 markings, 21141187 edges, 43275 markings/sec, 275 secs
lola: 13043641 markings, 21474575 edges, 40510 markings/sec, 280 secs
lola: 13250299 markings, 21814870 edges, 41332 markings/sec, 285 secs
lola: 13471978 markings, 22179939 edges, 44336 markings/sec, 290 secs
lola: 13690409 markings, 22539455 edges, 43686 markings/sec, 295 secs
lola: 13909889 markings, 22900946 edges, 43896 markings/sec, 300 secs
lola: 14134314 markings, 23270473 edges, 44885 markings/sec, 305 secs
lola: 14357417 markings, 23637740 edges, 44621 markings/sec, 310 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E ((((p649 <= p404) OR (3 <= p233)) U (3 <= p749))) AND E (X (E (X ((p1154 <= p1077))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E ((((p649 <= p404) OR (3 <= p233)) U (3 <= p749)))
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 ((((p649 <= p404) OR (3 <= p233)) U (3 <= p749)))
lola: processed formula length: 52
lola: 15 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: (3 <= p749)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-16-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 202945 markings, 289263 edges, 40589 markings/sec, 0 secs
lola: sara is running 5 secs || 413181 markings, 589564 edges, 42047 markings/sec, 5 secs
lola: sara is running 10 secs || 617504 markings, 880944 edges, 40865 markings/sec, 10 secs
lola: sara is running 15 secs || 821610 markings, 1172831 edges, 40821 markings/sec, 15 secs
lola: sara is running 20 secs || 1026306 markings, 1465094 edges, 40939 markings/sec, 20 secs
lola: sara is running 25 secs || 1233036 markings, 1759861 edges, 41346 markings/sec, 25 secs
lola: sara is running 30 secs || 1439581 markings, 2054828 edges, 41309 markings/sec, 30 secs
lola: sara is running 35 secs || 1641665 markings, 2343418 edges, 40417 markings/sec, 35 secs
lola: sara is running 40 secs || 1842430 markings, 2629695 edges, 40153 markings/sec, 40 secs
lola: sara is running 45 secs || 2045934 markings, 2920753 edges, 40701 markings/sec, 45 secs
lola: sara is running 50 secs || 2248898 markings, 3210282 edges, 40593 markings/sec, 50 secs
lola: sara is running 55 secs || 2449822 markings, 3497429 edges, 40185 markings/sec, 55 secs
lola: sara is running 60 secs || 2649789 markings, 3782319 edges, 39993 markings/sec, 60 secs
lola: sara is running 65 secs || 2849952 markings, 4068642 edges, 40033 markings/sec, 65 secs
lola: sara is running 70 secs || 3053347 markings, 4358512 edges, 40679 markings/sec, 70 secs
lola: sara is running 75 secs || 3236771 markings, 4620812 edges, 36685 markings/sec, 75 secs
lola: sara is running 80 secs || 3409762 markings, 4867700 edges, 34598 markings/sec, 80 secs
lola: sara is running 85 secs || 3586174 markings, 5119204 edges, 35282 markings/sec, 85 secs
lola: sara is running 90 secs || 3764718 markings, 5374443 edges, 35709 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (X (E (X ((p1154 <= p1077)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(EX((p1154 <= p1077)))
lola: processed formula length: 24
lola: 14 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((((p490 <= 0) AND (p2065 + 1 <= p986)) R ((p1078 <= 0) OR (p263 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((((p490 <= 0) AND (p2065 + 1 <= p986)) R ((p1078 <= 0) OR (p263 <= 2))))
lola: processed formula length: 76
lola: 17 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: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p1078) AND (3 <= p263))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-17-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 200834 markings, 286391 edges, 40167 markings/sec, 0 secs
lola: sara is running 5 secs || 403812 markings, 576442 edges, 40596 markings/sec, 5 secs
lola: sara is running 10 secs || 607394 markings, 866618 edges, 40716 markings/sec, 10 secs
lola: sara is running 15 secs || 809410 markings, 1155080 edges, 40403 markings/sec, 15 secs
lola: sara is running 20 secs || 1011648 markings, 1443930 edges, 40448 markings/sec, 20 secs
lola: sara is running 25 secs || 1214031 markings, 1733031 edges, 40477 markings/sec, 25 secs
lola: sara is running 30 secs || 1418897 markings, 2025368 edges, 40973 markings/sec, 30 secs
lola: sara is running 35 secs || 1622715 markings, 2316225 edges, 40764 markings/sec, 35 secs
lola: sara is running 40 secs || 1825214 markings, 2605164 edges, 40500 markings/sec, 40 secs
lola: sara is running 45 secs || 2025932 markings, 2892070 edges, 40144 markings/sec, 45 secs
lola: sara is running 50 secs || 2230459 markings, 3184211 edges, 40905 markings/sec, 50 secs
lola: sara is running 55 secs || 2435711 markings, 3477224 edges, 41050 markings/sec, 55 secs
lola: sara is running 60 secs || 2638711 markings, 3766778 edges, 40600 markings/sec, 60 secs
lola: sara is running 65 secs || 2839484 markings, 4053693 edges, 40155 markings/sec, 65 secs
lola: sara is running 70 secs || 3042843 markings, 4343541 edges, 40672 markings/sec, 70 secs
lola: sara is running 75 secs || 3231101 markings, 4612251 edges, 37652 markings/sec, 75 secs
lola: sara is running 80 secs || 3413601 markings, 4873289 edges, 36500 markings/sec, 80 secs
lola: sara is running 85 secs || 3598513 markings, 5137326 edges, 36982 markings/sec, 85 secs
lola: sara is running 90 secs || 3778766 markings, 5394537 edges, 36051 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((((p1060 <= p245) OR (p2177 <= p1174) OR ((p650 <= p2269) AND (3 <= p479))) U ((p666 + 1 <= p2005) AND ((p2290 <= p1498) OR (p455 <= p294)))))
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 ((((p1060 <= p245) OR (p2177 <= p1174) OR ((p650 <= p2269) AND (3 <= p479))) U ((p666 + 1 <= p2005) AND ((p2290 <= p1498) OR (p455 <= p294)))))
lola: processed formula length: 148
lola: 15 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: ((p666 + 1 <= p2005) AND ((p2290 <= p1498) OR (p455 <= p294)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-18-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 193177 markings, 275243 edges, 38635 markings/sec, 0 secs
lola: sara is running 5 secs || 394188 markings, 562355 edges, 40202 markings/sec, 5 secs
lola: sara is running 10 secs || 593586 markings, 846943 edges, 39880 markings/sec, 10 secs
lola: sara is running 15 secs || 791897 markings, 1130048 edges, 39662 markings/sec, 15 secs
lola: sara is running 20 secs || 991096 markings, 1414693 edges, 39840 markings/sec, 20 secs
lola: sara is running 25 secs || 1189786 markings, 1698457 edges, 39738 markings/sec, 25 secs
lola: sara is running 30 secs || 1388966 markings, 1982765 edges, 39836 markings/sec, 30 secs
lola: sara is running 35 secs || 1589097 markings, 2268244 edges, 40026 markings/sec, 35 secs
lola: sara is running 40 secs || 1787494 markings, 2551493 edges, 39679 markings/sec, 40 secs
lola: sara is running 45 secs || 1988499 markings, 2838267 edges, 40201 markings/sec, 45 secs
lola: sara is running 50 secs || 2182596 markings, 3115707 edges, 38819 markings/sec, 50 secs
lola: sara is running 55 secs || 2374953 markings, 3389963 edges, 38471 markings/sec, 55 secs
lola: sara is running 60 secs || 2570246 markings, 3668901 edges, 39059 markings/sec, 60 secs
lola: sara is running 65 secs || 2764724 markings, 3946414 edges, 38896 markings/sec, 65 secs
lola: sara is running 70 secs || 2958696 markings, 4223679 edges, 38794 markings/sec, 70 secs
lola: sara is running 75 secs || 3145408 markings, 4490342 edges, 37342 markings/sec, 75 secs
lola: sara is running 80 secs || 3316575 markings, 4734841 edges, 34233 markings/sec, 80 secs
lola: sara is running 85 secs || 3465088 markings, 4946572 edges, 29703 markings/sec, 85 secs
lola: sara is running 90 secs || 3498142 markings, 4993796 edges, 6611 markings/sec, 90 secs
lola: sara is running 95 secs || 3657813 markings, 5221928 edges, 31934 markings/sec, 95 secs
lola: sara is running 100 secs || 3755738 markings, 5361520 edges, 19585 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((p2350 <= p761))) AND ((1 <= p794) OR ((1 <= p1996) AND (1 <= p1702))))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p761 + 1 <= p2350)) OR ((p794 <= 0) AND ((p1996 <= 0) OR (p1702 <= 0)))))
lola: processed formula length: 82
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 191790 markings, 315710 edges, 38358 markings/sec, 0 secs
lola: 407968 markings, 671458 edges, 43236 markings/sec, 5 secs
lola: 633842 markings, 1043219 edges, 45175 markings/sec, 10 secs
lola: 858547 markings, 1413090 edges, 44941 markings/sec, 15 secs
lola: 1068548 markings, 1758900 edges, 42000 markings/sec, 20 secs
lola: 1279689 markings, 2106530 edges, 42228 markings/sec, 25 secs
lola: 1487796 markings, 2449327 edges, 41621 markings/sec, 30 secs
lola: 1700288 markings, 2799061 edges, 42498 markings/sec, 35 secs
lola: 1925043 markings, 3169101 edges, 44951 markings/sec, 40 secs
lola: 2148582 markings, 3537250 edges, 44708 markings/sec, 45 secs
lola: 2372339 markings, 3905643 edges, 44751 markings/sec, 50 secs
lola: 2597047 markings, 4275528 edges, 44942 markings/sec, 55 secs
lola: 2820288 markings, 4642977 edges, 44648 markings/sec, 60 secs
lola: 3046740 markings, 5015740 edges, 45290 markings/sec, 65 secs
lola: 3273813 markings, 5389815 edges, 45415 markings/sec, 70 secs
lola: 3499596 markings, 5761417 edges, 45157 markings/sec, 75 secs
lola: 3725176 markings, 6132894 edges, 45116 markings/sec, 80 secs
lola: 3949026 markings, 6501488 edges, 44770 markings/sec, 85 secs
lola: 4169969 markings, 6865208 edges, 44189 markings/sec, 90 secs
lola: 4391199 markings, 7229512 edges, 44246 markings/sec, 95 secs
lola: 4617210 markings, 7601355 edges, 45202 markings/sec, 100 secs
lola: 4841587 markings, 7970890 edges, 44875 markings/sec, 105 secs
lola: 5065515 markings, 8339584 edges, 44786 markings/sec, 110 secs
lola: 5290448 markings, 8709899 edges, 44987 markings/sec, 115 secs
lola: 5513563 markings, 9077263 edges, 44623 markings/sec, 120 secs
lola: 5734986 markings, 9441804 edges, 44285 markings/sec, 125 secs
lola: 5959247 markings, 9811045 edges, 44852 markings/sec, 130 secs
lola: 6184278 markings, 10181422 edges, 45006 markings/sec, 135 secs
lola: 6409090 markings, 10551461 edges, 44962 markings/sec, 140 secs
lola: 6638772 markings, 10929784 edges, 45936 markings/sec, 145 secs
lola: 6864965 markings, 11302193 edges, 45239 markings/sec, 150 secs
lola: 7092849 markings, 11677302 edges, 45577 markings/sec, 155 secs
lola: 7316877 markings, 12046153 edges, 44806 markings/sec, 160 secs
lola: 7540141 markings, 12413714 edges, 44653 markings/sec, 165 secs
lola: 7764073 markings, 12782252 edges, 44786 markings/sec, 170 secs
lola: 7988433 markings, 13151922 edges, 44872 markings/sec, 175 secs
lola: 8212167 markings, 13519998 edges, 44747 markings/sec, 180 secs
lola: 8434950 markings, 13886837 edges, 44557 markings/sec, 185 secs
lola: 8657297 markings, 14252924 edges, 44469 markings/sec, 190 secs
lola: 8881870 markings, 14622924 edges, 44915 markings/sec, 195 secs
lola: 9106050 markings, 14991859 edges, 44836 markings/sec, 200 secs
lola: 9329199 markings, 15359205 edges, 44630 markings/sec, 205 secs
lola: 9552335 markings, 15726572 edges, 44627 markings/sec, 210 secs
lola: 9774918 markings, 16093127 edges, 44517 markings/sec, 215 secs
lola: 9995896 markings, 16456798 edges, 44196 markings/sec, 220 secs
lola: 10215814 markings, 16819065 edges, 43984 markings/sec, 225 secs
lola: 10436908 markings, 17182851 edges, 44219 markings/sec, 230 secs
lola: 10658477 markings, 17547680 edges, 44314 markings/sec, 235 secs
lola: 10878990 markings, 17910701 edges, 44103 markings/sec, 240 secs
lola: 11099783 markings, 18274144 edges, 44159 markings/sec, 245 secs
lola: 11322386 markings, 18640740 edges, 44521 markings/sec, 250 secs
lola: 11545080 markings, 19007462 edges, 44539 markings/sec, 255 secs
lola: 11767952 markings, 19374403 edges, 44574 markings/sec, 260 secs
lola: 11916854 markings, 19619599 edges, 29780 markings/sec, 265 secs
lola: 12099629 markings, 19920499 edges, 36555 markings/sec, 270 secs
lola: 12313581 markings, 20272682 edges, 42790 markings/sec, 275 secs
lola: 12528455 markings, 20626439 edges, 42975 markings/sec, 280 secs
lola: 12742562 markings, 20978965 edges, 42821 markings/sec, 285 secs
lola: 12954185 markings, 21327408 edges, 42325 markings/sec, 290 secs
lola: 13166426 markings, 21677010 edges, 42448 markings/sec, 295 secs
lola: 13382974 markings, 22033462 edges, 43310 markings/sec, 300 secs
lola: 13597501 markings, 22386597 edges, 42905 markings/sec, 305 secs
lola: 13811478 markings, 22738978 edges, 42795 markings/sec, 310 secs
lola: 14026999 markings, 23093857 edges, 43104 markings/sec, 315 secs
lola: 14240979 markings, 23446100 edges, 42796 markings/sec, 320 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no yes yes unknown no yes no unknown yes no no unknown yes yes unknown
lola:
preliminary result: yes no yes yes unknown no yes no unknown yes no no unknown yes yes unknown
lola: memory consumption: 3404 KB
lola: time consumption: 1486 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="JoinFreeModules-PT-0500"
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 JoinFreeModules-PT-0500, 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 r184-oct2-158987928600451"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0500.tgz
mv JoinFreeModules-PT-0500 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 ;