Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 3.3K Apr 12 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 11 12:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 12:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 110K Mar 24 05:38 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 n0-CTLFireability-00
FORMULA_NAME n0-CTLFireability-01
FORMULA_NAME n0-CTLFireability-02
FORMULA_NAME n0-CTLFireability-03
FORMULA_NAME n0-CTLFireability-04
FORMULA_NAME n0-CTLFireability-05
FORMULA_NAME n0-CTLFireability-06
FORMULA_NAME n0-CTLFireability-07
FORMULA_NAME n0-CTLFireability-08
FORMULA_NAME n0-CTLFireability-09
FORMULA_NAME n0-CTLFireability-10
FORMULA_NAME n0-CTLFireability-11
FORMULA_NAME n0-CTLFireability-12
FORMULA_NAME n0-CTLFireability-13
FORMULA_NAME n0-CTLFireability-14
FORMULA_NAME n0-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591227368386

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:36:09] [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-03 23:36:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:36:09] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2020-06-03 23:36:09] [INFO ] Transformed 254 places.
[2020-06-03 23:36:09] [INFO ] Transformed 203 transitions.
[2020-06-03 23:36:09] [INFO ] Parsed PT model containing 254 places and 203 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Incomplete random walk after 100024 steps, including 0 resets, run finished after 204 ms. (steps per millisecond=490 ) properties seen :[0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1]
// Phase 1: matrix 203 rows 254 cols
[2020-06-03 23:36:09] [INFO ] Computed 102 place invariants in 6 ms
[2020-06-03 23:36:14] [INFO ] [Real]Absence check using 102 positive place invariants in 1306 ms returned sat
[2020-06-03 23:36:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:15] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2020-06-03 23:36:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:15] [INFO ] [Nat]Absence check using 102 positive place invariants in 38 ms returned sat
[2020-06-03 23:36:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:15] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-06-03 23:36:15] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 12 ms.
[2020-06-03 23:36:18] [INFO ] Added : 57 causal constraints over 12 iterations in 3464 ms. Result :sat
[2020-06-03 23:36:18] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:36:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:19] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-06-03 23:36:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:19] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:19] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2020-06-03 23:36:19] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:36:19] [INFO ] Added : 73 causal constraints over 15 iterations in 194 ms. Result :sat
[2020-06-03 23:36:19] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:36:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:19] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2020-06-03 23:36:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:19] [INFO ] [Nat]Absence check using 102 positive place invariants in 41 ms returned sat
[2020-06-03 23:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:19] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2020-06-03 23:36:19] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2020-06-03 23:36:20] [INFO ] Added : 91 causal constraints over 19 iterations in 271 ms. Result :sat
[2020-06-03 23:36:20] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:20] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2020-06-03 23:36:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:20] [INFO ] [Nat]Absence check using 102 positive place invariants in 40 ms returned sat
[2020-06-03 23:36:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:20] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2020-06-03 23:36:20] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2020-06-03 23:36:20] [INFO ] Added : 44 causal constraints over 9 iterations in 116 ms. Result :sat
[2020-06-03 23:36:20] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:36:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:20] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-06-03 23:36:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:20] [INFO ] [Nat]Absence check using 102 positive place invariants in 26 ms returned sat
[2020-06-03 23:36:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:21] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2020-06-03 23:36:21] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:36:21] [INFO ] Added : 63 causal constraints over 13 iterations in 186 ms. Result :sat
[2020-06-03 23:36:23] [INFO ] [Real]Absence check using 102 positive place invariants in 1890 ms returned sat
[2020-06-03 23:36:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:23] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2020-06-03 23:36:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:23] [INFO ] [Nat]Absence check using 102 positive place invariants in 39 ms returned sat
[2020-06-03 23:36:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:23] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2020-06-03 23:36:23] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 12 ms.
[2020-06-03 23:36:24] [INFO ] Added : 103 causal constraints over 21 iterations in 514 ms. Result :sat
[2020-06-03 23:36:24] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:24] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-03 23:36:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:24] [INFO ] [Nat]Absence check using 102 positive place invariants in 57 ms returned sat
[2020-06-03 23:36:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:24] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2020-06-03 23:36:24] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 13 ms.
[2020-06-03 23:36:25] [INFO ] Added : 86 causal constraints over 18 iterations in 201 ms. Result :sat
[2020-06-03 23:36:25] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:36:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:25] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-06-03 23:36:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:25] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:36:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:25] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2020-06-03 23:36:25] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 7 ms.
[2020-06-03 23:36:25] [INFO ] Added : 93 causal constraints over 19 iterations in 220 ms. Result :sat
[2020-06-03 23:36:25] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:26] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2020-06-03 23:36:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:26] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:26] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2020-06-03 23:36:26] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2020-06-03 23:36:26] [INFO ] Added : 54 causal constraints over 11 iterations in 161 ms. Result :sat
[2020-06-03 23:36:26] [INFO ] [Real]Absence check using 102 positive place invariants in 20 ms returned sat
[2020-06-03 23:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:26] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2020-06-03 23:36:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:26] [INFO ] [Nat]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:26] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2020-06-03 23:36:26] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2020-06-03 23:36:26] [INFO ] Added : 62 causal constraints over 13 iterations in 140 ms. Result :sat
[2020-06-03 23:36:27] [INFO ] [Real]Absence check using 102 positive place invariants in 453 ms returned sat
[2020-06-03 23:36:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:27] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2020-06-03 23:36:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:27] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:36:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:27] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-06-03 23:36:27] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 7 ms.
[2020-06-03 23:36:28] [INFO ] Added : 83 causal constraints over 17 iterations in 218 ms. Result :sat
[2020-06-03 23:36:28] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:28] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2020-06-03 23:36:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:28] [INFO ] [Nat]Absence check using 102 positive place invariants in 20 ms returned sat
[2020-06-03 23:36:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:28] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2020-06-03 23:36:28] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2020-06-03 23:36:28] [INFO ] Added : 44 causal constraints over 9 iterations in 106 ms. Result :sat
[2020-06-03 23:36:28] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:28] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2020-06-03 23:36:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:28] [INFO ] [Nat]Absence check using 102 positive place invariants in 36 ms returned sat
[2020-06-03 23:36:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:29] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2020-06-03 23:36:29] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 6 ms.
[2020-06-03 23:36:29] [INFO ] Added : 43 causal constraints over 9 iterations in 111 ms. Result :sat
[2020-06-03 23:36:29] [INFO ] [Real]Absence check using 102 positive place invariants in 669 ms returned sat
[2020-06-03 23:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:30] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2020-06-03 23:36:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:30] [INFO ] [Nat]Absence check using 102 positive place invariants in 31 ms returned sat
[2020-06-03 23:36:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:30] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2020-06-03 23:36:30] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:36:30] [INFO ] Added : 61 causal constraints over 13 iterations in 141 ms. Result :sat
[2020-06-03 23:36:30] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:36:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:30] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2020-06-03 23:36:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:31] [INFO ] [Nat]Absence check using 102 positive place invariants in 455 ms returned sat
[2020-06-03 23:36:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:31] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2020-06-03 23:36:31] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:36:31] [INFO ] Added : 75 causal constraints over 15 iterations in 185 ms. Result :sat
[2020-06-03 23:36:31] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:31] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2020-06-03 23:36:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:31] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:36:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:31] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-06-03 23:36:31] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:36:32] [INFO ] Added : 93 causal constraints over 19 iterations in 289 ms. Result :sat
[2020-06-03 23:36:32] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:32] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2020-06-03 23:36:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:32] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:36:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:32] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2020-06-03 23:36:32] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 19 ms.
[2020-06-03 23:36:32] [INFO ] Added : 62 causal constraints over 13 iterations in 182 ms. Result :sat
[2020-06-03 23:36:32] [INFO ] [Real]Absence check using 102 positive place invariants in 28 ms returned sat
[2020-06-03 23:36:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:32] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2020-06-03 23:36:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:32] [INFO ] [Nat]Absence check using 102 positive place invariants in 26 ms returned sat
[2020-06-03 23:36:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:33] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-06-03 23:36:33] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2020-06-03 23:36:33] [INFO ] Added : 96 causal constraints over 20 iterations in 271 ms. Result :sat
[2020-06-03 23:36:33] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:36:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:33] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2020-06-03 23:36:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:33] [INFO ] [Nat]Absence check using 102 positive place invariants in 60 ms returned sat
[2020-06-03 23:36:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:33] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2020-06-03 23:36:33] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:36:34] [INFO ] Added : 35 causal constraints over 7 iterations in 266 ms. Result :sat
[2020-06-03 23:36:34] [INFO ] Flatten gal took : 60 ms
[2020-06-03 23:36:34] [INFO ] Flatten gal took : 14 ms
[2020-06-03 23:36:34] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-03 23:36:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ RefineWMG-PT-050050 @ 3570 seconds

FORMULA n0-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 972
rslt: Output for CTLFireability @ RefineWMG-PT-050050

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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 <= p96) AND (1 <= p97) AND (1 <= p99))))",
"processed_size": 50,
"rewrites": 18
},
"result":
{
"edges": 32,
"markings": 33,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AX(((p138 <= 0) OR ((1 <= p126) AND (1 <= p127) AND (1 <= p129)) OR (1 <= p207)))",
"processed_size": 83,
"rewrites": 18
},
"net":
{
"conflict_clusters": 153,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((1 <= p148) OR (1 <= p208)) AND ((3 <= p3) OR (1 <= p100)))",
"processed_size": 63,
"rewrites": 19
},
"result":
{
"edges": 3,
"markings": 4,
"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": 8,
"problems": 4
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 267
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"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": 11,
"visible_transitions": 0
},
"processed": "A (((((1 <= p102) AND (1 <= p40)) OR ((1 <= p117) AND (1 <= p77))) U ((1 <= p176) AND (1 <= p177) AND (1 <= p179) AND (1 <= p48) AND ((p181 <= 0) OR (p182 <= 0) OR (p184 <= 0)))))",
"processed_size": 182,
"rewrites": 22
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 299
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"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 <= p181) AND (1 <= p182) AND (1 <= p184)) OR ((1 <= p56) AND (1 <= p57) AND (1 <= p59)))))",
"processed_size": 102,
"rewrites": 18
},
"result":
{
"edges": 15,
"markings": 16,
"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": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 463
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"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 (F (((1 <= p88) AND (1 <= p70) AND ((1 <= p40) OR (1 <= p215)))))",
"processed_size": 68,
"rewrites": 18
},
"result":
{
"edges": 39,
"markings": 40,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

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

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

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

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

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

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"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": 11,
"visible_transitions": 0
},
"processed": "A (((((1 <= p102) AND (1 <= p40)) OR ((1 <= p117) AND (1 <= p77))) U ((1 <= p176) AND (1 <= p177) AND (1 <= p179) AND (1 <= p48) AND ((p181 <= 0) OR (p182 <= 0) OR (p184 <= 0)))))",
"processed_size": 182,
"rewrites": 22
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3360,
"runtime": 2598.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(F(**)) AND (A(X(**)) OR **)) : E(X(E(F(**)))) : (E((** U A(G(**)))) OR **) : (E((** U A(X(**)))) OR (** AND (A(G(*)) OR **))) : A(G(**)) : (A((** U **)) OR A(G((** OR A(X(**)))))) : E(F(**)) : E(F((** AND A(G(**))))) : E(X(A(G(*)))) : (E(X(A(F(*)))) OR **) : E(F(**)) : (E(F(**)) OR E(F((A(X(**)) AND E(X(**)))))) : A(X(E(F(A(G(**)))))) : A(F(E((** U **)))) : (A(G(*)) OR **) : (** OR ((E(F(**)) OR E(F(**))) AND (E(F(**)) OR A((** U **)))))"
},
"net":
{
"arcs": 608,
"conflict_clusters": 153,
"places": 254,
"places_significant": 152,
"singleton_clusters": 0,
"transitions": 203
},
"result":
{
"preliminary_value": "yes yes unknown unknown no unknown yes unknown unknown no yes yes unknown unknown no yes ",
"value": "yes yes unknown unknown no unknown yes unknown unknown no yes yes unknown unknown 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: 457/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8128
lola: finding significant places
lola: 254 places, 203 transitions, 152 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: (E (F (((1 <= p96) AND (1 <= p97) AND (1 <= p99)))) AND (A (X (((p138 <= 0) OR ((1 <= p126) AND (1 <= p127) AND (1 <= p129)) OR (1 <= p207)))) OR ((1 <= p61) AND (1 <= p62) AND (1 <= p64)))) : E (X (E (F ((((1 <= p148) OR (1 <= p208)) AND ((3 <= p3) OR (1 <= p100))))))) : (E ((((p10 <= 0) AND ((1 <= p237) OR (1 <= p32))) U A (G (((1 <= p16) AND (1 <= p17) AND (1 <= p19)))))) OR ((1 <= p141) AND (1 <= p142) AND (1 <= p144))) : (E ((((1 <= p37) OR (1 <= p233) OR (1 <= p88)) U A (X (((1 <= p81) AND (1 <= p82) AND (1 <= p84)))))) OR (((1 <= p31) AND (1 <= p32) AND (1 <= p34)) AND (NOT(E (F ((1 <= p15)))) OR ((1 <= p106) AND (1 <= p107) AND (1 <= p109))))) : A (G ((1 <= p132))) : (A (((((1 <= p102) AND (1 <= p40)) OR ((1 <= p117) AND (1 <= p77))) U ((1 <= p176) AND (1 <= p177) AND (1 <= p179) AND (1 <= p48) AND ((p181 <= 0) OR (p182 <= 0) OR (p184 <= 0))))) OR A (G (((((1 <= p197)) OR ((1 <= p198) AND (1 <= p105))) OR A (X ((1 <= p72))))))) : A (F (E (F (((1 <= p88) AND (1 <= p70) AND ((1 <= p40) OR (1 <= p215))))))) : E (F (((1 <= p225) AND A (G (((1 <= p153) OR (1 <= p45))))))) : E (X (NOT(E (F (((1 <= p160) AND (1 <= p83))))))) : (NOT(A (X (E (G ((1 <= p82)))))) OR (1 <= p155)) : E (F ((1 <= p100))) : E (F (((((1 <= p181) AND (1 <= p182) AND (1 <= p184)) OR ((1 <= p56) AND (1 <= p57) AND (1 <= p59))) OR (A (X ((1 <= p7))) AND E (X ((1 <= p170))))))) : A (X (E (F (A (G ((1 <= p93))))))) : A (F (E ((((1 <= p247) OR (1 <= p188)) U ((1 <= p11) AND (1 <= p12) AND (1 <= p14)))))) : (NOT(E (F (A (F ((1 <= p110)))))) OR ((1 <= p0) AND (1 <= p251) AND (1 <= p252))) : (((1 <= p236) AND (1 <= p237) AND (1 <= p239)) OR ((E (F (((1 <= p90) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p9))))) OR E (F ((p162 <= 0)))) AND (E (F (((1 <= p156) AND (1 <= p157) AND (1 <= p159) AND (1 <= p128)))) OR A ((((1 <= p206) AND (1 <= p207) AND (1 <= p209)) U (1 <= p190))))))
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:449
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:455
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: 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 (((1 <= p96) AND (1 <= p97) AND (1 <= p99)))) AND (A (X (((p138 <= 0) OR ((1 <= p126) AND (1 <= p127) AND (1 <= p129)) OR (1 <= p207)))) OR ((1 <= p61) AND (1 <= p62) AND (1 <= p64))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p61) AND (1 <= p62) AND (1 <= p64))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p61) AND (1 <= p62) AND (1 <= p64))
lola: processed formula length: 42
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p96) AND (1 <= p97) AND (1 <= p99))))
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 <= p96) AND (1 <= p97) AND (1 <= p99))))
lola: processed formula length: 50
lola: 18 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33 markings, 32 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p138 <= 0) OR ((1 <= p126) AND (1 <= p127) AND (1 <= p129)) OR (1 <= p207))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p138 <= 0) OR ((1 <= p126) AND (1 <= p127) AND (1 <= p129)) OR (1 <= p207)))
lola: processed formula length: 83
lola: 18 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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((((1 <= p148) OR (1 <= p208)) AND ((3 <= p3) OR (1 <= p100)))))))
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 <= p148) OR (1 <= p208)) AND ((3 <= p3) OR (1 <= p100)))
lola: processed formula length: 63
lola: 19 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 <= p148) OR (1 <= p208)) AND ((3 <= p3) OR (1 <= p100)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((1 <= p37) OR (1 <= p233) OR (1 <= p88)) U A (X (((1 <= p81) AND (1 <= p82) AND (1 <= p84)))))) OR (((1 <= p31) AND (1 <= p32) AND (1 <= p34)) AND (A (G ((p15 <= 0))) OR ((1 <= p106) AND (1 <= p107) AND (1 <= p109)))))
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(((1 <= p37) OR (1 <= p233) OR (1 <= p88)) U AX(((1 <= p81) AND (1 <= p82) AND (1 <= p84)))) OR (((1 <= p31) AND (1 <= p32) AND (1 <= p34)) AND (AG((p15 <= 0)) OR ((1 <= p106) AND (1 <= p107) AND (1 <= p109)))))
lola: processed formula length: 215
lola: 20 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: 2112339 markings, 3189608 edges, 422468 markings/sec, 0 secs
lola: 4165388 markings, 6289683 edges, 410610 markings/sec, 5 secs
lola: 6209123 markings, 9375697 edges, 408747 markings/sec, 10 secs
lola: 8171420 markings, 12338799 edges, 392459 markings/sec, 15 secs
lola: 10167384 markings, 15352681 edges, 399193 markings/sec, 20 secs
lola: 12158574 markings, 18359400 edges, 398238 markings/sec, 25 secs
lola: 14141710 markings, 21353927 edges, 396627 markings/sec, 30 secs
lola: 16149649 markings, 24385921 edges, 401588 markings/sec, 35 secs
lola: 18158103 markings, 27418652 edges, 401691 markings/sec, 40 secs
lola: 20204390 markings, 30508579 edges, 409257 markings/sec, 45 secs
lola: 22232527 markings, 33571071 edges, 405627 markings/sec, 50 secs
lola: 24214145 markings, 36563299 edges, 396324 markings/sec, 55 secs
lola: 26146608 markings, 39481320 edges, 386493 markings/sec, 60 secs
lola: 28119561 markings, 42460504 edges, 394591 markings/sec, 65 secs
lola: 29918373 markings, 45176821 edges, 359762 markings/sec, 70 secs
lola: 31738322 markings, 47925229 edges, 363990 markings/sec, 75 secs
lola: 33464324 markings, 50531537 edges, 345200 markings/sec, 80 secs
lola: 34382228 markings, 51917433 edges, 183581 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((((1 <= p102) AND (1 <= p40)) OR ((1 <= p117) AND (1 <= p77))) U ((1 <= p176) AND (1 <= p177) AND (1 <= p179) AND (1 <= p48) AND ((p181 <= 0) OR (p182 <= 0) OR (p184 <= 0))))) OR A (G (((((1 <= p197)) OR ((1 <= p198) AND (1 <= p105))) OR A (X ((1 <= p72)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((1 <= p102) AND (1 <= p40)) OR ((1 <= p117) AND (1 <= p77))) U ((1 <= p176) AND (1 <= p177) AND (1 <= p179) AND (1 <= p48) AND ((p181 <= 0) OR (p182 <= 0) OR (p184 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((((1 <= p102) AND (1 <= p40)) OR ((1 <= p117) AND (1 <= p77))) U ((1 <= p176) AND (1 <= p177) AND (1 <= p179) AND (1 <= p48) AND ((p181 <= 0) OR (p182 <= 0) OR (p184 <= 0)))))
lola: processed formula length: 182
lola: 22 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p102) AND (1 <= p40)) OR ((1 <= p117) AND (1 <= p77)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((1 <= p197)) OR ((1 <= p198) AND (1 <= p105))) OR A (X ((1 <= p72))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((((1 <= p197)) OR ((1 <= p198) AND (1 <= p105))) OR AX((1 <= p72))))
lola: processed formula length: 73
lola: 19 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2465107 markings, 3722266 edges, 493021 markings/sec, 0 secs
lola: 4970018 markings, 7504656 edges, 500982 markings/sec, 5 secs
lola: 7494661 markings, 11316884 edges, 504929 markings/sec, 10 secs
lola: 9940003 markings, 15009355 edges, 489068 markings/sec, 15 secs
lola: 12348059 markings, 18645504 edges, 481611 markings/sec, 20 secs
lola: 14810912 markings, 22364453 edges, 492571 markings/sec, 25 secs
lola: 17283935 markings, 26098678 edges, 494605 markings/sec, 30 secs
lola: 19738233 markings, 29804664 edges, 490860 markings/sec, 35 secs
lola: 22204033 markings, 33528012 edges, 493160 markings/sec, 40 secs
lola: 24610740 markings, 37162180 edges, 481341 markings/sec, 45 secs
lola: 27008595 markings, 40782955 edges, 479571 markings/sec, 50 secs
lola: 29475817 markings, 44508433 edges, 493444 markings/sec, 55 secs
lola: 31958910 markings, 48258415 edges, 496619 markings/sec, 60 secs
lola: 34480215 markings, 52065066 edges, 504261 markings/sec, 65 secs
lola: 36979831 markings, 55839477 edges, 499923 markings/sec, 70 secs
lola: 39377473 markings, 59459920 edges, 479528 markings/sec, 75 secs
lola: 41842884 markings, 63182693 edges, 493082 markings/sec, 80 secs
lola: 44319696 markings, 66922697 edges, 495362 markings/sec, 85 secs
lola: 46779227 markings, 70636559 edges, 491906 markings/sec, 90 secs
lola: 49125124 markings, 74179249 edges, 469179 markings/sec, 95 secs
lola: 51098417 markings, 77160221 edges, 394659 markings/sec, 100 secs
lola: 51815873 markings, 78241912 edges, 143491 markings/sec, 105 secs
lola: 51815873 markings, 78241912 edges, 0 markings/sec, 110 secs
lola: 52414682 markings, 79146107 edges, 119762 markings/sec, 115 secs
lola: 53962018 markings, 81482585 edges, 309467 markings/sec, 120 secs
lola: 55281533 markings, 83475075 edges, 263903 markings/sec, 125 secs
lola: 55396126 markings, 83648117 edges, 22919 markings/sec, 130 secs
lola: 55396126 markings, 83648117 edges, 0 markings/sec, 135 secs
lola: 55396126 markings, 83648117 edges, 0 markings/sec, 140 secs
lola: 55401853 markings, 83656752 edges, 1145 markings/sec, 145 secs
lola: 57171640 markings, 86329105 edges, 353957 markings/sec, 150 secs
lola: 57190314 markings, 86357312 edges, 3735 markings/sec, 155 secs
lola: 57195309 markings, 86364854 edges, 999 markings/sec, 160 secs
lola: 57704807 markings, 87134184 edges, 101900 markings/sec, 165 secs
lola: 57710430 markings, 87142675 edges, 1125 markings/sec, 170 secs
lola: 58681297 markings, 88608692 edges, 194173 markings/sec, 175 secs
lola: 58681297 markings, 88608692 edges, 0 markings/sec, 180 secs
lola: 59609671 markings, 90010537 edges, 185675 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 4 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((p160 <= 0) OR (p83 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG(((p160 <= 0) OR (p83 <= 0))))
lola: processed formula length: 36
lola: 19 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 135304 markings, 204257 edges, 27061 markings/sec, 0 secs
lola: 1296989 markings, 1958405 edges, 232337 markings/sec, 5 secs
lola: 3849876 markings, 5813264 edges, 510577 markings/sec, 10 secs
lola: 6405799 markings, 9672701 edges, 511185 markings/sec, 15 secs
lola: 8947116 markings, 13510100 edges, 508263 markings/sec, 20 secs
lola: 11426931 markings, 17254620 edges, 495963 markings/sec, 25 secs
lola: 13870268 markings, 20944070 edges, 488667 markings/sec, 30 secs
lola: 16386130 markings, 24743012 edges, 503172 markings/sec, 35 secs
lola: 18867818 markings, 28490356 edges, 496338 markings/sec, 40 secs
lola: 21404262 markings, 32320361 edges, 507289 markings/sec, 45 secs
lola: 23878980 markings, 36057211 edges, 494944 markings/sec, 50 secs
lola: 26291166 markings, 39699625 edges, 482437 markings/sec, 55 secs
lola: 28787433 markings, 43468971 edges, 499253 markings/sec, 60 secs
lola: 31331443 markings, 47310453 edges, 508802 markings/sec, 65 secs
lola: 33931411 markings, 51236380 edges, 519994 markings/sec, 70 secs
lola: 36466797 markings, 55064795 edges, 507077 markings/sec, 75 secs
lola: 38879841 markings, 58708521 edges, 482609 markings/sec, 80 secs
lola: 41358734 markings, 62451643 edges, 495779 markings/sec, 85 secs
lola: 43870351 markings, 66244153 edges, 502323 markings/sec, 90 secs
lola: 46404666 markings, 70070978 edges, 506863 markings/sec, 95 secs
lola: 47923579 markings, 72364796 edges, 303783 markings/sec, 100 secs
lola: 50134734 markings, 75703919 edges, 442231 markings/sec, 105 secs
lola: 51564546 markings, 77862558 edges, 285962 markings/sec, 110 secs
lola: 53723973 markings, 81124022 edges, 431885 markings/sec, 115 secs
lola: 55631372 markings, 84003313 edges, 381480 markings/sec, 120 secs
lola: 56618650 markings, 85494116 edges, 197456 markings/sec, 125 secs
lola: 56720809 markings, 85648360 edges, 20432 markings/sec, 130 secs
lola: 56726724 markings, 85657300 edges, 1183 markings/sec, 135 secs
lola: 58542470 markings, 88399071 edges, 363149 markings/sec, 140 secs
lola: 58632961 markings, 88535734 edges, 18098 markings/sec, 145 secs
lola: 58632961 markings, 88535734 edges, 0 markings/sec, 150 secs
lola: 58632961 markings, 88535734 edges, 0 markings/sec, 155 secs
lola: 58632961 markings, 88535734 edges, 0 markings/sec, 160 secs
lola: 58922015 markings, 88972196 edges, 57811 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (A (F ((p82 <= 0))))) OR (1 <= p155))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p155)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p155)
lola: processed formula length: 11
lola: 17 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 6 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((p82 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF((p82 <= 0)))
lola: processed formula length: 18
lola: 19 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 1 significant temporal operators and needs 5 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: 2600 markings, 2650 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p181) AND (1 <= p182) AND (1 <= p184)) OR ((1 <= p56) AND (1 <= p57) AND (1 <= p59))))) OR E (F ((A (X ((1 <= p7))) AND E (X ((1 <= p170)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p181) AND (1 <= p182) AND (1 <= p184)) OR ((1 <= p56) AND (1 <= p57) AND (1 <= p59)))))
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 <= p181) AND (1 <= p182) AND (1 <= p184)) OR ((1 <= p56) AND (1 <= p57) AND (1 <= p59)))))
lola: processed formula length: 102
lola: 18 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 <= p181) AND (1 <= p182) AND (1 <= p184)) OR ((1 <= p56) AND (1 <= p57) AND (1 <= p59)))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (A (G ((1 <= p93)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(AG((1 <= p93))))
lola: processed formula length: 22
lola: 20 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: 1781599 markings, 4471750 edges, 356320 markings/sec, 0 secs
lola: 3488433 markings, 8755908 edges, 341367 markings/sec, 5 secs
lola: 5222357 markings, 13108052 edges, 346785 markings/sec, 10 secs
lola: 7029106 markings, 17642983 edges, 361350 markings/sec, 15 secs
lola: 8721428 markings, 21890724 edges, 338464 markings/sec, 20 secs
lola: 10450466 markings, 26230609 edges, 345808 markings/sec, 25 secs
lola: 12143015 markings, 30478924 edges, 338510 markings/sec, 30 secs
lola: 13792611 markings, 34619412 edges, 329919 markings/sec, 35 secs
lola: 15475819 markings, 38844264 edges, 336642 markings/sec, 40 secs
lola: 17213290 markings, 43205321 edges, 347494 markings/sec, 45 secs
lola: 18983152 markings, 47647638 edges, 353972 markings/sec, 50 secs
lola: 20732004 markings, 52037275 edges, 349770 markings/sec, 55 secs
lola: 22363768 markings, 56133001 edges, 326353 markings/sec, 60 secs
lola: 23970892 markings, 60166894 edges, 321425 markings/sec, 65 secs
lola: 25567070 markings, 64173287 edges, 319236 markings/sec, 70 secs
lola: 27169005 markings, 68194159 edges, 320387 markings/sec, 75 secs
lola: 28827340 markings, 72356573 edges, 331667 markings/sec, 80 secs
lola: 30497576 markings, 76548873 edges, 334047 markings/sec, 85 secs
lola: 32167495 markings, 80740340 edges, 333984 markings/sec, 90 secs
lola: 33843761 markings, 84947764 edges, 335253 markings/sec, 95 secs
lola: 35516369 markings, 89146017 edges, 334522 markings/sec, 100 secs
lola: 37099836 markings, 93120548 edges, 316693 markings/sec, 105 secs
lola: 38696192 markings, 97127386 edges, 319271 markings/sec, 110 secs
lola: 40295117 markings, 101140719 edges, 319785 markings/sec, 115 secs
lola: 41956801 markings, 105311519 edges, 332337 markings/sec, 120 secs
lola: 43615393 markings, 109474577 edges, 331718 markings/sec, 125 secs
lola: 45266414 markings, 113618624 edges, 330204 markings/sec, 130 secs
lola: 46931377 markings, 117797689 edges, 332993 markings/sec, 135 secs
lola: 48261410 markings, 121136866 edges, 266007 markings/sec, 140 secs
lola: 49182764 markings, 123452883 edges, 184271 markings/sec, 145 secs
lola: 50667522 markings, 127175673 edges, 296952 markings/sec, 150 secs
lola: 51994626 markings, 130507309 edges, 265421 markings/sec, 155 secs
lola: 53459613 markings, 134183575 edges, 292997 markings/sec, 160 secs
lola: 54042127 markings, 135645691 edges, 116503 markings/sec, 165 secs
lola: 54997072 markings, 138042613 edges, 190989 markings/sec, 170 secs
lola: 55604466 markings, 139567167 edges, 121479 markings/sec, 175 secs
lola: 57109675 markings, 143345224 edges, 301042 markings/sec, 180 secs
lola: 58402492 markings, 146590200 edges, 258563 markings/sec, 185 secs
lola: 59257405 markings, 148736029 edges, 170983 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p132)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((1 <= p132)))
lola: processed formula length: 19
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p132 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 51 markings, 50 edges
lola: subprocess 9 will run for 397 seconds at most (--localtimelimit=0)
lola: ========================================
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p100)))
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 <= p100)))
lola: processed formula length: 19
lola: 18 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 <= p100)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33 markings, 32 edges
lola: ========================================
lola: subprocess 10 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p88) AND (1 <= p70) AND ((1 <= p40) OR (1 <= p215)))))
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 <= p88) AND (1 <= p70) AND ((1 <= p40) OR (1 <= p215)))))
lola: processed formula length: 68
lola: 18 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 <= p88) AND (1 <= p70) AND ((1 <= p40) OR (1 <= p215)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40 markings, 39 edges
lola: state equation: write sara problem file to CTLFireability-10-0.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-10-0.sara.
lola: subprocess 11 will run for 556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p225) AND A (G (((1 <= p153) OR (1 <= p45)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(((1 <= p225) AND AG(((1 <= p153) OR (1 <= p45)))))
lola: processed formula length: 54
lola: 19 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).
sara: place or transition ordering is non-deterministic

lola: 2444200 markings, 3690701 edges, 488840 markings/sec, 0 secs
lola: 4929787 markings, 7443907 edges, 497117 markings/sec, 5 secs
lola: 7433954 markings, 11225238 edges, 500833 markings/sec, 10 secs
lola: 9853602 markings, 14878903 edges, 483930 markings/sec, 15 secs
lola: 12232860 markings, 18471584 edges, 475852 markings/sec, 20 secs
lola: 14645250 markings, 22114288 edges, 482478 markings/sec, 25 secs
lola: 17089723 markings, 25805418 edges, 488895 markings/sec, 30 secs
lola: 19535366 markings, 29498330 edges, 489129 markings/sec, 35 secs
lola: 21982413 markings, 33193394 edges, 489409 markings/sec, 40 secs
lola: 24370860 markings, 36799972 edges, 477689 markings/sec, 45 secs
lola: 26729240 markings, 40361103 edges, 471676 markings/sec, 50 secs
lola: 29165747 markings, 44040229 edges, 487301 markings/sec, 55 secs
lola: 31594270 markings, 47707286 edges, 485705 markings/sec, 60 secs
lola: 34054273 markings, 51421865 edges, 492001 markings/sec, 65 secs
lola: 36494721 markings, 55106943 edges, 488090 markings/sec, 70 secs
lola: 38896796 markings, 58734110 edges, 480415 markings/sec, 75 secs
lola: 41268865 markings, 62315927 edges, 474414 markings/sec, 80 secs
lola: 43769250 markings, 66091531 edges, 500077 markings/sec, 85 secs
lola: 46249757 markings, 69837076 edges, 496101 markings/sec, 90 secs
lola: 48608341 markings, 73398665 edges, 471717 markings/sec, 95 secs
lola: 49076407 markings, 74105416 edges, 93613 markings/sec, 100 secs
lola: 51252857 markings, 77392422 edges, 435290 markings/sec, 105 secs
lola: 51355015 markings, 77546002 edges, 20432 markings/sec, 110 secs
lola: 51355015 markings, 77546002 edges, 0 markings/sec, 115 secs
lola: 51355015 markings, 77546002 edges, 0 markings/sec, 120 secs
lola: 51355015 markings, 77546002 edges, 0 markings/sec, 125 secs
lola: 51363524 markings, 77558871 edges, 1702 markings/sec, 130 secs
lola: 53225306 markings, 80375777 edges, 372356 markings/sec, 135 secs
lola: 55434773 markings, 83707049 edges, 441893 markings/sec, 140 secs
lola: 56172021 markings, 84819715 edges, 147450 markings/sec, 145 secs
lola: 56268289 markings, 84965074 edges, 19254 markings/sec, 150 secs
lola: 56268289 markings, 84965074 edges, 0 markings/sec, 155 secs
lola: 56268289 markings, 84965074 edges, 0 markings/sec, 160 secs
lola: 58241978 markings, 87945745 edges, 394738 markings/sec, 165 secs
lola: 58323207 markings, 88067989 edges, 16246 markings/sec, 170 secs
lola: 58323207 markings, 88067989 edges, 0 markings/sec, 175 secs
lola: 58323207 markings, 88067989 edges, 0 markings/sec, 180 secs
lola: 58323207 markings, 88067989 edges, 0 markings/sec, 185 secs
lola: 58886609 markings, 88918737 edges, 112680 markings/sec, 190 secs
lola: 59528284 markings, 89887626 edges, 128335 markings/sec, 195 secs
lola: 59528284 markings, 89887626 edges, 0 markings/sec, 200 secs
lola: 59528284 markings, 89887626 edges, 0 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 630 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E ((((1 <= p247) OR (1 <= p188)) U ((1 <= p11) AND (1 <= p12) AND (1 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(E(((1 <= p247) OR (1 <= p188)) U ((1 <= p11) AND (1 <= p12) AND (1 <= p14))))
lola: processed formula length: 81
lola: 19 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: 2471046 markings, 3730722 edges, 494209 markings/sec, 0 secs
lola: 4971847 markings, 7506442 edges, 500160 markings/sec, 5 secs
lola: 7496769 markings, 11318596 edges, 504984 markings/sec, 10 secs
lola: 9937329 markings, 15003361 edges, 488112 markings/sec, 15 secs
lola: 12334944 markings, 18623284 edges, 479523 markings/sec, 20 secs
lola: 14793352 markings, 22335022 edges, 491682 markings/sec, 25 secs
lola: 17265811 markings, 26067934 edges, 494492 markings/sec, 30 secs
lola: 19650420 markings, 29668190 edges, 476922 markings/sec, 35 secs
lola: 22109459 markings, 33380882 edges, 491808 markings/sec, 40 secs
lola: 24504856 markings, 36997486 edges, 479079 markings/sec, 45 secs
lola: 26898527 markings, 40611458 edges, 478734 markings/sec, 50 secs
lola: 29355239 markings, 44320600 edges, 491342 markings/sec, 55 secs
lola: 31726216 markings, 47900302 edges, 474195 markings/sec, 60 secs
lola: 34205466 markings, 51643473 edges, 495850 markings/sec, 65 secs
lola: 36642078 markings, 55322313 edges, 487322 markings/sec, 70 secs
lola: 39039639 markings, 58942162 edges, 479512 markings/sec, 75 secs
lola: 41493644 markings, 62647224 edges, 490801 markings/sec, 80 secs
lola: 43954302 markings, 66362333 edges, 492132 markings/sec, 85 secs
lola: 46429355 markings, 70099148 edges, 495011 markings/sec, 90 secs
lola: 48788252 markings, 73660721 edges, 471779 markings/sec, 95 secs
lola: 50997134 markings, 76995999 edges, 441776 markings/sec, 100 secs
lola: 51086064 markings, 77129889 edges, 17786 markings/sec, 105 secs
lola: 51086064 markings, 77129889 edges, 0 markings/sec, 110 secs
lola: 51629758 markings, 77950742 edges, 108739 markings/sec, 115 secs
lola: 53805800 markings, 81236191 edges, 435208 markings/sec, 120 secs
lola: 55954140 markings, 84479759 edges, 429668 markings/sec, 125 secs
lola: 57884644 markings, 87394394 edges, 386101 markings/sec, 130 secs
lola: 59643499 markings, 90049939 edges, 351771 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((p10 <= 0) AND ((1 <= p237) OR (1 <= p32))) U A (G (((1 <= p16) AND (1 <= p17) AND (1 <= p19)))))) OR ((1 <= p141) AND (1 <= p142) AND (1 <= p144)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: (E(((p10 <= 0) AND ((1 <= p237) OR (1 <= p32))) U AG(((1 <= p16) AND (1 <= p17) AND (1 <= p19)))) OR ((1 <= p141) AND (1 <= p142) AND (1 <= p144)))
lola: processed formula length: 148
lola: 19 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: 1740568 markings, 4368755 edges, 348114 markings/sec, 0 secs
lola: 3457410 markings, 8678056 edges, 343368 markings/sec, 5 secs
lola: 5223068 markings, 13109837 edges, 353132 markings/sec, 10 secs
lola: 6969527 markings, 17493444 edges, 349292 markings/sec, 15 secs
lola: 8620299 markings, 21636885 edges, 330154 markings/sec, 20 secs
lola: 10239363 markings, 25700743 edges, 323813 markings/sec, 25 secs
lola: 11846950 markings, 29735775 edges, 321517 markings/sec, 30 secs
lola: 13441338 markings, 33737722 edges, 318878 markings/sec, 35 secs
lola: 15110890 markings, 37928313 edges, 333910 markings/sec, 40 secs
lola: 16766452 markings, 42083765 edges, 331112 markings/sec, 45 secs
lola: 18418169 markings, 46229526 edges, 330343 markings/sec, 50 secs
lola: 20087059 markings, 50418453 edges, 333778 markings/sec, 55 secs
lola: 21743597 markings, 54576370 edges, 331308 markings/sec, 60 secs
lola: 23360274 markings, 58634235 edges, 323335 markings/sec, 65 secs
lola: 24956045 markings, 62639633 edges, 319154 markings/sec, 70 secs
lola: 26535909 markings, 66605119 edges, 315973 markings/sec, 75 secs
lola: 28179525 markings, 70730579 edges, 328723 markings/sec, 80 secs
lola: 29816793 markings, 74840079 edges, 327454 markings/sec, 85 secs
lola: 31467266 markings, 78982773 edges, 330095 markings/sec, 90 secs
lola: 33112908 markings, 83113323 edges, 329128 markings/sec, 95 secs
lola: 34785565 markings, 87311730 edges, 334531 markings/sec, 100 secs
lola: 36424454 markings, 91425319 edges, 327778 markings/sec, 105 secs
lola: 38038110 markings, 95475593 edges, 322731 markings/sec, 110 secs
lola: 39629008 markings, 99468766 edges, 318180 markings/sec, 115 secs
lola: 41243173 markings, 103520310 edges, 322833 markings/sec, 120 secs
lola: 42896392 markings, 107669900 edges, 330644 markings/sec, 125 secs
lola: 44541889 markings, 111800084 edges, 329099 markings/sec, 130 secs
lola: 46235235 markings, 116050379 edges, 338669 markings/sec, 135 secs
lola: 47906431 markings, 120245288 edges, 334239 markings/sec, 140 secs
lola: 49112695 markings, 123273830 edges, 241253 markings/sec, 145 secs
lola: 50614832 markings, 127046326 edges, 300427 markings/sec, 150 secs
lola: 51285025 markings, 128725349 edges, 134039 markings/sec, 155 secs
lola: 51670657 markings, 129693310 edges, 77126 markings/sec, 160 secs
lola: 51670657 markings, 129693310 edges, 0 markings/sec, 165 secs
lola: 52617117 markings, 132068921 edges, 189292 markings/sec, 170 secs
lola: 52620069 markings, 132076326 edges, 590 markings/sec, 175 secs
lola: 53333348 markings, 133866667 edges, 142656 markings/sec, 180 secs
lola: 54242144 markings, 136147728 edges, 181759 markings/sec, 185 secs
lola: 54753877 markings, 137432165 edges, 102347 markings/sec, 190 secs
lola: 55732584 markings, 139888747 edges, 195741 markings/sec, 195 secs
lola: 56437480 markings, 141658017 edges, 140979 markings/sec, 200 secs
lola: 57343079 markings, 143931086 edges, 181120 markings/sec, 205 secs
lola: 58890254 markings, 147814475 edges, 309435 markings/sec, 210 secs
lola: 58968558 markings, 148011024 edges, 15661 markings/sec, 215 secs
lola: 59166616 markings, 148508163 edges, 39612 markings/sec, 220 secs
lola: 59566963 markings, 149513005 edges, 80069 markings/sec, 225 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1044 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p110 <= 0))) OR ((1 <= p0) AND (1 <= p251) AND (1 <= p252)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1044 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p0) AND (1 <= p251) AND (1 <= p252))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p0) AND (1 <= p251) AND (1 <= p252))
lola: processed formula length: 43
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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 15 will run for 2088 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p110 <= 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 ((p110 <= 0)))
lola: processed formula length: 19
lola: 19 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 <= p110)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31 markings, 30 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2088 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p236) AND (1 <= p237) AND (1 <= p239)) OR ((E (F (((1 <= p90) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p9))))) OR E (F ((p162 <= 0)))) AND (E (F (((1 <= p156) AND (1 <= p157) AND (1 <= p159) AND (1 <= p128)))) OR A ((((1 <= p206) AND (1 <= p207) AND (1 <= p209)) U (1 <= p190))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2088 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p162 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p162 <= 0)))
lola: processed formula length: 19
lola: 18 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: (p162 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 51 markings, 50 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: ((1 <= p236) AND (1 <= p237) AND (1 <= p239))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p236) AND (1 <= p237) AND (1 <= p239))
lola: processed formula length: 45
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p156) AND (1 <= p157) AND (1 <= p159) AND (1 <= p128))))
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 <= p156) AND (1 <= p157) AND (1 <= p159) AND (1 <= p128))))
lola: processed formula length: 69
lola: 18 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 <= p156) AND (1 <= p157) AND (1 <= p159) AND (1 <= p128))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: state equation: write sara problem file to CTLFireability-18-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
sara: lola: try reading problem file CTLFireability-18-0.sara.
========================================
lola: ...considering subproblem: (E ((((1 <= p37) OR (1 <= p233) OR (1 <= p88)) U A (X (((1 <= p81) AND (1 <= p82) AND (1 <= p84)))))) OR (((1 <= p31) AND (1 <= p32) AND (1 <= p34)) AND (A (G ((p15 <= 0))) OR ((1 <= p106) AND (1 <= p107) AND (1 <= p109)))))
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
sara: place or transition ordering is non-deterministic

lola: processed formula: (E(((1 <= p37) OR (1 <= p233) OR (1 <= p88)) U AX(((1 <= p81) AND (1 <= p82) AND (1 <= p84)))) OR (((1 <= p31) AND (1 <= p32) AND (1 <= p34)) AND (AG((p15 <= 0)) OR ((1 <= p106) AND (1 <= p107) AND (1 <= p109)))))
lola: processed formula length: 215
lola: 20 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: 2083240 markings, 3145647 edges, 416648 markings/sec, 0 secs
lola: 4193090 markings, 6331521 edges, 421970 markings/sec, 5 secs
lola: 6301221 markings, 9514773 edges, 421626 markings/sec, 10 secs
lola: 8395823 markings, 12677650 edges, 418920 markings/sec, 15 secs
lola: 10433863 markings, 15755076 edges, 407608 markings/sec, 20 secs
lola: 12450917 markings, 18800840 edges, 403411 markings/sec, 25 secs
lola: 14499162 markings, 21893682 edges, 409649 markings/sec, 30 secs
lola: 16559185 markings, 25004319 edges, 412005 markings/sec, 35 secs
lola: 18626200 markings, 28125499 edges, 413403 markings/sec, 40 secs
lola: 20710890 markings, 31273393 edges, 416938 markings/sec, 45 secs
lola: 22764443 markings, 34374264 edges, 410711 markings/sec, 50 secs
lola: 24776580 markings, 37412581 edges, 402427 markings/sec, 55 secs
lola: 26769937 markings, 40422573 edges, 398671 markings/sec, 60 secs
lola: 28753263 markings, 43417591 edges, 396665 markings/sec, 65 secs
lola: 30555770 markings, 46140102 edges, 360501 markings/sec, 70 secs
lola: 32345901 markings, 48842344 edges, 358026 markings/sec, 75 secs
lola: 32401088 markings, 48925578 edges, 11037 markings/sec, 80 secs
lola: 32401088 markings, 48925578 edges, 0 markings/sec, 85 secs
lola: 33309612 markings, 50297504 edges, 181705 markings/sec, 90 secs
lola: 33890030 markings, 51173883 edges, 116084 markings/sec, 95 secs
lola: 35345724 markings, 53371973 edges, 291139 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (((((1 <= p102) AND (1 <= p40)) OR ((1 <= p117) AND (1 <= p77))) U ((1 <= p176) AND (1 <= p177) AND (1 <= p179) AND (1 <= p48) AND ((p181 <= 0) OR (p182 <= 0) OR (p184 <= 0))))) OR A (G (((((1 <= p197)) OR ((1 <= p198) AND (1 <= p105))) OR A (X ((1 <= p72)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (((((1 <= p102) AND (1 <= p40)) OR ((1 <= p117) AND (1 <= p77))) U ((1 <= p176) AND (1 <= p177) AND (1 <= p179) AND (1 <= p48) AND ((p181 <= 0) OR (p182 <= 0) OR (p184 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((((1 <= p102) AND (1 <= p40)) OR ((1 <= p117) AND (1 <= p77))) U ((1 <= p176) AND (1 <= p177) AND (1 <= p179) AND (1 <= p48) AND ((p181 <= 0) OR (p182 <= 0) OR (p184 <= 0)))))
lola: processed formula length: 182
lola: 22 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p102) AND (1 <= p40)) OR ((1 <= p117) AND (1 <= p77)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 7 markings, 7 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((((1 <= p197)) OR ((1 <= p198) AND (1 <= p105))) OR A (X ((1 <= p72))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((((1 <= p197)) OR ((1 <= p198) AND (1 <= p105))) OR AX((1 <= p72))))
lola: processed formula length: 73
lola: 19 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2503573 markings, 3780340 edges, 500715 markings/sec, 0 secs
lola: 5011355 markings, 7567099 edges, 501556 markings/sec, 5 secs
lola: 7525997 markings, 11364185 edges, 502928 markings/sec, 10 secs
lola: 9964600 markings, 15046477 edges, 487721 markings/sec, 15 secs
lola: 12355320 markings, 18656479 edges, 478144 markings/sec, 20 secs
lola: 14810658 markings, 22364047 edges, 491068 markings/sec, 25 secs
lola: 17275994 markings, 26086703 edges, 493067 markings/sec, 30 secs
lola: 19733335 markings, 29797267 edges, 491468 markings/sec, 35 secs
lola: 22182707 markings, 33496368 edges, 489874 markings/sec, 40 secs
lola: 24591803 markings, 37133570 edges, 481819 markings/sec, 45 secs
lola: 26958710 markings, 40707606 edges, 473381 markings/sec, 50 secs
lola: 29414313 markings, 44415553 edges, 491121 markings/sec, 55 secs
lola: 31847685 markings, 48089961 edges, 486674 markings/sec, 60 secs
lola: 34312881 markings, 51812389 edges, 493039 markings/sec, 65 secs
lola: 36749670 markings, 55491927 edges, 487358 markings/sec, 70 secs
lola: 39149212 markings, 59115257 edges, 479908 markings/sec, 75 secs
lola: 41573308 markings, 62775638 edges, 484819 markings/sec, 80 secs
lola: 44022882 markings, 66474507 edges, 489915 markings/sec, 85 secs
lola: 46484625 markings, 70191721 edges, 492349 markings/sec, 90 secs
lola: 48826823 markings, 73728739 edges, 468440 markings/sec, 95 secs
lola: 51007024 markings, 77021067 edges, 436040 markings/sec, 100 secs
lola: 53134377 markings, 80233860 edges, 425471 markings/sec, 105 secs
lola: 53820871 markings, 81269470 edges, 137299 markings/sec, 110 secs
lola: 53820871 markings, 81269470 edges, 0 markings/sec, 115 secs
lola: 53820871 markings, 81269470 edges, 0 markings/sec, 120 secs
lola: 53820871 markings, 81269470 edges, 0 markings/sec, 125 secs
lola: 54900975 markings, 82900443 edges, 216021 markings/sec, 130 secs
lola: 57041862 markings, 86133173 edges, 428177 markings/sec, 135 secs
lola: 57695788 markings, 87120591 edges, 130785 markings/sec, 140 secs
lola: 59582714 markings, 89969828 edges, 377385 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((p160 <= 0) OR (p83 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG(((p160 <= 0) OR (p83 <= 0))))
lola: processed formula length: 36
lola: 19 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2477572 markings, 3741090 edges, 495514 markings/sec, 0 secs
lola: 4991368 markings, 7536912 edges, 502759 markings/sec, 5 secs
lola: 7524945 markings, 11362600 edges, 506715 markings/sec, 10 secs
lola: 9970040 markings, 15054676 edges, 489019 markings/sec, 15 secs
lola: 12376553 markings, 18688550 edges, 481303 markings/sec, 20 secs
lola: 14805287 markings, 22355957 edges, 485747 markings/sec, 25 secs
lola: 17272849 markings, 26081943 edges, 493512 markings/sec, 30 secs
lola: 19740281 markings, 29807756 edges, 493486 markings/sec, 35 secs
lola: 22208657 markings, 33535020 edges, 493675 markings/sec, 40 secs
lola: 24611469 markings, 37163283 edges, 480562 markings/sec, 45 secs
lola: 26983372 markings, 40744862 edges, 474381 markings/sec, 50 secs
lola: 29458148 markings, 44481762 edges, 494955 markings/sec, 55 secs
lola: 31921266 markings, 48201035 edges, 492624 markings/sec, 60 secs
lola: 34409563 markings, 51958365 edges, 497659 markings/sec, 65 secs
lola: 36855027 markings, 55651047 edges, 489093 markings/sec, 70 secs
lola: 39258368 markings, 59280132 edges, 480668 markings/sec, 75 secs
lola: 41688997 markings, 62950353 edges, 486126 markings/sec, 80 secs
lola: 44148320 markings, 66663899 edges, 491865 markings/sec, 85 secs
lola: 46604009 markings, 70372000 edges, 491138 markings/sec, 90 secs
lola: 48962328 markings, 73933387 edges, 471664 markings/sec, 95 secs
lola: 51052546 markings, 77089747 edges, 418044 markings/sec, 100 secs
lola: 53134943 markings, 80242513 edges, 416479 markings/sec, 105 secs
lola: 55341854 markings, 83566139 edges, 441382 markings/sec, 110 secs
lola: 55398967 markings, 83652392 edges, 11423 markings/sec, 115 secs
lola: 56888144 markings, 85901046 edges, 297835 markings/sec, 120 secs
lola: 58388432 markings, 88166476 edges, 300058 markings/sec, 125 secs
lola: 59524994 markings, 89882663 edges, 227312 markings/sec, 130 secs
lola: 59675905 markings, 90110566 edges, 30182 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (E (F (A (G ((1 <= p93)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(AG((1 <= p93))))
lola: processed formula length: 22
lola: 20 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: 1678124 markings, 4212036 edges, 335625 markings/sec, 0 secs
lola: 3371585 markings, 8462632 edges, 338692 markings/sec, 5 secs
lola: 5059602 markings, 12699556 edges, 337603 markings/sec, 10 secs
lola: 6766620 markings, 16984132 edges, 341404 markings/sec, 15 secs
lola: 8435087 markings, 21172008 edges, 333693 markings/sec, 20 secs
lola: 10062110 markings, 25255856 edges, 325405 markings/sec, 25 secs
lola: 11667861 markings, 29286308 edges, 321150 markings/sec, 30 secs
lola: 13261377 markings, 33286013 edges, 318703 markings/sec, 35 secs
lola: 14932783 markings, 37481235 edges, 334281 markings/sec, 40 secs
lola: 16587569 markings, 41634732 edges, 330957 markings/sec, 45 secs
lola: 18236862 markings, 45774464 edges, 329859 markings/sec, 50 secs
lola: 19899006 markings, 49946450 edges, 332429 markings/sec, 55 secs
lola: 21559892 markings, 54115244 edges, 332177 markings/sec, 60 secs
lola: 23179906 markings, 58181525 edges, 324003 markings/sec, 65 secs
lola: 24785442 markings, 62211383 edges, 321107 markings/sec, 70 secs
lola: 26372245 markings, 66194268 edges, 317361 markings/sec, 75 secs
lola: 28007953 markings, 70299919 edges, 327142 markings/sec, 80 secs
lola: 29651027 markings, 74424046 edges, 328615 markings/sec, 85 secs
lola: 31296963 markings, 78555338 edges, 329187 markings/sec, 90 secs
lola: 32927807 markings, 82648738 edges, 326169 markings/sec, 95 secs
lola: 34596404 markings, 86836883 edges, 333719 markings/sec, 100 secs
lola: 36236701 markings, 90954064 edges, 328059 markings/sec, 105 secs
lola: 37847798 markings, 94997913 edges, 322219 markings/sec, 110 secs
lola: 39450130 markings, 99019782 edges, 320466 markings/sec, 115 secs
lola: 41067598 markings, 103079608 edges, 323494 markings/sec, 120 secs
lola: 42722030 markings, 107232240 edges, 330886 markings/sec, 125 secs
lola: 44367626 markings, 111362694 edges, 329119 markings/sec, 130 secs
lola: 46018602 markings, 115506614 edges, 330195 markings/sec, 135 secs
lola: 47687077 markings, 119694499 edges, 333695 markings/sec, 140 secs
lola: 49199615 markings, 123491190 edges, 302508 markings/sec, 145 secs
lola: 50704386 markings, 127268172 edges, 300954 markings/sec, 150 secs
lola: 52200610 markings, 131023536 edges, 299245 markings/sec, 155 secs
lola: 53164883 markings, 133443805 edges, 192855 markings/sec, 160 secs
lola: 53651039 markings, 134664044 edges, 97231 markings/sec, 165 secs
lola: 54607710 markings, 137065300 edges, 191334 markings/sec, 170 secs
lola: 56133174 markings, 140894205 edges, 305093 markings/sec, 175 secs
lola: 57339668 markings, 143922503 edges, 241299 markings/sec, 180 secs
lola: 58860164 markings, 147738954 edges, 304099 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p225) AND A (G (((1 <= p153) OR (1 <= p45)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(((1 <= p225) AND AG(((1 <= p153) OR (1 <= p45)))))
lola: processed formula length: 54
lola: 19 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: 2465429 markings, 3722763 edges, 493086 markings/sec, 0 secs
lola: 4962104 markings, 7492732 edges, 499335 markings/sec, 5 secs
lola: 7467500 markings, 11275856 edges, 501079 markings/sec, 10 secs
lola: 9898949 markings, 14947351 edges, 486290 markings/sec, 15 secs
lola: 12281627 markings, 18545227 edges, 476536 markings/sec, 20 secs
lola: 14708882 markings, 22210346 edges, 485451 markings/sec, 25 secs
lola: 17156103 markings, 25905677 edges, 489444 markings/sec, 30 secs
lola: 19609680 markings, 29610556 edges, 490715 markings/sec, 35 secs
lola: 22061591 markings, 33312967 edges, 490382 markings/sec, 40 secs
lola: 24450502 markings, 36920217 edges, 477782 markings/sec, 45 secs
lola: 26804252 markings, 40474386 edges, 470750 markings/sec, 50 secs
lola: 29248821 markings, 44165669 edges, 488914 markings/sec, 55 secs
lola: 31679129 markings, 47835418 edges, 486062 markings/sec, 60 secs
lola: 34138277 markings, 51548728 edges, 491830 markings/sec, 65 secs
lola: 36569425 markings, 55219784 edges, 486230 markings/sec, 70 secs
lola: 38959489 markings, 58828780 edges, 478013 markings/sec, 75 secs
lola: 41359315 markings, 62452511 edges, 479965 markings/sec, 80 secs
lola: 43800840 markings, 66139247 edges, 488305 markings/sec, 85 secs
lola: 46242827 markings, 69826604 edges, 488397 markings/sec, 90 secs
lola: 48584927 markings, 73363459 edges, 468420 markings/sec, 95 secs
lola: 50723429 markings, 76592586 edges, 427700 markings/sec, 100 secs
lola: 52812752 markings, 79747950 edges, 417865 markings/sec, 105 secs
lola: 53494305 markings, 80777321 edges, 136311 markings/sec, 110 secs
lola: 55717584 markings, 84133982 edges, 444656 markings/sec, 115 secs
lola: 57235264 markings, 86425194 edges, 303536 markings/sec, 120 secs
lola: 59107904 markings, 89252864 edges, 374528 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F (E ((((1 <= p247) OR (1 <= p188)) U ((1 <= p11) AND (1 <= p12) AND (1 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(E(((1 <= p247) OR (1 <= p188)) U ((1 <= p11) AND (1 <= p12) AND (1 <= p14))))
lola: processed formula length: 81
lola: 19 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: 2474365 markings, 3735767 edges, 494873 markings/sec, 0 secs
lola: 4959561 markings, 7487935 edges, 497039 markings/sec, 5 secs
lola: 7468405 markings, 11275776 edges, 501769 markings/sec, 10 secs
lola: 9896662 markings, 14941990 edges, 485651 markings/sec, 15 secs
lola: 12280723 markings, 18541465 edges, 476812 markings/sec, 20 secs
lola: 14717933 markings, 22221146 edges, 487442 markings/sec, 25 secs
lola: 17165128 markings, 25915921 edges, 489439 markings/sec, 30 secs
lola: 19627682 markings, 29633894 edges, 492511 markings/sec, 35 secs
lola: 22075653 markings, 33329867 edges, 489594 markings/sec, 40 secs
lola: 24462713 markings, 36933854 edges, 477412 markings/sec, 45 secs
lola: 26832389 markings, 40511605 edges, 473935 markings/sec, 50 secs
lola: 29276892 markings, 44202308 edges, 488901 markings/sec, 55 secs
lola: 31723287 markings, 47895892 edges, 489279 markings/sec, 60 secs
lola: 34189176 markings, 51618883 edges, 493178 markings/sec, 65 secs
lola: 36611877 markings, 55276730 edges, 484540 markings/sec, 70 secs
lola: 38998201 markings, 58879590 edges, 477265 markings/sec, 75 secs
lola: 41421922 markings, 62538949 edges, 484744 markings/sec, 80 secs
lola: 43873787 markings, 66240740 edges, 490373 markings/sec, 85 secs
lola: 46322994 markings, 69938592 edges, 489841 markings/sec, 90 secs
lola: 48647421 markings, 73448068 edges, 464885 markings/sec, 95 secs
lola: 49926693 markings, 75379699 edges, 255854 markings/sec, 100 secs
lola: 52049443 markings, 78584415 edges, 424550 markings/sec, 105 secs
lola: 52779432 markings, 79686553 edges, 145998 markings/sec, 110 secs
lola: 53641520 markings, 80988154 edges, 172418 markings/sec, 115 secs
lola: 55729896 markings, 84141171 edges, 417675 markings/sec, 120 secs
lola: 55994896 markings, 84541269 edges, 53000 markings/sec, 125 secs
lola: 56459473 markings, 85242700 edges, 92915 markings/sec, 130 secs
lola: 58640377 markings, 88535397 edges, 436181 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E ((((p10 <= 0) AND ((1 <= p237) OR (1 <= p32))) U A (G (((1 <= p16) AND (1 <= p17) AND (1 <= p19)))))) OR ((1 <= p141) AND (1 <= p142) AND (1 <= p144)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: (E(((p10 <= 0) AND ((1 <= p237) OR (1 <= p32))) U AG(((1 <= p16) AND (1 <= p17) AND (1 <= p19)))) OR ((1 <= p141) AND (1 <= p142) AND (1 <= p144)))
lola: processed formula length: 148
lola: 19 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: 1683051 markings, 4224384 edges, 336610 markings/sec, 0 secs
lola: 3376642 markings, 8475322 edges, 338718 markings/sec, 5 secs
lola: 5059196 markings, 12698532 edges, 336511 markings/sec, 10 secs
lola: 6762884 markings, 16974772 edges, 340738 markings/sec, 15 secs
lola: 8421984 markings, 21139119 edges, 331820 markings/sec, 20 secs
lola: 10044877 markings, 25212607 edges, 324579 markings/sec, 25 secs
lola: 11647927 markings, 29236258 edges, 320610 markings/sec, 30 secs
lola: 13239045 markings, 33229971 edges, 318224 markings/sec, 35 secs
lola: 14878234 markings, 37344349 edges, 327838 markings/sec, 40 secs
lola: 16526465 markings, 41481388 edges, 329646 markings/sec, 45 secs
lola: 18172407 markings, 45612672 edges, 329188 markings/sec, 50 secs
lola: 19823877 markings, 49757867 edges, 330294 markings/sec, 55 secs
lola: 21476675 markings, 53906385 edges, 330560 markings/sec, 60 secs
lola: 23098323 markings, 57976748 edges, 324330 markings/sec, 65 secs
lola: 24695493 markings, 61985637 edges, 319434 markings/sec, 70 secs
lola: 26282281 markings, 65968477 edges, 317358 markings/sec, 75 secs
lola: 27908467 markings, 70050212 edges, 325237 markings/sec, 80 secs
lola: 29556216 markings, 74186043 edges, 329550 markings/sec, 85 secs
lola: 31202639 markings, 78318564 edges, 329285 markings/sec, 90 secs
lola: 32850899 markings, 82455702 edges, 329652 markings/sec, 95 secs
lola: 34520687 markings, 86646884 edges, 333958 markings/sec, 100 secs
lola: 36162507 markings, 90767818 edges, 328364 markings/sec, 105 secs
lola: 37776566 markings, 94819116 edges, 322812 markings/sec, 110 secs
lola: 39382388 markings, 98849734 edges, 321164 markings/sec, 115 secs
lola: 40999040 markings, 102907521 edges, 323330 markings/sec, 120 secs
lola: 42655664 markings, 107065673 edges, 331325 markings/sec, 125 secs
lola: 44304170 markings, 111203414 edges, 329701 markings/sec, 130 secs
lola: 45953636 markings, 115343573 edges, 329893 markings/sec, 135 secs
lola: 47617360 markings, 119519493 edges, 332745 markings/sec, 140 secs
lola: 49160409 markings, 123392662 edges, 308610 markings/sec, 145 secs
lola: 50657689 markings, 127150823 edges, 299456 markings/sec, 150 secs
lola: 52128335 markings, 130842069 edges, 294129 markings/sec, 155 secs
lola: 53587101 markings, 134503587 edges, 291753 markings/sec, 160 secs
lola: 55074519 markings, 138236990 edges, 297484 markings/sec, 165 secs
lola: 56583358 markings, 142024179 edges, 301768 markings/sec, 170 secs
lola: 58105199 markings, 145844008 edges, 304368 markings/sec, 175 secs
lola: 59560314 markings, 149496293 edges, 291023 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes yes unknown unknown no unknown yes unknown unknown no yes yes unknown unknown no yes
lola:
preliminary result: yes yes unknown unknown no unknown yes unknown unknown no yes yes unknown unknown no yes
lola: memory consumption: 3360 KB
lola: time consumption: 2598 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="RefineWMG-PT-050050"
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 RefineWMG-PT-050050, 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 r186-oct2-158987938500100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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