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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15793.480 3600000.00 1376748.00 26917.90 TFTTT?TF?FTTFTFT 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-159033478301052.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-040A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478301052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 4.0K May 14 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 20:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 20:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 15K 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.4K May 13 14:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 14:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 09:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 09:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 109K 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-040A-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-040A-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-040A-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-040A-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-040A-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-040A-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-040A-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-040A-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-040A-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-040A-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-040A-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-040A-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-040A-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-040A-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-040A-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-040A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591339340698

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 06:42:22] [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:42:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 06:42:23] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2020-06-05 06:42:23] [INFO ] Transformed 323 places.
[2020-06-05 06:42:23] [INFO ] Transformed 323 transitions.
[2020-06-05 06:42:23] [INFO ] Found NUPN structural information;
[2020-06-05 06:42:23] [INFO ] Parsed PT model containing 323 places and 323 transitions in 151 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 718 ms. (steps per millisecond=139 ) properties seen :[1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]
// Phase 1: matrix 322 rows 323 cols
[2020-06-05 06:42:23] [INFO ] Computed 161 place invariants in 8 ms
[2020-06-05 06:42:24] [INFO ] [Real]Absence check using 161 positive place invariants in 100 ms returned sat
[2020-06-05 06:42:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:24] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2020-06-05 06:42:24] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 46 ms.
[2020-06-05 06:42:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:25] [INFO ] [Nat]Absence check using 161 positive place invariants in 196 ms returned sat
[2020-06-05 06:42:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:25] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2020-06-05 06:42:25] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 34 ms.
[2020-06-05 06:42:27] [INFO ] Added : 319 causal constraints over 64 iterations in 2164 ms. Result :sat
[2020-06-05 06:42:27] [INFO ] [Real]Absence check using 161 positive place invariants in 72 ms returned sat
[2020-06-05 06:42:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:28] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2020-06-05 06:42:28] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 35 ms.
[2020-06-05 06:42:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:28] [INFO ] [Nat]Absence check using 161 positive place invariants in 59 ms returned sat
[2020-06-05 06:42:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:28] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2020-06-05 06:42:28] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 32 ms.
[2020-06-05 06:42:31] [INFO ] Added : 317 causal constraints over 64 iterations in 2632 ms. Result :sat
[2020-06-05 06:42:31] [INFO ] [Real]Absence check using 161 positive place invariants in 60 ms returned sat
[2020-06-05 06:42:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:31] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2020-06-05 06:42:31] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 36 ms.
[2020-06-05 06:42:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:31] [INFO ] [Nat]Absence check using 161 positive place invariants in 57 ms returned sat
[2020-06-05 06:42:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:32] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2020-06-05 06:42:32] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 44 ms.
[2020-06-05 06:42:34] [INFO ] Added : 319 causal constraints over 65 iterations in 1840 ms. Result :sat
[2020-06-05 06:42:34] [INFO ] [Real]Absence check using 161 positive place invariants in 57 ms returned sat
[2020-06-05 06:42:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:34] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2020-06-05 06:42:34] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 20 ms.
[2020-06-05 06:42:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:34] [INFO ] [Nat]Absence check using 161 positive place invariants in 45 ms returned sat
[2020-06-05 06:42:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:34] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2020-06-05 06:42:35] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 16 ms.
[2020-06-05 06:42:36] [INFO ] Added : 319 causal constraints over 65 iterations in 1878 ms. Result :sat
[2020-06-05 06:42:37] [INFO ] [Real]Absence check using 161 positive place invariants in 71 ms returned sat
[2020-06-05 06:42:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:37] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2020-06-05 06:42:37] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 17 ms.
[2020-06-05 06:42:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:37] [INFO ] [Nat]Absence check using 161 positive place invariants in 42 ms returned sat
[2020-06-05 06:42:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:37] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2020-06-05 06:42:37] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 16 ms.
[2020-06-05 06:42:39] [INFO ] Added : 316 causal constraints over 64 iterations in 1874 ms. Result :sat
[2020-06-05 06:42:39] [INFO ] [Real]Absence check using 161 positive place invariants in 66 ms returned sat
[2020-06-05 06:42:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:39] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2020-06-05 06:42:40] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 23 ms.
[2020-06-05 06:42:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:40] [INFO ] [Nat]Absence check using 161 positive place invariants in 69 ms returned sat
[2020-06-05 06:42:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:40] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2020-06-05 06:42:40] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 35 ms.
[2020-06-05 06:42:42] [INFO ] Added : 316 causal constraints over 64 iterations in 1690 ms. Result :sat
[2020-06-05 06:42:42] [INFO ] [Real]Absence check using 161 positive place invariants in 47 ms returned sat
[2020-06-05 06:42:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:42] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2020-06-05 06:42:42] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 24 ms.
[2020-06-05 06:42:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:42] [INFO ] [Nat]Absence check using 161 positive place invariants in 45 ms returned sat
[2020-06-05 06:42:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:43] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2020-06-05 06:42:43] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 12 ms.
[2020-06-05 06:42:45] [INFO ] Added : 316 causal constraints over 64 iterations in 2188 ms. Result :sat
[2020-06-05 06:42:45] [INFO ] [Real]Absence check using 161 positive place invariants in 45 ms returned sat
[2020-06-05 06:42:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:45] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2020-06-05 06:42:45] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 22 ms.
[2020-06-05 06:42:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:45] [INFO ] [Nat]Absence check using 161 positive place invariants in 59 ms returned sat
[2020-06-05 06:42:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:46] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2020-06-05 06:42:46] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 21 ms.
[2020-06-05 06:42:48] [INFO ] Added : 318 causal constraints over 64 iterations in 1994 ms. Result :sat
[2020-06-05 06:42:48] [INFO ] [Real]Absence check using 161 positive place invariants in 65 ms returned sat
[2020-06-05 06:42:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:48] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2020-06-05 06:42:48] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 26 ms.
[2020-06-05 06:42:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:48] [INFO ] [Nat]Absence check using 161 positive place invariants in 58 ms returned sat
[2020-06-05 06:42:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:49] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2020-06-05 06:42:49] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 21 ms.
[2020-06-05 06:42:50] [INFO ] Added : 319 causal constraints over 64 iterations in 1750 ms. Result :sat
[2020-06-05 06:42:50] [INFO ] [Real]Absence check using 161 positive place invariants in 65 ms returned sat
[2020-06-05 06:42:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:51] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2020-06-05 06:42:51] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 23 ms.
[2020-06-05 06:42:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:51] [INFO ] [Nat]Absence check using 161 positive place invariants in 75 ms returned sat
[2020-06-05 06:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:51] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2020-06-05 06:42:51] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 21 ms.
[2020-06-05 06:42:53] [INFO ] Added : 319 causal constraints over 65 iterations in 2093 ms. Result :sat
[2020-06-05 06:42:54] [INFO ] [Real]Absence check using 161 positive place invariants in 58 ms returned sat
[2020-06-05 06:42:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:54] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2020-06-05 06:42:54] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 22 ms.
[2020-06-05 06:42:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:54] [INFO ] [Nat]Absence check using 161 positive place invariants in 57 ms returned sat
[2020-06-05 06:42:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:54] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2020-06-05 06:42:54] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 18 ms.
[2020-06-05 06:42:56] [INFO ] Added : 317 causal constraints over 64 iterations in 1712 ms. Result :sat
[2020-06-05 06:42:56] [INFO ] [Real]Absence check using 161 positive place invariants in 47 ms returned sat
[2020-06-05 06:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:57] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2020-06-05 06:42:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:57] [INFO ] [Nat]Absence check using 161 positive place invariants in 50 ms returned sat
[2020-06-05 06:42:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:57] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2020-06-05 06:42:57] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 14 ms.
[2020-06-05 06:42:59] [INFO ] Added : 321 causal constraints over 65 iterations in 1725 ms. Result :sat
[2020-06-05 06:42:59] [INFO ] [Real]Absence check using 161 positive place invariants in 60 ms returned sat
[2020-06-05 06:42:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:59] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2020-06-05 06:42:59] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 15 ms.
[2020-06-05 06:42:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:42:59] [INFO ] [Nat]Absence check using 161 positive place invariants in 66 ms returned sat
[2020-06-05 06:42:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:42:59] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2020-06-05 06:42:59] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 13 ms.
[2020-06-05 06:43:02] [INFO ] Added : 320 causal constraints over 65 iterations in 2251 ms. Result :sat
[2020-06-05 06:43:02] [INFO ] [Real]Absence check using 161 positive place invariants in 58 ms returned sat
[2020-06-05 06:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:02] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2020-06-05 06:43:02] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 18 ms.
[2020-06-05 06:43:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:43:02] [INFO ] [Nat]Absence check using 161 positive place invariants in 110 ms returned sat
[2020-06-05 06:43:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:03] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2020-06-05 06:43:03] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 17 ms.
[2020-06-05 06:43:05] [INFO ] Added : 318 causal constraints over 64 iterations in 1935 ms. Result :sat
[2020-06-05 06:43:05] [INFO ] [Real]Absence check using 161 positive place invariants in 58 ms returned sat
[2020-06-05 06:43:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:05] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2020-06-05 06:43:05] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 22 ms.
[2020-06-05 06:43:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:43:05] [INFO ] [Nat]Absence check using 161 positive place invariants in 56 ms returned sat
[2020-06-05 06:43:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:05] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2020-06-05 06:43:06] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 26 ms.
[2020-06-05 06:43:07] [INFO ] Added : 315 causal constraints over 64 iterations in 1552 ms. Result :sat
[2020-06-05 06:43:07] [INFO ] [Real]Absence check using 161 positive place invariants in 60 ms returned sat
[2020-06-05 06:43:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:07] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2020-06-05 06:43:07] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 15 ms.
[2020-06-05 06:43:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:43:08] [INFO ] [Nat]Absence check using 161 positive place invariants in 54 ms returned sat
[2020-06-05 06:43:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:08] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2020-06-05 06:43:08] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 14 ms.
[2020-06-05 06:43:10] [INFO ] Added : 318 causal constraints over 64 iterations in 1947 ms. Result :sat
[2020-06-05 06:43:10] [INFO ] [Real]Absence check using 161 positive place invariants in 63 ms returned sat
[2020-06-05 06:43:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:10] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2020-06-05 06:43:10] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 16 ms.
[2020-06-05 06:43:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:43:10] [INFO ] [Nat]Absence check using 161 positive place invariants in 56 ms returned sat
[2020-06-05 06:43:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:11] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2020-06-05 06:43:11] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 20 ms.
[2020-06-05 06:43:12] [INFO ] Added : 315 causal constraints over 64 iterations in 1585 ms. Result :sat
[2020-06-05 06:43:12] [INFO ] [Real]Absence check using 161 positive place invariants in 44 ms returned sat
[2020-06-05 06:43:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:13] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2020-06-05 06:43:13] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 15 ms.
[2020-06-05 06:43:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:43:13] [INFO ] [Nat]Absence check using 161 positive place invariants in 64 ms returned sat
[2020-06-05 06:43:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:13] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2020-06-05 06:43:13] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 18 ms.
[2020-06-05 06:43:15] [INFO ] Added : 317 causal constraints over 64 iterations in 2091 ms. Result :sat
[2020-06-05 06:43:15] [INFO ] [Real]Absence check using 161 positive place invariants in 57 ms returned sat
[2020-06-05 06:43:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:16] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2020-06-05 06:43:16] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 19 ms.
[2020-06-05 06:43:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:43:16] [INFO ] [Nat]Absence check using 161 positive place invariants in 70 ms returned sat
[2020-06-05 06:43:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:16] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2020-06-05 06:43:16] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 15 ms.
[2020-06-05 06:43:18] [INFO ] Added : 317 causal constraints over 64 iterations in 2070 ms. Result :sat
[2020-06-05 06:43:18] [INFO ] [Real]Absence check using 161 positive place invariants in 71 ms returned sat
[2020-06-05 06:43:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:19] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2020-06-05 06:43:19] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 18 ms.
[2020-06-05 06:43:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:43:19] [INFO ] [Nat]Absence check using 161 positive place invariants in 56 ms returned sat
[2020-06-05 06:43:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:19] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2020-06-05 06:43:19] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 17 ms.
[2020-06-05 06:43:21] [INFO ] Added : 318 causal constraints over 64 iterations in 2211 ms. Result :sat
[2020-06-05 06:43:22] [INFO ] [Real]Absence check using 161 positive place invariants in 70 ms returned sat
[2020-06-05 06:43:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:22] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2020-06-05 06:43:22] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 18 ms.
[2020-06-05 06:43:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:43:22] [INFO ] [Nat]Absence check using 161 positive place invariants in 56 ms returned sat
[2020-06-05 06:43:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:22] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2020-06-05 06:43:22] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 17 ms.
[2020-06-05 06:43:24] [INFO ] Added : 316 causal constraints over 64 iterations in 1493 ms. Result :sat
[2020-06-05 06:43:24] [INFO ] [Real]Absence check using 161 positive place invariants in 61 ms returned sat
[2020-06-05 06:43:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:24] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2020-06-05 06:43:24] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 14 ms.
[2020-06-05 06:43:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:43:24] [INFO ] [Nat]Absence check using 161 positive place invariants in 39 ms returned sat
[2020-06-05 06:43:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:25] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2020-06-05 06:43:25] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 17 ms.
[2020-06-05 06:43:26] [INFO ] Added : 316 causal constraints over 64 iterations in 1544 ms. Result :sat
[2020-06-05 06:43:26] [INFO ] [Real]Absence check using 161 positive place invariants in 59 ms returned sat
[2020-06-05 06:43:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:27] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2020-06-05 06:43:27] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 17 ms.
[2020-06-05 06:43:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:43:27] [INFO ] [Nat]Absence check using 161 positive place invariants in 53 ms returned sat
[2020-06-05 06:43:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:27] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2020-06-05 06:43:27] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 17 ms.
[2020-06-05 06:43:29] [INFO ] Added : 318 causal constraints over 64 iterations in 1660 ms. Result :sat
[2020-06-05 06:43:29] [INFO ] [Real]Absence check using 161 positive place invariants in 66 ms returned sat
[2020-06-05 06:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:29] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2020-06-05 06:43:29] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 20 ms.
[2020-06-05 06:43:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:43:29] [INFO ] [Nat]Absence check using 161 positive place invariants in 69 ms returned sat
[2020-06-05 06:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:30] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2020-06-05 06:43:30] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 13 ms.
[2020-06-05 06:43:31] [INFO ] Added : 314 causal constraints over 64 iterations in 1838 ms. Result :sat
[2020-06-05 06:43:32] [INFO ] [Real]Absence check using 161 positive place invariants in 58 ms returned sat
[2020-06-05 06:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:32] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2020-06-05 06:43:32] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 19 ms.
[2020-06-05 06:43:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:43:32] [INFO ] [Nat]Absence check using 161 positive place invariants in 78 ms returned sat
[2020-06-05 06:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:32] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2020-06-05 06:43:32] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 16 ms.
[2020-06-05 06:43:34] [INFO ] Added : 319 causal constraints over 65 iterations in 1919 ms. Result :sat
[2020-06-05 06:43:34] [INFO ] [Real]Absence check using 161 positive place invariants in 38 ms returned sat
[2020-06-05 06:43:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:35] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2020-06-05 06:43:35] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 35 ms.
[2020-06-05 06:43:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:43:35] [INFO ] [Nat]Absence check using 161 positive place invariants in 42 ms returned sat
[2020-06-05 06:43:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:43:35] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2020-06-05 06:43:35] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 17 ms.
[2020-06-05 06:43:37] [INFO ] Added : 318 causal constraints over 64 iterations in 1486 ms. Result :sat
[2020-06-05 06:43:37] [INFO ] Flatten gal took : 139 ms
[2020-06-05 06:43:37] [INFO ] Flatten gal took : 94 ms
[2020-06-05 06:43:37] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-05 06:43:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 18 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ShieldRVt-PT-040A @ 3570 seconds

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

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

FORMULA ShieldRVt-PT-040A-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldRVt-PT-040A-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldRVt-PT-040A-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA ShieldRVt-PT-040A-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-CTLFireability-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

{
"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:43:37 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "EF((EF(((p94 <= 0) OR (p97 <= 0))) AND EX((((1 <= p246) AND (1 <= p249)) OR ((1 <= p167))))))",
"processed_size": 95,
"rewrites": 28
},
"net":
{
"conflict_clusters": 83,
"singleton_clusters": 0
},
"result":
{
"edges": 51,
"markings": 26,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"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": "(((1 <= p173)) OR ((1 <= p46) AND (1 <= p49)) OR ((1 <= p263) AND (1 <= p219)))",
"processed_size": 81,
"rewrites": 27
},
"result":
{
"edges": 1046,
"markings": 1040,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 3
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 263
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(E(AX(((1 <= p69))) U ((1 <= p126) AND (((1 <= p113)) OR ((1 <= p128) AND (1 <= p130) AND (1 <= p135))) AND (1 <= p129) AND (1 <= p224) AND (1 <= p226) AND (1 <= p231))) OR AG(((p78 <= 0) OR (p81 <= 0))))",
"processed_size": 206,
"rewrites": 28
},
"net":
{
"conflict_clusters": 83,
"singleton_clusters": 0
},
"result":
{
"edges": 92,
"markings": 92,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 285
},
"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 <= p107))",
"processed_size": 13,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 311
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((1 <= p52) AND (1 <= p53) AND (1 <= p56) AND (1 <= p4) AND (1 <= p5) AND (1 <= p8))",
"processed_size": 84,
"rewrites": 27
},
"result":
{
"edges": 3980,
"markings": 3839,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 6
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 311
},
"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 <= p212) AND (1 <= p213) AND (1 <= p216))))",
"processed_size": 53,
"rewrites": 26
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 342
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p141)) OR ((1 <= p175)) OR ((1 <= p185)) OR ((1 <= p259) AND (1 <= p268) AND (1 <= p274)))))",
"processed_size": 109,
"rewrites": 26
},
"result":
{
"edges": 499,
"markings": 493,
"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": 6,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 413
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"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(AF(((p187 <= 0))) U ((1 <= p248) AND (1 <= p250) AND (1 <= p255)))",
"processed_size": 68,
"rewrites": 27
},
"net":
{
"conflict_clusters": 83,
"singleton_clusters": 0
},
"result":
{
"edges": 50,
"markings": 26,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 472
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 7,
"adisj": 2,
"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": 10,
"visible_transitions": 0
},
"processed": "E(EF((((1 <= p99)) OR ((1 <= p72) AND (1 <= p74) AND (1 <= p79)))) U (((1 <= p255)) OR ((1 <= p227)) OR ((1 <= p297)) OR ((1 <= p113)) OR ((1 <= p68) AND (1 <= p69) AND (1 <= p72))))",
"processed_size": 187,
"rewrites": 27
},
"net":
{
"conflict_clusters": 83,
"singleton_clusters": 0
},
"result":
{
"edges": 107,
"markings": 88,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 551
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 0,
"U": 2,
"X": 0,
"aconj": 6,
"adisj": 0,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "E((EF(((1 <= p64) AND (1 <= p66) AND (1 <= p71))) OR (((1 <= p1) AND (1 <= p7)) OR (((1 <= p22) AND (1 <= p25)) OR ((1 <= p88) AND (1 <= p90) AND (1 <= p95))))) U A(((1 <= p78) AND (1 <= p81)) U ((1 <= p263))))",
"processed_size": 210,
"rewrites": 28
},
"net":
{
"conflict_clusters": 83,
"singleton_clusters": 0
},
"result":
{
"edges": 161,
"markings": 95,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 826
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A ((((1 <= p179) AND (1 <= p188) AND (1 <= p194)) R ((p309 <= 0) OR (p94 <= 0) OR (p97 <= 0))))",
"processed_size": 97,
"rewrites": 30
},
"result":
{
"edges": 194,
"markings": 195,
"produced_by": "state space /EU",
"value": false
},
"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": "universal_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 826
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 4,
"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 ((((p12 <= 0) OR (p13 <= 0) OR (p16 <= 0) OR ((1 <= p119) AND (((1 <= p201)) OR ((1 <= p223))))) U ((1 <= p193))))",
"processed_size": 120,
"rewrites": 28
},
"result":
{
"edges": 48,
"markings": 49,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1101
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"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": "G ((((1 <= p129) AND (1 <= p225)) U ((p77 <= 0))))",
"processed_size": 50,
"rewrites": 27
},
"result":
{
"edges": 210,
"markings": 152,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1652
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 4,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(((1 <= p265)) R (((p33 <= 0)) OR (F (((p132 <= 0) OR (p133 <= 0) OR (p136 <= 0))) OR (((p19 <= 0)) AND ((p11 <= 0))))))",
"processed_size": 122,
"rewrites": 38
},
"result":
{
"edges": 184105611,
"markings": 63878177,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2741
},
"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": "((p168 <= 0) OR (p170 <= 0) OR (p175 <= 0))",
"processed_size": 45,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"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": "((p230 <= 0) OR (p233 <= 0) OR (p37 <= 0) OR (((p67 <= 0) OR (p76 <= 0) OR (p82 <= 0)) AND ((p135 <= 0))))",
"processed_size": 111,
"rewrites": 28
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G (((p32 <= 0) OR (p34 <= 0) OR (p39 <= 0) OR (p246 <= 0) OR (p249 <= 0) OR (p2 <= 0) OR (p4 <= 0) OR (p10 <= 0))))",
"processed_size": 125,
"rewrites": 27
},
"result":
{
"edges": 17341,
"markings": 17321,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 8
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3576,
"runtime": 1078.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E((** U (** AND (E(G(**)) AND **)))) : E(F((E(F(*)) AND E(X(**))))) : E(F(**)) : E(X(E(F(**)))) : A(G(E(X(E(F(**)))))) : E((A(F(**)) U **)) : (A(G(*)) OR (A(G(*)) AND (A(F(**)) AND **))) : E(F(A(G(*)))) : A(G(A((** U **)))) : E((** U **)) : E((E(F(**)) U **)) : (E((A(X(**)) U **)) OR A(G(**))) : (** OR E(X(E(F(**))))) : (A((* R *)) AND **) : E(((E(F(**)) OR (** OR (** OR **))) U A((** U **))))"
},
"net":
{
"arcs": 1364,
"conflict_clusters": 83,
"places": 323,
"places_significant": 162,
"singleton_clusters": 0,
"transitions": 322
},
"result":
{
"preliminary_value": "yes no yes yes yes unknown yes no unknown no yes yes no yes no yes ",
"value": "yes no yes yes yes unknown yes no unknown no yes yes no 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: 645/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 10336
lola: finding significant places
lola: 323 places, 322 transitions, 162 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: (p212 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p216 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p136 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p175 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: LP says that atomic proposition is always true: (p274 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p263 <= 1)
lola: LP says that atomic proposition is always true: (p219 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p250 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p245 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 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: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p175 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p297 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p179 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p309 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 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: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 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: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p263 <= 1)
lola: E (F (((1 <= p212) AND (1 <= p213) AND (1 <= p216)))) : E ((((p265 <= 0)) U ((((1 <= p33)) AND E (G (((1 <= p132) AND (1 <= p133) AND (1 <= p136))))) AND (((1 <= p19)) OR ((1 <= p11)))))) : E (F ((NOT(A (G (((1 <= p94) AND (1 <= p97))))) AND E (X ((((1 <= p246) AND (1 <= p249)) OR ((1 <= p167)))))))) : E (F ((((1 <= p141)) OR ((1 <= p175)) OR ((1 <= p185)) OR ((1 <= p259) AND (1 <= p268) AND (1 <= p274))))) : E (X (E (F ((((1 <= p173)) OR ((1 <= p46) AND (1 <= p49)) OR ((1 <= p263) AND (1 <= p219))))))) : A (G (E (X (E (F (((1 <= p97)))))))) : E ((A (F (((p187 <= 0)))) U ((1 <= p248) AND (1 <= p250) AND (1 <= p255)))) : (NOT(E (F (((1 <= p32) AND (1 <= p34) AND (1 <= p39) AND (1 <= p246) AND (1 <= p249) AND (1 <= p2) AND (1 <= p4) AND (1 <= p10))))) OR ((NOT(E (F (((1 <= p244) AND (1 <= p245) AND (1 <= p248))))) AND A (F (((1 <= p230) AND (1 <= p233) AND (1 <= p37) AND (((1 <= p67) AND (1 <= p76) AND (1 <= p82)) OR ((1 <= p135))))))) AND ((p168 <= 0) OR (p170 <= 0) OR (p175 <= 0)))) : NOT(A (G (E (F ((((1 <= p205)) OR ((1 <= p243) AND (1 <= p252) AND (1 <= p258)))))))) : A (G (A ((((1 <= p129) AND (1 <= p225)) U ((p77 <= 0)))))) : E ((((p12 <= 0) OR (p13 <= 0) OR (p16 <= 0) OR ((1 <= p119) AND (((1 <= p201)) OR ((1 <= p223))))) U ((1 <= p193)))) : E ((E (F ((((1 <= p99)) OR ((1 <= p72) AND (1 <= p74) AND (1 <= p79))))) U (((1 <= p255)) OR ((1 <= p227)) OR ((1 <= p297)) OR ((1 <= p113)) OR ((1 <= p68) AND (1 <= p69) AND (1 <= p72))))) : (E ((A (X (((1 <= p69)))) U ((1 <= p126) AND (((1 <= p113)) OR ((1 <= p128) AND (1 <= p130) AND (1 <= p135))) AND (1 <= p129) AND (1 <= p224) AND (1 <= p226) AND (1 <= p231)))) OR E (G (A (G (((p78 <= 0) OR (p81 <= 0))))))) : (((1 <= p107)) OR E (F (E (X (((1 <= p52) AND (1 <= p53) AND (1 <= p56) AND (1 <= p4) AND (1 <= p5) AND (1 <= p8))))))) : (NOT(E ((((p179 <= 0) OR (p188 <= 0) OR (p194 <= 0)) U ((1 <= p309) AND (1 <= p94) AND (1 <= p97))))) AND ((p37 <= 0))) : E (((((E (F (((1 <= p64) AND (1 <= p66) AND (1 <= p71)))) OR ((1 <= p1) AND (1 <= p7))) OR ((1 <= p22) AND (1 <= p25))) OR ((1 <= p88) AND (1 <= p90) AND (1 <= p95))) U A ((((1 <= p78) AND (1 <= p81)) U ((1 <= p263))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:476
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (F (((p94 <= 0) OR (p97 <= 0)))) AND E (X ((((1 <= p246) AND (1 <= p249)) OR ((1 <= p167))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EF(((p94 <= 0) OR (p97 <= 0))) AND EX((((1 <= p246) AND (1 <= p249)) OR ((1 <= p167))))))
lola: processed formula length: 95
lola: 28 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 26 markings, 51 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((((1 <= p173)) OR ((1 <= p46) AND (1 <= p49)) OR ((1 <= p263) AND (1 <= p219)))))))
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 <= p173)) OR ((1 <= p46) AND (1 <= p49)) OR ((1 <= p263) AND (1 <= p219)))
lola: processed formula length: 81
lola: 27 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 <= p173)) OR ((1 <= p46) AND (1 <= p49)) OR ((1 <= p263) AND (1 <= p219)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 1040 markings, 1046 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (E (F (((1 <= p97))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(EF(((1 <= p97)))))
lola: processed formula length: 24
lola: 28 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: 866434 markings, 2353725 edges, 173287 markings/sec, 0 secs
lola: 1732734 markings, 4713009 edges, 173260 markings/sec, 5 secs
lola: 2516528 markings, 6969522 edges, 156759 markings/sec, 10 secs
lola: 3300329 markings, 9261255 edges, 156760 markings/sec, 15 secs
lola: 4207884 markings, 11624115 edges, 181511 markings/sec, 20 secs
lola: 5032928 markings, 14046004 edges, 165009 markings/sec, 25 secs
lola: 5791186 markings, 16225484 edges, 151652 markings/sec, 30 secs
lola: 6656282 markings, 18647088 edges, 173019 markings/sec, 35 secs
lola: 7508082 markings, 20935466 edges, 170360 markings/sec, 40 secs
lola: 8266541 markings, 23207159 edges, 151692 markings/sec, 45 secs
lola: 9075678 markings, 25336356 edges, 161827 markings/sec, 50 secs
lola: 9900731 markings, 27708124 edges, 165011 markings/sec, 55 secs
lola: 10677509 markings, 29856687 edges, 155356 markings/sec, 60 secs
lola: 11463411 markings, 32059934 edges, 157180 markings/sec, 65 secs
lola: 12260106 markings, 34264156 edges, 159339 markings/sec, 70 secs
lola: 13035925 markings, 36461400 edges, 155164 markings/sec, 75 secs
lola: 13850438 markings, 38800732 edges, 162903 markings/sec, 80 secs
lola: 14356001 markings, 40299617 edges, 101113 markings/sec, 85 secs
lola: 14591611 markings, 40932586 edges, 47122 markings/sec, 90 secs
lola: 15093549 markings, 42226912 edges, 100388 markings/sec, 95 secs
lola: 15520630 markings, 43562838 edges, 85416 markings/sec, 100 secs
lola: 16037130 markings, 44888486 edges, 103300 markings/sec, 105 secs
lola: 16501146 markings, 46173960 edges, 92803 markings/sec, 110 secs
lola: 16954914 markings, 47525267 edges, 90754 markings/sec, 115 secs
lola: 17408694 markings, 48754292 edges, 90756 markings/sec, 120 secs
lola: 17900235 markings, 50146429 edges, 98308 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((A (X (((1 <= p69)))) U ((1 <= p126) AND (((1 <= p113)) OR ((1 <= p128) AND (1 <= p130) AND (1 <= p135))) AND (1 <= p129) AND (1 <= p224) AND (1 <= p226) AND (1 <= p231)))) OR A (G (((p78 <= 0) OR (p81 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: (E(AX(((1 <= p69))) U ((1 <= p126) AND (((1 <= p113)) OR ((1 <= p128) AND (1 <= p130) AND (1 <= p135))) AND (1 <= p129) AND (1 <= p224) AND (1 <= p226) AND (1 <= p231))) OR AG(((p78 <= 0) OR (p81 <= 0))))
lola: processed formula length: 206
lola: 28 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: 92 markings, 92 edges
lola: ========================================
lola: subprocess 4 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p107)) OR E (X (E (F (((1 <= p52) AND (1 <= p53) AND (1 <= p56) AND (1 <= p4) AND (1 <= p5) AND (1 <= p8)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p107))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p107))
lola: processed formula length: 13
lola: 25 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 5 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((1 <= p52) AND (1 <= p53) AND (1 <= p56) AND (1 <= p4) AND (1 <= p5) AND (1 <= p8))))))
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 <= p52) AND (1 <= p53) AND (1 <= p56) AND (1 <= p4) AND (1 <= p5) AND (1 <= p8))
lola: processed formula length: 84
lola: 27 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 <= p52) AND (1 <= p53) AND (1 <= p56) AND (1 <= p4) AND (1 <= p5) AND (1 <= p8))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 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: 3839 markings, 3980 edges
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 5 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p212) AND (1 <= p213) AND (1 <= p216))))
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 <= p212) AND (1 <= p213) AND (1 <= p216))))
lola: processed formula length: 53
lola: 26 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 <= p212) AND (1 <= p213) AND (1 <= p216))
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: 18 markings, 17 edges
lola: ========================================
lola: subprocess 6 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLFireability-5-0.sara.
sara: could not read problem information -- aborting [#01]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: ...considering subproblem: E (F ((((1 <= p141)) OR ((1 <= p175)) OR ((1 <= p185)) OR ((1 <= p259) AND (1 <= p268) AND (1 <= p274)))))
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 <= p141)) OR ((1 <= p175)) OR ((1 <= p185)) OR ((1 <= p259) AND (1 <= p268) AND (1 <= p274)))))
lola: processed formula length: 109
lola: 26 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 <= p141)) OR ((1 <= p175)) OR ((1 <= p185)) OR ((1 <= p259) AND (1 <= p268) AND (1 <= p274)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 493 markings, 499 edges
lola: ========================================
lola: subprocess 7 will run for 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((p205 <= 0)) AND ((p243 <= 0) OR (p252 <= 0) OR (p258 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((1 <= p205)) OR ((1 <= p243) AND (1 <= p252) AND (1 <= p258)))
lola: processed formula length: 65
lola: 29 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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 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 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 0
lola: state equation task get result unparse finished++ id 1
lola: formula 0: (((p205 <= 0)) AND ((p243 <= 0) OR (p252 <= 0) OR (p258 <= 0)))
lola: state equation task get result unparse finished id 0
lola: formula 1: (((1 <= p205)) OR ((1 <= p243) AND (1 <= p252) AND (1 <= p258)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
lola: state equation: write sara problem file to CTLFireability-7-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1822125 markings, 2002841 edges, 364425 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 3850130 markings, 4232212 edges, 405601 markings/sec, 5 secs
sara: warning, failure of lp_solve (at job 60)
lola: sara is running 10 secs || sara is running 10 secs || 5967951 markings, 6560313 edges, 423564 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 8153864 markings, 8963266 edges, 437183 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 10324843 markings, 11349805 edges, 434196 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 12454186 markings, 13690574 edges, 425869 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 14461395 markings, 15897078 edges, 401442 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 16648207 markings, 18301017 edges, 437362 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 18681427 markings, 20536120 edges, 406644 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 20870108 markings, 22942117 edges, 437736 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 22855494 markings, 25124634 edges, 397077 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 24954090 markings, 27431600 edges, 419719 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 27064834 markings, 29751923 edges, 422149 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 29053272 markings, 31937790 edges, 397688 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 30909771 markings, 33978628 edges, 371300 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 32410558 markings, 35628424 edges, 300157 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 33472143 markings, 36795603 edges, 212317 markings/sec, 80 secs

lola: state equation 1: solution produced
lola: sara is running 85 secs || sara is running 85 secs || 34477142 markings, 37900203 edges, 201000 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 35767342 markings, 39318512 edges, 258040 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 36913815 markings, 40578818 edges, 229295 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 38184185 markings, 41975321 edges, 254074 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 39115732 markings, 42999364 edges, 186309 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (F (((p187 <= 0)))) U ((1 <= p248) AND (1 <= p250) AND (1 <= p255))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AF(((p187 <= 0))) U ((1 <= p248) AND (1 <= p250) AND (1 <= p255)))
lola: processed formula length: 68
lola: 27 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 26 markings, 50 edges
lola: ========================================
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((((1 <= p99)) OR ((1 <= p72) AND (1 <= p74) AND (1 <= p79))))) U (((1 <= p255)) OR ((1 <= p227)) OR ((1 <= p297)) OR ((1 <= p113)) OR ((1 <= p68) AND (1 <= p69) AND (1 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((((1 <= p99)) OR ((1 <= p72) AND (1 <= p74) AND (1 <= p79)))) U (((1 <= p255)) OR ((1 <= p227)) OR ((1 <= p297)) OR ((1 <= p113)) OR ((1 <= p68) AND (1 <= p69) AND (1 <= p72))))
lola: processed formula length: 187
lola: 27 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 88 markings, 107 edges
lola: ========================================
lola: subprocess 10 will run for 551 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((E (F (((1 <= p64) AND (1 <= p66) AND (1 <= p71)))) OR (((1 <= p1) AND (1 <= p7)) OR (((1 <= p22) AND (1 <= p25)) OR ((1 <= p88) AND (1 <= p90) AND (1 <= p95))))) U A ((((1 <= p78) AND (1 <= p81)) U ((1 <= p263))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((EF(((1 <= p64) AND (1 <= p66) AND (1 <= p71))) OR (((1 <= p1) AND (1 <= p7)) OR (((1 <= p22) AND (1 <= p25)) OR ((1 <= p88) AND (1 <= p90) AND (1 <= p95))))) U A(((1 <= p78) AND (1 <= p81)) U ((1 <= p263))))
lola: processed formula length: 210
lola: 28 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 95 markings, 161 edges
lola: ========================================
lola: subprocess 11 will run for 661 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((1 <= p179) AND (1 <= p188) AND (1 <= p194)) R ((p309 <= 0) OR (p94 <= 0) OR (p97 <= 0)))) AND ((p37 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 661 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p37 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p37 <= 0))
lola: processed formula length: 12
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 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 12 will run for 826 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p179) AND (1 <= p188) AND (1 <= p194)) R ((p309 <= 0) OR (p94 <= 0) OR (p97 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((((1 <= p179) AND (1 <= p188) AND (1 <= p194)) R ((p309 <= 0) OR (p94 <= 0) OR (p97 <= 0))))
lola: processed formula length: 97
lola: 30 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: 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 <= p309) AND (1 <= p94) AND (1 <= p97))
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: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 195 markings, 194 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 826 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p12 <= 0) OR (p13 <= 0) OR (p16 <= 0) OR ((1 <= p119) AND (((1 <= p201)) OR ((1 <= p223))))) U ((1 <= p193))))
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 ((((p12 <= 0) OR (p13 <= 0) OR (p16 <= 0) OR ((1 <= p119) AND (((1 <= p201)) OR ((1 <= p223))))) U ((1 <= p193))))
lola: processed formula length: 120
lola: 28 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 <= p193))
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 /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 49 markings, 48 edges
lola: ========================================
lola: subprocess 13 will run for 1101 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A ((((1 <= p129) AND (1 <= p225)) U ((p77 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p129) AND (1 <= p225)) U ((p77 <= 0))))
lola: processed formula length: 50
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 152 markings, 210 edges
lola: ========================================
lola: subprocess 14 will run for 1652 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p265 <= 0)) U (((1 <= p33)) AND (E (G (((1 <= p132) AND (1 <= p133) AND (1 <= p136)))) AND (((1 <= p19)) OR ((1 <= p11)))))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p265)) R (((p33 <= 0)) OR (F (((p132 <= 0) OR (p133 <= 0) OR (p136 <= 0))) OR (((p19 <= 0)) AND ((p11 <= 0))))))
lola: processed formula length: 122
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 1054944 markings, 2131485 edges, 210989 markings/sec, 0 secs
lola: 1963753 markings, 4122757 edges, 181762 markings/sec, 5 secs
lola: 2817218 markings, 6042003 edges, 170693 markings/sec, 10 secs
lola: 3556486 markings, 7742504 edges, 147854 markings/sec, 15 secs
lola: 4268801 markings, 9397121 edges, 142463 markings/sec, 20 secs
lola: 5016773 markings, 11131730 edges, 149594 markings/sec, 25 secs
lola: 5757506 markings, 12849439 edges, 148147 markings/sec, 30 secs
lola: 6443516 markings, 14448707 edges, 137202 markings/sec, 35 secs
lola: 7161481 markings, 16126252 edges, 143593 markings/sec, 40 secs
lola: 7873953 markings, 17797768 edges, 142494 markings/sec, 45 secs
lola: 8564194 markings, 19415265 edges, 138048 markings/sec, 50 secs
lola: 9237868 markings, 21025282 edges, 134735 markings/sec, 55 secs
lola: 9932861 markings, 22706060 edges, 138999 markings/sec, 60 secs
lola: 10619099 markings, 24366291 edges, 137248 markings/sec, 65 secs
lola: 11267766 markings, 25947252 edges, 129733 markings/sec, 70 secs
lola: 11934183 markings, 27568360 edges, 133283 markings/sec, 75 secs
lola: 12593083 markings, 29173125 edges, 131780 markings/sec, 80 secs
lola: 13244767 markings, 30756061 edges, 130337 markings/sec, 85 secs
lola: 13881840 markings, 32303230 edges, 127415 markings/sec, 90 secs
lola: 14505598 markings, 33827207 edges, 124752 markings/sec, 95 secs
lola: 15126106 markings, 35359695 edges, 124102 markings/sec, 100 secs
lola: 15742620 markings, 36868097 edges, 123303 markings/sec, 105 secs
lola: 16352444 markings, 38374618 edges, 121965 markings/sec, 110 secs
lola: 16961147 markings, 39878698 edges, 121741 markings/sec, 115 secs
lola: 17581557 markings, 41403375 edges, 124082 markings/sec, 120 secs
lola: 18201929 markings, 42923484 edges, 124074 markings/sec, 125 secs
lola: 18807674 markings, 44437066 edges, 121149 markings/sec, 130 secs
lola: 19413853 markings, 45919500 edges, 121236 markings/sec, 135 secs
lola: 19983944 markings, 47317734 edges, 114018 markings/sec, 140 secs
lola: 20665570 markings, 49005886 edges, 136325 markings/sec, 145 secs
lola: 21280354 markings, 50532882 edges, 122957 markings/sec, 150 secs
lola: 21905060 markings, 52060697 edges, 124941 markings/sec, 155 secs
lola: 22493356 markings, 53502637 edges, 117659 markings/sec, 160 secs
lola: 23101665 markings, 55001546 edges, 121662 markings/sec, 165 secs
lola: 23725228 markings, 56572580 edges, 124713 markings/sec, 170 secs
lola: 24348982 markings, 58106633 edges, 124751 markings/sec, 175 secs
lola: 24992904 markings, 59671277 edges, 128784 markings/sec, 180 secs
lola: 25739305 markings, 61485869 edges, 149280 markings/sec, 185 secs
lola: 26479476 markings, 63290244 edges, 148034 markings/sec, 190 secs
lola: 27208251 markings, 65081354 edges, 145755 markings/sec, 195 secs
lola: 27940832 markings, 66890007 edges, 146516 markings/sec, 200 secs
lola: 28675760 markings, 68713646 edges, 146986 markings/sec, 205 secs
lola: 29409466 markings, 70547898 edges, 146741 markings/sec, 210 secs
lola: 30136664 markings, 72376529 edges, 145440 markings/sec, 215 secs
lola: 30937224 markings, 74380993 edges, 160112 markings/sec, 220 secs
lola: 31629877 markings, 76131590 edges, 138531 markings/sec, 225 secs
lola: 32355105 markings, 77955773 edges, 145046 markings/sec, 230 secs
lola: 33079114 markings, 79778694 edges, 144802 markings/sec, 235 secs
lola: 33788680 markings, 81592965 edges, 141913 markings/sec, 240 secs
lola: 34380045 markings, 83114079 edges, 118273 markings/sec, 245 secs
lola: 34977573 markings, 84656065 edges, 119506 markings/sec, 250 secs
lola: 35551311 markings, 86141678 edges, 114748 markings/sec, 255 secs
lola: 36127717 markings, 87644497 edges, 115281 markings/sec, 260 secs
lola: 36710497 markings, 89159872 edges, 116556 markings/sec, 265 secs
lola: 37300150 markings, 90702384 edges, 117931 markings/sec, 270 secs
lola: 37888334 markings, 92265510 edges, 117637 markings/sec, 275 secs
lola: 38482755 markings, 93832322 edges, 118884 markings/sec, 280 secs
lola: 39033964 markings, 95312164 edges, 110242 markings/sec, 285 secs
lola: 39716923 markings, 97103278 edges, 136592 markings/sec, 290 secs
lola: 40396795 markings, 98875537 edges, 135974 markings/sec, 295 secs
lola: 41036920 markings, 100554079 edges, 128025 markings/sec, 300 secs
lola: 41670802 markings, 102251706 edges, 126776 markings/sec, 305 secs
lola: 42373594 markings, 104112046 edges, 140558 markings/sec, 310 secs
lola: 43091732 markings, 106001003 edges, 143628 markings/sec, 315 secs
lola: 43815044 markings, 107857589 edges, 144662 markings/sec, 320 secs
lola: 44516233 markings, 109674161 edges, 140238 markings/sec, 325 secs
lola: 45209500 markings, 111455406 edges, 138653 markings/sec, 330 secs
lola: 45789683 markings, 112953931 edges, 116037 markings/sec, 335 secs
lola: 46455601 markings, 114687174 edges, 133184 markings/sec, 340 secs
lola: 47120694 markings, 116448813 edges, 133019 markings/sec, 345 secs
lola: 47769362 markings, 118177472 edges, 129734 markings/sec, 350 secs
lola: 48420666 markings, 119945070 edges, 130261 markings/sec, 355 secs
lola: 49055985 markings, 121697242 edges, 127064 markings/sec, 360 secs
lola: 49623706 markings, 123290555 edges, 113544 markings/sec, 365 secs
lola: 50173775 markings, 124880686 edges, 110014 markings/sec, 370 secs
lola: 50747179 markings, 126666872 edges, 114681 markings/sec, 375 secs
lola: 51222135 markings, 128431752 edges, 94991 markings/sec, 380 secs
lola: 51655106 markings, 130145500 edges, 86594 markings/sec, 385 secs
lola: 52060604 markings, 131843769 edges, 81100 markings/sec, 390 secs
lola: 52437846 markings, 133403869 edges, 75448 markings/sec, 395 secs
lola: 52876675 markings, 135174091 edges, 87766 markings/sec, 400 secs
lola: 53277037 markings, 136808632 edges, 80072 markings/sec, 405 secs
lola: 53633660 markings, 138361726 edges, 71325 markings/sec, 410 secs
lola: 54021263 markings, 139906827 edges, 77521 markings/sec, 415 secs
lola: 54410147 markings, 141502285 edges, 77777 markings/sec, 420 secs
lola: 54760378 markings, 142950620 edges, 70046 markings/sec, 425 secs
lola: 55119461 markings, 144448989 edges, 71817 markings/sec, 430 secs
lola: 55533085 markings, 146141711 edges, 82725 markings/sec, 435 secs
lola: 55915970 markings, 147730169 edges, 76577 markings/sec, 440 secs
lola: 56298295 markings, 149308299 edges, 76465 markings/sec, 445 secs
lola: 56671455 markings, 150893973 edges, 74632 markings/sec, 450 secs
lola: 57035859 markings, 152511179 edges, 72881 markings/sec, 455 secs
lola: 57394187 markings, 154129210 edges, 71666 markings/sec, 460 secs
lola: 57766643 markings, 155772488 edges, 74491 markings/sec, 465 secs
lola: 58148700 markings, 157427232 edges, 76411 markings/sec, 470 secs
lola: 58559433 markings, 159164930 edges, 82147 markings/sec, 475 secs
lola: 58928335 markings, 160839217 edges, 73780 markings/sec, 480 secs
lola: 59257568 markings, 162362340 edges, 65847 markings/sec, 485 secs
lola: 59584989 markings, 163826120 edges, 65484 markings/sec, 490 secs
lola: 59891122 markings, 165253002 edges, 61227 markings/sec, 495 secs
lola: 60213728 markings, 166700336 edges, 64521 markings/sec, 500 secs
lola: 60523601 markings, 168107866 edges, 61975 markings/sec, 505 secs
lola: 60845271 markings, 169553930 edges, 64334 markings/sec, 510 secs
lola: 61160259 markings, 170992648 edges, 62998 markings/sec, 515 secs
lola: 61487878 markings, 172457190 edges, 65524 markings/sec, 520 secs
lola: 61802171 markings, 173912904 edges, 62859 markings/sec, 525 secs
lola: 62115533 markings, 175363110 edges, 62672 markings/sec, 530 secs
lola: 62422640 markings, 176826808 edges, 61421 markings/sec, 535 secs
lola: 62742268 markings, 178314121 edges, 63926 markings/sec, 540 secs
lola: 63055088 markings, 179832851 edges, 62564 markings/sec, 545 secs
lola: 63372131 markings, 181367932 edges, 63409 markings/sec, 550 secs
lola: 63681297 markings, 182949655 edges, 61833 markings/sec, 555 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The existential single path CTL formula does not hold.
lola: 63878177 markings, 184105611 edges
lola: ========================================
lola: subprocess 15 will run for 2741 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p32 <= 0) OR (p34 <= 0) OR (p39 <= 0) OR (p246 <= 0) OR (p249 <= 0) OR (p2 <= 0) OR (p4 <= 0) OR (p10 <= 0)))) OR (A (G (((p244 <= 0) OR (p245 <= 0) OR (p248 <= 0)))) AND (A (F (((1 <= p230) AND (1 <= p233) AND (1 <= p37) AND (((1 <= p67) AND (1 <= p76) AND (1 <= p82)) OR ((1 <= p135)))))) AND ((p168 <= 0) OR (p170 <= 0) OR (p175 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2741 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p168 <= 0) OR (p170 <= 0) OR (p175 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p168 <= 0) OR (p170 <= 0) OR (p175 <= 0))
lola: processed formula length: 45
lola: 25 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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p230) AND (1 <= p233) AND (1 <= p37) AND (((1 <= p67) AND (1 <= p76) AND (1 <= p82)) OR ((1 <= p135))))))
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: ((p230 <= 0) OR (p233 <= 0) OR (p37 <= 0) OR (((p67 <= 0) OR (p76 <= 0) OR (p82 <= 0)) AND ((p135 <= 0))))
lola: processed formula length: 111
lola: 28 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: SUBRESULT
lola: formula 0: ((1 <= p230) AND (1 <= p233) AND (1 <= p37) AND (((1 <= p67) AND (1 <= p76) AND (1 <= p82)) OR ((1 <= p135))))
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished id 0
lola: The predicate does not eventually occur.
lola: 5 markings, 5 edges
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p32 <= 0) OR (p34 <= 0) OR (p39 <= 0) OR (p246 <= 0) OR (p249 <= 0) OR (p2 <= 0) OR (p4 <= 0) OR (p10 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p32 <= 0) OR (p34 <= 0) OR (p39 <= 0) OR (p246 <= 0) OR (p249 <= 0) OR (p2 <= 0) OR (p4 <= 0) OR (p10 <= 0))))
lola: processed formula length: 125
lola: 27 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: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 <= p32) AND (1 <= p34) AND (1 <= p39) AND (1 <= p246) AND (1 <= p249) AND (1 <= p2) AND (1 <= p4) AND (1 <= p10))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-18-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17321 markings, 17341 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (X (E (F (((1 <= p97))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(EF(((1 <= p97)))))
lola: processed formula length: 24
lola: 28 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: 782658 markings, 2142298 edges, 156532 markings/sec, 0 secs
lola: 1656884 markings, 4606223 edges, 174845 markings/sec, 5 secs
lola: 2484842 markings, 6885845 edges, 165592 markings/sec, 10 secs
lola: 3236590 markings, 9044648 edges, 150350 markings/sec, 15 secs
lola: 4149037 markings, 11499897 edges, 182489 markings/sec, 20 secs
lola: 5032928 markings, 13984200 edges, 176778 markings/sec, 25 secs
lola: 5865519 markings, 16480392 edges, 166518 markings/sec, 30 secs
lola: 6765539 markings, 18911151 edges, 180004 markings/sec, 35 secs
lola: 7560168 markings, 21168941 edges, 158926 markings/sec, 40 secs
lola: 8415640 markings, 23524428 edges, 171094 markings/sec, 45 secs
lola: 9240699 markings, 25888429 edges, 165012 markings/sec, 50 secs
lola: 10024484 markings, 28099508 edges, 156757 markings/sec, 55 secs
lola: 10808304 markings, 30109821 edges, 156764 markings/sec, 60 secs
lola: 11550841 markings, 32362234 edges, 148507 markings/sec, 65 secs
lola: 12385188 markings, 34757318 edges, 166869 markings/sec, 70 secs
lola: 13200943 markings, 36952277 edges, 163151 markings/sec, 75 secs
lola: 13996666 markings, 39171984 edges, 159145 markings/sec, 80 secs
lola: 14590212 markings, 40929130 edges, 118709 markings/sec, 85 secs
lola: 15016046 markings, 42068202 edges, 85167 markings/sec, 90 secs
lola: 15464023 markings, 43317740 edges, 89595 markings/sec, 95 secs
lola: 15924895 markings, 44638404 edges, 92174 markings/sec, 100 secs
lola: 16418725 markings, 46083349 edges, 98766 markings/sec, 105 secs
lola: 16893286 markings, 47397212 edges, 94912 markings/sec, 110 secs
lola: 17367441 markings, 48645669 edges, 94831 markings/sec, 115 secs
lola: 17849404 markings, 50039721 edges, 96393 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((p205 <= 0)) AND ((p243 <= 0) OR (p252 <= 0) OR (p258 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((1 <= p205)) OR ((1 <= p243) AND (1 <= p252) AND (1 <= p258)))
lola: processed formula length: 65
lola: 29 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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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 <= p205)) OR ((1 <= p243) AND (1 <= p252) AND (1 <= p258)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
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: (((p205 <= 0)) AND ((p243 <= 0) OR (p252 <= 0) OR (p258 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-17-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-17-0.sara.
sara: try reading problem file CTLFireability-17-1.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2057274 markings, 2261340 edges, 411455 markings/sec, 0 secs
sara: warning, failure of lp_solve (at job 60)
lola: sara is running 5 secs || sara is running 5 secs || 4204827 markings, 4622124 edges, 429511 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 6304439 markings, 6930210 edges, 419922 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 8450841 markings, 9289731 edges, 429280 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 10565382 markings, 11614220 edges, 422908 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 12688634 markings, 13948296 edges, 424650 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 14589161 markings, 16037529 edges, 380105 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 16560782 markings, 18204914 edges, 394324 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 18503954 markings, 20341019 edges, 388634 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 20601570 markings, 22646919 edges, 419523 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 22773983 markings, 25035027 edges, 434483 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 24947002 markings, 27423807 edges, 434604 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 27113815 markings, 29805769 edges, 433363 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 29271811 markings, 32178030 edges, 431599 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 31315068 markings, 34424162 edges, 408651 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 32318411 markings, 35527129 edges, 200669 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 33524961 markings, 36853479 edges, 241310 markings/sec, 80 secs

lola: state equation 1: solution produced
lola: sara is running 85 secs || sara is running 85 secs || 34814325 markings, 38270868 edges, 257873 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 36219010 markings, 39815024 edges, 280937 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 37316482 markings, 41021463 edges, 219494 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 38260085 markings, 42058762 edges, 188721 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 39106245 markings, 42988937 edges, 169232 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 39106419 markings, 42989128 edges, 35 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no yes yes yes unknown yes no unknown no yes yes no yes no yes
lola:
preliminary result: yes no yes yes yes unknown yes no unknown no yes yes no yes no yes
lola: memory consumption: 3576 KB
lola: time consumption: 1078 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-040A"
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-040A, 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-159033478301052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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