fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r211-tajo-159033478301036
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ShieldRVt-PT-030A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15797.800 3600000.00 3921228.00 54751.40 ?TTTTT??FTFFTTFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 4.2K May 14 02:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 02:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 20:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 20:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.2K May 13 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 09:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 09:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 82K May 12 20:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-030A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591338749362

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 06:32:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 06:32:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 06:32:31] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2020-06-05 06:32:31] [INFO ] Transformed 243 places.
[2020-06-05 06:32:31] [INFO ] Transformed 243 transitions.
[2020-06-05 06:32:31] [INFO ] Found NUPN structural information;
[2020-06-05 06:32:31] [INFO ] Parsed PT model containing 243 places and 243 transitions in 87 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 402 ms. (steps per millisecond=248 ) properties seen :[0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1]
// Phase 1: matrix 242 rows 243 cols
[2020-06-05 06:32:31] [INFO ] Computed 121 place invariants in 14 ms
[2020-06-05 06:32:31] [INFO ] [Real]Absence check using 121 positive place invariants in 59 ms returned sat
[2020-06-05 06:32:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:31] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-06-05 06:32:32] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 20 ms.
[2020-06-05 06:32:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:32] [INFO ] [Nat]Absence check using 121 positive place invariants in 33 ms returned sat
[2020-06-05 06:32:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:32] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2020-06-05 06:32:32] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 16 ms.
[2020-06-05 06:32:33] [INFO ] Added : 239 causal constraints over 49 iterations in 1163 ms. Result :sat
[2020-06-05 06:32:33] [INFO ] [Real]Absence check using 121 positive place invariants in 44 ms returned sat
[2020-06-05 06:32:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:33] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2020-06-05 06:32:33] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 19 ms.
[2020-06-05 06:32:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:33] [INFO ] [Nat]Absence check using 121 positive place invariants in 33 ms returned sat
[2020-06-05 06:32:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:33] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2020-06-05 06:32:34] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 13 ms.
[2020-06-05 06:32:34] [INFO ] Added : 235 causal constraints over 48 iterations in 876 ms. Result :sat
[2020-06-05 06:32:35] [INFO ] [Real]Absence check using 121 positive place invariants in 54 ms returned sat
[2020-06-05 06:32:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:35] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2020-06-05 06:32:35] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 19 ms.
[2020-06-05 06:32:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:35] [INFO ] [Nat]Absence check using 121 positive place invariants in 54 ms returned sat
[2020-06-05 06:32:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:35] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2020-06-05 06:32:35] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 22 ms.
[2020-06-05 06:32:36] [INFO ] Added : 240 causal constraints over 49 iterations in 1136 ms. Result :sat
[2020-06-05 06:32:36] [INFO ] [Real]Absence check using 121 positive place invariants in 53 ms returned sat
[2020-06-05 06:32:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:37] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2020-06-05 06:32:37] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 20 ms.
[2020-06-05 06:32:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:37] [INFO ] [Nat]Absence check using 121 positive place invariants in 53 ms returned sat
[2020-06-05 06:32:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:37] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2020-06-05 06:32:37] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 26 ms.
[2020-06-05 06:32:38] [INFO ] Added : 238 causal constraints over 48 iterations in 975 ms. Result :sat
[2020-06-05 06:32:38] [INFO ] [Real]Absence check using 121 positive place invariants in 52 ms returned sat
[2020-06-05 06:32:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:38] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-06-05 06:32:38] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 21 ms.
[2020-06-05 06:32:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:38] [INFO ] [Nat]Absence check using 121 positive place invariants in 54 ms returned sat
[2020-06-05 06:32:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:39] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2020-06-05 06:32:39] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 19 ms.
[2020-06-05 06:32:40] [INFO ] Added : 239 causal constraints over 49 iterations in 1053 ms. Result :sat
[2020-06-05 06:32:40] [INFO ] [Real]Absence check using 121 positive place invariants in 51 ms returned sat
[2020-06-05 06:32:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:40] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2020-06-05 06:32:40] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 19 ms.
[2020-06-05 06:32:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:40] [INFO ] [Nat]Absence check using 121 positive place invariants in 52 ms returned sat
[2020-06-05 06:32:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:40] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2020-06-05 06:32:40] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 34 ms.
[2020-06-05 06:32:42] [INFO ] Added : 239 causal constraints over 48 iterations in 1141 ms. Result :sat
[2020-06-05 06:32:42] [INFO ] [Real]Absence check using 121 positive place invariants in 51 ms returned sat
[2020-06-05 06:32:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:42] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2020-06-05 06:32:42] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 17 ms.
[2020-06-05 06:32:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:42] [INFO ] [Nat]Absence check using 121 positive place invariants in 57 ms returned sat
[2020-06-05 06:32:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:42] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2020-06-05 06:32:42] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 23 ms.
[2020-06-05 06:32:43] [INFO ] Added : 238 causal constraints over 49 iterations in 942 ms. Result :sat
[2020-06-05 06:32:43] [INFO ] [Real]Absence check using 121 positive place invariants in 52 ms returned sat
[2020-06-05 06:32:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:44] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2020-06-05 06:32:44] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 14 ms.
[2020-06-05 06:32:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:44] [INFO ] [Nat]Absence check using 121 positive place invariants in 51 ms returned sat
[2020-06-05 06:32:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:44] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2020-06-05 06:32:44] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 23 ms.
[2020-06-05 06:32:45] [INFO ] Added : 235 causal constraints over 47 iterations in 893 ms. Result :sat
[2020-06-05 06:32:45] [INFO ] [Real]Absence check using 121 positive place invariants in 52 ms returned sat
[2020-06-05 06:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:45] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2020-06-05 06:32:45] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 17 ms.
[2020-06-05 06:32:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:45] [INFO ] [Nat]Absence check using 121 positive place invariants in 52 ms returned sat
[2020-06-05 06:32:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:46] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2020-06-05 06:32:46] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 18 ms.
[2020-06-05 06:32:47] [INFO ] Added : 237 causal constraints over 48 iterations in 1099 ms. Result :sat
[2020-06-05 06:32:47] [INFO ] [Real]Absence check using 121 positive place invariants in 56 ms returned sat
[2020-06-05 06:32:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:47] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2020-06-05 06:32:47] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 14 ms.
[2020-06-05 06:32:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:47] [INFO ] [Nat]Absence check using 121 positive place invariants in 54 ms returned sat
[2020-06-05 06:32:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:47] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2020-06-05 06:32:47] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 16 ms.
[2020-06-05 06:32:48] [INFO ] Added : 238 causal constraints over 48 iterations in 1059 ms. Result :sat
[2020-06-05 06:32:49] [INFO ] [Real]Absence check using 121 positive place invariants in 43 ms returned sat
[2020-06-05 06:32:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:49] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-06-05 06:32:49] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 38 ms.
[2020-06-05 06:32:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:49] [INFO ] [Nat]Absence check using 121 positive place invariants in 44 ms returned sat
[2020-06-05 06:32:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:49] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2020-06-05 06:32:49] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 17 ms.
[2020-06-05 06:32:50] [INFO ] Added : 238 causal constraints over 48 iterations in 970 ms. Result :sat
[2020-06-05 06:32:50] [INFO ] [Real]Absence check using 121 positive place invariants in 51 ms returned sat
[2020-06-05 06:32:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:50] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2020-06-05 06:32:50] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 15 ms.
[2020-06-05 06:32:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:51] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2020-06-05 06:32:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:51] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-06-05 06:32:51] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 13 ms.
[2020-06-05 06:32:52] [INFO ] Added : 239 causal constraints over 48 iterations in 949 ms. Result :sat
[2020-06-05 06:32:52] [INFO ] [Real]Absence check using 121 positive place invariants in 51 ms returned sat
[2020-06-05 06:32:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:52] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2020-06-05 06:32:52] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 15 ms.
[2020-06-05 06:32:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:52] [INFO ] [Nat]Absence check using 121 positive place invariants in 52 ms returned sat
[2020-06-05 06:32:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:52] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2020-06-05 06:32:52] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 16 ms.
[2020-06-05 06:32:53] [INFO ] Added : 236 causal constraints over 48 iterations in 1085 ms. Result :sat
[2020-06-05 06:32:54] [INFO ] [Real]Absence check using 121 positive place invariants in 48 ms returned sat
[2020-06-05 06:32:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:54] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2020-06-05 06:32:54] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 14 ms.
[2020-06-05 06:32:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:54] [INFO ] [Nat]Absence check using 121 positive place invariants in 46 ms returned sat
[2020-06-05 06:32:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:54] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2020-06-05 06:32:54] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 15 ms.
[2020-06-05 06:32:55] [INFO ] Added : 238 causal constraints over 48 iterations in 1213 ms. Result :sat
[2020-06-05 06:32:55] [INFO ] [Real]Absence check using 121 positive place invariants in 80 ms returned sat
[2020-06-05 06:32:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:56] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2020-06-05 06:32:56] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 20 ms.
[2020-06-05 06:32:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:56] [INFO ] [Nat]Absence check using 121 positive place invariants in 53 ms returned sat
[2020-06-05 06:32:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:56] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2020-06-05 06:32:56] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 13 ms.
[2020-06-05 06:32:57] [INFO ] Added : 235 causal constraints over 47 iterations in 1225 ms. Result :sat
[2020-06-05 06:32:57] [INFO ] [Real]Absence check using 121 positive place invariants in 51 ms returned sat
[2020-06-05 06:32:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:58] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2020-06-05 06:32:58] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 13 ms.
[2020-06-05 06:32:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:58] [INFO ] [Nat]Absence check using 121 positive place invariants in 43 ms returned sat
[2020-06-05 06:32:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:58] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2020-06-05 06:32:58] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 15 ms.
[2020-06-05 06:32:59] [INFO ] Added : 238 causal constraints over 48 iterations in 970 ms. Result :sat
[2020-06-05 06:32:59] [INFO ] [Real]Absence check using 121 positive place invariants in 57 ms returned sat
[2020-06-05 06:32:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:59] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2020-06-05 06:32:59] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 17 ms.
[2020-06-05 06:32:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:59] [INFO ] [Nat]Absence check using 121 positive place invariants in 51 ms returned sat
[2020-06-05 06:32:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:33:00] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2020-06-05 06:33:00] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 16 ms.
[2020-06-05 06:33:01] [INFO ] Added : 238 causal constraints over 48 iterations in 1186 ms. Result :sat
[2020-06-05 06:33:01] [INFO ] [Real]Absence check using 121 positive place invariants in 49 ms returned sat
[2020-06-05 06:33:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:33:01] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2020-06-05 06:33:01] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 13 ms.
[2020-06-05 06:33:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:33:01] [INFO ] [Nat]Absence check using 121 positive place invariants in 62 ms returned sat
[2020-06-05 06:33:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:33:01] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2020-06-05 06:33:01] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 17 ms.
[2020-06-05 06:33:03] [INFO ] Added : 235 causal constraints over 48 iterations in 1103 ms. Result :sat
[2020-06-05 06:33:03] [INFO ] [Real]Absence check using 121 positive place invariants in 42 ms returned sat
[2020-06-05 06:33:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:33:03] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-05 06:33:03] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 15 ms.
[2020-06-05 06:33:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:33:03] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2020-06-05 06:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:33:03] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2020-06-05 06:33:03] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 15 ms.
[2020-06-05 06:33:04] [INFO ] Added : 241 causal constraints over 49 iterations in 797 ms. Result :sat
[2020-06-05 06:33:04] [INFO ] Flatten gal took : 76 ms
[2020-06-05 06:33:04] [INFO ] Flatten gal took : 27 ms
[2020-06-05 06:33:04] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-05 06:33:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ShieldRVt-PT-030A @ 3570 seconds

FORMULA ShieldRVt-PT-030A-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLFireability-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLFireability-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLFireability-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1899
rslt: Output for CTLFireability @ ShieldRVt-PT-030A

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 06:33:05 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((p21 <= 0)) AND ((p177 <= 0)) AND (1 <= p83) AND (1 <= p92) AND (1 <= p98))",
"processed_size": 77,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((1 <= p43))",
"processed_size": 12,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"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": "E (F ((((1 <= p64) AND (1 <= p66) AND (1 <= p71)) OR ((1 <= p35)))))",
"processed_size": 69,
"rewrites": 39
},
"result":
{
"edges": 23,
"markings": 24,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 239
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p49 <= 0))",
"processed_size": 12,
"rewrites": 40
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 305
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((p179 <= 0) OR ((1 <= p97) AND (1 <= p55))) AND ((p89 <= 0) OR ((1 <= p221))))",
"processed_size": 82,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 448
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"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 (F (((1 <= p85))))",
"processed_size": 20,
"rewrites": 39
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 627
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"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 (F (((1 <= p171))))",
"processed_size": 21,
"rewrites": 39
},
"result":
{
"edges": 1598,
"markings": 1587,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 627
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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 (G (((1 <= p118) AND (1 <= p121))))",
"processed_size": 37,
"rewrites": 40
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (((((p196 <= 0) OR (p197 <= 0) OR (p200 <= 0)) AND ((p117 <= 0))) U ((1 <= p160) AND (1 <= p162) AND (1 <= p167))))",
"processed_size": 119,
"rewrites": 41
},
"result":
{
"edges": 43,
"markings": 44,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1046
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 1,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p187) AND (1 <= p196) AND (1 <= p202)) OR ((1 <= p5)) OR ((1 <= p174) AND (1 <= p177)) OR ((1 <= p144) AND (1 <= p146) AND (1 <= p151)) OR ((1 <= p150) AND (1 <= p153)))))",
"processed_size": 189,
"rewrites": 39
},
"result":
{
"edges": 250,
"markings": 248,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 11,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3139
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((1 <= p67) AND (1 <= p76) AND (1 <= p82))",
"processed_size": 42,
"rewrites": 41
},
"result":
{
"edges": 1714,
"markings": 1705,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3139
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E ((((1 <= p36) AND (1 <= p37) AND (1 <= p40)) U ((1 <= p182) AND (1 <= p185))))",
"processed_size": 80,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3139
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"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 (F (((1 <= p239))))",
"processed_size": 21,
"rewrites": 39
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((((1 <= p179)) OR ((1 <= p41))) AND ((p203 <= 0)))))",
"processed_size": 60,
"rewrites": 39
},
"result":
{
"edges": 472,
"markings": 423,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E ((((1 <= p36) AND (1 <= p37) AND (1 <= p40)) U ((1 <= p182) AND (1 <= p185))))",
"processed_size": 80,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"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 (F (((1 <= p239))))",
"processed_size": 21,
"rewrites": 39
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p54) AND (1 <= p57))",
"processed_size": 27,
"rewrites": 42
},
"result":
{
"edges": 2953,
"markings": 2699,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 19,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3980,
"runtime": 1671.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E((** U **)) OR (E(F(**)) AND E((** U **)))) : E(F(**)) : (A(G(**)) OR (** OR (E(F(**)) OR (E(G(**)) OR (** AND (A(X(*)) AND E(G(A(F(**)))))))))) : (A(G(**)) OR E((** U **))) : (E(F(**)) OR (** AND A(F(**)))) : (** AND (E(F(E(G(**)))) OR A(F(**)))) : E(F((E(X(**)) AND (A(G(**)) AND A((** U **)))))) : A((* R E(F(*)))) : (A(F(A(G(*)))) AND (A(G(**)) OR E(F(**)))) : (E(X(E(F(**)))) AND E(X(E(F(*))))) : E(G((** AND A(G(*))))) : A(X(A(G(*)))) : (E(F(**)) OR E(F(**))) : (A(X(**)) OR (E(F(**)) OR E(X(E(X(**)))))) : (A(G(**)) AND (A(X(E(G(**)))) OR (A(G(**)) OR **))) : (E(F(*)) AND E(F(**)))"
},
"net":
{
"arcs": 1024,
"conflict_clusters": 63,
"places": 243,
"places_significant": 122,
"singleton_clusters": 0,
"transitions": 242
},
"result":
{
"preliminary_value": "unknown yes yes yes yes yes unknown unknown no yes no no yes yes no yes ",
"value": "unknown yes yes yes yes yes unknown unknown no yes no no yes yes no 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: 485/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 7776
lola: finding significant places
lola: 243 places, 242 transitions, 122 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 CTLFireability.xml
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p182 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p179 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p220 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p196 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p200 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p171 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p200 <= 1)
lola: LP says that atomic proposition is always true: (p202 <= 1)
lola: LP says that atomic proposition is always true: (p207 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p169 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p179 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p239 <= 1)
lola: LP says that atomic proposition is always true: (p150 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p207 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p179 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p196 <= 1)
lola: LP says that atomic proposition is always true: (p202 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p174 <= 1)
lola: LP says that atomic proposition is always true: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p150 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: (E ((((1 <= p36) AND (1 <= p37) AND (1 <= p40)) U ((1 <= p182) AND (1 <= p185)))) OR (E (F (((((1 <= p179)) OR ((1 <= p41))) AND ((p203 <= 0))))) AND E ((((p102 <= 0) OR (p105 <= 0)) U ((1 <= p180) AND (1 <= p181) AND (1 <= p184) AND (1 <= p139) AND (1 <= p148) AND (1 <= p154)))))) : E (F (((1 <= p143) AND ((p233 <= 0)) AND (1 <= p99) AND (1 <= p108) AND (1 <= p114)))) : ((((A (G (((p220 <= 0) OR (p221 <= 0) OR (p224 <= 0)))) OR ((1 <= p43))) OR E (F ((((1 <= p64) AND (1 <= p66) AND (1 <= p71)) OR ((1 <= p35)))))) OR E (G (((1 <= p115) AND (1 <= p199))))) OR (((((p21 <= 0)) AND ((p177 <= 0)) AND (1 <= p83) AND (1 <= p92) AND (1 <= p98)) AND NOT(E (X (((1 <= p201)))))) AND E (G (A (F (((1 <= p203)))))))) : (A (G (((1 <= p118) AND (1 <= p121)))) OR E (((((p196 <= 0) OR (p197 <= 0) OR (p200 <= 0)) AND ((p117 <= 0))) U ((1 <= p160) AND (1 <= p162) AND (1 <= p167))))) : (E (F (((1 <= p171)))) OR (((1 <= p62) AND (1 <= p65)) AND A (F (((1 <= p22) AND (1 <= p25)))))) : (((p152 <= 0) OR (p154 <= 0) OR (p159 <= 0)) AND (E (F (E (G (((1 <= p67) AND (1 <= p76) AND (1 <= p82)))))) OR A (F (((1 <= p33) AND (1 <= p21) AND ((p89 <= 0))))))) : E (F (((E (X (((1 <= p79)))) AND A (G (((1 <= p102) AND (1 <= p105))))) AND A ((((1 <= p200) AND (1 <= p202) AND (1 <= p207)) U ((1 <= p105))))))) : NOT(E ((((p169 <= 0) OR (p238 <= 0) OR (p241 <= 0)) U A (G (((1 <= p61))))))) : (A (F (NOT(E (F (((1 <= p54) AND (1 <= p57))))))) AND (A (G (((((1 <= p86) AND (1 <= p89)) OR ((1 <= p179))) AND (((1 <= p96) AND (1 <= p98) AND (1 <= p103)) OR ((1 <= p197)))))) OR E (F (((1 <= p239)))))) : (E (F (E (X (((1 <= p150) AND (1 <= p153)))))) AND E (F (NOT(A (X (((1 <= p49)))))))) : E (G ((((p65 <= 0)) AND NOT(E (F (((1 <= p141)))))))) : A (X (NOT(E (F (((1 <= p6) AND (1 <= p9))))))) : E (F ((E ((((1 <= p198) AND (1 <= p201)) U ((1 <= p85)))) OR ((1 <= p24) AND (1 <= p26) AND (1 <= p31))))) : ((A (X (((1 <= p99) AND (((1 <= p17)) OR ((1 <= p207)) OR ((1 <= p93)))))) OR E (F (((1 <= p140) AND (1 <= p141) AND (1 <= p144))))) OR E (X (E (X (((1 <= p79))))))) : (A (G (((p151 <= 0)))) AND ((A (X (E (G (((1 <= p56) AND (1 <= p58) AND (1 <= p63)))))) OR A (G (((1 <= p51) AND (1 <= p60) AND (1 <= p66) AND (1 <= p31))))) OR (((p179 <= 0) OR ((1 <= p97) AND (1 <= p55))) AND ((p89 <= 0) OR ((1 <= p221)))))) : (NOT(A (G (((1 <= p223))))) AND E (F ((((1 <= p187) AND (1 <= p196) AND (1 <= p202)) OR ((1 <= p5)) OR ((1 <= p174) AND (1 <= p177)) OR ((1 <= p144) AND (1 <= p146) AND (1 <= p151)) OR ((1 <= p150) AND (1 <= p153))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p220 <= 0) OR (p221 <= 0) OR (p224 <= 0)))) OR (((1 <= p43)) OR (E (F ((((1 <= p64) AND (1 <= p66) AND (1 <= p71)) OR ((1 <= p35))))) OR (E (G (((1 <= p115) AND (1 <= p199)))) OR ((((p21 <= 0)) AND ((p177 <= 0)) AND (1 <= p83) AND (1 <= p92) AND (1 <= p98)) AND (A (X (((p201 <= 0)))) AND E (G (A (F (((1 <= p203))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p21 <= 0)) AND ((p177 <= 0)) AND (1 <= p83) AND (1 <= p92) AND (1 <= p98))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p21 <= 0)) AND ((p177 <= 0)) AND (1 <= p83) AND (1 <= p92) AND (1 <= p98))
lola: processed formula length: 77
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 5 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 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p43))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p43))
lola: processed formula length: 12
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p115) AND (1 <= p199))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p115) AND (1 <= p199))))
lola: processed formula length: 37
lola: 39 rewrites
lola: closed formula file CTLFireability.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: ((p115 <= 0) OR (p199 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p220 <= 0) OR (p221 <= 0) OR (p224 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p220 <= 0) OR (p221 <= 0) OR (p224 <= 0))))
lola: processed formula length: 53
lola: 40 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p220) AND (1 <= p221) AND (1 <= p224))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p64) AND (1 <= p66) AND (1 <= p71)) OR ((1 <= p35)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p64) AND (1 <= p66) AND (1 <= p71)) OR ((1 <= p35)))))
lola: processed formula length: 69
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p64) AND (1 <= p66) AND (1 <= p71)) OR ((1 <= p35)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 24 markings, 23 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (X (((1 <= p79)))) AND (A (G (((1 <= p102) AND (1 <= p105)))) AND A ((((1 <= p200) AND (1 <= p202) AND (1 <= p207)) U ((1 <= p105))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EX(((1 <= p79))) AND (AG(((1 <= p102) AND (1 <= p105))) AND A(((1 <= p200) AND (1 <= p202) AND (1 <= p207)) U ((1 <= p105))))))
lola: processed formula length: 131
lola: 42 rewrites
lola: closed formula file CTLFireability.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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 650823 markings, 810102 edges, 130165 markings/sec, 0 secs
lola: 1339489 markings, 1672097 edges, 137733 markings/sec, 5 secs
lola: 2035887 markings, 2532411 edges, 139280 markings/sec, 10 secs
lola: 2769772 markings, 3454555 edges, 146777 markings/sec, 15 secs
lola: 3514208 markings, 4378085 edges, 148887 markings/sec, 20 secs
lola: 4263005 markings, 5316646 edges, 149759 markings/sec, 25 secs
lola: 4975866 markings, 6205355 edges, 142572 markings/sec, 30 secs
lola: 5708185 markings, 7105303 edges, 146464 markings/sec, 35 secs
lola: 6464025 markings, 8051661 edges, 151168 markings/sec, 40 secs
lola: 7230718 markings, 9009951 edges, 153339 markings/sec, 45 secs
lola: 7991277 markings, 9951269 edges, 152112 markings/sec, 50 secs
lola: 8757812 markings, 10909461 edges, 153307 markings/sec, 55 secs
lola: 9524869 markings, 11857912 edges, 153411 markings/sec, 60 secs
lola: 10296308 markings, 12811263 edges, 154288 markings/sec, 65 secs
lola: 11052073 markings, 13757490 edges, 151153 markings/sec, 70 secs
lola: 11750353 markings, 14630120 edges, 139656 markings/sec, 75 secs
lola: 12480207 markings, 15527425 edges, 145971 markings/sec, 80 secs
lola: 13256681 markings, 16506665 edges, 155295 markings/sec, 85 secs
lola: 14025959 markings, 17457633 edges, 153856 markings/sec, 90 secs
lola: 14800263 markings, 18424370 edges, 154861 markings/sec, 95 secs
lola: 15572378 markings, 19378413 edges, 154423 markings/sec, 100 secs
lola: 16342282 markings, 20346433 edges, 153981 markings/sec, 105 secs
lola: 17109219 markings, 21288682 edges, 153387 markings/sec, 110 secs
lola: 17897717 markings, 22281245 edges, 157700 markings/sec, 115 secs
lola: 18599705 markings, 23157950 edges, 140398 markings/sec, 120 secs
lola: 19329363 markings, 24065179 edges, 145932 markings/sec, 125 secs
lola: 20007012 markings, 24904778 edges, 135530 markings/sec, 130 secs
lola: 20607456 markings, 25659363 edges, 120089 markings/sec, 135 secs
lola: 21112319 markings, 26287921 edges, 100973 markings/sec, 140 secs
lola: 21599378 markings, 26896822 edges, 97412 markings/sec, 145 secs
lola: 22122498 markings, 27555696 edges, 104624 markings/sec, 150 secs
lola: 22663330 markings, 28213685 edges, 108166 markings/sec, 155 secs
lola: 23046369 markings, 28687436 edges, 76608 markings/sec, 160 secs
lola: 23551195 markings, 29326119 edges, 100965 markings/sec, 165 secs
lola: 24090978 markings, 30003387 edges, 107957 markings/sec, 170 secs
lola: 24442431 markings, 30442334 edges, 70291 markings/sec, 175 secs
lola: 24955071 markings, 31069180 edges, 102528 markings/sec, 180 secs
lola: 25241506 markings, 31426094 edges, 57287 markings/sec, 185 secs
lola: 25246260 markings, 31431324 edges, 951 markings/sec, 190 secs
lola: 25246306 markings, 31431374 edges, 9 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F (((1 <= p150) AND (1 <= p153)))))) AND E (X (E (F (((p49 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((p49 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: ((p49 <= 0))
lola: processed formula length: 12
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: 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:711
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 1 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p49 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((1 <= p150) AND (1 <= p153))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: ((1 <= p150) AND (1 <= p153))
lola: processed formula length: 29
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p150) AND (1 <= p153))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 13 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((p6 <= 0) OR (p9 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p6) AND (1 <= p9))
lola: processed formula length: 25
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: 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:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p6) AND (1 <= p9))
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 /EXEF
lola: The predicate is not invariant from successors.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 4 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((1 <= p99) AND (((1 <= p17)) OR ((1 <= p207)) OR ((1 <= p93)))))) OR (E (F (((1 <= p140) AND (1 <= p141) AND (1 <= p144)))) OR E (X (E (X (((1 <= p79))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p140) AND (1 <= p141) AND (1 <= p144))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p140) AND (1 <= p141) AND (1 <= p144))))
lola: processed formula length: 53
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p140) AND (1 <= p141) AND (1 <= p144))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 305 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p151 <= 0)))) AND (A (X (E (G (((1 <= p56) AND (1 <= p58) AND (1 <= p63)))))) OR (A (G (((1 <= p51) AND (1 <= p60) AND (1 <= p66) AND (1 <= p31)))) OR (((p179 <= 0) OR ((1 <= p97) AND (1 <= p55))) AND ((p89 <= 0) OR ((1 <= p221)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 305 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p179 <= 0) OR ((1 <= p97) AND (1 <= p55))) AND ((p89 <= 0) OR ((1 <= p221))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p179 <= 0) OR ((1 <= p97) AND (1 <= p55))) AND ((p89 <= 0) OR ((1 <= p221))))
lola: processed formula length: 82
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p151 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p151 <= 0))))
lola: processed formula length: 21
lola: 40 rewrites
lola: closed formula file CTLFireability.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 <= p151))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p143) AND ((p233 <= 0)) AND (1 <= p99) AND (1 <= p108) AND (1 <= p114))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p143) AND ((p233 <= 0)) AND (1 <= p99) AND (1 <= p108) AND (1 <= p114))))
lola: processed formula length: 86
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p143) AND ((p233 <= 0)) AND (1 <= p99) AND (1 <= p108) AND (1 <= p114))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: ========================================
lola: subprocess 7 will run for 373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p65 <= 0)) AND A (G (((p141 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((((p65 <= 0)) AND AG(((p141 <= 0)))))
lola: processed formula length: 40
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 39 markings, 39 edges
lola: ========================================
lola: subprocess 8 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p169) AND (1 <= p238) AND (1 <= p241)) R E (F (((p61 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: processed formula: A(((1 <= p169) AND (1 <= p238) AND (1 <= p241)) R EF(((p61 <= 0))))
lola: processed formula length: 67
lola: 40 rewrites
lola: closed formula file CTLFireability.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: 1067477 markings, 2992055 edges, 213495 markings/sec, 0 secs
lola: 2301145 markings, 6447800 edges, 246734 markings/sec, 5 secs
lola: 3598197 markings, 10081265 edges, 259410 markings/sec, 10 secs
lola: 4866569 markings, 13628240 edges, 253674 markings/sec, 15 secs
lola: 6136515 markings, 17188671 edges, 253989 markings/sec, 20 secs
lola: 7410055 markings, 20749027 edges, 254708 markings/sec, 25 secs
lola: 8688876 markings, 24337059 edges, 255764 markings/sec, 30 secs
lola: 9968991 markings, 27925890 edges, 256023 markings/sec, 35 secs
lola: 11246558 markings, 31495539 edges, 255513 markings/sec, 40 secs
lola: 12529228 markings, 35095328 edges, 256534 markings/sec, 45 secs
lola: 13774533 markings, 38586121 edges, 249061 markings/sec, 50 secs
lola: 15019008 markings, 42064400 edges, 248895 markings/sec, 55 secs
lola: 16252106 markings, 45524329 edges, 246620 markings/sec, 60 secs
lola: 17498897 markings, 49017179 edges, 249358 markings/sec, 65 secs
lola: 18736469 markings, 52483080 edges, 247514 markings/sec, 70 secs
lola: 19971460 markings, 55941292 edges, 246998 markings/sec, 75 secs
lola: 21194171 markings, 59366286 edges, 244542 markings/sec, 80 secs
lola: 22449219 markings, 62882948 edges, 251010 markings/sec, 85 secs
lola: 23693432 markings, 66372639 edges, 248843 markings/sec, 90 secs
lola: 24942091 markings, 69865104 edges, 249732 markings/sec, 95 secs
lola: 26175747 markings, 73319507 edges, 246731 markings/sec, 100 secs
lola: 27412080 markings, 76782783 edges, 247267 markings/sec, 105 secs
lola: 28638348 markings, 80219906 edges, 245254 markings/sec, 110 secs
lola: 29861093 markings, 83642339 edges, 244549 markings/sec, 115 secs
lola: 31062828 markings, 87010879 edges, 240347 markings/sec, 120 secs
lola: 32286639 markings, 90439397 edges, 244762 markings/sec, 125 secs
lola: 33533972 markings, 93930285 edges, 249467 markings/sec, 130 secs
lola: 34698609 markings, 97195574 edges, 232927 markings/sec, 135 secs
lola: 35801813 markings, 100283929 edges, 220641 markings/sec, 140 secs
lola: 36664356 markings, 102697327 edges, 172509 markings/sec, 145 secs
lola: 37630153 markings, 105408322 edges, 193159 markings/sec, 150 secs
lola: 38333669 markings, 107378925 edges, 140703 markings/sec, 155 secs
lola: 39047000 markings, 109370458 edges, 142666 markings/sec, 160 secs
lola: 39746494 markings, 111334174 edges, 139899 markings/sec, 165 secs
lola: 40669475 markings, 113919156 edges, 184596 markings/sec, 170 secs
lola: 41546528 markings, 116370571 edges, 175411 markings/sec, 175 secs
lola: 42444964 markings, 118889439 edges, 179687 markings/sec, 180 secs
lola: 42998826 markings, 120439885 edges, 110772 markings/sec, 185 secs
lola: 43744170 markings, 122532739 edges, 149069 markings/sec, 190 secs
lola: 44341408 markings, 124204320 edges, 119448 markings/sec, 195 secs
lola: 44824887 markings, 125551902 edges, 96696 markings/sec, 200 secs
lola: 44825043 markings, 125552073 edges, 31 markings/sec, 205 secs
lola: 44826126 markings, 125553567 edges, 217 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 448 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p85)))) OR E (F (((1 <= p24) AND (1 <= p26) AND (1 <= p31)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 448 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p85))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p85))))
lola: processed formula length: 20
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p85))
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
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 523 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p171)))) OR (((1 <= p62) AND (1 <= p65)) AND A (F (((1 <= p22) AND (1 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 523 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p62) AND (1 <= p65))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p62) AND (1 <= p65))
lola: processed formula length: 27
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 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 11 will run for 627 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p171))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p171))))
lola: processed formula length: 21
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p171))
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 CTLFireability-11-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1587 markings, 1598 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 627 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((1 <= p118) AND (1 <= p121)))) OR E (((((p196 <= 0) OR (p197 <= 0) OR (p200 <= 0)) AND ((p117 <= 0))) U ((1 <= p160) AND (1 <= p162) AND (1 <= p167)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 627 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p118) AND (1 <= p121))))
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 (((1 <= p118) AND (1 <= p121))))
lola: processed formula length: 37
lola: 40 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
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: ((p118 <= 0) OR (p121 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 12 will run for 784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((p196 <= 0) OR (p197 <= 0) OR (p200 <= 0)) AND ((p117 <= 0))) U ((1 <= p160) AND (1 <= p162) AND (1 <= p167))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((((p196 <= 0) OR (p197 <= 0) OR (p200 <= 0)) AND ((p117 <= 0))) U ((1 <= p160) AND (1 <= p162) AND (1 <= p167))))
lola: processed formula length: 119
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p160) AND (1 <= p162) AND (1 <= p167))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 44 markings, 43 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p223 <= 0)))) AND E (F ((((1 <= p187) AND (1 <= p196) AND (1 <= p202)) OR ((1 <= p5)) OR ((1 <= p174) AND (1 <= p177)) OR ((1 <= p144) AND (1 <= p146) AND (1 <= p151)) OR ((1 <= p150) AND (1 <= p153))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p223 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p223 <= 0))))
lola: processed formula length: 21
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p223 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 13 will run for 1046 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p187) AND (1 <= p196) AND (1 <= p202)) OR ((1 <= p5)) OR ((1 <= p174) AND (1 <= p177)) OR ((1 <= p144) AND (1 <= p146) AND (1 <= p151)) OR ((1 <= p150) AND (1 <= p153)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p187) AND (1 <= p196) AND (1 <= p202)) OR ((1 <= p5)) OR ((1 <= p174) AND (1 <= p177)) OR ((1 <= p144) AND (1 <= p146) AND (1 <= p151)) OR ((1 <= p150) AND (1 <= p153)))))
lola: processed formula length: 189
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p187) AND (1 <= p196) AND (1 <= p202)) OR ((1 <= p5)) OR ((1 <= p174) AND (1 <= p177)) OR ((1 <= p144) AND (1 <= p146) AND (1 <= p151)) OR ((1 <= p150) AND (1 <= p153)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 11 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 248 markings, 250 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1046 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p152 <= 0) OR (p154 <= 0) OR (p159 <= 0)) AND (E (F (E (G (((1 <= p67) AND (1 <= p76) AND (1 <= p82)))))) OR A (F (((1 <= p33) AND (1 <= p21) AND ((p89 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1046 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p33) AND (1 <= p21) AND ((p89 <= 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: ((p33 <= 0) OR (p21 <= 0) OR ((1 <= p89)))
lola: processed formula length: 44
lola: 41 rewrites
lola: closed formula file CTLFireability.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 <= p33) AND (1 <= p21) AND ((p89 <= 0)))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: The predicate does not eventually occur.
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 14 will run for 1569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p152 <= 0) OR (p154 <= 0) OR (p159 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p152 <= 0) OR (p154 <= 0) OR (p159 <= 0))
lola: processed formula length: 45
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3139 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((1 <= p67) AND (1 <= p76) AND (1 <= p82))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: ((1 <= p67) AND (1 <= p76) AND (1 <= p82))
lola: processed formula length: 42
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p67 <= 0) OR (p76 <= 0) OR (p82 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
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 <= p67) AND (1 <= p76) AND (1 <= p82))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-15-1.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: lola: state equation: calling and running sara
The predicate is possibly preserved from a reachable marking.
lola: 1705 markings, 1714 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1569 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLFireability-15-1.sara.
lola: ...considering subproblem: (E ((((1 <= p36) AND (1 <= p37) AND (1 <= p40)) U ((1 <= p182) AND (1 <= p185)))) OR (E (F (((((1 <= p179)) OR ((1 <= p41))) AND ((p203 <= 0))))) AND E ((((p102 <= 0) OR (p105 <= 0)) U ((1 <= p180) AND (1 <= p181) AND (1 <= p184) AND (1 <= p139) AND (1 <= p148) AND (1 <= p154))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((1 <= p179)) OR ((1 <= p41))) AND ((p203 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((((1 <= p179)) OR ((1 <= p41))) AND ((p203 <= 0)))))
lola: processed formula length: 60
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p179)) OR ((1 <= p41))) AND ((p203 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 423 markings, 472 edges
lola: ========================================
lola: subprocess 15 will run for 3139 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p36) AND (1 <= p37) AND (1 <= p40)) U ((1 <= p182) AND (1 <= p185))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((1 <= p36) AND (1 <= p37) AND (1 <= p40)) U ((1 <= p182) AND (1 <= p185))))
lola: processed formula length: 80
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p182) AND (1 <= p185))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
sara: place or transition ordering is non-deterministic
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 15 will run for 3139 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (A (G (((p54 <= 0) OR (p57 <= 0)))))) AND (A (G (((((1 <= p86) AND (1 <= p89)) OR ((1 <= p179))) AND (((1 <= p96) AND (1 <= p98) AND (1 <= p103)) OR ((1 <= p197)))))) OR E (F (((1 <= p239))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3139 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p239))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p239))))
lola: processed formula length: 21
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p239))
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
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((E (X (((1 <= p79)))) AND (A (G (((1 <= p102) AND (1 <= p105)))) AND A ((((1 <= p200) AND (1 <= p202) AND (1 <= p207)) U ((1 <= p105))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EX(((1 <= p79))) AND (AG(((1 <= p102) AND (1 <= p105))) AND A(((1 <= p200) AND (1 <= p202) AND (1 <= p207)) U ((1 <= p105))))))
lola: processed formula length: 131
lola: 42 rewrites
lola: closed formula file CTLFireability.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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 595503 markings, 749056 edges, 119101 markings/sec, 0 secs
lola: 1302080 markings, 1620589 edges, 141315 markings/sec, 5 secs
lola: 2042189 markings, 2539389 edges, 148022 markings/sec, 10 secs
lola: 2783571 markings, 3469727 edges, 148276 markings/sec, 15 secs
lola: 3458713 markings, 4306621 edges, 135028 markings/sec, 20 secs
lola: 4161442 markings, 5184121 edges, 140546 markings/sec, 25 secs
sara: warning, failure of lp_solve (at job 774)
lola: 4941015 markings, 6156670 edges, 155915 markings/sec, 30 secs
lola: 5661972 markings, 7054322 edges, 144191 markings/sec, 35 secs
lola: 6357717 markings, 7913965 edges, 139149 markings/sec, 40 secs
lola: 7110426 markings, 8856804 edges, 150542 markings/sec, 45 secs
lola: 7873622 markings, 9801032 edges, 152639 markings/sec, 50 secs
lola: 8643540 markings, 10762928 edges, 153984 markings/sec, 55 secs
lola: 9429603 markings, 11742621 edges, 157213 markings/sec, 60 secs
lola: 10210975 markings, 12706886 edges, 156274 markings/sec, 65 secs
lola: 10930386 markings, 13613004 edges, 143882 markings/sec, 70 secs
lola: 11643895 markings, 14492255 edges, 142702 markings/sec, 75 secs
lola: 12415293 markings, 15455726 edges, 154280 markings/sec, 80 secs
lola: 13197475 markings, 16431118 edges, 156436 markings/sec, 85 secs
lola: 13981097 markings, 17408131 edges, 156724 markings/sec, 90 secs
lola: 14714777 markings, 18319832 edges, 146736 markings/sec, 95 secs
lola: 15444059 markings, 19216428 edges, 145856 markings/sec, 100 secs
lola: 16208699 markings, 20182669 edges, 152928 markings/sec, 105 secs
lola: 16918730 markings, 21058097 edges, 142006 markings/sec, 110 secs
lola: 17582866 markings, 21891937 edges, 132827 markings/sec, 115 secs
lola: 18313501 markings, 22801281 edges, 146127 markings/sec, 120 secs
lola: 19070533 markings, 23748983 edges, 151406 markings/sec, 125 secs
lola: 19837686 markings, 24697546 edges, 153431 markings/sec, 130 secs
lola: 20567173 markings, 25614901 edges, 145897 markings/sec, 135 secs
lola: 21096985 markings, 26270956 edges, 105962 markings/sec, 140 secs
lola: 21563208 markings, 26846634 edges, 93245 markings/sec, 145 secs
lola: 22054432 markings, 27470354 edges, 98245 markings/sec, 150 secs
lola: 22440080 markings, 27936684 edges, 77130 markings/sec, 155 secs
lola: 22902062 markings, 28517943 edges, 92396 markings/sec, 160 secs
lola: 23410198 markings, 29150102 edges, 101627 markings/sec, 165 secs
lola: 23759451 markings, 29586524 edges, 69851 markings/sec, 170 secs
lola: 24152370 markings, 30081339 edges, 78584 markings/sec, 175 secs
lola: 24628102 markings, 30667626 edges, 95146 markings/sec, 180 secs
lola: 25095328 markings, 31254628 edges, 93445 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p169) AND (1 <= p238) AND (1 <= p241)) R E (F (((p61 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: processed formula: A(((1 <= p169) AND (1 <= p238) AND (1 <= p241)) R EF(((p61 <= 0))))
lola: processed formula length: 67
lola: 40 rewrites
lola: closed formula file CTLFireability.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: 1201557 markings, 3357988 edges, 240311 markings/sec, 0 secs
lola: 2439125 markings, 6832863 edges, 247514 markings/sec, 5 secs
lola: 3684351 markings, 10321216 edges, 249045 markings/sec, 10 secs
lola: 4910599 markings, 13752486 edges, 245250 markings/sec, 15 secs
lola: 6127410 markings, 17159939 edges, 243362 markings/sec, 20 secs
lola: 7327553 markings, 20527021 edges, 240029 markings/sec, 25 secs
lola: 8472296 markings, 23733426 edges, 228949 markings/sec, 30 secs
lola: 9718902 markings, 27221209 edges, 249321 markings/sec, 35 secs
lola: 10946656 markings, 30662852 edges, 245551 markings/sec, 40 secs
lola: 12199213 markings, 34165630 edges, 250511 markings/sec, 45 secs
lola: 13435500 markings, 37632200 edges, 247257 markings/sec, 50 secs
lola: 14606406 markings, 40908416 edges, 234181 markings/sec, 55 secs
lola: 15727638 markings, 44056038 edges, 224246 markings/sec, 60 secs
lola: 16979348 markings, 47555114 edges, 250342 markings/sec, 65 secs
lola: 18227120 markings, 51056669 edges, 249554 markings/sec, 70 secs
lola: 19401322 markings, 54344176 edges, 234840 markings/sec, 75 secs
lola: 20604942 markings, 57717490 edges, 240724 markings/sec, 80 secs
lola: 21869090 markings, 61257380 edges, 252830 markings/sec, 85 secs
lola: 23130786 markings, 64791844 edges, 252339 markings/sec, 90 secs
lola: 24398266 markings, 68344846 edges, 253496 markings/sec, 95 secs
lola: 25643672 markings, 71827581 edges, 249081 markings/sec, 100 secs
lola: 26875232 markings, 75280006 edges, 246312 markings/sec, 105 secs
lola: 28109160 markings, 78735289 edges, 246786 markings/sec, 110 secs
lola: 29344814 markings, 82199602 edges, 247131 markings/sec, 115 secs
lola: 30577229 markings, 85651089 edges, 246483 markings/sec, 120 secs
lola: 31596800 markings, 88507601 edges, 203914 markings/sec, 125 secs
lola: 32706903 markings, 91616293 edges, 222021 markings/sec, 130 secs
lola: 33774299 markings, 94600040 edges, 213479 markings/sec, 135 secs
lola: 34852020 markings, 97618271 edges, 215544 markings/sec, 140 secs
lola: 35884628 markings, 100515398 edges, 206522 markings/sec, 145 secs
lola: 36494976 markings, 102227246 edges, 122070 markings/sec, 150 secs
lola: 37273876 markings, 104403441 edges, 155780 markings/sec, 155 secs
lola: 37833822 markings, 105974097 edges, 111989 markings/sec, 160 secs
lola: 38518345 markings, 107895083 edges, 136905 markings/sec, 165 secs
lola: 39342842 markings, 110203932 edges, 164899 markings/sec, 170 secs
lola: 39992119 markings, 112024299 edges, 129855 markings/sec, 175 secs
lola: 40683141 markings, 113960189 edges, 138204 markings/sec, 180 secs
lola: 41472422 markings, 116163101 edges, 157856 markings/sec, 185 secs
lola: 42168138 markings, 118119170 edges, 139143 markings/sec, 190 secs
lola: 42758355 markings, 119769391 edges, 118043 markings/sec, 195 secs
lola: 43267560 markings, 121189191 edges, 101841 markings/sec, 200 secs
lola: 43768689 markings, 122599668 edges, 100226 markings/sec, 205 secs
lola: 44466449 markings, 124556793 edges, 139552 markings/sec, 210 secs
lola: 44795180 markings, 125467207 edges, 65746 markings/sec, 215 secs
lola: 44796467 markings, 125479448 edges, 257 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E ((((1 <= p36) AND (1 <= p37) AND (1 <= p40)) U ((1 <= p182) AND (1 <= p185)))) OR (E (F (((((1 <= p179)) OR ((1 <= p41))) AND ((p203 <= 0))))) AND E ((((p102 <= 0) OR (p105 <= 0)) U ((1 <= p180) AND (1 <= p181) AND (1 <= p184) AND (1 <= p139) AND (1 <= p148) AND (1 <= p154))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((((1 <= p179)) OR ((1 <= p41))) AND ((p203 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((((1 <= p179)) OR ((1 <= p41))) AND ((p203 <= 0)))))
lola: processed formula length: 60
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p179)) OR ((1 <= p41))) AND ((p203 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 423 markings, 472 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p36) AND (1 <= p37) AND (1 <= p40)) U ((1 <= p182) AND (1 <= p185))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((1 <= p36) AND (1 <= p37) AND (1 <= p40)) U ((1 <= p182) AND (1 <= p185))))
lola: processed formula length: 80
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p182) AND (1 <= p185))
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 /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((p102 <= 0) OR (p105 <= 0)) U ((1 <= p180) AND (1 <= p181) AND (1 <= p184) AND (1 <= p139) AND (1 <= p148) AND (1 <= p154))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((p102 <= 0) OR (p105 <= 0)) U ((1 <= p180) AND (1 <= p181) AND (1 <= p184) AND (1 <= p139) AND (1 <= p148) AND (1 <= p154))))
lola: processed formula length: 131
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p180) AND (1 <= p181) AND (1 <= p184) AND (1 <= p139) AND (1 <= p148) AND (1 <= p154))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-20-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-20-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1727672 markings, 2463043 edges, 345534 markings/sec, 0 secs
lola: sara is running 5 secs || 2695379 markings, 5079645 edges, 193541 markings/sec, 5 secs
lola: sara is running 10 secs || 3665655 markings, 7475615 edges, 194055 markings/sec, 10 secs
lola: sara is running 15 secs || 4484098 markings, 9756374 edges, 163689 markings/sec, 15 secs
lola: sara is running 20 secs || 5308161 markings, 12185478 edges, 164813 markings/sec, 20 secs

lola: state equation 0: solution produced
lola: sara is running 25 secs || 5983943 markings, 14228796 edges, 135156 markings/sec, 25 secs
lola: sara is running 30 secs || 6563558 markings, 16027813 edges, 115923 markings/sec, 30 secs
lola: sara is running 35 secs || 7117616 markings, 17784496 edges, 110812 markings/sec, 35 secs
lola: sara is running 40 secs || 7657117 markings, 19500469 edges, 107900 markings/sec, 40 secs
lola: sara is running 45 secs || 8203478 markings, 21179577 edges, 109272 markings/sec, 45 secs
lola: sara is running 50 secs || 8753345 markings, 22867342 edges, 109973 markings/sec, 50 secs
lola: sara is running 55 secs || 9473375 markings, 24890283 edges, 144006 markings/sec, 55 secs
lola: sara is running 60 secs || 10186034 markings, 26862160 edges, 142532 markings/sec, 60 secs
lola: sara is running 65 secs || 10928762 markings, 28887627 edges, 148546 markings/sec, 65 secs
lola: sara is running 70 secs || 11642181 markings, 30865639 edges, 142684 markings/sec, 70 secs
lola: sara is running 75 secs || 12328344 markings, 32906876 edges, 137233 markings/sec, 75 secs
lola: sara is running 80 secs || 13005181 markings, 34970365 edges, 135367 markings/sec, 80 secs
lola: sara is running 85 secs || 13678054 markings, 37071369 edges, 134575 markings/sec, 85 secs
lola: sara is running 90 secs || 14341092 markings, 39168808 edges, 132608 markings/sec, 90 secs
lola: sara is running 95 secs || 15040301 markings, 41224826 edges, 139842 markings/sec, 95 secs
lola: sara is running 100 secs || 15725999 markings, 43296666 edges, 137140 markings/sec, 100 secs
lola: sara is running 105 secs || 16409051 markings, 45350886 edges, 136610 markings/sec, 105 secs
lola: sara is running 110 secs || 17096980 markings, 47485722 edges, 137586 markings/sec, 110 secs
lola: sara is running 115 secs || 17770645 markings, 49612332 edges, 134733 markings/sec, 115 secs
lola: sara is running 120 secs || 18434598 markings, 51725289 edges, 132791 markings/sec, 120 secs
lola: sara is running 125 secs || 19090698 markings, 53843866 edges, 131220 markings/sec, 125 secs
lola: sara is running 130 secs || 19747190 markings, 55966978 edges, 131298 markings/sec, 130 secs
lola: sara is running 135 secs || 20393271 markings, 58092057 edges, 129216 markings/sec, 135 secs
lola: sara is running 140 secs || 21041840 markings, 60231724 edges, 129714 markings/sec, 140 secs
lola: sara is running 145 secs || 21697517 markings, 62404475 edges, 131135 markings/sec, 145 secs
lola: sara is running 150 secs || 22364983 markings, 64587111 edges, 133493 markings/sec, 150 secs
lola: sara is running 155 secs || 23044964 markings, 66756220 edges, 135996 markings/sec, 155 secs
lola: sara is running 160 secs || 23711260 markings, 68934997 edges, 133259 markings/sec, 160 secs
lola: sara is running 165 secs || 24369577 markings, 71115984 edges, 131663 markings/sec, 165 secs
lola: sara is running 170 secs || 25037654 markings, 73079917 edges, 133615 markings/sec, 170 secs
lola: sara is running 175 secs || 25697202 markings, 75092172 edges, 131910 markings/sec, 175 secs
lola: sara is running 180 secs || 26324685 markings, 77047014 edges, 125497 markings/sec, 180 secs
lola: sara is running 185 secs || 26978692 markings, 79258354 edges, 130801 markings/sec, 185 secs
lola: sara is running 190 secs || 27613373 markings, 81294396 edges, 126936 markings/sec, 190 secs
lola: sara is running 195 secs || 28307273 markings, 83443446 edges, 138780 markings/sec, 195 secs
lola: sara is running 200 secs || 28893025 markings, 85341364 edges, 117150 markings/sec, 200 secs
lola: sara is running 205 secs || 29366521 markings, 86884912 edges, 94699 markings/sec, 205 secs
lola: sara is running 210 secs || 29821024 markings, 88384322 edges, 90901 markings/sec, 210 secs
lola: sara is running 215 secs || 30270806 markings, 89887396 edges, 89956 markings/sec, 215 secs
lola: sara is running 220 secs || 30718393 markings, 91379003 edges, 89517 markings/sec, 220 secs
lola: sara is running 225 secs || 31163266 markings, 92855094 edges, 88975 markings/sec, 225 secs
lola: sara is running 230 secs || 31612453 markings, 94325088 edges, 89837 markings/sec, 230 secs
lola: sara is running 235 secs || 32059400 markings, 95784050 edges, 89389 markings/sec, 235 secs
lola: sara is running 240 secs || 32504498 markings, 97209026 edges, 89020 markings/sec, 240 secs
lola: sara is running 245 secs || 32953527 markings, 98594104 edges, 89806 markings/sec, 245 secs
lola: sara is running 250 secs || 33413195 markings, 99893646 edges, 91934 markings/sec, 250 secs
lola: sara is running 255 secs || 33862487 markings, 101332800 edges, 89858 markings/sec, 255 secs
lola: sara is running 260 secs || 34293388 markings, 102630020 edges, 86180 markings/sec, 260 secs
lola: sara is running 265 secs || 34725558 markings, 104099972 edges, 86434 markings/sec, 265 secs
lola: sara is running 270 secs || 35167847 markings, 105404156 edges, 88458 markings/sec, 270 secs
lola: sara is running 275 secs || 35616182 markings, 106662982 edges, 89667 markings/sec, 275 secs
lola: sara is running 280 secs || 36040634 markings, 107883100 edges, 84890 markings/sec, 280 secs
lola: sara is running 285 secs || 36442493 markings, 109143264 edges, 80372 markings/sec, 285 secs
lola: sara is running 290 secs || 36847655 markings, 110446709 edges, 81032 markings/sec, 290 secs
lola: sara is running 295 secs || 37246980 markings, 111729201 edges, 79865 markings/sec, 295 secs
lola: sara is running 300 secs || 37644421 markings, 113021384 edges, 79488 markings/sec, 300 secs
lola: sara is running 305 secs || 38040802 markings, 114312783 edges, 79276 markings/sec, 305 secs
lola: sara is running 310 secs || 38437202 markings, 115608949 edges, 79280 markings/sec, 310 secs
lola: sara is running 315 secs || 38933785 markings, 117161541 edges, 99317 markings/sec, 315 secs
lola: sara is running 320 secs || 39512775 markings, 118981860 edges, 115798 markings/sec, 320 secs
lola: sara is running 325 secs || 40069480 markings, 120812646 edges, 111341 markings/sec, 325 secs
lola: sara is running 330 secs || 40654131 markings, 122636386 edges, 116930 markings/sec, 330 secs
lola: sara is running 335 secs || 41239370 markings, 124487602 edges, 117048 markings/sec, 335 secs
lola: sara is running 340 secs || 41819876 markings, 126303984 edges, 116101 markings/sec, 340 secs
lola: sara is running 345 secs || 42400543 markings, 128170023 edges, 116133 markings/sec, 345 secs
lola: sara is running 350 secs || 42973406 markings, 129965670 edges, 114573 markings/sec, 350 secs
lola: sara is running 355 secs || 43539719 markings, 131758486 edges, 113263 markings/sec, 355 secs
lola: sara is running 360 secs || 44098862 markings, 133626188 edges, 111829 markings/sec, 360 secs
lola: sara is running 365 secs || 44661604 markings, 135502753 edges, 112548 markings/sec, 365 secs
lola: sara is running 370 secs || 45216990 markings, 137406213 edges, 111077 markings/sec, 370 secs
lola: sara is running 375 secs || 45790333 markings, 139286944 edges, 114669 markings/sec, 375 secs
lola: sara is running 380 secs || 46404110 markings, 141360610 edges, 122755 markings/sec, 380 secs
lola: sara is running 385 secs || 47014578 markings, 143385898 edges, 122094 markings/sec, 385 secs
lola: sara is running 390 secs || 47593724 markings, 145254696 edges, 115829 markings/sec, 390 secs
lola: sara is running 395 secs || 48154913 markings, 147145148 edges, 112238 markings/sec, 395 secs
lola: sara is running 400 secs || 48723602 markings, 149016766 edges, 113738 markings/sec, 400 secs
lola: sara is running 405 secs || 49316781 markings, 150817572 edges, 118636 markings/sec, 405 secs
lola: sara is running 410 secs || 49897634 markings, 152634526 edges, 116171 markings/sec, 410 secs
lola: sara is running 415 secs || 50470358 markings, 154441942 edges, 114545 markings/sec, 415 secs
lola: sara is running 420 secs || 51035480 markings, 156250065 edges, 113024 markings/sec, 420 secs
lola: sara is running 425 secs || 51625020 markings, 158091338 edges, 117908 markings/sec, 425 secs
lola: sara is running 430 secs || 52189989 markings, 159920283 edges, 112994 markings/sec, 430 secs
lola: sara is running 435 secs || 52765478 markings, 161783889 edges, 115098 markings/sec, 435 secs
lola: sara is running 440 secs || 53340951 markings, 163660514 edges, 115095 markings/sec, 440 secs
lola: sara is running 445 secs || 53901823 markings, 165491295 edges, 112174 markings/sec, 445 secs
lola: sara is running 450 secs || 54470701 markings, 167326979 edges, 113776 markings/sec, 450 secs
lola: sara is running 455 secs || 55038628 markings, 169212140 edges, 113585 markings/sec, 455 secs
lola: sara is running 460 secs || 55594714 markings, 171085872 edges, 111217 markings/sec, 460 secs
lola: sara is running 465 secs || 56184848 markings, 172917665 edges, 118027 markings/sec, 465 secs
lola: sara is running 470 secs || 56755897 markings, 174789799 edges, 114210 markings/sec, 470 secs
lola: sara is running 475 secs || 57317198 markings, 176600354 edges, 112260 markings/sec, 475 secs
lola: sara is running 480 secs || 57901745 markings, 178341386 edges, 116909 markings/sec, 480 secs
lola: sara is running 485 secs || 58463076 markings, 180080664 edges, 112266 markings/sec, 485 secs
lola: sara is running 490 secs || 59028549 markings, 181943955 edges, 113095 markings/sec, 490 secs
lola: sara is running 495 secs || 59596260 markings, 183850579 edges, 113542 markings/sec, 495 secs
lola: sara is running 500 secs || 60170437 markings, 185680442 edges, 114835 markings/sec, 500 secs
lola: sara is running 505 secs || 60738035 markings, 187568546 edges, 113520 markings/sec, 505 secs
lola: sara is running 510 secs || 61297906 markings, 189406323 edges, 111974 markings/sec, 510 secs
lola: sara is running 515 secs || 61865283 markings, 191296138 edges, 113475 markings/sec, 515 secs
lola: sara is running 520 secs || 62432566 markings, 193166248 edges, 113457 markings/sec, 520 secs
lola: sara is running 525 secs || 63005630 markings, 195039794 edges, 114613 markings/sec, 525 secs
lola: sara is running 530 secs || 63581805 markings, 196934685 edges, 115235 markings/sec, 530 secs
lola: sara is running 535 secs || 64150737 markings, 198854909 edges, 113786 markings/sec, 535 secs
lola: sara is running 540 secs || 64702543 markings, 200692097 edges, 110361 markings/sec, 540 secs
lola: sara is running 545 secs || 65245440 markings, 202576930 edges, 108579 markings/sec, 545 secs
lola: sara is running 550 secs || 65796778 markings, 204486695 edges, 110268 markings/sec, 550 secs
lola: sara is running 555 secs || 66369492 markings, 206449858 edges, 114543 markings/sec, 555 secs
lola: sara is running 560 secs || 66922588 markings, 208289781 edges, 110619 markings/sec, 560 secs
lola: sara is running 565 secs || 67472391 markings, 210123210 edges, 109961 markings/sec, 565 secs
lola: sara is running 570 secs || 68019102 markings, 211966466 edges, 109342 markings/sec, 570 secs
lola: sara is running 575 secs || 68589713 markings, 213913243 edges, 114122 markings/sec, 575 secs
lola: sara is running 580 secs || 69158651 markings, 215876455 edges, 113788 markings/sec, 580 secs
lola: sara is running 585 secs || 69724853 markings, 217838380 edges, 113240 markings/sec, 585 secs
lola: sara is running 590 secs || 70290056 markings, 219790462 edges, 113041 markings/sec, 590 secs
lola: sara is running 595 secs || 70855293 markings, 221742939 edges, 113047 markings/sec, 595 secs
lola: sara is running 600 secs || 71413360 markings, 223682617 edges, 111613 markings/sec, 600 secs
lola: sara is running 605 secs || 71969119 markings, 225576632 edges, 111152 markings/sec, 605 secs
lola: sara is running 610 secs || 72509384 markings, 227417918 edges, 108053 markings/sec, 610 secs
lola: sara is running 615 secs || 73050549 markings, 229261183 edges, 108233 markings/sec, 615 secs
lola: sara is running 620 secs || 73611617 markings, 231206433 edges, 112214 markings/sec, 620 secs
lola: sara is running 625 secs || 74179089 markings, 233166849 edges, 113494 markings/sec, 625 secs
lola: sara is running 630 secs || 74727349 markings, 235037394 edges, 109652 markings/sec, 630 secs
lola: sara is running 635 secs || 75269610 markings, 236897236 edges, 108452 markings/sec, 635 secs
lola: sara is running 640 secs || 75817419 markings, 238833418 edges, 109562 markings/sec, 640 secs
lola: sara is running 645 secs || 76388403 markings, 240777589 edges, 114197 markings/sec, 645 secs
lola: sara is running 650 secs || 76928940 markings, 242644772 edges, 108107 markings/sec, 650 secs
lola: sara is running 655 secs || 77457130 markings, 244434641 edges, 105638 markings/sec, 655 secs
lola: sara is running 660 secs || 78007771 markings, 246333111 edges, 110128 markings/sec, 660 secs
lola: sara is running 665 secs || 78553700 markings, 248223883 edges, 109186 markings/sec, 665 secs
lola: sara is running 670 secs || 79124051 markings, 250172258 edges, 114070 markings/sec, 670 secs
lola: sara is running 675 secs || 79683070 markings, 252075186 edges, 111804 markings/sec, 675 secs
lola: sara is running 680 secs || 80235659 markings, 253979549 edges, 110518 markings/sec, 680 secs
lola: sara is running 685 secs || 80806642 markings, 255986356 edges, 114197 markings/sec, 685 secs
lola: sara is running 690 secs || 81396249 markings, 258022192 edges, 117921 markings/sec, 690 secs
lola: sara is running 695 secs || 81974503 markings, 260065806 edges, 115651 markings/sec, 695 secs
lola: sara is running 700 secs || 82546792 markings, 262100431 edges, 114458 markings/sec, 700 secs
lola: sara is running 705 secs || 83128713 markings, 264136140 edges, 116384 markings/sec, 705 secs
lola: sara is running 710 secs || 83695820 markings, 266102722 edges, 113421 markings/sec, 710 secs
lola: sara is running 715 secs || 84203115 markings, 267872561 edges, 101459 markings/sec, 715 secs
lola: sara is running 720 secs || 84755697 markings, 269817632 edges, 110516 markings/sec, 720 secs
lola: sara is running 725 secs || 85308201 markings, 271771599 edges, 110501 markings/sec, 725 secs
lola: sara is running 730 secs || 85867900 markings, 273749484 edges, 111940 markings/sec, 730 secs
lola: sara is running 735 secs || 86430692 markings, 275748800 edges, 112558 markings/sec, 735 secs
lola: sara is running 740 secs || 86990847 markings, 277728749 edges, 112031 markings/sec, 740 secs
lola: sara is running 745 secs || 87544455 markings, 279695632 edges, 110722 markings/sec, 745 secs
lola: sara is running 750 secs || 88099311 markings, 281678412 edges, 110971 markings/sec, 750 secs
lola: sara is running 755 secs || 88674007 markings, 283699817 edges, 114939 markings/sec, 755 secs
lola: sara is running 760 secs || 89221093 markings, 285634862 edges, 109417 markings/sec, 760 secs
lola: sara is running 765 secs || 89761976 markings, 287547459 edges, 108177 markings/sec, 765 secs
lola: sara is running 770 secs || 90326864 markings, 289537718 edges, 112978 markings/sec, 770 secs
lola: sara is running 775 secs || 90882905 markings, 291510094 edges, 111208 markings/sec, 775 secs
lola: sara is running 780 secs || 91429589 markings, 293456927 edges, 109337 markings/sec, 780 secs
lola: sara is running 785 secs || 91983063 markings, 295422023 edges, 110695 markings/sec, 785 secs
lola: sara is running 790 secs || 92538280 markings, 297408275 edges, 111043 markings/sec, 790 secs
lola: sara is running 795 secs || 93095201 markings, 299414248 edges, 111384 markings/sec, 795 secs
lola: sara is running 800 secs || 93657975 markings, 301427168 edges, 112555 markings/sec, 800 secs
lola: sara is running 805 secs || 94221482 markings, 303431048 edges, 112701 markings/sec, 805 secs
lola: sara is running 810 secs || 94410968 markings, 304107216 edges, 37897 markings/sec, 810 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 (A (G (((p54 <= 0) OR (p57 <= 0)))))) AND (A (G (((((1 <= p86) AND (1 <= p89)) OR ((1 <= p179))) AND (((1 <= p96) AND (1 <= p98) AND (1 <= p103)) OR ((1 <= p197)))))) OR E (F (((1 <= p239))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p239))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p239))))
lola: processed formula length: 21
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p239))
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
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: state equation: write sara problem file to CTLFireability-19-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((p54 <= 0) OR (p57 <= 0))))))
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:788
lola: processed formula: ((1 <= p54) AND (1 <= p57))
lola: processed formula length: 27
lola: 42 rewrites
lola: closed formula file CTLFireability.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: ========================================
sara: try reading problem file CTLFireability-19-0.sara.
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: ((p54 <= 0) OR (p57 <= 0))
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 task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p54) AND (1 <= p57))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
sara: place or transition ordering is non-deterministic

lola: state equation: write sara problem file to CTLFireability-20-1.sara
lola: state equation: write sara problem file to CTLFireability-20-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 2699 markings, 2953 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
sara: try reading problem file CTLFireability-20-1.sara.
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: RESULT
lola:
SUMMARY: unknown yes yes yes yes yes unknown unknown no yes no no yes yes no yes
lola:
preliminary result: unknown yes yes yes yes yes unknown unknown no yes no no yes yes no yes
lola: memory consumption: 3980 KB
lola: time consumption: 1671 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427488 kB
MemFree: 14575316 kB
After kill :
MemTotal: 16427488 kB
MemFree: 14574056 kB

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-030A"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is ShieldRVt-PT-030A, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033478301036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-030A.tgz
mv ShieldRVt-PT-030A execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;