Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853600716.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 Peterson-PT-3, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853600716
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 23K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 37K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 248K Apr 27 15:14 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 Peterson-PT-3-CTLFireability-00
FORMULA_NAME Peterson-PT-3-CTLFireability-01
FORMULA_NAME Peterson-PT-3-CTLFireability-02
FORMULA_NAME Peterson-PT-3-CTLFireability-03
FORMULA_NAME Peterson-PT-3-CTLFireability-04
FORMULA_NAME Peterson-PT-3-CTLFireability-05
FORMULA_NAME Peterson-PT-3-CTLFireability-06
FORMULA_NAME Peterson-PT-3-CTLFireability-07
FORMULA_NAME Peterson-PT-3-CTLFireability-08
FORMULA_NAME Peterson-PT-3-CTLFireability-09
FORMULA_NAME Peterson-PT-3-CTLFireability-10
FORMULA_NAME Peterson-PT-3-CTLFireability-11
FORMULA_NAME Peterson-PT-3-CTLFireability-12
FORMULA_NAME Peterson-PT-3-CTLFireability-13
FORMULA_NAME Peterson-PT-3-CTLFireability-14
FORMULA_NAME Peterson-PT-3-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591163864828

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:57:47] [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 05:57:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:57:47] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2020-06-03 05:57:47] [INFO ] Transformed 244 places.
[2020-06-03 05:57:47] [INFO ] Transformed 332 transitions.
[2020-06-03 05:57:47] [INFO ] Parsed PT model containing 244 places and 332 transitions in 138 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 52 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 589 ms. (steps per millisecond=169 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0]
[2020-06-03 05:57:48] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2020-06-03 05:57:48] [INFO ] Computed 15 place invariants in 16 ms
[2020-06-03 05:57:48] [INFO ] [Real]Absence check using 11 positive place invariants in 43 ms returned sat
[2020-06-03 05:57:48] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:57:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:48] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2020-06-03 05:57:48] [INFO ] State equation strengthened by 66 read => feed constraints.
[2020-06-03 05:57:48] [INFO ] [Real]Added 66 Read/Feed constraints in 52 ms returned sat
[2020-06-03 05:57:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:57:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 56 ms returned sat
[2020-06-03 05:57:49] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-03 05:57:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:49] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2020-06-03 05:57:49] [INFO ] [Nat]Added 66 Read/Feed constraints in 38 ms returned sat
[2020-06-03 05:57:50] [INFO ] Deduced a trap composed of 35 places in 481 ms
[2020-06-03 05:57:50] [INFO ] Deduced a trap composed of 23 places in 199 ms
[2020-06-03 05:57:50] [INFO ] Deduced a trap composed of 13 places in 280 ms
[2020-06-03 05:57:50] [INFO ] Deduced a trap composed of 79 places in 123 ms
[2020-06-03 05:57:51] [INFO ] Deduced a trap composed of 38 places in 156 ms
[2020-06-03 05:57:51] [INFO ] Deduced a trap composed of 30 places in 111 ms
[2020-06-03 05:57:51] [INFO ] Deduced a trap composed of 49 places in 182 ms
[2020-06-03 05:57:51] [INFO ] Deduced a trap composed of 48 places in 141 ms
[2020-06-03 05:57:51] [INFO ] Deduced a trap composed of 45 places in 175 ms
[2020-06-03 05:57:52] [INFO ] Deduced a trap composed of 27 places in 856 ms
[2020-06-03 05:57:52] [INFO ] Deduced a trap composed of 31 places in 109 ms
[2020-06-03 05:57:53] [INFO ] Deduced a trap composed of 49 places in 376 ms
[2020-06-03 05:57:53] [INFO ] Deduced a trap composed of 16 places in 161 ms
[2020-06-03 05:57:53] [INFO ] Deduced a trap composed of 16 places in 211 ms
[2020-06-03 05:57:53] [INFO ] Deduced a trap composed of 9 places in 94 ms
[2020-06-03 05:57:54] [INFO ] Deduced a trap composed of 13 places in 134 ms
[2020-06-03 05:57:54] [INFO ] Deduced a trap composed of 34 places in 59 ms
[2020-06-03 05:57:54] [INFO ] Deduced a trap composed of 31 places in 94 ms
[2020-06-03 05:57:54] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4593 ms
[2020-06-03 05:57:54] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 44 ms.
[2020-06-03 05:57:56] [INFO ] Added : 301 causal constraints over 61 iterations in 1886 ms. Result :sat
[2020-06-03 05:57:56] [INFO ] [Real]Absence check using 11 positive place invariants in 26 ms returned sat
[2020-06-03 05:57:56] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:56] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2020-06-03 05:57:56] [INFO ] [Real]Added 66 Read/Feed constraints in 20 ms returned sat
[2020-06-03 05:57:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:57:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-06-03 05:57:56] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:57:56] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2020-06-03 05:57:56] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-06-03 05:57:57] [INFO ] Deduced a trap composed of 27 places in 321 ms
[2020-06-03 05:57:57] [INFO ] Deduced a trap composed of 13 places in 168 ms
[2020-06-03 05:57:57] [INFO ] Deduced a trap composed of 13 places in 100 ms
[2020-06-03 05:57:57] [INFO ] Deduced a trap composed of 31 places in 162 ms
[2020-06-03 05:57:58] [INFO ] Deduced a trap composed of 35 places in 226 ms
[2020-06-03 05:57:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1185 ms
[2020-06-03 05:57:58] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 33 ms.
[2020-06-03 05:57:59] [INFO ] Added : 304 causal constraints over 61 iterations in 1790 ms. Result :sat
[2020-06-03 05:58:00] [INFO ] Deduced a trap composed of 16 places in 504 ms
[2020-06-03 05:58:00] [INFO ] Deduced a trap composed of 9 places in 384 ms
[2020-06-03 05:58:01] [INFO ] Deduced a trap composed of 9 places in 156 ms
[2020-06-03 05:58:01] [INFO ] Deduced a trap composed of 9 places in 384 ms
[2020-06-03 05:58:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1650 ms
[2020-06-03 05:58:01] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 05:58:01] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-06-03 05:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:01] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2020-06-03 05:58:01] [INFO ] [Real]Added 66 Read/Feed constraints in 22 ms returned sat
[2020-06-03 05:58:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:58:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 24 ms returned sat
[2020-06-03 05:58:01] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-06-03 05:58:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:02] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2020-06-03 05:58:02] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2020-06-03 05:58:03] [INFO ] Deduced a trap composed of 9 places in 1302 ms
[2020-06-03 05:58:04] [INFO ] Deduced a trap composed of 9 places in 843 ms
[2020-06-03 05:58:04] [INFO ] Deduced a trap composed of 9 places in 207 ms
[2020-06-03 05:58:05] [INFO ] Deduced a trap composed of 34 places in 213 ms
[2020-06-03 05:58:05] [INFO ] Deduced a trap composed of 16 places in 437 ms
[2020-06-03 05:58:05] [INFO ] Deduced a trap composed of 53 places in 125 ms
[2020-06-03 05:58:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3297 ms
[2020-06-03 05:58:05] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 36 ms.
[2020-06-03 05:58:08] [INFO ] Added : 303 causal constraints over 61 iterations in 2305 ms. Result :sat
[2020-06-03 05:58:08] [INFO ] Deduced a trap composed of 52 places in 304 ms
[2020-06-03 05:58:08] [INFO ] Deduced a trap composed of 52 places in 184 ms
[2020-06-03 05:58:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 628 ms
[2020-06-03 05:58:08] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-06-03 05:58:08] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:09] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2020-06-03 05:58:09] [INFO ] [Real]Added 66 Read/Feed constraints in 11 ms returned sat
[2020-06-03 05:58:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:58:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 23 ms returned sat
[2020-06-03 05:58:09] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:58:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:09] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2020-06-03 05:58:09] [INFO ] [Nat]Added 66 Read/Feed constraints in 50 ms returned sat
[2020-06-03 05:58:10] [INFO ] Deduced a trap composed of 9 places in 194 ms
[2020-06-03 05:58:10] [INFO ] Deduced a trap composed of 27 places in 498 ms
[2020-06-03 05:58:10] [INFO ] Deduced a trap composed of 27 places in 105 ms
[2020-06-03 05:58:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 869 ms
[2020-06-03 05:58:10] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 54 ms.
[2020-06-03 05:58:12] [INFO ] Added : 304 causal constraints over 61 iterations in 1959 ms. Result :sat
[2020-06-03 05:58:12] [INFO ] [Real]Absence check using 11 positive place invariants in 54 ms returned sat
[2020-06-03 05:58:12] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:58:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:13] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2020-06-03 05:58:13] [INFO ] [Real]Added 66 Read/Feed constraints in 20 ms returned sat
[2020-06-03 05:58:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:58:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 46 ms returned sat
[2020-06-03 05:58:13] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:58:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:13] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2020-06-03 05:58:13] [INFO ] [Nat]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-06-03 05:58:14] [INFO ] Deduced a trap composed of 9 places in 468 ms
[2020-06-03 05:58:14] [INFO ] Deduced a trap composed of 13 places in 97 ms
[2020-06-03 05:58:14] [INFO ] Deduced a trap composed of 62 places in 178 ms
[2020-06-03 05:58:14] [INFO ] Deduced a trap composed of 20 places in 255 ms
[2020-06-03 05:58:15] [INFO ] Deduced a trap composed of 50 places in 168 ms
[2020-06-03 05:58:15] [INFO ] Deduced a trap composed of 50 places in 75 ms
[2020-06-03 05:58:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1363 ms
[2020-06-03 05:58:15] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 37 ms.
[2020-06-03 05:58:17] [INFO ] Added : 304 causal constraints over 61 iterations in 2090 ms. Result :sat
[2020-06-03 05:58:17] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 05:58:17] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 10 ms returned sat
[2020-06-03 05:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:18] [INFO ] [Real]Absence check using state equation in 804 ms returned sat
[2020-06-03 05:58:18] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-06-03 05:58:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:58:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 51 ms returned sat
[2020-06-03 05:58:18] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 6 ms returned sat
[2020-06-03 05:58:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:18] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2020-06-03 05:58:19] [INFO ] [Nat]Added 66 Read/Feed constraints in 61 ms returned sat
[2020-06-03 05:58:20] [INFO ] Deduced a trap composed of 13 places in 950 ms
[2020-06-03 05:58:20] [INFO ] Deduced a trap composed of 9 places in 121 ms
[2020-06-03 05:58:20] [INFO ] Deduced a trap composed of 16 places in 670 ms
[2020-06-03 05:58:20] [INFO ] Deduced a trap composed of 49 places in 113 ms
[2020-06-03 05:58:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1982 ms
[2020-06-03 05:58:21] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 60 ms.
[2020-06-03 05:58:23] [INFO ] Added : 304 causal constraints over 61 iterations in 2351 ms. Result :sat
[2020-06-03 05:58:23] [INFO ] Deduced a trap composed of 16 places in 187 ms
[2020-06-03 05:58:23] [INFO ] Deduced a trap composed of 9 places in 112 ms
[2020-06-03 05:58:24] [INFO ] Deduced a trap composed of 11 places in 309 ms
[2020-06-03 05:58:24] [INFO ] Deduced a trap composed of 38 places in 315 ms
[2020-06-03 05:58:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1126 ms
[2020-06-03 05:58:24] [INFO ] [Real]Absence check using 11 positive place invariants in 38 ms returned sat
[2020-06-03 05:58:24] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 11 ms returned sat
[2020-06-03 05:58:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:25] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2020-06-03 05:58:25] [INFO ] [Real]Added 66 Read/Feed constraints in 17 ms returned sat
[2020-06-03 05:58:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:58:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 59 ms returned sat
[2020-06-03 05:58:25] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:58:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:25] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2020-06-03 05:58:25] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2020-06-03 05:58:25] [INFO ] Deduced a trap composed of 31 places in 169 ms
[2020-06-03 05:58:25] [INFO ] Deduced a trap composed of 13 places in 163 ms
[2020-06-03 05:58:26] [INFO ] Deduced a trap composed of 26 places in 157 ms
[2020-06-03 05:58:26] [INFO ] Deduced a trap composed of 9 places in 129 ms
[2020-06-03 05:58:26] [INFO ] Deduced a trap composed of 9 places in 74 ms
[2020-06-03 05:58:26] [INFO ] Deduced a trap composed of 47 places in 84 ms
[2020-06-03 05:58:26] [INFO ] Deduced a trap composed of 45 places in 228 ms
[2020-06-03 05:58:26] [INFO ] Deduced a trap composed of 51 places in 167 ms
[2020-06-03 05:58:26] [INFO ] Deduced a trap composed of 27 places in 70 ms
[2020-06-03 05:58:27] [INFO ] Deduced a trap composed of 27 places in 65 ms
[2020-06-03 05:58:27] [INFO ] Deduced a trap composed of 45 places in 114 ms
[2020-06-03 05:58:27] [INFO ] Deduced a trap composed of 26 places in 240 ms
[2020-06-03 05:58:27] [INFO ] Deduced a trap composed of 27 places in 66 ms
[2020-06-03 05:58:27] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2017 ms
[2020-06-03 05:58:27] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 26 ms.
[2020-06-03 05:58:28] [INFO ] Added : 302 causal constraints over 61 iterations in 1473 ms. Result :sat
[2020-06-03 05:58:30] [INFO ] Deduced a trap composed of 12 places in 1088 ms
[2020-06-03 05:58:30] [INFO ] Deduced a trap composed of 44 places in 118 ms
[2020-06-03 05:58:30] [INFO ] Deduced a trap composed of 41 places in 99 ms
[2020-06-03 05:58:30] [INFO ] Deduced a trap composed of 29 places in 182 ms
[2020-06-03 05:58:31] [INFO ] Deduced a trap composed of 37 places in 318 ms
[2020-06-03 05:58:31] [INFO ] Deduced a trap composed of 45 places in 264 ms
[2020-06-03 05:58:31] [INFO ] Deduced a trap composed of 16 places in 463 ms
[2020-06-03 05:58:32] [INFO ] Deduced a trap composed of 9 places in 413 ms
[2020-06-03 05:58:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3539 ms
[2020-06-03 05:58:32] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 05:58:32] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:58:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:33] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2020-06-03 05:58:33] [INFO ] [Real]Added 66 Read/Feed constraints in 23 ms returned sat
[2020-06-03 05:58:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:58:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 26 ms returned sat
[2020-06-03 05:58:33] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:58:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:33] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2020-06-03 05:58:33] [INFO ] [Nat]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-06-03 05:58:33] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 22 ms.
[2020-06-03 05:58:35] [INFO ] Added : 304 causal constraints over 61 iterations in 1434 ms. Result :sat
[2020-06-03 05:58:35] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 05:58:35] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:35] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2020-06-03 05:58:35] [INFO ] [Real]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-06-03 05:58:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:58:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 31 ms returned sat
[2020-06-03 05:58:35] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 23 ms returned sat
[2020-06-03 05:58:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:36] [INFO ] [Nat]Absence check using state equation in 848 ms returned sat
[2020-06-03 05:58:36] [INFO ] [Nat]Added 66 Read/Feed constraints in 64 ms returned sat
[2020-06-03 05:58:38] [INFO ] Deduced a trap composed of 9 places in 1411 ms
[2020-06-03 05:58:38] [INFO ] Deduced a trap composed of 34 places in 504 ms
[2020-06-03 05:58:38] [INFO ] Deduced a trap composed of 35 places in 76 ms
[2020-06-03 05:58:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2083 ms
[2020-06-03 05:58:38] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 23 ms.
[2020-06-03 05:58:40] [INFO ] Added : 303 causal constraints over 61 iterations in 2176 ms. Result :sat
[2020-06-03 05:58:41] [INFO ] Deduced a trap composed of 11 places in 290 ms
[2020-06-03 05:58:41] [INFO ] Deduced a trap composed of 17 places in 736 ms
[2020-06-03 05:58:42] [INFO ] Deduced a trap composed of 54 places in 66 ms
[2020-06-03 05:58:42] [INFO ] Deduced a trap composed of 39 places in 662 ms
[2020-06-03 05:58:43] [INFO ] Deduced a trap composed of 62 places in 144 ms
[2020-06-03 05:58:43] [INFO ] Deduced a trap composed of 34 places in 148 ms
[2020-06-03 05:58:43] [INFO ] Deduced a trap composed of 24 places in 164 ms
[2020-06-03 05:58:43] [INFO ] Deduced a trap composed of 9 places in 252 ms
[2020-06-03 05:58:43] [INFO ] Deduced a trap composed of 52 places in 95 ms
[2020-06-03 05:58:44] [INFO ] Deduced a trap composed of 53 places in 121 ms
[2020-06-03 05:58:44] [INFO ] Deduced a trap composed of 52 places in 771 ms
[2020-06-03 05:58:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4152 ms
[2020-06-03 05:58:45] [INFO ] [Real]Absence check using 11 positive place invariants in 67 ms returned sat
[2020-06-03 05:58:45] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:58:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:45] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2020-06-03 05:58:45] [INFO ] [Real]Added 66 Read/Feed constraints in 34 ms returned sat
[2020-06-03 05:58:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:58:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 66 ms returned sat
[2020-06-03 05:58:45] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned sat
[2020-06-03 05:58:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:46] [INFO ] [Nat]Absence check using state equation in 765 ms returned sat
[2020-06-03 05:58:46] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2020-06-03 05:58:46] [INFO ] Deduced a trap composed of 13 places in 317 ms
[2020-06-03 05:58:46] [INFO ] Deduced a trap composed of 32 places in 240 ms
[2020-06-03 05:58:47] [INFO ] Deduced a trap composed of 42 places in 108 ms
[2020-06-03 05:58:49] [INFO ] Deduced a trap composed of 52 places in 2012 ms
[2020-06-03 05:58:50] [INFO ] Deduced a trap composed of 38 places in 806 ms
[2020-06-03 05:58:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3663 ms
[2020-06-03 05:58:50] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 19 ms.
[2020-06-03 05:58:52] [INFO ] Added : 303 causal constraints over 61 iterations in 1991 ms. Result :sat
[2020-06-03 05:58:52] [INFO ] Deduced a trap composed of 52 places in 260 ms
[2020-06-03 05:58:52] [INFO ] Deduced a trap composed of 18 places in 237 ms
[2020-06-03 05:58:52] [INFO ] Deduced a trap composed of 9 places in 210 ms
[2020-06-03 05:58:53] [INFO ] Deduced a trap composed of 57 places in 276 ms
[2020-06-03 05:58:53] [INFO ] Deduced a trap composed of 64 places in 618 ms
[2020-06-03 05:58:55] [INFO ] Deduced a trap composed of 14 places in 1411 ms
[2020-06-03 05:58:55] [INFO ] Deduced a trap composed of 71 places in 543 ms
[2020-06-03 05:58:56] [INFO ] Deduced a trap composed of 56 places in 245 ms
[2020-06-03 05:58:56] [INFO ] Deduced a trap composed of 13 places in 159 ms
[2020-06-03 05:58:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4480 ms
[2020-06-03 05:58:56] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-06-03 05:58:56] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned sat
[2020-06-03 05:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:57] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2020-06-03 05:58:57] [INFO ] [Real]Added 66 Read/Feed constraints in 34 ms returned sat
[2020-06-03 05:58:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:58:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 69 ms returned sat
[2020-06-03 05:58:57] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:58:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:58:58] [INFO ] [Nat]Absence check using state equation in 913 ms returned sat
[2020-06-03 05:58:58] [INFO ] [Nat]Added 66 Read/Feed constraints in 77 ms returned sat
[2020-06-03 05:58:59] [INFO ] Deduced a trap composed of 20 places in 409 ms
[2020-06-03 05:58:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 465 ms
[2020-06-03 05:58:59] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-06-03 05:59:02] [INFO ] Added : 304 causal constraints over 61 iterations in 2985 ms. Result :sat
[2020-06-03 05:59:03] [INFO ] Deduced a trap composed of 12 places in 1160 ms
[2020-06-03 05:59:04] [INFO ] Deduced a trap composed of 16 places in 623 ms
[2020-06-03 05:59:04] [INFO ] Deduced a trap composed of 13 places in 113 ms
[2020-06-03 05:59:04] [INFO ] Deduced a trap composed of 38 places in 377 ms
[2020-06-03 05:59:04] [INFO ] Deduced a trap composed of 20 places in 49 ms
[2020-06-03 05:59:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2568 ms
[2020-06-03 05:59:04] [INFO ] [Real]Absence check using 11 positive place invariants in 29 ms returned sat
[2020-06-03 05:59:04] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:59:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:59:05] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2020-06-03 05:59:05] [INFO ] [Real]Added 66 Read/Feed constraints in 20 ms returned sat
[2020-06-03 05:59:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:59:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-06-03 05:59:05] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 30 ms returned sat
[2020-06-03 05:59:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:59:06] [INFO ] [Nat]Absence check using state equation in 1274 ms returned sat
[2020-06-03 05:59:06] [INFO ] [Nat]Added 66 Read/Feed constraints in 50 ms returned sat
[2020-06-03 05:59:06] [INFO ] Deduced a trap composed of 9 places in 209 ms
[2020-06-03 05:59:08] [INFO ] Deduced a trap composed of 45 places in 1094 ms
[2020-06-03 05:59:08] [INFO ] Deduced a trap composed of 45 places in 213 ms
[2020-06-03 05:59:08] [INFO ] Deduced a trap composed of 45 places in 573 ms
[2020-06-03 05:59:09] [INFO ] Deduced a trap composed of 9 places in 161 ms
[2020-06-03 05:59:09] [INFO ] Deduced a trap composed of 9 places in 70 ms
[2020-06-03 05:59:10] [INFO ] Deduced a trap composed of 27 places in 870 ms
[2020-06-03 05:59:11] [INFO ] Deduced a trap composed of 27 places in 1206 ms
[2020-06-03 05:59:12] [INFO ] Deduced a trap composed of 27 places in 1325 ms
[2020-06-03 05:59:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 5976 ms
[2020-06-03 05:59:12] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 14 ms.
[2020-06-03 05:59:15] [INFO ] Added : 301 causal constraints over 61 iterations in 2830 ms. Result :sat
[2020-06-03 05:59:15] [INFO ] Deduced a trap composed of 16 places in 174 ms
[2020-06-03 05:59:16] [INFO ] Deduced a trap composed of 38 places in 458 ms
[2020-06-03 05:59:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 746 ms
[2020-06-03 05:59:16] [INFO ] Flatten gal took : 166 ms
[2020-06-03 05:59:16] [INFO ] Flatten gal took : 40 ms
[2020-06-03 05:59:16] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 51 ms.
[2020-06-03 05:59:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Peterson-PT-3 @ 3570 seconds

FORMULA Peterson-PT-3-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-3-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3111
rslt: Output for CTLFireability @ Peterson-PT-3

{
"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",
"--safe",
"--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 05:59:17 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": 75,
"adisj": 63,
"aneg": 0,
"comp": 268,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 268,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 80,
"visible_transitions": 0
},
"processed": "((((1 <= p166) AND (1 <= p212)) OR ((1 <= p148) AND (1 <= p235)) OR ((1 <= p170) AND (1 <= p205)) OR ((1 <= p147) AND (1 <= p216)) OR ((1 <= p146) AND (1 <= p211)) OR ((1 <= p172) AND (1 <= p234)) OR ((1 <= p170) AND (1 <= p210)) OR ((1 <= p170) AND (1 <= p208)) OR ((1 <= p147) AND (1 <= p211)) OR ((1 <= p168) AND (1 <= p235)) OR ((1 <= p146) AND (1 <= p216)) OR ((1 <= p166) AND (1 <= p209)) OR ((1 <= p145) AND (1 <= p206)) OR ((1 <= p166) AND (1 <= p207)) OR ((1 <= p147) AND (1 <= p206)) OR ((1 <= p148) AND (1 <= p212)) OR ((1 <= p171) AND (1 <= p234)) OR ((1 <= p165) AND (1 <= p208)) OR ((1 <= p167) AND (1 <= p235)) OR ((1 <= p144) AND (1 <= p206)) OR ((1 <= p146) AND (1 <= p236)) OR ((1 <= p148) AND (1 <= p207)) OR ((1 <= p165) AND (1 <= p205)) OR ((1 <= p168) AND (1 <= p207)) OR ((1 <= p165) AND (1 <= p234)) OR ((1 <= p144) AND (1 <= p211)) OR ((1 <= p145) AND (1 <= p236)) OR ((1 <= p172) AND (1 <= p208)) OR ((1 <= p172) AND (1 <= p210)) OR ((1 <= p168) AND (1 <= p209)) OR ((1 <= p167) AND (1 <= p209)) OR ((1 <= p167) AND (1 <= p212)) OR ((1 <= p144) AND (1 <= p236)) OR ((1 <= p145) AND (1 <= p216)) OR ((1 <= p171) AND (1 <= p205)) OR ((1 <= p171) AND (1 <= p210))) AND ((((p170 <= 0) OR (p234 <= 0)) AND ((p146 <= 0) OR (p206 <= 0)) AND ((p145 <= 0) OR (p211 <= 0)) AND ((p148 <= 0) OR (p209 <= 0)) AND ((p171 <= 0) OR (p208 <= 0)) AND ((p172 <= 0) OR (p205 <= 0)) AND ((p165 <= 0) OR (p210 <= 0)) AND ((p168 <= 0) OR (p212 <= 0)) AND ((p166 <= 0) OR (p235 <= 0)) AND ((p144 <= 0) OR (p216 <= 0)) AND ((p167 <= 0) OR (p207 <= 0)) AND ((p147 <= 0) OR (p236 <= 0))) OR (((p211 <= 0) OR (p227 <= 0)) AND ((p216 <= 0) OR (p228 <= 0)) AND ((p211 <= 0) OR (p228 <= 0)) AND ((p216 <= 0) OR (p229 <= 0)) AND ((p211 <= 0) OR (p226 <= 0)) AND ((p221 <= 0) OR (p234 <= 0)) AND ((p216 <= 0) OR (p226 <= 0)) AND ((p216 <= 0) OR (p227 <= 0)) AND ((p226 <= 0) OR (p236 <= 0)) AND ((p208 <= 0) OR (p243 <= 0)) AND ((p210 <= 0) OR (p221 <= 0)) AND ((p208 <= 0) OR (p242 <= 0)) AND ((p208 <= 0) OR (p240 <= 0)) AND ((p205 <= 0) OR (p221 <= 0)) AND ((p207 <= 0) OR (p225 <= 0)) AND ((p211 <= 0) OR (p229 <= 0)) AND ((p207 <= 0) OR (p222 <= 0)) AND ((p207 <= 0) OR (p224 <= 0)) AND ((p207 <= 0) OR (p223 <= 0)) AND ((p223 <= 0) OR (p235 <= 0)) AND ((p222 <= 0) OR (p235 <= 0)) AND ((p227 <= 0) OR (p236 <= 0)) AND ((p206 <= 0) OR (p229 <= 0)) AND ((p205 <= 0) OR (p240 <= 0)) AND ((p206 <= 0) OR (p228 <= 0)) AND ((p206 <= 0) OR (p227 <= 0)) AND ((p205 <= 0) OR (p242 <= 0)) AND ((p206 <= 0) OR (p226 <= 0)) AND ((p234 <= 0) OR (p240 <= 0)) AND ((p205 <= 0) OR (p243 <= 0)) AND ((p229 <= 0) OR (p236 <= 0)) AND ((p234 <= 0) OR (p242 <= 0)) AND ((p208 <= 0) OR (p221 <= 0)) AND ((p224 <= 0) OR (p235 <= 0)) AND ((p234 <= 0) OR (p243 <= 0)) AND ((p209 <= 0) OR (p224 <= 0)) AND ((p209 <= 0) OR (p223 <= 0)) AND ((p210 <= 0) OR (p240 <= 0)) AND ((p209 <= 0) OR (p225 <= 0)) AND ((p210 <= 0) OR (p242 <= 0)) AND ((p210 <= 0) OR (p243 <= 0)) AND ((p212 <= 0) OR (p224 <= 0)) AND ((p212 <= 0) OR (p225 <= 0)) AND ((p228 <= 0) OR (p236 <= 0)) AND ((p212 <= 0) OR (p222 <= 0)) AND ((p209 <= 0) OR (p222 <= 0)) AND ((p225 <= 0) OR (p235 <= 0)) AND ((p212 <= 0) OR (p223 <= 0)))) AND ((1 <= p53) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR ((1 <= p111) AND (1 <= p132)) OR ((1 <= p111) AND (1 <= p131)) OR ((1 <= p111) AND (1 <= p130)) OR ((1 <= p111) AND (1 <= p129)) OR ((1 <= p109) AND (1 <= p113)) OR ((1 <= p110) AND (1 <= p143)) OR ((1 <= p110) AND (1 <= p142)) OR ((1 <= p111) AND (1 <= p128)) OR ((1 <= p111) AND (1 <= p127)) OR ((1 <= p110) AND (1 <= p141)) OR ((1 <= p111) AND (1 <= p125)) OR ((1 <= p110) AND (1 <= p151)) OR ((1 <= p110) AND (1 <= p153)) OR ((1 <= p113) AND (1 <= p124)) OR ((1 <= p110) AND (1 <= p152)) OR ((1 <= p113) AND (1 <= p123)) OR ((1 <= p113) AND (1 <= p122)) OR ((1 <= p113) AND (1 <= p121)) OR ((1 <= p113) AND (1 <= p120)) OR ((1 <= p113) AND (1 <= p119)) OR ((1 <= p113) AND (1 <= p118)) OR ((1 <= p113) AND (1 <= p117)) OR ((1 <= p110) AND (1 <= p155)) OR ((1 <= p110) AND (1 <= p154)) OR ((1 <= p110) AND (1 <= p156)) OR ((1 <= p112) AND (1 <= p126)) OR ((1 <= p112) AND (1 <= p133)) OR ((1 <= p112) AND (1 <= p135)) OR ((1 <= p111) AND (1 <= p150)) OR ((1 <= p112) AND (1 <= p134)) OR ((1 <= p111) AND (1 <= p149)) OR ((1 <= p112) AND (1 <= p137)) OR ((1 <= p112) AND (1 <= p136)) OR ((1 <= p112) AND (1 <= p139)) OR ((1 <= p112) AND (1 <= p138)) OR ((1 <= p112) AND (1 <= p140))))",
"processed_size": 4555,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 1,
"aneg": 0,
"comp": 56,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 56,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 56,
"visible_transitions": 0
},
"processed": "E (G ((((p65 <= 0) AND (p64 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p68 <= 0) AND (p71 <= 0) AND (p70 <= 0) AND (p73 <= 0) AND (p72 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p81 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p91 <= 0) AND (p90 <= 0) AND (p93 <= 0) AND (p92 <= 0) AND (p95 <= 0) AND (p94 <= 0) AND (p97 <= 0) AND (p96 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p101 <= 0) AND (p100 <= 0) AND (p103 <= 0) AND (p106 <= 0) AND (p104 <= 0) AND (p107 <= 0) AND (p105 <= 0) AND (p108 <= 0) AND (p57 <= 0) AND (p61 <= 0) AND (p63 <= 0) AND (p62 <= 0)) OR ((1 <= p114) AND (1 <= p237)) OR ((1 <= p102) AND (1 <= p241)) OR ((1 <= p116) AND (1 <= p238)) OR ((1 <= p115) AND (1 <= p239)))))",
"processed_size": 871,
"rewrites": 21
},
"result":
{
"edges": 36,
"markings": 36,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 144
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3840,
"problems": 768
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"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": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AG(((p164 <= 0) OR EX(((p116 <= 0) OR (p135 <= 0)))))",
"processed_size": 54,
"rewrites": 22
},
"net":
{
"conflict_clusters": 163,
"singleton_clusters": 0
},
"result":
{
"edges": 13631784,
"markings": 3407946,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 250
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"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": "EF(A((1 <= p10) U ((1 <= p167) AND (1 <= p235))))",
"processed_size": 49,
"rewrites": 22
},
"net":
{
"conflict_clusters": 163,
"singleton_clusters": 0
},
"result":
{
"edges": 194208,
"markings": 38937,
"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": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 269
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EF(((1 <= p19) AND AG(((1 <= p209) AND (1 <= p222)))))",
"processed_size": 54,
"rewrites": 22
},
"net":
{
"conflict_clusters": 163,
"singleton_clusters": 0
},
"result":
{
"edges": 13634352,
"markings": 3407946,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 288
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EF(AX(((1 <= p212) AND (1 <= p223))))",
"processed_size": 37,
"rewrites": 22
},
"net":
{
"conflict_clusters": 163,
"singleton_clusters": 0
},
"result":
{
"edges": 13631784,
"markings": 3407946,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 310
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (G (((p201 <= 0) AND ((p111 <= 0) OR (p129 <= 0)) AND ((p115 <= 0) OR (p239 <= 0)) AND ((p50 <= 0) OR (p115 <= 0) OR (p149 <= 0) OR (p177 <= 0) OR (p234 <= 0) OR (p240 <= 0)))))",
"processed_size": 186,
"rewrites": 22
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 11,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 341
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 5,
"aneg": 0,
"comp": 56,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 56,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 56,
"visible_transitions": 0
},
"processed": "A (G ((((p65 <= 0) AND (p64 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p68 <= 0) AND (p71 <= 0) AND (p70 <= 0) AND (p73 <= 0) AND (p72 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p81 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p91 <= 0) AND (p90 <= 0) AND (p93 <= 0) AND (p92 <= 0) AND (p95 <= 0) AND (p94 <= 0) AND (p97 <= 0) AND (p96 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p101 <= 0) AND (p100 <= 0) AND (p103 <= 0) AND (p106 <= 0) AND (p104 <= 0) AND (p107 <= 0) AND (p105 <= 0) AND (p108 <= 0) AND (p57 <= 0) AND (p61 <= 0) AND (p63 <= 0) AND (p62 <= 0)) OR (((p114 <= 0) OR (p237 <= 0)) AND ((p102 <= 0) OR (p241 <= 0)) AND ((p116 <= 0) OR (p238 <= 0)) AND ((p115 <= 0) OR (p239 <= 0))))))",
"processed_size": 873,
"rewrites": 22
},
"result":
{
"edges": 30,
"markings": 31,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 379
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 1,
"aneg": 1,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "((1 <= p179) OR (1 <= p193) OR (1 <= p161) OR (1 <= p192) OR (1 <= p215) OR (1 <= p197) OR (1 <= p219) OR (1 <= p187) OR (1 <= p201) OR (1 <= p169) OR (1 <= p175) OR (1 <= p157) OR (((p110 <= 0) OR (p230 <= 0)) AND ((p111 <= 0) OR (p231 <= 0)) AND ((p112 <= 0) OR (p232 <= 0)) AND ((p113 <= 0) OR (p233 <= 0))))",
"processed_size": 327,
"rewrites": 24
},
"result":
{
"edges": 12560068,
"markings": 3217323,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 56,
"problems": 4
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 421
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 36,
"adisj": 1,
"aneg": 1,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "(((p166 <= 0) OR (p212 <= 0)) AND ((p148 <= 0) OR (p235 <= 0)) AND ((p170 <= 0) OR (p205 <= 0)) AND ((p147 <= 0) OR (p216 <= 0)) AND ((p146 <= 0) OR (p211 <= 0)) AND ((p172 <= 0) OR (p234 <= 0)) AND ((p170 <= 0) OR (p210 <= 0)) AND ((p170 <= 0) OR (p208 <= 0)) AND ((p147 <= 0) OR (p211 <= 0)) AND ((p168 <= 0) OR (p235 <= 0)) AND ((p146 <= 0) OR (p216 <= 0)) AND ((p166 <= 0) OR (p209 <= 0)) AND ((p145 <= 0) OR (p206 <= 0)) AND ((p166 <= 0) OR (p207 <= 0)) AND ((p147 <= 0) OR (p206 <= 0)) AND ((p148 <= 0) OR (p212 <= 0)) AND ((p171 <= 0) OR (p234 <= 0)) AND ((p165 <= 0) OR (p208 <= 0)) AND ((p167 <= 0) OR (p235 <= 0)) AND ((p144 <= 0) OR (p206 <= 0)) AND ((p146 <= 0) OR (p236 <= 0)) AND ((p148 <= 0) OR (p207 <= 0)) AND ((p165 <= 0) OR (p205 <= 0)) AND ((p168 <= 0) OR (p207 <= 0)) AND ((p165 <= 0) OR (p234 <= 0)) AND ((p144 <= 0) OR (p211 <= 0)) AND ((p145 <= 0) OR (p236 <= 0)) AND ((p172 <= 0) OR (p208 <= 0)) AND ((p172 <= 0) OR (p210 <= 0)) AND ((p168 <= 0) OR (p209 <= 0)) AND ((p167 <= 0) OR (p209 <= 0)) AND ((p167 <= 0) OR (p212 <= 0)) AND ((p144 <= 0) OR (p236 <= 0)) AND ((p145 <= 0) OR (p216 <= 0)) AND ((p171 <= 0) OR (p205 <= 0)) AND ((p171 <= 0) OR (p210 <= 0)))",
"processed_size": 1221,
"rewrites": 24
},
"result":
{
"edges": 12821841,
"markings": 3407946,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": null,
"problems": null
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 471
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 36,
"adisj": 1,
"aneg": 1,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "(((p111 <= 0) OR (p132 <= 0)) AND ((p111 <= 0) OR (p131 <= 0)) AND ((p111 <= 0) OR (p130 <= 0)) AND ((p111 <= 0) OR (p129 <= 0)) AND ((p109 <= 0) OR (p113 <= 0)) AND ((p110 <= 0) OR (p143 <= 0)) AND ((p110 <= 0) OR (p142 <= 0)) AND ((p111 <= 0) OR (p128 <= 0)) AND ((p111 <= 0) OR (p127 <= 0)) AND ((p110 <= 0) OR (p141 <= 0)) AND ((p111 <= 0) OR (p125 <= 0)) AND ((p110 <= 0) OR (p151 <= 0)) AND ((p110 <= 0) OR (p153 <= 0)) AND ((p113 <= 0) OR (p124 <= 0)) AND ((p110 <= 0) OR (p152 <= 0)) AND ((p113 <= 0) OR (p123 <= 0)) AND ((p113 <= 0) OR (p122 <= 0)) AND ((p113 <= 0) OR (p121 <= 0)) AND ((p113 <= 0) OR (p120 <= 0)) AND ((p113 <= 0) OR (p119 <= 0)) AND ((p113 <= 0) OR (p118 <= 0)) AND ((p113 <= 0) OR (p117 <= 0)) AND ((p110 <= 0) OR (p155 <= 0)) AND ((p110 <= 0) OR (p154 <= 0)) AND ((p110 <= 0) OR (p156 <= 0)) AND ((p112 <= 0) OR (p126 <= 0)) AND ((p112 <= 0) OR (p133 <= 0)) AND ((p112 <= 0) OR (p135 <= 0)) AND ((p111 <= 0) OR (p150 <= 0)) AND ((p112 <= 0) OR (p134 <= 0)) AND ((p111 <= 0) OR (p149 <= 0)) AND ((p112 <= 0) OR (p137 <= 0)) AND ((p112 <= 0) OR (p136 <= 0)) AND ((p112 <= 0) OR (p139 <= 0)) AND ((p112 <= 0) OR (p138 <= 0)) AND ((p112 <= 0) OR (p140 <= 0)))",
"processed_size": 1221,
"rewrites": 24
},
"result":
{
"edges": 13491264,
"markings": 3404351,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": null,
"problems": null
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 538
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 36,
"adisj": 1,
"aneg": 1,
"comp": 108,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 108,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 60,
"visible_transitions": 0
},
"processed": "((p195 <= 0) AND (p194 <= 0) AND (p199 <= 0) AND (p198 <= 0) AND (p196 <= 0) AND (p203 <= 0) AND (p202 <= 0) AND (p200 <= 0) AND (p204 <= 0) AND (p214 <= 0) AND (p213 <= 0) AND (p218 <= 0) AND (p217 <= 0) AND (p158 <= 0) AND (p159 <= 0) AND (p220 <= 0) AND (p162 <= 0) AND (p163 <= 0) AND (p160 <= 0) AND (p164 <= 0) AND (p174 <= 0) AND (p173 <= 0) AND (p178 <= 0) AND (p177 <= 0) AND (p176 <= 0) AND (p183 <= 0) AND (p182 <= 0) AND (p181 <= 0) AND (p180 <= 0) AND (p186 <= 0) AND (p185 <= 0) AND (p184 <= 0) AND (p191 <= 0) AND (p190 <= 0) AND (p189 <= 0) AND (p188 <= 0) AND ((p166 <= 0) OR (p212 <= 0)) AND ((p148 <= 0) OR (p235 <= 0)) AND ((p170 <= 0) OR (p205 <= 0)) AND ((p147 <= 0) OR (p216 <= 0)) AND ((p146 <= 0) OR (p211 <= 0)) AND ((p172 <= 0) OR (p234 <= 0)) AND ((p170 <= 0) OR (p210 <= 0)) AND ((p170 <= 0) OR (p208 <= 0)) AND ((p147 <= 0) OR (p211 <= 0)) AND ((p168 <= 0) OR (p235 <= 0)) AND ((p146 <= 0) OR (p216 <= 0)) AND ((p166 <= 0) OR (p209 <= 0)) AND ((p145 <= 0) OR (p206 <= 0)) AND ((p166 <= 0) OR (p207 <= 0)) AND ((p147 <= 0) OR (p206 <= 0)) AND ((p148 <= 0) OR (p212 <= 0)) AND ((p171 <= 0) OR (p234 <= 0)) AND ((p165 <= 0) OR (p208 <= 0)) AND ((p167 <= 0) OR (p235 <= 0)) AND ((p144 <= 0) OR (p206 <= 0)) AND ((p146 <= 0) OR (p236 <= 0)) AND ((p148 <= 0) OR (p207 <= 0)) AND ((p165 <= 0) OR (p205 <= 0)) AND ((p168 <= 0) OR (p207 <= 0)) AND ((p165 <= 0) OR (p234 <= 0)) AND ((p144 <= 0) OR (p211 <= 0)) AND ((p145 <= 0) OR (p236 <= 0)) AND ((p172 <= 0) OR (p208 <= 0)) AND ((p172 <= 0) OR (p210 <= 0)) AND ((p168 <= 0) OR (p209 <= 0)) AND ((p167 <= 0) OR (p209 <= 0)) AND ((p167 <= 0) OR (p212 <= 0)) AND ((p144 <= 0) OR (p236 <= 0)) AND ((p145 <= 0) OR (p216 <= 0)) AND ((p171 <= 0) OR (p205 <= 0)) AND ((p171 <= 0) OR (p210 <= 0)))",
"processed_size": 1797,
"rewrites": 23
},
"result":
{
"edges": 574,
"markings": 312,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 204
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 108,
"problems": 72
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 646
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 60,
"adisj": 2,
"aneg": 1,
"comp": 120,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 120,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "EF((AG((((p170 <= 0) OR (p234 <= 0)) AND ((p146 <= 0) OR (p206 <= 0)) AND ((p145 <= 0) OR (p211 <= 0)) AND ((p148 <= 0) OR (p209 <= 0)) AND ((p171 <= 0) OR (p208 <= 0)) AND ((p172 <= 0) OR (p205 <= 0)) AND ((p165 <= 0) OR (p210 <= 0)) AND ((p168 <= 0) OR (p212 <= 0)) AND ((p166 <= 0) OR (p235 <= 0)) AND ((p144 <= 0) OR (p216 <= 0)) AND ((p167 <= 0) OR (p207 <= 0)) AND ((p147 <= 0) OR (p236 <= 0)))) AND (((1 <= p211) AND (1 <= p227)) OR ((1 <= p216) AND (1 <= p228)) OR ((1 <= p211) AND (1 <= p228)) OR ((1 <= p216) AND (1 <= p229)) OR ((1 <= p211) AND (1 <= p226)) OR ((1 <= p221) AND (1 <= p234)) OR ((1 <= p216) AND (1 <= p226)) OR ((1 <= p216) AND (1 <= p227)) OR ((1 <= p226) AND (1 <= p236)) OR ((1 <= p208) AND (1 <= p243)) OR ((1 <= p210) AND (1 <= p221)) OR ((1 <= p208) AND (1 <= p242)) OR ((1 <= p208) AND (1 <= p240)) OR ((1 <= p205) AND (1 <= p221)) OR ((1 <= p207) AND (1 <= p225)) OR ((1 <= p211) AND (1 <= p229)) OR ((1 <= p207) AND (1 <= p222)) OR ((1 <= p207) AND (1 <= p224)) OR ((1 <= p207) AND (1 <= p223)) OR ((1 <= p223) AND (1 <= p235)) OR ((1 <= p222) AND (1 <= p235)) OR ((1 <= p227) AND (1 <= p236)) OR ((1 <= p206) AND (1 <= p229)) OR ((1 <= p205) AND (1 <= p240)) OR ((1 <= p206) AND (1 <= p228)) OR ((1 <= p206) AND (1 <= p227)) OR ((1 <= p205) AND (1 <= p242)) OR ((1 <= p206) AND (1 <= p226)) OR ((1 <= p234) AND (1 <= p240)) OR ((1 <= p205) AND (1 <= p243)) OR ((1 <= p229) AND (1 <= p236)) OR ((1 <= p234) AND (1 <= p242)) OR ((1 <= p208) AND (1 <= p221)) OR ((1 <= p224) AND (1 <= p235)) OR ((1 <= p234) AND (1 <= p243)) OR ((1 <= p209) AND (1 <= p224)) OR ((1 <= p209) AND (1 <= p223)) OR ((1 <= p210) AND (1 <= p240)) OR ((1 <= p209) AND (1 <= p225)) OR ((1 <= p210) AND (1 <= p242)) OR ((1 <= p210) AND (1 <= p243)) OR ((1 <= p212) AND (1 <= p224)) OR ((1 <= p212) AND (1 <= p225)) OR ((1 <= p228) AND (1 <= p236)) OR ((1 <= p212) AND (1 <= p222)) OR ((1 <= p209) AND (1 <= p222)) OR ((1 <= p225) AND (1 <= p235)) OR ((1 <= p212) AND (1 <= p223)))))",
"processed_size": 2049,
"rewrites": 22
},
"net":
{
"conflict_clusters": 163,
"singleton_clusters": 0
},
"result":
{
"edges": 19488947,
"markings": 3407946,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 787
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 3,
"aneg": 1,
"comp": 108,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 108,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 60,
"visible_transitions": 0
},
"processed": "A(EG(((p179 <= 0) AND (p193 <= 0) AND (p161 <= 0) AND (p192 <= 0) AND (p215 <= 0) AND (p197 <= 0) AND (p219 <= 0) AND (p187 <= 0) AND (p201 <= 0) AND (p169 <= 0) AND (p175 <= 0) AND (p157 <= 0))) U (AF(((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78) OR (1 <= p81) OR (1 <= p80) OR (1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR (1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p101) OR (1 <= p100) OR (1 <= p103) OR (1 <= p106) OR (1 <= p104) OR (1 <= p107) OR (1 <= p105) OR (1 <= p108) OR (1 <= p57) OR (1 <= p61) OR (1 <= p63) OR (1 <= p62))) AND ((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78) OR (1 <= p81) OR (1 <= p80) OR (1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR (1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p101) OR (1 <= p100) OR (1 <= p103) OR (1 <= p106) OR (1 <= p104) OR (1 <= p107) OR (1 <= p105) OR (1 <= p108) OR (1 <= p57) OR (1 <= p61) OR (1 <= p63) OR (1 <= p62))))",
"processed_size": 1660,
"rewrites": 23
},
"net":
{
"conflict_clusters": 163,
"singleton_clusters": 0
},
"result":
{
"edges": 1044,
"markings": 489,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1049
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 2,
"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 (((((p89 <= 0) AND ((p112 <= 0) OR (p134 <= 0))) OR ((p180 <= 0) AND (p103 <= 0))) U (1 <= p219)))",
"processed_size": 102,
"rewrites": 23
},
"result":
{
"edges": 6551152,
"markings": 1637847,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 14
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3112
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 2,
"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 (((((p110 <= 0) OR (p151 <= 0)) AND ((p102 <= 0) OR (p122 <= 0))) U ((1 <= p113) AND (1 <= p117))))",
"processed_size": 103,
"rewrites": 23
},
"result":
{
"edges": 6877,
"markings": 2244,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (G (((1 <= p228) AND (1 <= p236) AND ((1 <= p203) OR (1 <= p12) OR ((1 <= p145) AND (1 <= p206) AND (1 <= p168) AND (1 <= p212))))))",
"processed_size": 136,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 49
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 14,
"problems": 6
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G (((p167 <= 0) OR (p209 <= 0))))",
"processed_size": 37,
"rewrites": 21
},
"result":
{
"edges": 62,
"markings": 62,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G (((p146 <= 0) OR (p206 <= 0))))",
"processed_size": 37,
"rewrites": 21
},
"result":
{
"edges": 30,
"markings": 30,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 17
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p114) AND (1 <= p143)) OR ((1 <= p166) AND (1 <= p209)))))",
"processed_size": 73,
"rewrites": 21
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 219868,
"runtime": 458.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((E(G(*)) U (A(F(**)) AND **))) : E(F(A(G(**)))) : E(F((A(G(*)) AND **))) : E(F(A(G(**)))) : A(F(**)) : E(F(A(G(**)))) : A(G(**)) : (A(X(**)) OR (E(G(**)) OR **)) : A(G((** OR E(X(**))))) : (E(F(A((** U **)))) OR (A(X(**)) AND A(X(E(F(**)))))) : E(F(**)) : A(G(**)) : (E(G(**)) OR (E(G(*)) AND (E(F(**)) AND (E(G(*)) AND **)))) : (E(F(A(X(**)))) OR E(F((** AND A(G(**)))))) : E((** U **)) : (E((** U **)) AND **)"
},
"net":
{
"arcs": 1016,
"conflict_clusters": 163,
"places": 244,
"places_significant": 229,
"singleton_clusters": 0,
"transitions": 332
},
"result":
{
"preliminary_value": "no no no no yes no no yes yes yes yes no yes no yes yes ",
"value": "no no no no yes no no yes yes yes yes no yes no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 576/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 244
lola: finding significant places
lola: 244 places, 332 transitions, 229 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: A ((NOT(A (F (((1 <= p179) OR (1 <= p193) OR (1 <= p161) OR (1 <= p192) OR (1 <= p215) OR (1 <= p197) OR (1 <= p219) OR (1 <= p187) OR (1 <= p201) OR (1 <= p169) OR (1 <= p175) OR (1 <= p157))))) U (A (F (((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78) OR (1 <= p81) OR (1 <= p80) OR (1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR (1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p101) OR (1 <= p100) OR (1 <= p103) OR (1 <= p106) OR (1 <= p104) OR (1 <= p107) OR (1 <= p105) OR (1 <= p108) OR (1 <= p57) OR (1 <= p61) OR (1 <= p63) OR (1 <= p62)))) AND ((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78) OR (1 <= p81) OR (1 <= p80) OR (1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR (1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p101) OR (1 <= p100) OR (1 <= p103) OR (1 <= p106) OR (1 <= p104) OR (1 <= p107) OR (1 <= p105) OR (1 <= p108) OR (1 <= p57) OR (1 <= p61) OR (1 <= p63) OR (1 <= p62))))) : E (F (A (G (((p179 <= 0) AND (p193 <= 0) AND (p161 <= 0) AND (p192 <= 0) AND (p215 <= 0) AND (p197 <= 0) AND (p219 <= 0) AND (p187 <= 0) AND (p201 <= 0) AND (p169 <= 0) AND (p175 <= 0) AND (p157 <= 0) AND (((1 <= p110) AND (1 <= p230)) OR ((1 <= p111) AND (1 <= p231)) OR ((1 <= p112) AND (1 <= p232)) OR ((1 <= p113) AND (1 <= p233)))))))) : E (F ((NOT(E (F ((((1 <= p170) AND (1 <= p234)) OR ((1 <= p146) AND (1 <= p206)) OR ((1 <= p145) AND (1 <= p211)) OR ((1 <= p148) AND (1 <= p209)) OR ((1 <= p171) AND (1 <= p208)) OR ((1 <= p172) AND (1 <= p205)) OR ((1 <= p165) AND (1 <= p210)) OR ((1 <= p168) AND (1 <= p212)) OR ((1 <= p166) AND (1 <= p235)) OR ((1 <= p144) AND (1 <= p216)) OR ((1 <= p167) AND (1 <= p207)) OR ((1 <= p147) AND (1 <= p236)))))) AND (((1 <= p211) AND (1 <= p227)) OR ((1 <= p216) AND (1 <= p228)) OR ((1 <= p211) AND (1 <= p228)) OR ((1 <= p216) AND (1 <= p229)) OR ((1 <= p211) AND (1 <= p226)) OR ((1 <= p221) AND (1 <= p234)) OR ((1 <= p216) AND (1 <= p226)) OR ((1 <= p216) AND (1 <= p227)) OR ((1 <= p226) AND (1 <= p236)) OR ((1 <= p208) AND (1 <= p243)) OR ((1 <= p210) AND (1 <= p221)) OR ((1 <= p208) AND (1 <= p242)) OR ((1 <= p208) AND (1 <= p240)) OR ((1 <= p205) AND (1 <= p221)) OR ((1 <= p207) AND (1 <= p225)) OR ((1 <= p211) AND (1 <= p229)) OR ((1 <= p207) AND (1 <= p222)) OR ((1 <= p207) AND (1 <= p224)) OR ((1 <= p207) AND (1 <= p223)) OR ((1 <= p223) AND (1 <= p235)) OR ((1 <= p222) AND (1 <= p235)) OR ((1 <= p227) AND (1 <= p236)) OR ((1 <= p206) AND (1 <= p229)) OR ((1 <= p205) AND (1 <= p240)) OR ((1 <= p206) AND (1 <= p228)) OR ((1 <= p206) AND (1 <= p227)) OR ((1 <= p205) AND (1 <= p242)) OR ((1 <= p206) AND (1 <= p226)) OR ((1 <= p234) AND (1 <= p240)) OR ((1 <= p205) AND (1 <= p243)) OR ((1 <= p229) AND (1 <= p236)) OR ((1 <= p234) AND (1 <= p242)) OR ((1 <= p208) AND (1 <= p221)) OR ((1 <= p224) AND (1 <= p235)) OR ((1 <= p234) AND (1 <= p243)) OR ((1 <= p209) AND (1 <= p224)) OR ((1 <= p209) AND (1 <= p223)) OR ((1 <= p210) AND (1 <= p240)) OR ((1 <= p209) AND (1 <= p225)) OR ((1 <= p210) AND (1 <= p242)) OR ((1 <= p210) AND (1 <= p243)) OR ((1 <= p212) AND (1 <= p224)) OR ((1 <= p212) AND (1 <= p225)) OR ((1 <= p228) AND (1 <= p236)) OR ((1 <= p212) AND (1 <= p222)) OR ((1 <= p209) AND (1 <= p222)) OR ((1 <= p225) AND (1 <= p235)) OR ((1 <= p212) AND (1 <= p223)))))) : E (F (A (G ((((1 <= p166) AND (1 <= p212)) OR ((1 <= p148) AND (1 <= p235)) OR ((1 <= p170) AND (1 <= p205)) OR ((1 <= p147) AND (1 <= p216)) OR ((1 <= p146) AND (1 <= p211)) OR ((1 <= p172) AND (1 <= p234)) OR ((1 <= p170) AND (1 <= p210)) OR ((1 <= p170) AND (1 <= p208)) OR ((1 <= p147) AND (1 <= p211)) OR ((1 <= p168) AND (1 <= p235)) OR ((1 <= p146) AND (1 <= p216)) OR ((1 <= p166) AND (1 <= p209)) OR ((1 <= p145) AND (1 <= p206)) OR ((1 <= p166) AND (1 <= p207)) OR ((1 <= p147) AND (1 <= p206)) OR ((1 <= p148) AND (1 <= p212)) OR ((1 <= p171) AND (1 <= p234)) OR ((1 <= p165) AND (1 <= p208)) OR ((1 <= p167) AND (1 <= p235)) OR ((1 <= p144) AND (1 <= p206)) OR ((1 <= p146) AND (1 <= p236)) OR ((1 <= p148) AND (1 <= p207)) OR ((1 <= p165) AND (1 <= p205)) OR ((1 <= p168) AND (1 <= p207)) OR ((1 <= p165) AND (1 <= p234)) OR ((1 <= p144) AND (1 <= p211)) OR ((1 <= p145) AND (1 <= p236)) OR ((1 <= p172) AND (1 <= p208)) OR ((1 <= p172) AND (1 <= p210)) OR ((1 <= p168) AND (1 <= p209)) OR ((1 <= p167) AND (1 <= p209)) OR ((1 <= p167) AND (1 <= p212)) OR ((1 <= p144) AND (1 <= p236)) OR ((1 <= p145) AND (1 <= p216)) OR ((1 <= p171) AND (1 <= p205)) OR ((1 <= p171) AND (1 <= p210))))))) : A (F (A (((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15) OR (1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p35) OR (1 <= p36)) AND (((1 <= p211) AND (1 <= p227)) OR ((1 <= p216) AND (1 <= p228)) OR ((1 <= p211) AND (1 <= p228)) OR ((1 <= p216) AND (1 <= p229)) OR ((1 <= p211) AND (1 <= p226)) OR ((1 <= p221) AND (1 <= p234)) OR ((1 <= p216) AND (1 <= p226)) OR ((1 <= p216) AND (1 <= p227)) OR ((1 <= p226) AND (1 <= p236)) OR ((1 <= p208) AND (1 <= p243)) OR ((1 <= p210) AND (1 <= p221)) OR ((1 <= p208) AND (1 <= p242)) OR ((1 <= p208) AND (1 <= p240)) OR ((1 <= p205) AND (1 <= p221)) OR ((1 <= p207) AND (1 <= p225)) OR ((1 <= p211) AND (1 <= p229)) OR ((1 <= p207) AND (1 <= p222)) OR ((1 <= p207) AND (1 <= p224)) OR ((1 <= p207) AND (1 <= p223)) OR ((1 <= p223) AND (1 <= p235)) OR ((1 <= p222) AND (1 <= p235)) OR ((1 <= p227) AND (1 <= p236)) OR ((1 <= p206) AND (1 <= p229)) OR ((1 <= p205) AND (1 <= p240)) OR ((1 <= p206) AND (1 <= p228)) OR ((1 <= p206) AND (1 <= p227)) OR ((1 <= p205) AND (1 <= p242)) OR ((1 <= p206) AND (1 <= p226)) OR ((1 <= p234) AND (1 <= p240)) OR ((1 <= p205) AND (1 <= p243)) OR ((1 <= p229) AND (1 <= p236)) OR ((1 <= p234) AND (1 <= p242)) OR ((1 <= p208) AND (1 <= p221)) OR ((1 <= p224) AND (1 <= p235)) OR ((1 <= p234) AND (1 <= p243)) OR ((1 <= p209) AND (1 <= p224)) OR ((1 <= p209) AND (1 <= p223)) OR ((1 <= p210) AND (1 <= p240)) OR ((1 <= p209) AND (1 <= p225)) OR ((1 <= p210) AND (1 <= p242)) OR ((1 <= p210) AND (1 <= p243)) OR ((1 <= p212) AND (1 <= p224)) OR ((1 <= p212) AND (1 <= p225)) OR ((1 <= p228) AND (1 <= p236)) OR ((1 <= p212) AND (1 <= p222)) OR ((1 <= p209) AND (1 <= p222)) OR ((1 <= p225) AND (1 <= p235)) OR ((1 <= p212) AND (1 <= p223)))) U ((1 <= p195) OR (1 <= p194) OR (1 <= p199) OR (1 <= p198) OR (1 <= p196) OR (1 <= p203) OR (1 <= p202) OR (1 <= p200) OR (1 <= p204) OR (1 <= p214) OR (1 <= p213) OR (1 <= p218) OR (1 <= p217) OR (1 <= p158) OR (1 <= p159) OR (1 <= p220) OR (1 <= p162) OR (1 <= p163) OR (1 <= p160) OR (1 <= p164) OR (1 <= p174) OR (1 <= p173) OR (1 <= p178) OR (1 <= p177) OR (1 <= p176) OR (1 <= p183) OR (1 <= p182) OR (1 <= p181) OR (1 <= p180) OR (1 <= p186) OR (1 <= p185) OR (1 <= p184) OR (1 <= p191) OR (1 <= p190) OR (1 <= p189) OR (1 <= p188) OR ((1 <= p166) AND (1 <= p212)) OR ((1 <= p148) AND (1 <= p235)) OR ((1 <= p170) AND (1 <= p205)) OR ((1 <= p147) AND (1 <= p216)) OR ((1 <= p146) AND (1 <= p211)) OR ((1 <= p172) AND (1 <= p234)) OR ((1 <= p170) AND (1 <= p210)) OR ((1 <= p170) AND (1 <= p208)) OR ((1 <= p147) AND (1 <= p211)) OR ((1 <= p168) AND (1 <= p235)) OR ((1 <= p146) AND (1 <= p216)) OR ((1 <= p166) AND (1 <= p209)) OR ((1 <= p145) AND (1 <= p206)) OR ((1 <= p166) AND (1 <= p207)) OR ((1 <= p147) AND (1 <= p206)) OR ((1 <= p148) AND (1 <= p212)) OR ((1 <= p171) AND (1 <= p234)) OR ((1 <= p165) AND (1 <= p208)) OR ((1 <= p167) AND (1 <= p235)) OR ((1 <= p144) AND (1 <= p206)) OR ((1 <= p146) AND (1 <= p236)) OR ((1 <= p148) AND (1 <= p207)) OR ((1 <= p165) AND (1 <= p205)) OR ((1 <= p168) AND (1 <= p207)) OR ((1 <= p165) AND (1 <= p234)) OR ((1 <= p144) AND (1 <= p211)) OR ((1 <= p145) AND (1 <= p236)) OR ((1 <= p172) AND (1 <= p208)) OR ((1 <= p172) AND (1 <= p210)) OR ((1 <= p168) AND (1 <= p209)) OR ((1 <= p167) AND (1 <= p209)) OR ((1 <= p167) AND (1 <= p212)) OR ((1 <= p144) AND (1 <= p236)) OR ((1 <= p145) AND (1 <= p216)) OR ((1 <= p171) AND (1 <= p205)) OR ((1 <= p171) AND (1 <= p210))))))) : E (F (A (G ((((1 <= p111) AND (1 <= p132)) OR ((1 <= p111) AND (1 <= p131)) OR ((1 <= p111) AND (1 <= p130)) OR ((1 <= p111) AND (1 <= p129)) OR ((1 <= p109) AND (1 <= p113)) OR ((1 <= p110) AND (1 <= p143)) OR ((1 <= p110) AND (1 <= p142)) OR ((1 <= p111) AND (1 <= p128)) OR ((1 <= p111) AND (1 <= p127)) OR ((1 <= p110) AND (1 <= p141)) OR ((1 <= p111) AND (1 <= p125)) OR ((1 <= p110) AND (1 <= p151)) OR ((1 <= p110) AND (1 <= p153)) OR ((1 <= p113) AND (1 <= p124)) OR ((1 <= p110) AND (1 <= p152)) OR ((1 <= p113) AND (1 <= p123)) OR ((1 <= p113) AND (1 <= p122)) OR ((1 <= p113) AND (1 <= p121)) OR ((1 <= p113) AND (1 <= p120)) OR ((1 <= p113) AND (1 <= p119)) OR ((1 <= p113) AND (1 <= p118)) OR ((1 <= p113) AND (1 <= p117)) OR ((1 <= p110) AND (1 <= p155)) OR ((1 <= p110) AND (1 <= p154)) OR ((1 <= p110) AND (1 <= p156)) OR ((1 <= p112) AND (1 <= p126)) OR ((1 <= p112) AND (1 <= p133)) OR ((1 <= p112) AND (1 <= p135)) OR ((1 <= p111) AND (1 <= p150)) OR ((1 <= p112) AND (1 <= p134)) OR ((1 <= p111) AND (1 <= p149)) OR ((1 <= p112) AND (1 <= p137)) OR ((1 <= p112) AND (1 <= p136)) OR ((1 <= p112) AND (1 <= p139)) OR ((1 <= p112) AND (1 <= p138)) OR ((1 <= p112) AND (1 <= p140))))))) : A (G ((((p65 <= 0) AND (p64 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p68 <= 0) AND (p71 <= 0) AND (p70 <= 0) AND (p73 <= 0) AND (p72 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p81 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p91 <= 0) AND (p90 <= 0) AND (p93 <= 0) AND (p92 <= 0) AND (p95 <= 0) AND (p94 <= 0) AND (p97 <= 0) AND (p96 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p101 <= 0) AND (p100 <= 0) AND (p103 <= 0) AND (p106 <= 0) AND (p104 <= 0) AND (p107 <= 0) AND (p105 <= 0) AND (p108 <= 0) AND (p57 <= 0) AND (p61 <= 0) AND (p63 <= 0) AND (p62 <= 0)) OR (((p114 <= 0) OR (p237 <= 0)) AND ((p102 <= 0) OR (p241 <= 0)) AND ((p116 <= 0) OR (p238 <= 0)) AND ((p115 <= 0) OR (p239 <= 0)))))) : ((A (X (((1 <= p195) OR (1 <= p194) OR (1 <= p199) OR (1 <= p198) OR (1 <= p196) OR (1 <= p203) OR (1 <= p202) OR (1 <= p200) OR (1 <= p204) OR (1 <= p214) OR (1 <= p213) OR (1 <= p218) OR (1 <= p217) OR (1 <= p158) OR (1 <= p159) OR (1 <= p220) OR (1 <= p162) OR (1 <= p163) OR (1 <= p160) OR (1 <= p164) OR (1 <= p174) OR (1 <= p173) OR (1 <= p178) OR (1 <= p177) OR (1 <= p176) OR (1 <= p183) OR (1 <= p182) OR (1 <= p181) OR (1 <= p180) OR (1 <= p186) OR (1 <= p185) OR (1 <= p184) OR (1 <= p191) OR (1 <= p190) OR (1 <= p189) OR (1 <= p188)))) OR E (G ((((p65 <= 0) AND (p64 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p68 <= 0) AND (p71 <= 0) AND (p70 <= 0) AND (p73 <= 0) AND (p72 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p81 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p91 <= 0) AND (p90 <= 0) AND (p93 <= 0) AND (p92 <= 0) AND (p95 <= 0) AND (p94 <= 0) AND (p97 <= 0) AND (p96 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p101 <= 0) AND (p100 <= 0) AND (p103 <= 0) AND (p106 <= 0) AND (p104 <= 0) AND (p107 <= 0) AND (p105 <= 0) AND (p108 <= 0) AND (p57 <= 0) AND (p61 <= 0) AND (p63 <= 0) AND (p62 <= 0)) OR ((1 <= p114) AND (1 <= p237)) OR ((1 <= p102) AND (1 <= p241)) OR ((1 <= p116) AND (1 <= p238)) OR ((1 <= p115) AND (1 <= p239)))))) OR ((((1 <= p166) AND (1 <= p212)) OR ((1 <= p148) AND (1 <= p235)) OR ((1 <= p170) AND (1 <= p205)) OR ((1 <= p147) AND (1 <= p216)) OR ((1 <= p146) AND (1 <= p211)) OR ((1 <= p172) AND (1 <= p234)) OR ((1 <= p170) AND (1 <= p210)) OR ((1 <= p170) AND (1 <= p208)) OR ((1 <= p147) AND (1 <= p211)) OR ((1 <= p168) AND (1 <= p235)) OR ((1 <= p146) AND (1 <= p216)) OR ((1 <= p166) AND (1 <= p209)) OR ((1 <= p145) AND (1 <= p206)) OR ((1 <= p166) AND (1 <= p207)) OR ((1 <= p147) AND (1 <= p206)) OR ((1 <= p148) AND (1 <= p212)) OR ((1 <= p171) AND (1 <= p234)) OR ((1 <= p165) AND (1 <= p208)) OR ((1 <= p167) AND (1 <= p235)) OR ((1 <= p144) AND (1 <= p206)) OR ((1 <= p146) AND (1 <= p236)) OR ((1 <= p148) AND (1 <= p207)) OR ((1 <= p165) AND (1 <= p205)) OR ((1 <= p168) AND (1 <= p207)) OR ((1 <= p165) AND (1 <= p234)) OR ((1 <= p144) AND (1 <= p211)) OR ((1 <= p145) AND (1 <= p236)) OR ((1 <= p172) AND (1 <= p208)) OR ((1 <= p172) AND (1 <= p210)) OR ((1 <= p168) AND (1 <= p209)) OR ((1 <= p167) AND (1 <= p209)) OR ((1 <= p167) AND (1 <= p212)) OR ((1 <= p144) AND (1 <= p236)) OR ((1 <= p145) AND (1 <= p216)) OR ((1 <= p171) AND (1 <= p205)) OR ((1 <= p171) AND (1 <= p210))) AND ((((p170 <= 0) OR (p234 <= 0)) AND ((p146 <= 0) OR (p206 <= 0)) AND ((p145 <= 0) OR (p211 <= 0)) AND ((p148 <= 0) OR (p209 <= 0)) AND ((p171 <= 0) OR (p208 <= 0)) AND ((p172 <= 0) OR (p205 <= 0)) AND ((p165 <= 0) OR (p210 <= 0)) AND ((p168 <= 0) OR (p212 <= 0)) AND ((p166 <= 0) OR (p235 <= 0)) AND ((p144 <= 0) OR (p216 <= 0)) AND ((p167 <= 0) OR (p207 <= 0)) AND ((p147 <= 0) OR (p236 <= 0))) OR (((p211 <= 0) OR (p227 <= 0)) AND ((p216 <= 0) OR (p228 <= 0)) AND ((p211 <= 0) OR (p228 <= 0)) AND ((p216 <= 0) OR (p229 <= 0)) AND ((p211 <= 0) OR (p226 <= 0)) AND ((p221 <= 0) OR (p234 <= 0)) AND ((p216 <= 0) OR (p226 <= 0)) AND ((p216 <= 0) OR (p227 <= 0)) AND ((p226 <= 0) OR (p236 <= 0)) AND ((p208 <= 0) OR (p243 <= 0)) AND ((p210 <= 0) OR (p221 <= 0)) AND ((p208 <= 0) OR (p242 <= 0)) AND ((p208 <= 0) OR (p240 <= 0)) AND ((p205 <= 0) OR (p221 <= 0)) AND ((p207 <= 0) OR (p225 <= 0)) AND ((p211 <= 0) OR (p229 <= 0)) AND ((p207 <= 0) OR (p222 <= 0)) AND ((p207 <= 0) OR (p224 <= 0)) AND ((p207 <= 0) OR (p223 <= 0)) AND ((p223 <= 0) OR (p235 <= 0)) AND ((p222 <= 0) OR (p235 <= 0)) AND ((p227 <= 0) OR (p236 <= 0)) AND ((p206 <= 0) OR (p229 <= 0)) AND ((p205 <= 0) OR (p240 <= 0)) AND ((p206 <= 0) OR (p228 <= 0)) AND ((p206 <= 0) OR (p227 <= 0)) AND ((p205 <= 0) OR (p242 <= 0)) AND ((p206 <= 0) OR (p226 <= 0)) AND ((p234 <= 0) OR (p240 <= 0)) AND ((p205 <= 0) OR (p243 <= 0)) AND ((p229 <= 0) OR (p236 <= 0)) AND ((p234 <= 0) OR (p242 <= 0)) AND ((p208 <= 0) OR (p221 <= 0)) AND ((p224 <= 0) OR (p235 <= 0)) AND ((p234 <= 0) OR (p243 <= 0)) AND ((p209 <= 0) OR (p224 <= 0)) AND ((p209 <= 0) OR (p223 <= 0)) AND ((p210 <= 0) OR (p240 <= 0)) AND ((p209 <= 0) OR (p225 <= 0)) AND ((p210 <= 0) OR (p242 <= 0)) AND ((p210 <= 0) OR (p243 <= 0)) AND ((p212 <= 0) OR (p224 <= 0)) AND ((p212 <= 0) OR (p225 <= 0)) AND ((p228 <= 0) OR (p236 <= 0)) AND ((p212 <= 0) OR (p222 <= 0)) AND ((p209 <= 0) OR (p222 <= 0)) AND ((p225 <= 0) OR (p235 <= 0)) AND ((p212 <= 0) OR (p223 <= 0)))) AND ((1 <= p53) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR ((1 <= p111) AND (1 <= p132)) OR ((1 <= p111) AND (1 <= p131)) OR ((1 <= p111) AND (1 <= p130)) OR ((1 <= p111) AND (1 <= p129)) OR ((1 <= p109) AND (1 <= p113)) OR ((1 <= p110) AND (1 <= p143)) OR ((1 <= p110) AND (1 <= p142)) OR ((1 <= p111) AND (1 <= p128)) OR ((1 <= p111) AND (1 <= p127)) OR ((1 <= p110) AND (1 <= p141)) OR ((1 <= p111) AND (1 <= p125)) OR ((1 <= p110) AND (1 <= p151)) OR ((1 <= p110) AND (1 <= p153)) OR ((1 <= p113) AND (1 <= p124)) OR ((1 <= p110) AND (1 <= p152)) OR ((1 <= p113) AND (1 <= p123)) OR ((1 <= p113) AND (1 <= p122)) OR ((1 <= p113) AND (1 <= p121)) OR ((1 <= p113) AND (1 <= p120)) OR ((1 <= p113) AND (1 <= p119)) OR ((1 <= p113) AND (1 <= p118)) OR ((1 <= p113) AND (1 <= p117)) OR ((1 <= p110) AND (1 <= p155)) OR ((1 <= p110) AND (1 <= p154)) OR ((1 <= p110) AND (1 <= p156)) OR ((1 <= p112) AND (1 <= p126)) OR ((1 <= p112) AND (1 <= p133)) OR ((1 <= p112) AND (1 <= p135)) OR ((1 <= p111) AND (1 <= p150)) OR ((1 <= p112) AND (1 <= p134)) OR ((1 <= p111) AND (1 <= p149)) OR ((1 <= p112) AND (1 <= p137)) OR ((1 <= p112) AND (1 <= p136)) OR ((1 <= p112) AND (1 <= p139)) OR ((1 <= p112) AND (1 <= p138)) OR ((1 <= p112) AND (1 <= p140))))) : A (G (((p164 <= 0) OR E (X (((p116 <= 0) OR (p135 <= 0))))))) : (E (F (A (((1 <= p10) U ((1 <= p167) AND (1 <= p235)))))) OR A (X ((((1 <= p205) AND (1 <= p243)) AND E (F (((1 <= p112) AND (1 <= p135)))))))) : A (F (E (F (((1 <= p74) AND (1 <= p212) AND (1 <= p225)))))) : A (G (((p201 <= 0) AND ((p111 <= 0) OR (p129 <= 0)) AND ((p115 <= 0) OR (p239 <= 0)) AND ((p50 <= 0) OR (p115 <= 0) OR (p149 <= 0) OR (p177 <= 0) OR (p234 <= 0) OR (p240 <= 0))))) : (E (G (((1 <= p228) AND (1 <= p236) AND ((1 <= p203) OR (1 <= p12) OR ((1 <= p145) AND (1 <= p206) AND (1 <= p168) AND (1 <= p212)))))) OR (((NOT(A (F (((1 <= p146) AND (1 <= p206))))) AND E (F ((((1 <= p114) AND (1 <= p143)) OR ((1 <= p166) AND (1 <= p209)))))) AND NOT(A (F (((1 <= p167) AND (1 <= p209)))))) AND ((p116 <= 0) OR (p137 <= 0)))) : E (F ((A (X (((1 <= p212) AND (1 <= p223)))) OR ((1 <= p19) AND A (G (((1 <= p209) AND (1 <= p222)))))))) : E (((((p89 <= 0) AND ((p112 <= 0) OR (p134 <= 0))) OR ((p180 <= 0) AND (p103 <= 0))) U (1 <= p219))) : (E (((((p110 <= 0) OR (p151 <= 0)) AND ((p102 <= 0) OR (p122 <= 0))) U ((1 <= p113) AND (1 <= p117)))) AND ((p112 <= 0) OR (p140 <= 0)))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:440
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((1 <= p195) OR (1 <= p194) OR (1 <= p199) OR (1 <= p198) OR (1 <= p196) OR (1 <= p203) OR (1 <= p202) OR (1 <= p200) OR (1 <= p204) OR (1 <= p214) OR (1 <= p213) OR (1 <= p218) OR (1 <= p217) OR (1 <= p158) OR (1 <= p159) OR (1 <= p220) OR (1 <= p162) OR (1 <= p163) OR (1 <= p160) OR (1 <= p164) OR (1 <= p174) OR (1 <= p173) OR (1 <= p178) OR (1 <= p177) OR (1 <= p1... (shortened)
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 <= p166) AND (1 <= p212)) OR ((1 <= p148) AND (1 <= p235)) OR ((1 <= p170) AND (1 <= p205)) OR ((1 <= p147) AND (1 <= p216)) OR ((1 <= p146) AND (1 <= p211)) OR ((1 <= p172) AND (1 <= p234)) OR ((1 <= p170) AND (1 <= p210)) OR ((1 <= p170) AND (1 <= p208)) OR ((1 <= p147) AND (1 <= p211)) OR ((1 <= p168) AND (1 <= p235)) OR ((1 <= p146) AND (1 <= p216)) OR ((1 <= p166) AND (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((1 <= p166) AND (1 <= p212)) OR ((1 <= p148) AND (1 <= p235)) OR ((1 <= p170) AND (1 <= p205)) OR ((1 <= p147) AND (1 <= p216)) OR ((1 <= p146) AND (1 <= p211)) OR ((1 <= p172) AND (1 <= p234)) OR ((1 <= p170) AND (1 <= p210)) OR ((1 <= p170) AND (1 <= p208)) OR ((1 <= p147) AND (1 <= p211)) OR ((1 <= p168) AND (1 <= p235)) OR ((1 <= p146) AND (1 <= p216)) OR ((1 <= p166) AND (1 <= p... (shortened)
lola: processed formula length: 4555
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 268 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 (G ((((p65 <= 0) AND (p64 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p68 <= 0) AND (p71 <= 0) AND (p70 <= 0) AND (p73 <= 0) AND (p72 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p81 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p65 <= 0) AND (p64 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p68 <= 0) AND (p71 <= 0) AND (p70 <= 0) AND (p73 <= 0) AND (p72 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p81 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p... (shortened)
lola: processed formula length: 871
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78) OR (1 <= p81) OR (1 <= p80) OR (1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR (1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p101) OR (1 <= p100) OR (1 <= p103) OR (1 <= p106) OR (1 <= p104) OR (1 <= p107) OR (1 <= p105) OR (1 <= p108) OR (1 <= p57) OR (1 <= p61) OR (1 <= p63) OR (1 <= p62)) AND ((p114 <= 0) OR (p237 <= 0)) AND ((p102 <= 0) OR (p241 <= 0)) AND ((p116 <= 0) OR (p238 <= 0)) AND ((p115 <= 0) OR (p239 <= 0)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 36 markings, 36 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3840 literals and 768 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
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: A (G (((p164 <= 0) OR E (X (((p116 <= 0) OR (p135 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
sara: try reading problem file CTLFireability-0.sara.
lola: processed formula: AG(((p164 <= 0) OR EX(((p116 <= 0) OR (p135 <= 0)))))
lola: processed formula length: 54
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: 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).
sara: place or transition ordering is non-deterministic
lola: 420273 markings, 1680968 edges, 84055 markings/sec, 0 secs
lola: 830902 markings, 3323377 edges, 82126 markings/sec, 5 secs
lola: 1107529 markings, 4429833 edges, 55325 markings/sec, 10 secs
lola: 1413799 markings, 5655018 edges, 61254 markings/sec, 15 secs
lola: 1692154 markings, 6768399 edges, 55671 markings/sec, 20 secs
lola: 1993274 markings, 7972863 edges, 60224 markings/sec, 25 secs
lola: 2350068 markings, 9400012 edges, 71359 markings/sec, 30 secs
lola: 2762755 markings, 11050888 edges, 82537 markings/sec, 35 secs
lola: 3054401 markings, 12217484 edges, 58329 markings/sec, 40 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3407946 markings, 13631784 edges
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (((1 <= p10) U ((1 <= p167) AND (1 <= p235)))))) OR (A (X (((1 <= p205) AND (1 <= p243)))) AND A (X (E (F (((1 <= p112) AND (1 <= p135))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (((1 <= p10) U ((1 <= p167) AND (1 <= p235))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(A((1 <= p10) U ((1 <= p167) AND (1 <= p235))))
lola: processed formula length: 49
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 38937 markings, 194208 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (X (((1 <= p212) AND (1 <= p223)))))) OR E (F (((1 <= p19) AND A (G (((1 <= p209) AND (1 <= p222))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p19) AND A (G (((1 <= p209) AND (1 <= p222)))))))
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 <= p19) AND AG(((1 <= p209) AND (1 <= p222)))))
lola: processed formula length: 54
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: 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: 470460 markings, 1884237 edges, 94092 markings/sec, 0 secs
lola: 932524 markings, 3732439 edges, 92413 markings/sec, 5 secs
lola: 1271431 markings, 5087850 edges, 67781 markings/sec, 10 secs
lola: 1536593 markings, 6148721 edges, 53032 markings/sec, 15 secs
lola: 1833182 markings, 7335037 edges, 59318 markings/sec, 20 secs
lola: 2155911 markings, 8625994 edges, 64546 markings/sec, 25 secs
lola: 2418234 markings, 9675282 edges, 52465 markings/sec, 30 secs
lola: 2780796 markings, 11125564 edges, 72512 markings/sec, 35 secs
lola: 3197695 markings, 12793215 edges, 83380 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3407946 markings, 13634352 edges
lola: ========================================
lola: subprocess 4 will run for 288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p212) AND (1 <= p223))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((1 <= p212) AND (1 <= p223))))
lola: processed formula length: 37
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: 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: 462531 markings, 1850023 edges, 92506 markings/sec, 0 secs
lola: 891304 markings, 3564960 edges, 85755 markings/sec, 5 secs
lola: 1310334 markings, 5241061 edges, 83806 markings/sec, 10 secs
lola: 1643253 markings, 6572826 edges, 66584 markings/sec, 15 secs
lola: 1993156 markings, 7972388 edges, 69981 markings/sec, 20 secs
lola: 2404730 markings, 9618700 edges, 82315 markings/sec, 25 secs
lola: 2759373 markings, 11037256 edges, 70929 markings/sec, 30 secs
lola: 3122869 markings, 12491369 edges, 72699 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3407946 markings, 13631784 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p74) AND (1 <= p212) AND (1 <= p225))))
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 <= p74) AND (1 <= p212) AND (1 <= p225))))
lola: processed formula length: 52
lola: 21 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 <= p74) AND (1 <= p212) AND (1 <= p225))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 5 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p201 <= 0) AND ((p111 <= 0) OR (p129 <= 0)) AND ((p115 <= 0) OR (p239 <= 0)) AND ((p50 <= 0) OR (p115 <= 0) OR (p149 <= 0) OR (p177 <= 0) OR (p234 <= 0) OR (p240 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p201 <= 0) AND ((p111 <= 0) OR (p129 <= 0)) AND ((p115 <= 0) OR (p239 <= 0)) AND ((p50 <= 0) OR (p115 <= 0) OR (p149 <= 0) OR (p177 <= 0) OR (p234 <= 0) OR (p240 <= 0)))))
lola: processed formula length: 186
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p201) OR ((1 <= p111) AND (1 <= p129)) OR ((1 <= p115) AND (1 <= p239)) OR ((1 <= p50) AND (1 <= p115) AND (1 <= p149) AND (1 <= p177) AND (1 <= p234) AND (1 <= p240)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 11 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 6 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p65 <= 0) AND (p64 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p68 <= 0) AND (p71 <= 0) AND (p70 <= 0) AND (p73 <= 0) AND (p72 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p81 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p... (shortened)
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 ((((p65 <= 0) AND (p64 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p68 <= 0) AND (p71 <= 0) AND (p70 <= 0) AND (p73 <= 0) AND (p72 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p81 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p... (shortened)
lola: processed formula length: 873
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)
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31 markings, 30 edges
lola: formula 0: (((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78) OR (1 <= p81) OR (1 <= p80) OR (1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR (1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p98) OR (1 <= p101) OR (1 <= p100) OR (1 <= p103) OR (1 <= p106) OR (1 <= p104) OR (1 <= p107) OR (1 <= p105) OR (1 <= p108) OR (1 <= p57) OR (1 <= p61) OR (1 <= p63) OR (1 <= p62)) AND (((1 <= p114) AND (1 <= p237)) OR ((1 <= p102) AND (1 <= p241)) OR ((1 <= p116) AND (1 <= p238)) OR ((1 <= p115) AND (1 <= p239))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 576 literals and 192 conjunctive subformulas
lola: ========================================
lola: subprocess 7 will run for 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p179 <= 0) AND (p193 <= 0) AND (p161 <= 0) AND (p192 <= 0) AND (p215 <= 0) AND (p197 <= 0) AND (p219 <= 0) AND (p187 <= 0) AND (p201 <= 0) AND (p169 <= 0) AND (p175 <= 0) AND (p157 <= 0) AND (((1 <= p110) AND (1 <= p230)) OR ((1 <= p111) AND (1 <= p231)) OR ((1 <= p112) AND (1 <= p232)) OR ((1 <= p113) AND (1 <= p233))))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p179) OR (1 <= p193) OR (1 <= p161) OR (1 <= p192) OR (1 <= p215) OR (1 <= p197) OR (1 <= p219) OR (1 <= p187) OR (1 <= p201) OR (1 <= p169) OR (1 <= p175) OR (1 <= p157) OR (((p110 <= 0) OR (p230 <= 0)) AND ((p111 <= 0) OR (p231 <= 0)) AND ((p112 <= 0) OR (p232 <= 0)) AND ((p113 <= 0) OR (p233 <= 0))))
lola: processed formula length: 327
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p179) OR (1 <= p193) OR (1 <= p161) OR (1 <= p192) OR (1 <= p215) OR (1 <= p197) OR (1 <= p219) OR (1 <= p187) OR (1 <= p201) OR (1 <= p169) OR (1 <= p175) OR (1 <= p157) OR (((p110 <= 0) OR (p230 <= 0)) AND ((p111 <= 0) OR (p231 <= 0)) AND ((p112 <= 0) OR (p232 <= 0)) AND ((p113 <= 0) OR (p233 <= 0))))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 76 literals and 28 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-1.sara.
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: ((p179 <= 0) AND (p193 <= 0) AND (p161 <= 0) AND (p192 <= 0) AND (p215 <= 0) AND (p197 <= 0) AND (p219 <= 0) AND (p187 <= 0) AND (p201 <= 0) AND (p169 <= 0) AND (p175 <= 0) AND (p157 <= 0) AND (((1 <= p110) AND (1 <= p230)) OR ((1 <= p111) AND (1 <= p231)) OR ((1 <= p112) AND (1 <= p232)) OR ((1 <= p113) AND (1 <= p233))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 56 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 328213 markings, 1287297 edges, 65643 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 697732 markings, 2738209 edges, 73904 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1079180 markings, 4222528 edges, 76290 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 1398574 markings, 5473118 edges, 63879 markings/sec, 15 secs
sara: warning, failure of lp_solve (at job 6912)
lola: sara is running 20 secs || sara is running 20 secs || 1653119 markings, 6463439 edges, 50909 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 1984614 markings, 7755707 edges, 66299 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 2345916 markings, 9164006 edges, 72260 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 2694974 markings, 10525665 edges, 69812 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 3025289 markings, 11812417 edges, 66063 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 3217323 markings, 12560068 edges
lola: ========================================
lola: subprocess 8 will run for 421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((1 <= p166) AND (1 <= p212)) OR ((1 <= p148) AND (1 <= p235)) OR ((1 <= p170) AND (1 <= p205)) OR ((1 <= p147) AND (1 <= p216)) OR ((1 <= p146) AND (1 <= p211)) OR ((1 <= p172) AND (1 <= p234)) OR ((1 <= p170) AND (1 <= p210)) OR ((1 <= p170) AND (1 <= p208)) OR ((1 <= p147) AND (1 <= p211)) OR ((1 <= p168) AND (1 <= p235)) OR ((1 <= p146) AND (1 <= p216)) OR ((1 <= p166) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p166 <= 0) OR (p212 <= 0)) AND ((p148 <= 0) OR (p235 <= 0)) AND ((p170 <= 0) OR (p205 <= 0)) AND ((p147 <= 0) OR (p216 <= 0)) AND ((p146 <= 0) OR (p211 <= 0)) AND ((p172 <= 0) OR (p234 <= 0)) AND ((p170 <= 0) OR (p210 <= 0)) AND ((p170 <= 0) OR (p208 <= 0)) AND ((p147 <= 0) OR (p211 <= 0)) AND ((p168 <= 0) OR (p235 <= 0)) AND ((p146 <= 0) OR (p216 <= 0)) AND ((p166 <= 0) OR (p209 <=... (shortened)
lola: processed formula length: 1221
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p166 <= 0) OR (p212 <= 0)) AND ((p148 <= 0) OR (p235 <= 0)) AND ((p170 <= 0) OR (p205 <= 0)) AND ((p147 <= 0) OR (p216 <= 0)) AND ((p146 <= 0) OR (p211 <= 0)) AND ((p172 <= 0) OR (p234 <= 0)) AND ((p170 <= 0) OR (p210 <= 0)) AND ((p170 <= 0) OR (p208 <= 0)) AND ((p147 <= 0) OR (p211 <= 0)) AND ((p168 <= 0) OR (p235 <= 0)) AND ((p146 <= 0) OR (p216 <= 0)) AND ((p166 <= 0) OR (p209 <= 0)) AND ((p145 <= 0) OR (p206 <= 0)) AND ((p166 <= 0) OR (p207 <= 0)) AND ((p147 <= 0) OR (p206 <= 0)) AND ((p148 <= 0) OR (p212 <= 0)) AND ((p171 <= 0) OR (p234 <= 0)) AND ((p165 <= 0) OR (p208 <= 0)) AND ((p167 <= 0) OR (p235 <= 0)) AND ((p144 <= 0) OR (p206 <= 0)) AND ((p146 <= 0) OR (p236 <= 0)) AND ((p148 <= 0) OR (p207 <= 0)) AND ((p165 <= 0) OR (p205 <= 0)) AND ((p168 <= 0) OR (p207 <= 0)) AND ((p165 <= 0) OR (p234 <= 0)) AND ((p144 <= 0) OR (p211 <= 0)) AND ((p145 <= 0) OR (p236 <= 0)) AND ((p172 <= 0) OR (p208 <= 0)) AND ((p172 <= 0) OR (p210 <= 0)) AND ((p168 <= 0) OR (p209 <= 0)) AND ((p167 <= 0) OR (p209 <= 0)) AND ((p167 <= 0) OR (p212 <= 0)) AND ((p144 <= 0) OR (p236 <= 0)) AND ((p145 <= 0) OR (p216 <= 0)) AND ((p171 <= 0) OR (p205 <= 0)) AND ((p171 <= 0) OR (p210 <= 0)))
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 <= p166) AND (1 <= p212)) OR ((1 <= p148) AND (1 <= p235)) OR ((1 <= p170) AND (1 <= p205)) OR ((1 <= p147) AND (1 <= p216)) OR ((1 <= p146) AND (1 <= p211)) OR ((1 <= p172) AND (1 <= p234)) OR ((1 <= p170) AND (1 <= p210)) OR ((1 <= p170) AND (1 <= p208)) OR ((1 <= p147) AND (1 <= p211)) OR ((1 <= p168) AND (1 <= p235)) OR ((1 <= p146) AND (1 <= p216)) OR ((1 <= p166) AND (1 <= p209)) OR ((1 <= p145) AND (1 <= p206)) OR ((1 <= p166) AND (1 <= p207)) OR ((1 <= p147) AND (1 <= p206)) OR ((1 <= p148) AND (1 <= p212)) OR ((1 <= p171) AND (1 <= p234)) OR ((1 <= p165) AND (1 <= p208)) OR ((1 <= p167) AND (1 <= p235)) OR ((1 <= p144) AND (1 <= p206)) OR ((1 <= p146) AND (1 <= p236)) OR ((1 <= p148) AND (1 <= p207)) OR ((1 <= p165) AND (1 <= p205)) OR ((1 <= p168) AND (1 <= p207)) OR ((1 <= p165) AND (1 <= p234)) OR ((1 <= p144) AND (1 <= p211)) OR ((1 <= p145) AND (1 <= p236)) OR ((1 <= p172) AND (1 <= p208)) OR ((1 <= p172) AND (1 <= p210)) OR ((1 <= p168) AND (1 <= p209)) OR ((1 <= p167) AND (1 <= p209)) OR ((1 <= p167) AND (1 <= p212)) OR ((1 <= p144) AND (1 <= p236)) OR ((1 <= p145) AND (1 <= p216)) OR ((1 <= p171) AND (1 <= p205)) OR ((1 <= p171) AND (1 <= p210)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 72 literals and 36 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || sara not yet started (preprocessing) || 233981 markings, 847065 edges, 46796 markings/sec, 0 secs
lola: sara is running 5 secs || sara not yet started (preprocessing) || 516955 markings, 1909240 edges, 56595 markings/sec, 5 secs
lola: sara is running 10 secs || sara not yet started (preprocessing) || 799452 markings, 2951227 edges, 56499 markings/sec, 10 secs
lola: state equation task get result unparse finished id 1
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara is running 15 secs || sara not yet started (preprocessing) || 1103169 markings, 4097175 edges, 60743 markings/sec, 15 secs
lola: sara is running 20 secs || sara not yet started (preprocessing) || 1360247 markings, 5044627 edges, 51416 markings/sec, 20 secs
lola: sara is running 25 secs || sara not yet started (preprocessing) || 1644042 markings, 6130140 edges, 56759 markings/sec, 25 secs
lola: sara is running 30 secs || sara not yet started (preprocessing) || 1870007 markings, 6976417 edges, 45193 markings/sec, 30 secs
lola: sara is running 35 secs || sara not yet started (preprocessing) || 2064333 markings, 7699934 edges, 38865 markings/sec, 35 secs
lola: sara is running 40 secs || sara not yet started (preprocessing) || 2314828 markings, 8649305 edges, 50099 markings/sec, 40 secs
lola: sara is running 45 secs || sara not yet started (preprocessing) || 2553828 markings, 9560881 edges, 47800 markings/sec, 45 secs
sara: warning, failure of lp_solve (at job 10670)
lola: sara is running 50 secs || sara not yet started (preprocessing) || 2766019 markings, 10366801 edges, 42438 markings/sec, 50 secs
lola: sara is running 55 secs || sara not yet started (preprocessing) || 2981728 markings, 11189826 edges, 43142 markings/sec, 55 secs
lola: sara is running 60 secs || sara not yet started (preprocessing) || 3158698 markings, 11861413 edges, 35394 markings/sec, 60 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 3407946 markings, 12821841 edges
lola: ========================================
lola: subprocess 9 will run for 471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((1 <= p111) AND (1 <= p132)) OR ((1 <= p111) AND (1 <= p131)) OR ((1 <= p111) AND (1 <= p130)) OR ((1 <= p111) AND (1 <= p129)) OR ((1 <= p109) AND (1 <= p113)) OR ((1 <= p110) AND (1 <= p143)) OR ((1 <= p110) AND (1 <= p142)) OR ((1 <= p111) AND (1 <= p128)) OR ((1 <= p111) AND (1 <= p127)) OR ((1 <= p110) AND (1 <= p141)) OR ((1 <= p111) AND (1 <= p125)) OR ((1 <= p110) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p111 <= 0) OR (p132 <= 0)) AND ((p111 <= 0) OR (p131 <= 0)) AND ((p111 <= 0) OR (p130 <= 0)) AND ((p111 <= 0) OR (p129 <= 0)) AND ((p109 <= 0) OR (p113 <= 0)) AND ((p110 <= 0) OR (p143 <= 0)) AND ((p110 <= 0) OR (p142 <= 0)) AND ((p111 <= 0) OR (p128 <= 0)) AND ((p111 <= 0) OR (p127 <= 0)) AND ((p110 <= 0) OR (p141 <= 0)) AND ((p111 <= 0) OR (p125 <= 0)) AND ((p110 <= 0) OR (p151 <=... (shortened)
lola: processed formula length: 1221
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p111) AND (1 <= p132)) OR ((1 <= p111) AND (1 <= p131)) OR ((1 <= p111) AND (1 <= p130)) OR ((1 <= p111) AND (1 <= p129)) OR ((1 <= p109) AND (1 <= p113)) OR ((1 <= p110) AND (1 <= p143)) OR ((1 <= p110) AND (1 <= p142)) OR ((1 <= p111) AND (1 <= p128)) OR ((1 <= p111) AND (1 <= p127)) OR ((1 <= p110) AND (1 <= p141)) OR ((1 <= p111) AND (1 <= p125)) OR ((1 <= p110) AND (1 <= p151)) OR ((1 <= p110) AND (1 <= p153)) OR ((1 <= p113) AND (1 <= p124)) OR ((1 <= p110) AND (1 <= p152)) OR ((1 <= p113) AND (1 <= p123)) OR ((1 <= p113) AND (1 <= p122)) OR ((1 <= p113) AND (1 <= p121)) OR ((1 <= p113) AND (1 <= p120)) OR ((1 <= p113) AND (1 <= p119)) OR ((1 <= p113) AND (1 <= p118)) OR ((1 <= p113) AND (1 <= p117)) OR ((1 <= p110) AND (1 <= p155)) OR ((1 <= p110) AND (1 <= p154)) OR ((1 <= p110) AND (1 <= p156)) OR ((1 <= p112) AND (1 <= p126)) OR ((1 <= p112) AND (1 <= p133)) OR ((1 <= p112) AND (1 <= p135)) OR ((1 <= p111) AND (1 <= p150)) OR ((1 <= p112) AND (1 <= p134)) OR ((1 <= p111) AND (1 <= p149)) OR ((1 <= p112) AND (1 <= p137)) OR ((1 <= p112) AND (1 <= p136)) OR ((1 <= p112) AND (1 <= p139)) OR ((1 <= p112) AND (1 <= p138)) OR ((1 <= p112) AND (1 <= p140)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 72 literals and 36 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-0.sara.
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p111 <= 0) OR (p132 <= 0)) AND ((p111 <= 0) OR (p131 <= 0)) AND ((p111 <= 0) OR (p130 <= 0)) AND ((p111 <= 0) OR (p129 <= 0)) AND ((p109 <= 0) OR (p113 <= 0)) AND ((p110 <= 0) OR (p143 <= 0)) AND ((p110 <= 0) OR (p142 <= 0)) AND ((p111 <= 0) OR (p128 <= 0)) AND ((p111 <= 0) OR (p127 <= 0)) AND ((p110 <= 0) OR (p141 <= 0)) AND ((p111 <= 0) OR (p125 <= 0)) AND ((p110 <= 0) OR (p151 <= 0)) AND ((p110 <= 0) OR (p153 <= 0)) AND ((p113 <= 0) OR (p124 <= 0)) AND ((p110 <= 0) OR (p152 <= 0)) AND ((p113 <= 0) OR (p123 <= 0)) AND ((p113 <= 0) OR (p122 <= 0)) AND ((p113 <= 0) OR (p121 <= 0)) AND ((p113 <= 0) OR (p120 <= 0)) AND ((p113 <= 0) OR (p119 <= 0)) AND ((p113 <= 0) OR (p118 <= 0)) AND ((p113 <= 0) OR (p117 <= 0)) AND ((p110 <= 0) OR (p155 <= 0)) AND ((p110 <= 0) OR (p154 <= 0)) AND ((p110 <= 0) OR (p156 <= 0)) AND ((p112 <= 0) OR (p126 <= 0)) AND ((p112 <= 0) OR (p133 <= 0)) AND ((p112 <= 0) OR (p135 <= 0)) AND ((p111 <= 0) OR (p150 <= 0)) AND ((p112 <= 0) OR (p134 <= 0)) AND ((p111 <= 0) OR (p149 <= 0)) AND ((p112 <= 0) OR (p137 <= 0)) AND ((p112 <= 0) OR (p136 <= 0)) AND ((p112 <= 0) OR (p139 <= 0)) AND ((p112 <= 0) OR (p138 <= 0)) AND ((p112 <= 0) OR (p140 <= 0)))
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || sara not yet started (preprocessing) || 268007 markings, 1066708 edges, 53601 markings/sec, 0 secs
lola: sara is running 5 secs || sara not yet started (preprocessing) || 492625 markings, 1956523 edges, 44924 markings/sec, 5 secs
lola: state equation task get result unparse finished id 1
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara is running 10 secs || sara not yet started (preprocessing) || 721295 markings, 2866733 edges, 45734 markings/sec, 10 secs
lola: sara is running 15 secs || sara not yet started (preprocessing) || 1052689 markings, 4177545 edges, 66279 markings/sec, 15 secs
lola: sara is running 20 secs || sara not yet started (preprocessing) || 1294536 markings, 5139675 edges, 48369 markings/sec, 20 secs
lola: sara is running 25 secs || sara not yet started (preprocessing) || 1653624 markings, 6560277 edges, 71818 markings/sec, 25 secs
lola: sara is running 30 secs || sara not yet started (preprocessing) || 1887374 markings, 7488392 edges, 46750 markings/sec, 30 secs
lola: sara is running 35 secs || sara not yet started (preprocessing) || 2148891 markings, 8524752 edges, 52303 markings/sec, 35 secs
lola: sara is running 40 secs || sara not yet started (preprocessing) || 2361233 markings, 9364212 edges, 42468 markings/sec, 40 secs
sara: warning, failure of lp_solve (at job 6119)
lola: sara is running 45 secs || sara not yet started (preprocessing) || 2560182 markings, 10151809 edges, 39790 markings/sec, 45 secs
lola: sara is running 50 secs || sara not yet started (preprocessing) || 2781345 markings, 11025560 edges, 44233 markings/sec, 50 secs
lola: sara is running 55 secs || sara not yet started (preprocessing) || 2982720 markings, 11823299 edges, 40275 markings/sec, 55 secs
lola: sara is running 60 secs || sara not yet started (preprocessing) || 3216271 markings, 12747012 edges, 46710 markings/sec, 60 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 3404351 markings, 13491264 edges
lola: subprocess 10 will run for 538 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p195) OR (1 <= p194) OR (1 <= p199) OR (1 <= p198) OR (1 <= p196) OR (1 <= p203) OR (1 <= p202) OR (1 <= p200) OR (1 <= p204) OR (1 <= p214) OR (1 <= p213) OR (1 <= p218) OR (1 <= p217) OR (1 <= p158) OR (1 <= p159) OR (1 <= p220) OR (1 <= p162) OR (1 <= p163) OR (1 <= p160) OR (1 <= p164) OR (1 <= p174) OR (1 <= p173) OR (1 <= p178) OR (1 <= p177) OR (1 <= p17... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p195 <= 0) AND (p194 <= 0) AND (p199 <= 0) AND (p198 <= 0) AND (p196 <= 0) AND (p203 <= 0) AND (p202 <= 0) AND (p200 <= 0) AND (p204 <= 0) AND (p214 <= 0) AND (p213 <= 0) AND (p218 <= 0) AND (p217 <= 0) AND (p158 <= 0) AND (p159 <= 0) AND (p220 <= 0) AND (p162 <= 0) AND (p163 <= 0) AND (p160 <= 0) AND (p164 <= 0) AND (p174 <= 0) AND (p173 <= 0) AND (p178 <= 0) AND (p177 <= 0) AND (p176 <= 0) AND... (shortened)
lola: processed formula length: 1797
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p195) OR (1 <= p194) OR (1 <= p199) OR (1 <= p198) OR (1 <= p196) OR (1 <= p203) OR (1 <= p202) OR (1 <= p200) OR (1 <= p204) OR (1 <= p214) OR (1 <= p213) OR (1 <= p218) OR (1 <= p217) OR (1 <= p158) OR (1 <= p159) OR (1 <= p220) OR (1 <= p162) OR (1 <= p163) OR (1 <= p160) OR (1 <= p164) OR (1 <= p174) OR (1 <= p173) OR (1 <= p178) OR (1 <= p177) OR (1 <= p176) OR (1 <= p183) OR (1 <= p182) OR (1 <= p181) OR (1 <= p180) OR (1 <= p186) OR (1 <= p185) OR (1 <= p184) OR (1 <= p191) OR (1 <= p190) OR (1 <= p189) OR (1 <= p188) OR ((1 <= p166) AND (1 <= p212)) OR ((1 <= p148) AND (1 <= p235)) OR ((1 <= p170) AND (1 <= p205)) OR ((1 <= p147) AND (1 <= p216)) OR ((1 <= p146) AND (1 <= p211)) OR ((1 <= p172) AND (1 <= p234)) OR ((1 <= p170) AND (1 <= p210)) OR ((1 <= p170) AND (1 <= p208)) OR ((1 <= p147) AND (1 <= p211)) OR ((1 <= p168) AND (1 <= p235)) OR ((1 <= p146) AND (1 <= p216)) OR ((1 <= p166) AND (1 <= p209)) OR ((1 <= p145) AND (1 <= p206)) OR ((1 <= p166) AND (1 <= p207)) OR ((1 <= p147) AND (1 <= p206)) OR ((1 <= p148) AND (1 <= p212)) OR ((1 <= p171) AND (1 <= p234)) OR ((1 <= p165) AND (1 <= p208)) OR ((1 <= p167) AND (1 <= p235)) OR ((1 <= p144) AND (1 <= p206)) OR ((1 <= p146) AND (1 <= p236)) OR ((1 <= p148) AND (1 <= p207)) OR ((1 <= p165) AND (1 <= p205)) OR ((1 <= p168) AND (1 <= p207)) OR ((1 <= p165) AND (1 <= p234)) OR ((1 <= p144) AND (1 <= p211)) OR ((1 <= p145) AND (1 <= p236)) OR ((1 <= p172) AND (1 <= p208)) OR ((1 <= p172) AND (1 <= p210)) OR ((1 <= p168) AND (1 <= p209)) OR ((1 <= p167) AND (1 <= p209)) OR ((1 <= p167) AND (1 <= p212)) OR ((1 <= p144) AND (1 <= p236)) OR ((1 <= p145) AND (1 <= p216)) OR ((1 <= p171) AND (1 <= p205)) OR ((1 <= p171) AND (1 <= p210)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 108 literals and 72 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 312 markings, 574 edges
lola: state equation: write sara problem file to CTLFireability-10-0.sara
lola: subprocess 11 will run for 646 seconds at most (--localtimelimit=0)
lola: ========================================
lola: state equation: calling and running sara
lola: ...considering subproblem: E (F ((A (G ((((p170 <= 0) OR (p234 <= 0)) AND ((p146 <= 0) OR (p206 <= 0)) AND ((p145 <= 0) OR (p211 <= 0)) AND ((p148 <= 0) OR (p209 <= 0)) AND ((p171 <= 0) OR (p208 <= 0)) AND ((p172 <= 0) OR (p205 <= 0)) AND ((p165 <= 0) OR (p210 <= 0)) AND ((p168 <= 0) OR (p212 <= 0)) AND ((p166 <= 0) OR (p235 <= 0)) AND ((p144 <= 0) OR (p216 <= 0)) AND ((p167 <= 0) OR (p207 <= 0)) AND ((p147 <= 0)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
sara: try reading problem file CTLFireability-10-0.sara.
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: processed formula: EF((AG((((p170 <= 0) OR (p234 <= 0)) AND ((p146 <= 0) OR (p206 <= 0)) AND ((p145 <= 0) OR (p211 <= 0)) AND ((p148 <= 0) OR (p209 <= 0)) AND ((p171 <= 0) OR (p208 <= 0)) AND ((p172 <= 0) OR (p205 <= 0)) AND ((p165 <= 0) OR (p210 <= 0)) AND ((p168 <= 0) OR (p212 <= 0)) AND ((p166 <= 0) OR (p235 <= 0)) AND ((p144 <= 0) OR (p216 <= 0)) AND ((p167 <= 0) OR (p207 <= 0)) AND ((p147 <= 0) OR (... (shortened)
lola: processed formula length: 2049
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: 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: 242098 markings, 1356075 edges, 48420 markings/sec, 0 secs
lola: 462155 markings, 2612282 edges, 44011 markings/sec, 5 secs
lola: 651636 markings, 3685772 edges, 37896 markings/sec, 10 secs
lola: 776410 markings, 4395611 edges, 24955 markings/sec, 15 secs
lola: 947219 markings, 5380504 edges, 34162 markings/sec, 20 secs
lola: 1138837 markings, 6470504 edges, 38324 markings/sec, 25 secs
lola: 1372349 markings, 7806078 edges, 46702 markings/sec, 30 secs
lola: 1628704 markings, 9277896 edges, 51271 markings/sec, 35 secs
lola: 1921592 markings, 10944557 edges, 58578 markings/sec, 40 secs
lola: 2079945 markings, 11852733 edges, 31671 markings/sec, 45 secs
lola: 2279057 markings, 12996789 edges, 39822 markings/sec, 50 secs
lola: 2484406 markings, 14178616 edges, 41070 markings/sec, 55 secs
lola: 2625227 markings, 14989713 edges, 28164 markings/sec, 60 secs
lola: 2819396 markings, 16103880 edges, 38834 markings/sec, 65 secs
lola: 3105921 markings, 17750691 edges, 57305 markings/sec, 70 secs
lola: 3342236 markings, 19109936 edges, 47263 markings/sec, 75 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3407946 markings, 19488947 edges
lola: ========================================
lola: subprocess 12 will run for 787 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (G (((p179 <= 0) AND (p193 <= 0) AND (p161 <= 0) AND (p192 <= 0) AND (p215 <= 0) AND (p197 <= 0) AND (p219 <= 0) AND (p187 <= 0) AND (p201 <= 0) AND (p169 <= 0) AND (p175 <= 0) AND (p157 <= 0)))) U (A (F (((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p7... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EG(((p179 <= 0) AND (p193 <= 0) AND (p161 <= 0) AND (p192 <= 0) AND (p215 <= 0) AND (p197 <= 0) AND (p219 <= 0) AND (p187 <= 0) AND (p201 <= 0) AND (p169 <= 0) AND (p175 <= 0) AND (p157 <= 0))) U (AF(((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1... (shortened)
lola: processed formula length: 1660
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 489 markings, 1044 edges
lola: ========================================
lola: subprocess 13 will run for 1049 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((p89 <= 0) AND ((p112 <= 0) OR (p134 <= 0))) OR ((p180 <= 0) AND (p103 <= 0))) U (1 <= p219)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((((p89 <= 0) AND ((p112 <= 0) OR (p134 <= 0))) OR ((p180 <= 0) AND (p103 <= 0))) U (1 <= p219)))
lola: processed formula length: 102
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p219)
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-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-13-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 313218 markings, 1252659 edges, 62644 markings/sec, 0 secs
lola: sara is running 5 secs || 553739 markings, 2214638 edges, 48104 markings/sec, 5 secs
lola: sara is running 10 secs || 740766 markings, 2962763 edges, 37405 markings/sec, 10 secs
lola: sara is running 15 secs || 932873 markings, 3731296 edges, 38421 markings/sec, 15 secs
lola: sara is running 20 secs || 1131674 markings, 4526404 edges, 39760 markings/sec, 20 secs
lola: sara is running 25 secs || 1313143 markings, 5252219 edges, 36294 markings/sec, 25 secs
sara: warning, failure of lp_solve (at job 1059)
lola: sara is running 30 secs || 1541391 markings, 6165328 edges, 45650 markings/sec, 30 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 1637847 markings, 6551152 edges
lola: ========================================
lola: subprocess 14 will run for 1556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((((p110 <= 0) OR (p151 <= 0)) AND ((p102 <= 0) OR (p122 <= 0))) U ((1 <= p113) AND (1 <= p117)))) AND ((p112 <= 0) OR (p140 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p112 <= 0) OR (p140 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p112 <= 0) OR (p140 <= 0))
lola: processed formula length: 29
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3112 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((p110 <= 0) OR (p151 <= 0)) AND ((p102 <= 0) OR (p122 <= 0))) U ((1 <= p113) AND (1 <= p117))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((((p110 <= 0) OR (p151 <= 0)) AND ((p102 <= 0) OR (p122 <= 0))) U ((1 <= p113) AND (1 <= p117))))
lola: processed formula length: 103
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p113) AND (1 <= p117))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 2244 markings, 6877 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: lola: ========================================
state equation: calling and running sara
sara: try reading problem file CTLFireability-15-0.sara.
lola: subprocess 15 will run for 3112 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((1 <= p228) AND (1 <= p236) AND ((1 <= p203) OR (1 <= p12) OR ((1 <= p145) AND (1 <= p206) AND (1 <= p168) AND (1 <= p212)))))) OR (E (G (((p146 <= 0) OR (p206 <= 0)))) AND (E (F ((((1 <= p114) AND (1 <= p143)) OR ((1 <= p166) AND (1 <= p209))))) AND (E (G (((p167 <= 0) OR (p209 <= 0)))) AND ((p116 <= 0) OR (p137 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3112 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p116 <= 0) OR (p137 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p116 <= 0) OR (p137 <= 0))
lola: processed formula length: 29
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p146 <= 0) OR (p206 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p146 <= 0) OR (p206 <= 0))))
lola: processed formula length: 37
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
sara: place or transition ordering is non-deterministic
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 <= p146) AND (1 <= p206))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 30 markings, 30 edges
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p114) AND (1 <= p143)) OR ((1 <= p166) AND (1 <= p209)))))
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 <= p114) AND (1 <= p143)) OR ((1 <= p166) AND (1 <= p209)))))
lola: processed formula length: 73
lola: 21 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: SUBRESULT
lola: state equation task get result unparse finished++ id 0
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: formula 0: (((1 <= p114) AND (1 <= p143)) OR ((1 <= p166) AND (1 <= p209)))
lola: state equation task get result unparse finished id 0
lola: 14 markings, 13 edges
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 19 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p228) AND (1 <= p236) AND ((1 <= p203) OR (1 <= p12) OR ((1 <= p145) AND (1 <= p206) AND (1 <= p168) AND (1 <= p212))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p228) AND (1 <= p236) AND ((1 <= p203) OR (1 <= p12) OR ((1 <= p145) AND (1 <= p206) AND (1 <= p168) AND (1 <= p212))))))
lola: processed formula length: 136
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p228 <= 0) OR (p236 <= 0) OR ((p203 <= 0) AND (p12 <= 0) AND ((p145 <= 0) OR (p206 <= 0) OR (p168 <= 0) OR (p212 <= 0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 14 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G (((1 <= p228) AND (1 <= p236) AND ((1 <= p203) OR (1 <= p12) OR ((1 <= p145) AND (1 <= p206) AND (1 <= p168) AND (1 <= p212)))))) OR (E (G (((p146 <= 0) OR (p206 <= 0)))) AND (E (F ((((1 <= p114) AND (1 <= p143)) OR ((1 <= p166) AND (1 <= p209))))) AND (E (G (((p167 <= 0) OR (p209 <= 0)))) AND ((p116 <= 0) OR (p137 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p116 <= 0) OR (p137 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p116 <= 0) OR (p137 <= 0))
lola: processed formula length: 29
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (((p167 <= 0) OR (p209 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p167 <= 0) OR (p209 <= 0))))
lola: processed formula length: 37
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p167) AND (1 <= p209))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 62 markings, 62 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (((p146 <= 0) OR (p206 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p146 <= 0) OR (p206 <= 0))))
lola: processed formula length: 37
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p146) AND (1 <= p206))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 30 markings, 30 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p114) AND (1 <= p143)) OR ((1 <= p166) AND (1 <= p209)))))
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 <= p114) AND (1 <= p143)) OR ((1 <= p166) AND (1 <= p209)))))
lola: processed formula length: 73
lola: 21 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 <= p114) AND (1 <= p143)) OR ((1 <= p166) AND (1 <= p209)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no yes yes yes yes no yes no yes yes
lola:
preliminary result: no no no no yes no no yes yes yes yes no yes no yes yes
lola: memory consumption: 219868 KB
lola: time consumption: 458 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 6949388 kB
After kill :
MemTotal: 16427332 kB
MemFree: 6946112 kB

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-3"
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 Peterson-PT-3, 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 r174-csrt-158987853600716"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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