Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.1M
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 5.9M Apr 27 14:36 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 Dekker-PT-100-CTLCardinality-00
FORMULA_NAME Dekker-PT-100-CTLCardinality-01
FORMULA_NAME Dekker-PT-100-CTLCardinality-02
FORMULA_NAME Dekker-PT-100-CTLCardinality-03
FORMULA_NAME Dekker-PT-100-CTLCardinality-04
FORMULA_NAME Dekker-PT-100-CTLCardinality-05
FORMULA_NAME Dekker-PT-100-CTLCardinality-06
FORMULA_NAME Dekker-PT-100-CTLCardinality-07
FORMULA_NAME Dekker-PT-100-CTLCardinality-08
FORMULA_NAME Dekker-PT-100-CTLCardinality-09
FORMULA_NAME Dekker-PT-100-CTLCardinality-10
FORMULA_NAME Dekker-PT-100-CTLCardinality-11
FORMULA_NAME Dekker-PT-100-CTLCardinality-12
FORMULA_NAME Dekker-PT-100-CTLCardinality-13
FORMULA_NAME Dekker-PT-100-CTLCardinality-14
FORMULA_NAME Dekker-PT-100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591217564207

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:52:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 20:52:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:52:46] [INFO ] Load time of PNML (sax parser for PT used): 420 ms
[2020-06-03 20:52:46] [INFO ] Transformed 500 places.
[2020-06-03 20:52:46] [INFO ] Transformed 10200 transitions.
[2020-06-03 20:52:46] [INFO ] Found NUPN structural information;
[2020-06-03 20:52:46] [INFO ] Parsed PT model containing 500 places and 10200 transitions in 538 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 59 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1603 ms. (steps per millisecond=62 ) properties seen :[1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1]
[2020-06-03 20:52:48] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2020-06-03 20:52:48] [INFO ] Computed 300 place invariants in 38 ms
[2020-06-03 20:52:48] [INFO ] [Real]Absence check using 200 positive place invariants in 119 ms returned sat
[2020-06-03 20:52:48] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 49 ms returned sat
[2020-06-03 20:52:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:52:49] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2020-06-03 20:52:49] [INFO ] State equation strengthened by 100 read => feed constraints.
[2020-06-03 20:52:49] [INFO ] [Real]Added 100 Read/Feed constraints in 56 ms returned sat
[2020-06-03 20:52:49] [INFO ] Deduced a trap composed of 4 places in 184 ms
[2020-06-03 20:52:49] [INFO ] Deduced a trap composed of 4 places in 151 ms
[2020-06-03 20:52:50] [INFO ] Deduced a trap composed of 4 places in 123 ms
[2020-06-03 20:52:50] [INFO ] Deduced a trap composed of 6 places in 100 ms
[2020-06-03 20:52:50] [INFO ] Deduced a trap composed of 6 places in 81 ms
[2020-06-03 20:52:50] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-06-03 20:52:50] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-06-03 20:52:50] [INFO ] Deduced a trap composed of 6 places in 62 ms
[2020-06-03 20:52:50] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 20:52:50] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-06-03 20:52:50] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 20:52:50] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-06-03 20:52:50] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-06-03 20:52:51] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-06-03 20:52:51] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-06-03 20:52:51] [INFO ] Deduced a trap composed of 5 places in 51 ms
[2020-06-03 20:52:51] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-06-03 20:52:51] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2020-06-03 20:52:51] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1856 ms
[2020-06-03 20:52:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:52:51] [INFO ] [Nat]Absence check using 200 positive place invariants in 90 ms returned sat
[2020-06-03 20:52:51] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 48 ms returned sat
[2020-06-03 20:52:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:52:52] [INFO ] [Nat]Absence check using state equation in 652 ms returned sat
[2020-06-03 20:52:52] [INFO ] [Nat]Added 100 Read/Feed constraints in 37 ms returned sat
[2020-06-03 20:52:52] [INFO ] Deduced a trap composed of 4 places in 138 ms
[2020-06-03 20:52:52] [INFO ] Deduced a trap composed of 6 places in 87 ms
[2020-06-03 20:52:52] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-06-03 20:52:52] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-06-03 20:52:52] [INFO ] Deduced a trap composed of 4 places in 134 ms
[2020-06-03 20:52:53] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-06-03 20:52:53] [INFO ] Deduced a trap composed of 5 places in 96 ms
[2020-06-03 20:52:53] [INFO ] Deduced a trap composed of 6 places in 90 ms
[2020-06-03 20:52:53] [INFO ] Deduced a trap composed of 6 places in 71 ms
[2020-06-03 20:52:53] [INFO ] Deduced a trap composed of 6 places in 126 ms
[2020-06-03 20:52:53] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2020-06-03 20:52:53] [INFO ] Deduced a trap composed of 6 places in 95 ms
[2020-06-03 20:52:53] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2020-06-03 20:52:54] [INFO ] Deduced a trap composed of 6 places in 86 ms
[2020-06-03 20:52:54] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 20:52:54] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-06-03 20:52:54] [INFO ] Deduced a trap composed of 6 places in 69 ms
[2020-06-03 20:52:54] [INFO ] Deduced a trap composed of 5 places in 60 ms
[2020-06-03 20:52:54] [INFO ] Deduced a trap composed of 6 places in 80 ms
[2020-06-03 20:52:54] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-06-03 20:52:54] [INFO ] Deduced a trap composed of 6 places in 76 ms
[2020-06-03 20:52:54] [INFO ] Deduced a trap composed of 5 places in 69 ms
[2020-06-03 20:52:55] [INFO ] Deduced a trap composed of 5 places in 67 ms
[2020-06-03 20:52:55] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-06-03 20:52:55] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 20:52:55] [INFO ] Deduced a trap composed of 6 places in 81 ms
[2020-06-03 20:52:55] [INFO ] Deduced a trap composed of 6 places in 87 ms
[2020-06-03 20:52:55] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2020-06-03 20:52:55] [INFO ] Deduced a trap composed of 6 places in 101 ms
[2020-06-03 20:52:55] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 20:52:55] [INFO ] Deduced a trap composed of 6 places in 82 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 5 places in 73 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 5 places in 51 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 5 places in 60 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 6 places in 68 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 5 places in 53 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 5 places in 51 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-06-03 20:52:56] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-06-03 20:52:56] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 4621 ms
[2020-06-03 20:52:57] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 263 ms.
[2020-06-03 20:52:59] [INFO ] Added : 101 causal constraints over 21 iterations in 2444 ms. Result :sat
[2020-06-03 20:52:59] [INFO ] [Real]Absence check using 200 positive place invariants in 99 ms returned sat
[2020-06-03 20:52:59] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 52 ms returned sat
[2020-06-03 20:52:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:53:00] [INFO ] [Real]Absence check using state equation in 728 ms returned sat
[2020-06-03 20:53:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:53:00] [INFO ] [Nat]Absence check using 200 positive place invariants in 88 ms returned sat
[2020-06-03 20:53:00] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 49 ms returned sat
[2020-06-03 20:53:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:53:01] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2020-06-03 20:53:01] [INFO ] [Nat]Added 100 Read/Feed constraints in 26 ms returned sat
[2020-06-03 20:53:01] [INFO ] Deduced a trap composed of 4 places in 119 ms
[2020-06-03 20:53:01] [INFO ] Deduced a trap composed of 5 places in 110 ms
[2020-06-03 20:53:01] [INFO ] Deduced a trap composed of 4 places in 119 ms
[2020-06-03 20:53:01] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2020-06-03 20:53:01] [INFO ] Deduced a trap composed of 5 places in 91 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 6 places in 83 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 5 places in 62 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 20:53:02] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 5 places in 55 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 5 places in 54 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 5 places in 47 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 5 places in 87 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 20:53:03] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-06-03 20:53:04] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-06-03 20:53:04] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 2761 ms
[2020-06-03 20:53:04] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 286 ms.
[2020-06-03 20:53:06] [INFO ] Added : 101 causal constraints over 21 iterations in 2485 ms. Result :sat
[2020-06-03 20:53:06] [INFO ] [Real]Absence check using 200 positive place invariants in 101 ms returned sat
[2020-06-03 20:53:06] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 56 ms returned sat
[2020-06-03 20:53:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:53:07] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2020-06-03 20:53:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:53:07] [INFO ] [Nat]Absence check using 200 positive place invariants in 93 ms returned sat
[2020-06-03 20:53:07] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 76 ms returned sat
[2020-06-03 20:53:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:53:08] [INFO ] [Nat]Absence check using state equation in 672 ms returned sat
[2020-06-03 20:53:08] [INFO ] [Nat]Added 100 Read/Feed constraints in 37 ms returned sat
[2020-06-03 20:53:08] [INFO ] Deduced a trap composed of 4 places in 138 ms
[2020-06-03 20:53:08] [INFO ] Deduced a trap composed of 4 places in 137 ms
[2020-06-03 20:53:09] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2020-06-03 20:53:09] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-06-03 20:53:09] [INFO ] Deduced a trap composed of 4 places in 147 ms
[2020-06-03 20:53:09] [INFO ] Deduced a trap composed of 4 places in 129 ms
[2020-06-03 20:53:09] [INFO ] Deduced a trap composed of 5 places in 112 ms
[2020-06-03 20:53:09] [INFO ] Deduced a trap composed of 6 places in 112 ms
[2020-06-03 20:53:09] [INFO ] Deduced a trap composed of 4 places in 111 ms
[2020-06-03 20:53:10] [INFO ] Deduced a trap composed of 6 places in 99 ms
[2020-06-03 20:53:10] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-06-03 20:53:10] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-06-03 20:53:10] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-06-03 20:53:10] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 20:53:10] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-06-03 20:53:10] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 20:53:10] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-03 20:53:10] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 20:53:11] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-06-03 20:53:11] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-06-03 20:53:11] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 20:53:11] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-06-03 20:53:11] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 20:53:11] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-06-03 20:53:11] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-06-03 20:53:11] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 20:53:11] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 20:53:11] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-06-03 20:53:12] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-06-03 20:53:12] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 20:53:12] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 20:53:12] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 20:53:12] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-06-03 20:53:12] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-06-03 20:53:12] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-06-03 20:53:12] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-06-03 20:53:12] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 4057 ms
[2020-06-03 20:53:12] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 229 ms.
[2020-06-03 20:53:15] [INFO ] Added : 101 causal constraints over 21 iterations in 2345 ms. Result :sat
[2020-06-03 20:53:15] [INFO ] [Real]Absence check using 200 positive place invariants in 94 ms returned sat
[2020-06-03 20:53:15] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 51 ms returned sat
[2020-06-03 20:53:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:53:16] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2020-06-03 20:53:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:53:16] [INFO ] [Nat]Absence check using 200 positive place invariants in 87 ms returned sat
[2020-06-03 20:53:16] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 65 ms returned sat
[2020-06-03 20:53:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:53:16] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2020-06-03 20:53:16] [INFO ] [Nat]Added 100 Read/Feed constraints in 32 ms returned sat
[2020-06-03 20:53:16] [INFO ] Deduced a trap composed of 4 places in 122 ms
[2020-06-03 20:53:17] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2020-06-03 20:53:17] [INFO ] Deduced a trap composed of 4 places in 135 ms
[2020-06-03 20:53:17] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-06-03 20:53:17] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 20:53:17] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-06-03 20:53:17] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-06-03 20:53:17] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 20:53:17] [INFO ] Deduced a trap composed of 5 places in 72 ms
[2020-06-03 20:53:18] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 20:53:18] [INFO ] Deduced a trap composed of 5 places in 93 ms
[2020-06-03 20:53:18] [INFO ] Deduced a trap composed of 5 places in 81 ms
[2020-06-03 20:53:18] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-06-03 20:53:18] [INFO ] Deduced a trap composed of 5 places in 69 ms
[2020-06-03 20:53:18] [INFO ] Deduced a trap composed of 5 places in 66 ms
[2020-06-03 20:53:18] [INFO ] Deduced a trap composed of 5 places in 68 ms
[2020-06-03 20:53:18] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 20:53:18] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 20:53:18] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2073 ms
[2020-06-03 20:53:19] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 227 ms.
[2020-06-03 20:53:21] [INFO ] Added : 101 causal constraints over 21 iterations in 2415 ms. Result :sat
[2020-06-03 20:53:21] [INFO ] [Real]Absence check using 200 positive place invariants in 94 ms returned sat
[2020-06-03 20:53:21] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 58 ms returned sat
[2020-06-03 20:53:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:53:22] [INFO ] [Real]Absence check using state equation in 684 ms returned sat
[2020-06-03 20:53:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:53:22] [INFO ] [Nat]Absence check using 200 positive place invariants in 87 ms returned sat
[2020-06-03 20:53:22] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 51 ms returned sat
[2020-06-03 20:53:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:53:23] [INFO ] [Nat]Absence check using state equation in 661 ms returned sat
[2020-06-03 20:53:23] [INFO ] [Nat]Added 100 Read/Feed constraints in 31 ms returned sat
[2020-06-03 20:53:23] [INFO ] Deduced a trap composed of 4 places in 148 ms
[2020-06-03 20:53:23] [INFO ] Deduced a trap composed of 6 places in 131 ms
[2020-06-03 20:53:23] [INFO ] Deduced a trap composed of 4 places in 131 ms
[2020-06-03 20:53:23] [INFO ] Deduced a trap composed of 4 places in 118 ms
[2020-06-03 20:53:24] [INFO ] Deduced a trap composed of 4 places in 120 ms
[2020-06-03 20:53:24] [INFO ] Deduced a trap composed of 6 places in 118 ms
[2020-06-03 20:53:24] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-06-03 20:53:24] [INFO ] Deduced a trap composed of 6 places in 75 ms
[2020-06-03 20:53:24] [INFO ] Deduced a trap composed of 6 places in 90 ms
[2020-06-03 20:53:24] [INFO ] Deduced a trap composed of 6 places in 90 ms
[2020-06-03 20:53:24] [INFO ] Deduced a trap composed of 6 places in 72 ms
[2020-06-03 20:53:24] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-06-03 20:53:24] [INFO ] Deduced a trap composed of 6 places in 76 ms
[2020-06-03 20:53:25] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-06-03 20:53:25] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2020-06-03 20:53:25] [INFO ] Deduced a trap composed of 6 places in 101 ms
[2020-06-03 20:53:25] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-06-03 20:53:25] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 20:53:25] [INFO ] Deduced a trap composed of 6 places in 73 ms
[2020-06-03 20:53:25] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-06-03 20:53:25] [INFO ] Deduced a trap composed of 6 places in 77 ms
[2020-06-03 20:53:25] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 20:53:25] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-06-03 20:53:26] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-06-03 20:53:26] [INFO ] Deduced a trap composed of 6 places in 102 ms
[2020-06-03 20:53:26] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 20:53:26] [INFO ] Deduced a trap composed of 6 places in 94 ms
[2020-06-03 20:53:26] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 20:53:26] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-06-03 20:53:26] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2020-06-03 20:53:26] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 20:53:26] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 20:53:27] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 20:53:27] [INFO ] Deduced a trap composed of 5 places in 70 ms
[2020-06-03 20:53:27] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-06-03 20:53:27] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2020-06-03 20:53:27] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-06-03 20:53:27] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 4143 ms
[2020-06-03 20:53:27] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 201 ms.
[2020-06-03 20:53:29] [INFO ] Added : 101 causal constraints over 21 iterations in 2239 ms. Result :sat
[2020-06-03 20:53:30] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 20:53:31] [INFO ] Flatten gal took : 916 ms
[2020-06-03 20:53:31] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 20:53:31] [INFO ] Flatten gal took : 509 ms
FORMULA Dekker-PT-100-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 20:53:31] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 20:53:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 81 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Dekker-PT-100 @ 3570 seconds

FORMULA Dekker-PT-100-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-CTLCardinality-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2227
rslt: Output for CTLCardinality @ Dekker-PT-100

{
"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",
"--safe",
"--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 20:53:31 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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": "AX(((1 <= p369)))",
"processed_size": 17,
"rewrites": 10
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 404
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AX((((p477 <= 0)) AND ((1 <= p459)) AND ((p375 <= 0))))",
"processed_size": 55,
"rewrites": 10
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"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": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 462
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EG((EX((((p404 <= 0)) OR ((1 <= p360)))) OR EG((((p389 <= 0)) OR ((1 <= p339))))))",
"processed_size": 84,
"rewrites": 12
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 3,
"markings": 3,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 539
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((((p371 <= 0)) OR ((1 <= p421)) OR ((p343 <= 0)) OR ((1 <= p46)))))",
"processed_size": 76,
"rewrites": 11
},
"result":
{
"edges": 3,
"markings": 4,
"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": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 647
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 12
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10200
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": null,
"problems": null
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 809
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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 (G (((1 <= p266))))",
"processed_size": 21,
"rewrites": 10
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 101
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1079
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EG(E((((p135 <= 0)) OR ((1 <= p184))) U (((p129 <= 0)) OR ((1 <= p267)))))",
"processed_size": 76,
"rewrites": 11
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 6,
"markings": 3,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1618
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "DEADLOCK",
"processed_size": 8,
"rewrites": 9
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2893
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p343 <= 0)) OR ((1 <= p458)))",
"processed_size": 33,
"rewrites": 9
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AX((((p477 <= 0)) AND ((1 <= p459)) AND ((p375 <= 0))))",
"processed_size": 55,
"rewrites": 10
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"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": 10,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "DEADLOCK",
"processed_size": 8,
"rewrites": 9
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p343 <= 0)) OR ((1 <= p458)))",
"processed_size": 33,
"rewrites": 9
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A ((((1 <= p380)) U ((1 <= p468))))",
"processed_size": 35,
"rewrites": 14
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 101
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p350 <= 0)) OR ((1 <= p200)))",
"processed_size": 33,
"rewrites": 12
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 202
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 6308,
"runtime": 1343.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(**)) : A(G(**)) : E(G(E((** U **)))) : (DEADLOCK OR A(F(A(G(**))))) : A(F(DEADLOCK)) : A(X(**)) : (A(F(**)) OR (A((** U **)) AND **)) : (A(X(**)) OR A(G(E(F(**))))) : E(G(E(X(**)))) : E(G((E(X(**)) OR E(G(**)))))"
},
"net":
{
"arcs": 80200,
"conflict_clusters": 1,
"places": 500,
"places_significant": 200,
"singleton_clusters": 0,
"transitions": 10200
},
"result":
{
"preliminary_value": "yes no yes unknown no no no unknown yes yes ",
"value": "yes no yes unknown no no no unknown yes yes "
},
"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: 10700/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 500
lola: finding significant places
lola: 500 places, 10200 transitions, 200 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p266 <= 1)
lola: LP says that atomic proposition is always true: (p421 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p309 <= 1)
lola: LP says that atomic proposition is always true: (p369 <= 1)
lola: LP says that atomic proposition is always true: (p200 <= 1)
lola: LP says that atomic proposition is always true: (p380 <= 1)
lola: LP says that atomic proposition is always true: (p468 <= 1)
lola: LP says that atomic proposition is always true: (p458 <= 1)
lola: LP says that atomic proposition is always true: (p477 <= 1)
lola: LP says that atomic proposition is always true: (p375 <= 1)
lola: LP says that atomic proposition is always true: (p294 <= 1)
lola: LP says that atomic proposition is always true: (p391 <= 1)
lola: LP says that atomic proposition is always true: (p360 <= 1)
lola: LP says that atomic proposition is always true: (p339 <= 1)
lola: E (((1 <= 0) U E (G (((1 <= p266)))))) : A (G (A (G ((((p371 <= 0)) OR ((1 <= p421)) OR ((p343 <= 0)) OR ((1 <= p46))))))) : E (G (E (((((p135 <= 0)) OR ((1 <= p184))) U (((p129 <= 0)) OR ((1 <= p267))))))) : (A (X ((1 <= 0))) OR A (F (A (G ((((p427 <= 0)) OR ((1 <= p309)))))))) : A (((0 <= 0) U A (X ((1 <= 0))))) : A (X (((1 <= p369)))) : (A (F ((((1 <= p350)) AND ((p200 <= 0))))) OR (A ((((1 <= p380)) U ((1 <= p468)))) AND (((p343 <= 0)) OR ((1 <= p458))))) : (A (X ((((p477 <= 0)) AND ((1 <= p459)) AND ((p375 <= 0))))) OR A (G (E (F (((1 <= p294))))))) : E (G (E (X ((((p62 <= 0)) OR ((1 <= p391))))))) : E (G ((E (X ((((p404 <= 0)) OR ((1 <= p360))))) OR E (G ((((p389 <= 0)) OR ((1 <= p339))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p369))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p369)))
lola: processed formula length: 17
lola: 10 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: subprocess 1 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((((p477 <= 0)) AND ((1 <= p459)) AND ((p375 <= 0))))) OR A (G (E (F (((1 <= p294)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p294))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p294))
lola: processed formula length: 13
lola: 12 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
lola: using tscc preserving stubborn set method (--stubborn)
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 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: formula 1: ((1 <= p294))
lola: state equation task get result unparse finished id 1
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: ((p294 <= 0))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-1.sara.
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-0.sara.
lola: sara is running 0 secs || sara is running 0 secs || 315637 markings, 1263431 edges, 63127 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 5 secs || sara is running 5 secs || 633556 markings, 2624163 edges, 63584 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 943937 markings, 4036395 edges, 62076 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 1240183 markings, 5331475 edges, 59249 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 1531534 markings, 6776367 edges, 58270 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 1841657 markings, 8175564 edges, 62025 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 2170577 markings, 9497768 edges, 65784 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 2481104 markings, 10841387 edges, 62105 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 2779808 markings, 12214474 edges, 59741 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 3078235 markings, 13591649 edges, 59685 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 3389620 markings, 14950245 edges, 62277 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 3690504 markings, 16337002 edges, 60177 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 4003749 markings, 17683173 edges, 62649 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 4329605 markings, 18987607 edges, 65171 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 4623501 markings, 20402252 edges, 58779 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 4904340 markings, 21852227 edges, 56168 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 5194547 markings, 23265802 edges, 58041 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 5475569 markings, 24677660 edges, 56204 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 5742322 markings, 26131681 edges, 53351 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 6022537 markings, 27551651 edges, 56043 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 6319038 markings, 28923999 edges, 59300 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 6591229 markings, 30404074 edges, 54438 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 6856466 markings, 31900004 edges, 53047 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 7107135 markings, 33431323 edges, 50134 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 7378801 markings, 34893108 edges, 54333 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 7641601 markings, 36396890 edges, 52560 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 7908573 markings, 37891887 edges, 53394 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 8179926 markings, 39378396 edges, 54271 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 8477813 markings, 40770936 edges, 59577 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 8759389 markings, 42175502 edges, 56315 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 9054489 markings, 43540183 edges, 59020 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 9356553 markings, 44891850 edges, 60413 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 9653101 markings, 46255594 edges, 59310 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 9926542 markings, 47701822 edges, 54688 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 10172628 markings, 49104931 edges, 49217 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 10426600 markings, 50426823 edges, 50794 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 10683787 markings, 51756255 edges, 51437 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 10937885 markings, 53209513 edges, 50820 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 11205560 markings, 54631239 edges, 53535 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 11485662 markings, 56002834 edges, 56020 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 11774587 markings, 57357646 edges, 57785 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 12049214 markings, 58770154 edges, 54925 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 12308949 markings, 60207627 edges, 51947 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 12561382 markings, 61476382 edges, 50487 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 12800881 markings, 62827637 edges, 47900 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 13033687 markings, 64265658 edges, 46561 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 13286383 markings, 65713411 edges, 50539 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 13557068 markings, 67173585 edges, 54137 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 13822843 markings, 68580253 edges, 53155 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 14029301 markings, 69810056 edges, 41292 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 14255882 markings, 71147781 edges, 45316 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 14468682 markings, 72495491 edges, 42560 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 14646363 markings, 73502048 edges, 35536 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 14888860 markings, 74804363 edges, 48499 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 15107695 markings, 76105947 edges, 43767 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 15345799 markings, 77405731 edges, 47621 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 15593503 markings, 78719391 edges, 49541 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 15841670 markings, 79876017 edges, 49633 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 16088783 markings, 81167602 edges, 49423 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 16350783 markings, 82541439 edges, 52400 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 16591378 markings, 83907301 edges, 48119 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 16850547 markings, 85260411 edges, 51834 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 17061556 markings, 86536331 edges, 42202 markings/sec, 310 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((p477 <= 0)) AND ((1 <= p459)) AND ((p375 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((p477 <= 0)) AND ((1 <= p459)) AND ((p375 <= 0))))
lola: processed formula length: 55
lola: 10 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: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 2 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((((p62 <= 0)) OR ((1 <= p391)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX((((p62 <= 0)) OR ((1 <= p391)))))
lola: processed formula length: 40
lola: 11 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 3 will run for 462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (X ((((p404 <= 0)) OR ((1 <= p360))))) OR E (G ((((p389 <= 0)) OR ((1 <= p339))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EX((((p404 <= 0)) OR ((1 <= p360)))) OR EG((((p389 <= 0)) OR ((1 <= p339))))))
lola: processed formula length: 84
lola: 12 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 4 will run for 539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p371 <= 0)) OR ((1 <= p421)) OR ((p343 <= 0)) OR ((1 <= p46)))))
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 ((((p371 <= 0)) OR ((1 <= p421)) OR ((p343 <= 0)) OR ((1 <= p46)))))
lola: processed formula length: 76
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p371)) AND ((p421 <= 0)) AND ((1 <= p343)) AND ((p46 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 5 will run for 647 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:776
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: DEADLOCK
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 6 will run for 809 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p266))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p266))))
lola: processed formula length: 21
lola: 10 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: ((p266 <= 0))
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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 1079 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (((((p135 <= 0)) OR ((1 <= p184))) U (((p129 <= 0)) OR ((1 <= p267)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E((((p135 <= 0)) OR ((1 <= p184))) U (((p129 <= 0)) OR ((1 <= p267)))))
lola: processed formula length: 76
lola: 11 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: 3 markings, 6 edges
lola: ========================================
lola: subprocess 8 will run for 1618 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (DEADLOCK OR A (F (A (G ((((p427 <= 0)) OR ((1 <= p309))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1618 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 3237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((((p427 <= 0)) OR ((1 <= p309)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p427)) AND ((p309 <= 0)))
lola: processed formula length: 33
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 /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: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
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 1
lola: formula 1: (((1 <= p427)) AND ((p309 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p427 <= 0)) OR ((1 <= p309)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-1.sara.
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.
lola: sara is running 0 secs || sara is running 0 secs || 290404 markings, 1146324 edges, 58081 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 5 secs || sara is running 5 secs || 609972 markings, 2540304 edges, 63914 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 921412 markings, 3990833 edges, 62288 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 1199020 markings, 5199700 edges, 55522 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 1482647 markings, 6629162 edges, 56725 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 1794928 markings, 8094293 edges, 62456 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 2061226 markings, 9223883 edges, 53260 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 2392009 markings, 10607533 edges, 66157 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 2706979 markings, 12043205 edges, 62994 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 3006715 markings, 13514701 edges, 59947 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 3321513 markings, 14861816 edges, 62960 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 3621904 markings, 16276699 edges, 60078 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 3948499 markings, 17676435 edges, 65319 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 4283353 markings, 19051231 edges, 66971 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 4575430 markings, 20577950 edges, 58415 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 4880250 markings, 22057249 edges, 60964 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 5164157 markings, 23343887 edges, 56781 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 5453490 markings, 24645609 edges, 57867 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 5747491 markings, 26127817 edges, 58800 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 6026824 markings, 27660003 edges, 55867 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 6323835 markings, 29152493 edges, 59402 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 6591089 markings, 30710169 edges, 53451 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 6837009 markings, 32154947 edges, 49184 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 7070341 markings, 33476690 edges, 46666 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 7356850 markings, 34919425 edges, 57302 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 7636829 markings, 36362500 edges, 55996 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 7920516 markings, 37910151 edges, 56737 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 8192061 markings, 39505567 edges, 54309 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 8499259 markings, 41002389 edges, 61440 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 8800405 markings, 42544692 edges, 60229 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 9115192 markings, 44040964 edges, 62957 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 9445656 markings, 45470731 edges, 66093 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 9759213 markings, 46920252 edges, 62711 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 10050623 markings, 48368243 edges, 58282 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 10330303 markings, 49842508 edges, 55936 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 10614463 markings, 51248211 edges, 56832 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 10889451 markings, 52858749 edges, 54998 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 11177559 markings, 54420850 edges, 57622 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 11457251 markings, 55858053 edges, 55938 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 11769073 markings, 57354771 edges, 62364 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 12062449 markings, 58913377 edges, 58675 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 12326175 markings, 60416108 edges, 52745 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 12634606 markings, 61916912 edges, 61686 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 12944063 markings, 63385250 edges, 61891 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 13244801 markings, 64879419 edges, 60148 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 13536753 markings, 66394767 edges, 58390 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 13838857 markings, 67851194 edges, 60421 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 14118409 markings, 69343435 edges, 55910 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 14413869 markings, 70797513 edges, 59092 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 14725968 markings, 72212735 edges, 62420 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 14997323 markings, 73591689 edges, 54271 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 15245231 markings, 74913990 edges, 49582 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 15503337 markings, 76390265 edges, 51621 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 15777269 markings, 77783969 edges, 54786 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 15988841 markings, 78883260 edges, 42314 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 16208945 markings, 80109196 edges, 44021 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 16442395 markings, 81298948 edges, 46690 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 16709562 markings, 82587136 edges, 53433 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 16933772 markings, 83719454 edges, 44842 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 17144773 markings, 84938695 edges, 42200 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 17362275 markings, 86166259 edges, 43500 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 17580603 markings, 87533712 edges, 43666 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 17825639 markings, 88903445 edges, 49007 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 18069513 markings, 90333413 edges, 48775 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 18292835 markings, 91750072 edges, 44664 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 18527711 markings, 93132670 edges, 46975 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 18765372 markings, 94492753 edges, 47532 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 18964483 markings, 95441284 edges, 39822 markings/sec, 335 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 9 will run for 2894 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((1 <= p350)) AND ((p200 <= 0))))) OR (A ((((1 <= p380)) U ((1 <= p468)))) AND (((p343 <= 0)) OR ((1 <= p458)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 2893 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p343 <= 0)) OR ((1 <= p458)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p343 <= 0)) OR ((1 <= p458)))
lola: processed formula length: 33
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p350)) AND ((p200 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p350 <= 0)) OR ((1 <= p200)))
lola: processed formula length: 33
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p350)) AND ((p200 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (X ((((p477 <= 0)) AND ((1 <= p459)) AND ((p375 <= 0))))) OR A (G (E (F (((1 <= p294)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p294))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p294))
lola: processed formula length: 13
lola: 12 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
lola: using tscc preserving stubborn set method (--stubborn)
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 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 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 1
lola: formula 1: ((1 <= p294))
lola: state equation task get result unparse finished id 1
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p294 <= 0))
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: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-10-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-10-1.sara.
lola: state equation: write sara problem file to CTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-10-0.sara.
lola: sara is running 0 secs || sara is running 0 secs || 325681 markings, 1304289 edges, 65136 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 5 secs || sara is running 5 secs || 641885 markings, 2660128 edges, 63241 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 912351 markings, 3909005 edges, 54093 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 1221964 markings, 5251080 edges, 61923 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 1485059 markings, 6551345 edges, 52619 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 1759328 markings, 7798031 edges, 54854 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 2077925 markings, 9130888 edges, 63719 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 2394826 markings, 10452530 edges, 63380 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 2674754 markings, 11700312 edges, 55986 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 2936695 markings, 12961035 edges, 52388 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 3235267 markings, 14242558 edges, 59714 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 3530355 markings, 15635149 edges, 59018 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 3837381 markings, 16975291 edges, 61405 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 4128059 markings, 18144842 edges, 58136 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 4413436 markings, 19370852 edges, 57075 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 4683207 markings, 20682238 edges, 53954 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 4930013 markings, 21991700 edges, 49361 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 5187927 markings, 23237101 edges, 51583 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 5433583 markings, 24460851 edges, 49131 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 5684785 markings, 25841550 edges, 50240 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 5961019 markings, 27252763 edges, 55247 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 6229744 markings, 28502808 edges, 53745 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 6478989 markings, 29765832 edges, 49849 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 6719008 markings, 31124013 edges, 48004 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 6973221 markings, 32622552 edges, 50843 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 7204037 markings, 33980163 edges, 46163 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 7445898 markings, 35247771 edges, 48372 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 7705489 markings, 36780690 edges, 51918 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 7977873 markings, 38266585 edges, 54477 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 8228049 markings, 39616800 edges, 50035 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 8497332 markings, 40861961 edges, 53857 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 8762205 markings, 42189589 edges, 52975 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 9055532 markings, 43544978 edges, 58665 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 9360017 markings, 44905243 edges, 60897 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 9658372 markings, 46282645 edges, 59671 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 9932720 markings, 47736554 edges, 54870 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 10192475 markings, 49224839 edges, 51951 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 10467406 markings, 50639752 edges, 54986 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 10737002 markings, 52067363 edges, 53919 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 10996549 markings, 53531679 edges, 51909 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 11268056 markings, 54965051 edges, 54301 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 11560375 markings, 56337038 edges, 58464 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 11845763 markings, 57737934 edges, 57078 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 12104731 markings, 59061345 edges, 51794 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 12354400 markings, 60440960 edges, 49934 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 12621167 markings, 61794363 edges, 53353 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 12869198 markings, 63258998 edges, 49606 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 13098998 markings, 64641763 edges, 45960 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 13346923 markings, 66067911 edges, 49585 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 13625236 markings, 67519253 edges, 55663 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 13863789 markings, 68815123 edges, 47711 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 14096652 markings, 70186340 edges, 46573 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 14302094 markings, 71450488 edges, 41088 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 14460102 markings, 72442799 edges, 31602 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 14656191 markings, 73556525 edges, 39218 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 14853947 markings, 74615110 edges, 39551 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 15040449 markings, 75721639 edges, 37300 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 15232981 markings, 76791730 edges, 38506 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 15476537 markings, 78124341 edges, 48711 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 15730347 markings, 79363700 edges, 50762 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 15973679 markings, 80541581 edges, 48666 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 16211597 markings, 81780363 edges, 47584 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 16458550 markings, 83177063 edges, 49391 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 16710884 markings, 84510115 edges, 50467 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 16957615 markings, 85895116 edges, 49346 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 17159770 markings, 87170482 edges, 40431 markings/sec, 325 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X ((((p477 <= 0)) AND ((1 <= p459)) AND ((p375 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((p477 <= 0)) AND ((1 <= p459)) AND ((p375 <= 0))))
lola: processed formula length: 55
lola: 10 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: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (DEADLOCK OR A (F (A (G ((((p427 <= 0)) OR ((1 <= p309))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((((p427 <= 0)) OR ((1 <= p309)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p427)) AND ((p309 <= 0)))
lola: processed formula length: 33
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 /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: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
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 1
lola: formula 1: (((1 <= p427)) AND ((p309 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation task get result unparse finished++ id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: formula 0: (((p427 <= 0)) OR ((1 <= p309)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-1.sara
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-1.sara.
sara: try reading problem file CTLCardinality-12-0.sara.
lola: sara is running 0 secs || sara is running 0 secs || 331837 markings, 1333998 edges, 66367 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 5 secs || sara is running 5 secs || 660473 markings, 2765001 edges, 65727 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 957979 markings, 4146915 edges, 59501 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 1261694 markings, 5496647 edges, 60743 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 1560238 markings, 7009266 edges, 59709 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 1879202 markings, 8480445 edges, 63793 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 2218674 markings, 9849919 edges, 67894 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 2531664 markings, 11241049 edges, 62598 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 2806622 markings, 12557381 edges, 54992 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 3095684 markings, 13891134 edges, 57812 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 3416335 markings, 15306446 edges, 64130 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 3734124 markings, 16736015 edges, 63558 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 4062661 markings, 18126336 edges, 65707 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 4386285 markings, 19558300 edges, 64725 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 4678764 markings, 21098064 edges, 58496 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 4986557 markings, 22578110 edges, 61559 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 5293545 markings, 23895902 edges, 61398 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 5591185 markings, 25362611 edges, 59528 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 5883761 markings, 26859049 edges, 58515 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 6168555 markings, 28380191 edges, 56959 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 6460039 markings, 29914966 edges, 58297 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 6726549 markings, 31531499 edges, 53302 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 7004379 markings, 33099638 edges, 55566 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 7294731 markings, 34625102 edges, 58070 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 7594435 markings, 36128358 edges, 59941 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 7879558 markings, 37686021 edges, 57025 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 8153185 markings, 39289505 edges, 54725 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 8456979 markings, 40807732 edges, 60759 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 8761126 markings, 42347465 edges, 60829 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 9076149 markings, 43847309 edges, 63005 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 9405697 markings, 45295500 edges, 65910 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 9722842 markings, 46740970 edges, 63429 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 10024555 markings, 48229627 edges, 60343 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 10314615 markings, 49764345 edges, 58012 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 10619388 markings, 51277962 edges, 60955 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 10895925 markings, 52895234 edges, 55307 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 11185366 markings, 54464001 edges, 57888 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 11483917 markings, 55989779 edges, 59710 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 11791187 markings, 57474946 edges, 61454 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 12084387 markings, 59029606 edges, 58640 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 12362491 markings, 60609402 edges, 55621 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 12651395 markings, 61982366 edges, 57781 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 12939665 markings, 63360273 edges, 57654 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 13241894 markings, 64860718 edges, 60446 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 13534967 markings, 66386066 edges, 58615 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 13838425 markings, 67848840 edges, 60692 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 14119886 markings, 69351365 edges, 56292 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 14417087 markings, 70814648 edges, 59440 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 14711610 markings, 72149076 edges, 58905 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 15003888 markings, 73624854 edges, 58456 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 15286234 markings, 75140625 edges, 56469 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 15557242 markings, 76686174 edges, 54202 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 15845211 markings, 78116617 edges, 57594 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 16034200 markings, 79147636 edges, 37798 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 16293401 markings, 80532434 edges, 51840 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 16539503 markings, 81807252 edges, 49220 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 16779783 markings, 82914898 edges, 48056 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 17019061 markings, 84183455 edges, 47856 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 17281576 markings, 85695458 edges, 52503 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 17518489 markings, 87153185 edges, 47383 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 17763649 markings, 88562387 edges, 49032 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 18002193 markings, 89924154 edges, 47709 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 18244314 markings, 91464147 edges, 48424 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 18491025 markings, 92908216 edges, 49342 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 18717735 markings, 94237779 edges, 45342 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 18926545 markings, 95267188 edges, 41762 markings/sec, 325 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F ((((1 <= p350)) AND ((p200 <= 0))))) OR (A ((((1 <= p380)) U ((1 <= p468)))) AND (((p343 <= 0)) OR ((1 <= p458)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p343 <= 0)) OR ((1 <= p458)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p343 <= 0)) OR ((1 <= p458)))
lola: processed formula length: 33
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p380)) U ((1 <= p468))))
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 ((((1 <= p380)) U ((1 <= p468))))
lola: processed formula length: 35
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 /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: ((1 <= p380))
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: 3 markings, 3 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p350)) AND ((p200 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p350 <= 0)) OR ((1 <= p200)))
lola: processed formula length: 33
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p350)) AND ((p200 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes unknown no no no unknown yes yes
lola:
preliminary result: yes no yes unknown no no no unknown yes yes
lola: memory consumption: 6308 KB
lola: time consumption: 1343 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="Dekker-PT-100"
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 Dekker-PT-100, 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 r178-tajo-158987882200339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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