fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r174-csrt-158987853600708
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Peterson-PT-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15746.650 3600000.00 64811.00 524.80 TTTFTFTFFTTFFFTF normal

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-158987853600708.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-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853600708
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 7.0K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K 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 11K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K 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 98K 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-2-CTLFireability-00
FORMULA_NAME Peterson-PT-2-CTLFireability-01
FORMULA_NAME Peterson-PT-2-CTLFireability-02
FORMULA_NAME Peterson-PT-2-CTLFireability-03
FORMULA_NAME Peterson-PT-2-CTLFireability-04
FORMULA_NAME Peterson-PT-2-CTLFireability-05
FORMULA_NAME Peterson-PT-2-CTLFireability-06
FORMULA_NAME Peterson-PT-2-CTLFireability-07
FORMULA_NAME Peterson-PT-2-CTLFireability-08
FORMULA_NAME Peterson-PT-2-CTLFireability-09
FORMULA_NAME Peterson-PT-2-CTLFireability-10
FORMULA_NAME Peterson-PT-2-CTLFireability-11
FORMULA_NAME Peterson-PT-2-CTLFireability-12
FORMULA_NAME Peterson-PT-2-CTLFireability-13
FORMULA_NAME Peterson-PT-2-CTLFireability-14
FORMULA_NAME Peterson-PT-2-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591163743759

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:55:45] [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:55:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:55:46] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2020-06-03 05:55:46] [INFO ] Transformed 102 places.
[2020-06-03 05:55:46] [INFO ] Transformed 126 transitions.
[2020-06-03 05:55:46] [INFO ] Parsed PT model containing 102 places and 126 transitions in 145 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 335 ms. (steps per millisecond=298 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1]
[2020-06-03 05:55:46] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2020-06-03 05:55:46] [INFO ] Computed 11 place invariants in 23 ms
[2020-06-03 05:55:46] [INFO ] [Real]Absence check using 8 positive place invariants in 50 ms returned sat
[2020-06-03 05:55:46] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 4 ms returned sat
[2020-06-03 05:55:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:46] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2020-06-03 05:55:46] [INFO ] State equation strengthened by 26 read => feed constraints.
[2020-06-03 05:55:46] [INFO ] [Real]Added 26 Read/Feed constraints in 21 ms returned sat
[2020-06-03 05:55:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2020-06-03 05:55:46] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:47] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2020-06-03 05:55:47] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:55:47] [INFO ] Deduced a trap composed of 12 places in 127 ms
[2020-06-03 05:55:47] [INFO ] Deduced a trap composed of 8 places in 155 ms
[2020-06-03 05:55:47] [INFO ] Deduced a trap composed of 26 places in 117 ms
[2020-06-03 05:55:47] [INFO ] Deduced a trap composed of 29 places in 64 ms
[2020-06-03 05:55:47] [INFO ] Deduced a trap composed of 12 places in 200 ms
[2020-06-03 05:55:47] [INFO ] Deduced a trap composed of 25 places in 121 ms
[2020-06-03 05:55:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 897 ms
[2020-06-03 05:55:47] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 14 ms.
[2020-06-03 05:55:48] [INFO ] Added : 111 causal constraints over 23 iterations in 317 ms. Result :sat
[2020-06-03 05:55:48] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-03 05:55:48] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:48] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2020-06-03 05:55:48] [INFO ] [Real]Added 26 Read/Feed constraints in 22 ms returned sat
[2020-06-03 05:55:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-03 05:55:48] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 11 ms returned sat
[2020-06-03 05:55:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:48] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2020-06-03 05:55:48] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:55:48] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 9 ms.
[2020-06-03 05:55:48] [INFO ] Added : 117 causal constraints over 24 iterations in 296 ms. Result :sat
[2020-06-03 05:55:48] [INFO ] Deduced a trap composed of 11 places in 62 ms
[2020-06-03 05:55:48] [INFO ] Deduced a trap composed of 29 places in 40 ms
[2020-06-03 05:55:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2020-06-03 05:55:49] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-03 05:55:49] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:49] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2020-06-03 05:55:49] [INFO ] [Real]Added 26 Read/Feed constraints in 13 ms returned sat
[2020-06-03 05:55:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 54 ms returned sat
[2020-06-03 05:55:49] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:49] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2020-06-03 05:55:49] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:55:49] [INFO ] Deduced a trap composed of 29 places in 37 ms
[2020-06-03 05:55:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2020-06-03 05:55:49] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 10 ms.
[2020-06-03 05:55:49] [INFO ] Added : 115 causal constraints over 23 iterations in 275 ms. Result :sat
[2020-06-03 05:55:49] [INFO ] [Real]Absence check using 8 positive place invariants in 26 ms returned sat
[2020-06-03 05:55:49] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:49] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2020-06-03 05:55:49] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-06-03 05:55:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-03 05:55:49] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:49] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2020-06-03 05:55:49] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:55:49] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2020-06-03 05:55:50] [INFO ] Added : 117 causal constraints over 24 iterations in 228 ms. Result :sat
[2020-06-03 05:55:50] [INFO ] Deduced a trap composed of 11 places in 61 ms
[2020-06-03 05:55:50] [INFO ] Deduced a trap composed of 29 places in 41 ms
[2020-06-03 05:55:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2020-06-03 05:55:50] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-06-03 05:55:50] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:50] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2020-06-03 05:55:50] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-06-03 05:55:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2020-06-03 05:55:50] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:50] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2020-06-03 05:55:50] [INFO ] [Nat]Added 26 Read/Feed constraints in 8 ms returned sat
[2020-06-03 05:55:50] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 8 ms.
[2020-06-03 05:55:50] [INFO ] Added : 110 causal constraints over 23 iterations in 208 ms. Result :sat
[2020-06-03 05:55:50] [INFO ] Deduced a trap composed of 13 places in 52 ms
[2020-06-03 05:55:50] [INFO ] Deduced a trap composed of 11 places in 31 ms
[2020-06-03 05:55:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2020-06-03 05:55:50] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-03 05:55:50] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:50] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2020-06-03 05:55:51] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:55:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-03 05:55:51] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:51] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2020-06-03 05:55:51] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:55:51] [INFO ] Deduced a trap composed of 8 places in 47 ms
[2020-06-03 05:55:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2020-06-03 05:55:51] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 12 ms.
[2020-06-03 05:55:51] [INFO ] Added : 108 causal constraints over 22 iterations in 268 ms. Result :sat
[2020-06-03 05:55:51] [INFO ] Deduced a trap composed of 26 places in 40 ms
[2020-06-03 05:55:51] [INFO ] Deduced a trap composed of 31 places in 34 ms
[2020-06-03 05:55:51] [INFO ] Deduced a trap composed of 12 places in 22 ms
[2020-06-03 05:55:51] [INFO ] Deduced a trap composed of 29 places in 39 ms
[2020-06-03 05:55:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 199 ms
[2020-06-03 05:55:51] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-03 05:55:51] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:51] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2020-06-03 05:55:51] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-06-03 05:55:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-03 05:55:51] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2020-06-03 05:55:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:51] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2020-06-03 05:55:51] [INFO ] [Nat]Added 26 Read/Feed constraints in 13 ms returned sat
[2020-06-03 05:55:51] [INFO ] Deduced a trap composed of 14 places in 38 ms
[2020-06-03 05:55:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2020-06-03 05:55:51] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2020-06-03 05:55:52] [INFO ] Added : 117 causal constraints over 24 iterations in 238 ms. Result :sat
[2020-06-03 05:55:52] [INFO ] Deduced a trap composed of 25 places in 47 ms
[2020-06-03 05:55:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2020-06-03 05:55:52] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-03 05:55:52] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 10 ms returned sat
[2020-06-03 05:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:52] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2020-06-03 05:55:52] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-06-03 05:55:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-06-03 05:55:52] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:52] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2020-06-03 05:55:52] [INFO ] [Nat]Added 26 Read/Feed constraints in 15 ms returned sat
[2020-06-03 05:55:52] [INFO ] Deduced a trap composed of 29 places in 25 ms
[2020-06-03 05:55:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2020-06-03 05:55:52] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2020-06-03 05:55:52] [INFO ] Added : 109 causal constraints over 22 iterations in 304 ms. Result :sat
[2020-06-03 05:55:52] [INFO ] Deduced a trap composed of 12 places in 49 ms
[2020-06-03 05:55:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2020-06-03 05:55:52] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2020-06-03 05:55:52] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:52] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2020-06-03 05:55:52] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-06-03 05:55:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 24 ms returned sat
[2020-06-03 05:55:53] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 23 ms returned sat
[2020-06-03 05:55:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:53] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2020-06-03 05:55:53] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:55:53] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 20 ms.
[2020-06-03 05:55:53] [INFO ] Added : 117 causal constraints over 24 iterations in 302 ms. Result :sat
[2020-06-03 05:55:53] [INFO ] Deduced a trap composed of 12 places in 46 ms
[2020-06-03 05:55:53] [INFO ] Deduced a trap composed of 15 places in 51 ms
[2020-06-03 05:55:53] [INFO ] Deduced a trap composed of 22 places in 48 ms
[2020-06-03 05:55:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 197 ms
[2020-06-03 05:55:53] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-06-03 05:55:53] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 15 ms returned sat
[2020-06-03 05:55:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:53] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2020-06-03 05:55:53] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:55:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-06-03 05:55:53] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-03 05:55:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:54] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2020-06-03 05:55:54] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:55:54] [INFO ] Deduced a trap composed of 8 places in 46 ms
[2020-06-03 05:55:54] [INFO ] Deduced a trap composed of 12 places in 35 ms
[2020-06-03 05:55:54] [INFO ] Deduced a trap composed of 29 places in 43 ms
[2020-06-03 05:55:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 152 ms
[2020-06-03 05:55:54] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2020-06-03 05:55:54] [INFO ] Added : 117 causal constraints over 24 iterations in 363 ms. Result :sat
[2020-06-03 05:55:54] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-06-03 05:55:54] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2020-06-03 05:55:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:54] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2020-06-03 05:55:54] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:55:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 23 ms returned sat
[2020-06-03 05:55:54] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:54] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2020-06-03 05:55:54] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-06-03 05:55:54] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2020-06-03 05:55:55] [INFO ] Added : 116 causal constraints over 24 iterations in 195 ms. Result :sat
[2020-06-03 05:55:55] [INFO ] Deduced a trap composed of 12 places in 68 ms
[2020-06-03 05:55:55] [INFO ] Deduced a trap composed of 25 places in 29 ms
[2020-06-03 05:55:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2020-06-03 05:55:55] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-06-03 05:55:55] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:55] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2020-06-03 05:55:55] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:55:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 23 ms returned sat
[2020-06-03 05:55:55] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:55] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2020-06-03 05:55:55] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:55:55] [INFO ] Deduced a trap composed of 29 places in 23 ms
[2020-06-03 05:55:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2020-06-03 05:55:55] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2020-06-03 05:55:55] [INFO ] Added : 117 causal constraints over 24 iterations in 225 ms. Result :sat
[2020-06-03 05:55:55] [INFO ] Deduced a trap composed of 29 places in 23 ms
[2020-06-03 05:55:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2020-06-03 05:55:55] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-03 05:55:55] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:55] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-06-03 05:55:55] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-06-03 05:55:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2020-06-03 05:55:55] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:55] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2020-06-03 05:55:55] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:55:55] [INFO ] Deduced a trap composed of 8 places in 59 ms
[2020-06-03 05:55:55] [INFO ] Deduced a trap composed of 12 places in 39 ms
[2020-06-03 05:55:56] [INFO ] Deduced a trap composed of 29 places in 37 ms
[2020-06-03 05:55:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 169 ms
[2020-06-03 05:55:56] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 14 ms.
[2020-06-03 05:55:56] [INFO ] Added : 110 causal constraints over 22 iterations in 198 ms. Result :sat
[2020-06-03 05:55:56] [INFO ] Deduced a trap composed of 11 places in 29 ms
[2020-06-03 05:55:56] [INFO ] Deduced a trap composed of 22 places in 26 ms
[2020-06-03 05:55:56] [INFO ] Deduced a trap composed of 22 places in 36 ms
[2020-06-03 05:55:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 127 ms
[2020-06-03 05:55:56] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-03 05:55:56] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:56] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2020-06-03 05:55:56] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:55:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2020-06-03 05:55:56] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 52 ms returned sat
[2020-06-03 05:55:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:56] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2020-06-03 05:55:56] [INFO ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat
[2020-06-03 05:55:57] [INFO ] Deduced a trap composed of 22 places in 150 ms
[2020-06-03 05:55:57] [INFO ] Deduced a trap composed of 22 places in 559 ms
[2020-06-03 05:55:57] [INFO ] Deduced a trap composed of 12 places in 72 ms
[2020-06-03 05:55:57] [INFO ] Deduced a trap composed of 12 places in 258 ms
[2020-06-03 05:55:58] [INFO ] Deduced a trap composed of 8 places in 122 ms
[2020-06-03 05:55:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1256 ms
[2020-06-03 05:55:58] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 8 ms.
[2020-06-03 05:55:58] [INFO ] Added : 89 causal constraints over 18 iterations in 417 ms. Result :sat
[2020-06-03 05:55:58] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-06-03 05:55:58] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 25 ms returned sat
[2020-06-03 05:55:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:58] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2020-06-03 05:55:58] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:55:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:55:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 24 ms returned sat
[2020-06-03 05:55:58] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:55:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:59] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2020-06-03 05:55:59] [INFO ] [Nat]Added 26 Read/Feed constraints in 13 ms returned sat
[2020-06-03 05:55:59] [INFO ] Deduced a trap composed of 22 places in 201 ms
[2020-06-03 05:55:59] [INFO ] Deduced a trap composed of 22 places in 38 ms
[2020-06-03 05:55:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 286 ms
[2020-06-03 05:55:59] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 13 ms.
[2020-06-03 05:55:59] [INFO ] Added : 115 causal constraints over 24 iterations in 347 ms. Result :sat
[2020-06-03 05:55:59] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-03 05:55:59] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2020-06-03 05:55:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:55:59] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2020-06-03 05:55:59] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-06-03 05:55:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2020-06-03 05:56:00] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:00] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2020-06-03 05:56:00] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:56:00] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 5 ms.
[2020-06-03 05:56:00] [INFO ] Added : 117 causal constraints over 24 iterations in 220 ms. Result :sat
[2020-06-03 05:56:00] [INFO ] Deduced a trap composed of 11 places in 32 ms
[2020-06-03 05:56:00] [INFO ] Deduced a trap composed of 8 places in 45 ms
[2020-06-03 05:56:00] [INFO ] Deduced a trap composed of 8 places in 44 ms
[2020-06-03 05:56:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 174 ms
[2020-06-03 05:56:00] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-06-03 05:56:00] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-06-03 05:56:00] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-03 05:56:00] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:00] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2020-06-03 05:56:00] [INFO ] [Real]Added 26 Read/Feed constraints in 2 ms returned sat
[2020-06-03 05:56:00] [INFO ] Deduced a trap composed of 8 places in 64 ms
[2020-06-03 05:56:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2020-06-03 05:56:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-06-03 05:56:00] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:00] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2020-06-03 05:56:00] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:56:00] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2020-06-03 05:56:01] [INFO ] Added : 117 causal constraints over 24 iterations in 256 ms. Result :sat
[2020-06-03 05:56:01] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned unsat
[2020-06-03 05:56:01] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-03 05:56:01] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:01] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2020-06-03 05:56:01] [INFO ] [Real]Added 26 Read/Feed constraints in 13 ms returned sat
[2020-06-03 05:56:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-03 05:56:01] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:01] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2020-06-03 05:56:01] [INFO ] [Nat]Added 26 Read/Feed constraints in 8 ms returned sat
[2020-06-03 05:56:01] [INFO ] Deduced a trap composed of 8 places in 41 ms
[2020-06-03 05:56:01] [INFO ] Deduced a trap composed of 12 places in 44 ms
[2020-06-03 05:56:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2020-06-03 05:56:01] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2020-06-03 05:56:01] [INFO ] Added : 110 causal constraints over 22 iterations in 237 ms. Result :sat
[2020-06-03 05:56:01] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-03 05:56:01] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:01] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2020-06-03 05:56:01] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-06-03 05:56:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-03 05:56:01] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:01] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2020-06-03 05:56:01] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:56:01] [INFO ] Deduced a trap composed of 29 places in 29 ms
[2020-06-03 05:56:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2020-06-03 05:56:01] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2020-06-03 05:56:02] [INFO ] Added : 108 causal constraints over 22 iterations in 215 ms. Result :sat
[2020-06-03 05:56:02] [INFO ] Deduced a trap composed of 12 places in 59 ms
[2020-06-03 05:56:02] [INFO ] Deduced a trap composed of 12 places in 47 ms
[2020-06-03 05:56:02] [INFO ] Deduced a trap composed of 8 places in 45 ms
[2020-06-03 05:56:02] [INFO ] Deduced a trap composed of 22 places in 55 ms
[2020-06-03 05:56:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 273 ms
[2020-06-03 05:56:02] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-06-03 05:56:02] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:02] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2020-06-03 05:56:02] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-06-03 05:56:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-03 05:56:02] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:02] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2020-06-03 05:56:02] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-06-03 05:56:02] [INFO ] Deduced a trap composed of 12 places in 46 ms
[2020-06-03 05:56:02] [INFO ] Deduced a trap composed of 8 places in 46 ms
[2020-06-03 05:56:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2020-06-03 05:56:02] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2020-06-03 05:56:02] [INFO ] Added : 117 causal constraints over 24 iterations in 209 ms. Result :sat
[2020-06-03 05:56:02] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-03 05:56:02] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:02] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2020-06-03 05:56:02] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-06-03 05:56:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-03 05:56:02] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:02] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2020-06-03 05:56:02] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:56:03] [INFO ] Deduced a trap composed of 8 places in 38 ms
[2020-06-03 05:56:03] [INFO ] Deduced a trap composed of 25 places in 46 ms
[2020-06-03 05:56:03] [INFO ] Deduced a trap composed of 12 places in 15 ms
[2020-06-03 05:56:03] [INFO ] Deduced a trap composed of 12 places in 20 ms
[2020-06-03 05:56:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 162 ms
[2020-06-03 05:56:03] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 10 ms.
[2020-06-03 05:56:03] [INFO ] Added : 112 causal constraints over 23 iterations in 278 ms. Result :sat
[2020-06-03 05:56:03] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-06-03 05:56:03] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:03] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2020-06-03 05:56:03] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:56:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-06-03 05:56:03] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-03 05:56:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:03] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2020-06-03 05:56:03] [INFO ] [Nat]Added 26 Read/Feed constraints in 14 ms returned sat
[2020-06-03 05:56:03] [INFO ] Deduced a trap composed of 8 places in 62 ms
[2020-06-03 05:56:03] [INFO ] Deduced a trap composed of 12 places in 51 ms
[2020-06-03 05:56:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2020-06-03 05:56:03] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 8 ms.
[2020-06-03 05:56:04] [INFO ] Added : 110 causal constraints over 22 iterations in 234 ms. Result :sat
[2020-06-03 05:56:04] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-06-03 05:56:04] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:04] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-06-03 05:56:04] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:56:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2020-06-03 05:56:04] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:04] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2020-06-03 05:56:04] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:56:04] [INFO ] Deduced a trap composed of 8 places in 48 ms
[2020-06-03 05:56:04] [INFO ] Deduced a trap composed of 29 places in 28 ms
[2020-06-03 05:56:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2020-06-03 05:56:04] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 5 ms.
[2020-06-03 05:56:04] [INFO ] Added : 105 causal constraints over 21 iterations in 208 ms. Result :sat
[2020-06-03 05:56:04] [INFO ] Deduced a trap composed of 34 places in 69 ms
[2020-06-03 05:56:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2020-06-03 05:56:04] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-03 05:56:04] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:04] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2020-06-03 05:56:04] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-06-03 05:56:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:56:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-03 05:56:04] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:56:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:56:04] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2020-06-03 05:56:04] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:56:04] [INFO ] Deduced a trap composed of 13 places in 43 ms
[2020-06-03 05:56:04] [INFO ] Deduced a trap composed of 8 places in 40 ms
[2020-06-03 05:56:04] [INFO ] Deduced a trap composed of 11 places in 40 ms
[2020-06-03 05:56:04] [INFO ] Deduced a trap composed of 22 places in 39 ms
[2020-06-03 05:56:05] [INFO ] Deduced a trap composed of 22 places in 47 ms
[2020-06-03 05:56:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 242 ms
[2020-06-03 05:56:05] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 8 ms.
[2020-06-03 05:56:05] [INFO ] Added : 117 causal constraints over 24 iterations in 269 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-03 05:56:05] [INFO ] Flatten gal took : 92 ms
[2020-06-03 05:56:05] [INFO ] Flatten gal took : 13 ms
[2020-06-03 05:56:05] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 9 ms.
[2020-06-03 05:56:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Peterson-PT-2 @ 3570 seconds

FORMULA Peterson-PT-2-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Peterson-PT-2-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA Peterson-PT-2-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA Peterson-PT-2-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA Peterson-PT-2-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for CTLFireability @ Peterson-PT-2

{
"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:56:06 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": 2,
"adisj": 12,
"aneg": 0,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 27,
"visible_transitions": 0
},
"processed": "((((p42 <= 0) OR (p60 <= 0)) AND ((p44 <= 0) OR (p52 <= 0)) AND ((p42 <= 0) OR (p58 <= 0)) AND ((p42 <= 0) OR (p59 <= 0)) AND ((p41 <= 0) OR (p56 <= 0)) AND ((p41 <= 0) OR (p55 <= 0)) AND ((p41 <= 0) OR (p54 <= 0)) AND ((p42 <= 0) OR (p53 <= 0)) AND ((p44 <= 0) OR (p45 <= 0)) AND ((p44 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p44 <= 0) OR (p51 <= 0))) OR ((p81 <= 0) AND (p64 <= 0) AND (p82 <= 0) AND (p84 <= 0) AND (p71 <= 0) AND (p70 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p63 <= 0) AND (p78 <= 0)))",
"processed_size": 564,
"rewrites": 213
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 12,
"adisj": 2,
"aneg": 0,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "E (((((1 <= p46) AND (1 <= p60)) OR ((1 <= p46) AND (1 <= p58)) OR ((1 <= p46) AND (1 <= p59)) OR ((1 <= p48) AND (1 <= p50)) OR ((1 <= p48) AND (1 <= p51)) OR ((1 <= p47) AND (1 <= p54)) OR ((1 <= p47) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p49)) OR ((1 <= p46) AND (1 <= p53)) OR ((1 <= p45) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p52))) U ((1 <= p17) OR (1 <= p19) OR (1 <= p20))))",
"processed_size": 432,
"rewrites": 215
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 27
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "((1 <= p81) OR (1 <= p64) OR (1 <= p82) OR (1 <= p84) OR (1 <= p71) OR (1 <= p70) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p63) OR (1 <= p78))",
"processed_size": 177,
"rewrites": 215
},
"result":
{
"edges": 62262,
"markings": 20754,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 12,
"problems": 12
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 14,
"adisj": 4,
"aneg": 0,
"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": 45,
"visible_transitions": 0
},
"processed": "A (((((p32 <= 0) AND (p33 <= 0) AND (p34 <= 0) AND (p35 <= 0) AND (p37 <= 0) AND (p36 <= 0) AND (p39 <= 0) AND (p38 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p23 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0) AND (p31 <= 0)) OR ((((1 <= p46) AND (1 <= p60)) OR ((1 <= p46) AND (1 <= p58)) OR ((1 <= p46) AND (1 <= p59)) OR ((1 <= p48) AND (1 <= p50)) OR ((1 <= p48) AND (1 <= p51)) OR ((1 <= p47) AND (1 <= p54)) OR ((1 <= p47) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p49)) OR ((1 <= p46) AND (1 <= p53)) OR ((1 <= p45) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p52))) AND ((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)))) U ((1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38) OR (1 <= p40) OR (1 <= p43) OR (1 <= p23) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31))))",
"processed_size": 1105,
"rewrites": 217
},
"result":
{
"edges": 31,
"markings": 31,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 67
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 450,
"problems": 145
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 7,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 6,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "EX((EF(((1 <= p81) OR (1 <= p64) OR (1 <= p82) OR (1 <= p84) OR (1 <= p71) OR (1 <= p70) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p63) OR (1 <= p78))) AND (((p47 <= 0) OR (p88 <= 0)) AND (((p46 <= 0) OR (p87 <= 0)) AND (((p48 <= 0) OR (p85 <= 0)) AND (((p47 <= 0) OR (p88 <= 0)) AND (((p46 <= 0) OR (p87 <= 0)) AND ((p48 <= 0) OR (p85 <= 0)))))))))",
"processed_size": 389,
"rewrites": 214
},
"net":
{
"conflict_clusters": 65,
"singleton_clusters": 0
},
"result":
{
"edges": 20,
"markings": 19,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 12,
"adisj": 1,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "AG(EF(AX((((1 <= p42) AND (1 <= p60)) OR ((1 <= p44) AND (1 <= p52)) OR ((1 <= p42) AND (1 <= p58)) OR ((1 <= p42) AND (1 <= p59)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p41) AND (1 <= p55)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p53)) OR ((1 <= p44) AND (1 <= p45)) OR ((1 <= p44) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51))))))",
"processed_size": 393,
"rewrites": 215
},
"net":
{
"conflict_clusters": 65,
"singleton_clusters": 0
},
"result":
{
"edges": 102578,
"markings": 20754,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E(EX((p20 <= 0)) U DEADLOCK)",
"processed_size": 28,
"rewrites": 214
},
"net":
{
"conflict_clusters": 65,
"singleton_clusters": 0
},
"result":
{
"edges": 62262,
"markings": 20754,
"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": 297
},
"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 <= p68) AND (1 <= p92))))",
"processed_size": 35,
"rewrites": 214
},
"net":
{
"conflict_clusters": 65,
"singleton_clusters": 0
},
"result":
{
"edges": 62262,
"markings": 20754,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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 <= p2) AND (1 <= p41) AND (1 <= p49))))",
"processed_size": 49,
"rewrites": 213
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (G ((((p17 <= 0) AND (p19 <= 0) AND (p20 <= 0)) OR (((p42 <= 0) OR (p101 <= 0)) AND ((p44 <= 0) OR (p93 <= 0)) AND ((p41 <= 0) OR (p94 <= 0))))))",
"processed_size": 151,
"rewrites": 214
},
"result":
{
"edges": 4684,
"markings": 2120,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 27,
"problems": 9
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p64 <= 0)",
"processed_size": 10,
"rewrites": 216
},
"result":
{
"edges": 58478,
"markings": 20754,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p63 <= 0) AND ((p90 <= 0) OR (p95 <= 0)))",
"processed_size": 44,
"rewrites": 215
},
"result":
{
"edges": 57949,
"markings": 20754,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)))",
"processed_size": 189,
"rewrites": 215
},
"result":
{
"edges": 62262,
"markings": 20754,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 384,
"problems": 64
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 12,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "E (G ((((p42 <= 0) OR (p60 <= 0)) AND ((p44 <= 0) OR (p52 <= 0)) AND ((p42 <= 0) OR (p58 <= 0)) AND ((p42 <= 0) OR (p59 <= 0)) AND ((p41 <= 0) OR (p56 <= 0)) AND ((p41 <= 0) OR (p55 <= 0)) AND ((p41 <= 0) OR (p54 <= 0)) AND ((p42 <= 0) OR (p53 <= 0)) AND ((p44 <= 0) OR (p45 <= 0)) AND ((p44 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p44 <= 0) OR (p51 <= 0)))))",
"processed_size": 389,
"rewrites": 213
},
"result":
{
"edges": 331,
"markings": 281,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 42
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 24,
"problems": 12
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AF((AG(((p46 <= 0) OR (p59 <= 0))) OR (AG(((1 <= p44) AND (1 <= p93))) AND ((p46 <= 0) OR (p53 <= 0)))))",
"processed_size": 106,
"rewrites": 215
},
"net":
{
"conflict_clusters": 65,
"singleton_clusters": 0
},
"result":
{
"edges": 18294,
"markings": 6060,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 4,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "E ((((p39 <= 0) OR ((1 <= p61) AND (1 <= p92))) U ((p19 <= 0) AND ((p47 <= 0) OR (p49 <= 0)) AND ((1 <= p83) OR ((1 <= p41) AND (1 <= p55))) AND ((1 <= p29) OR ((1 <= p48) AND (1 <= p52))))))",
"processed_size": 195,
"rewrites": 215
},
"result":
{
"edges": 19715,
"markings": 6680,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 40,
"problems": 8
},
"type": "existential_until",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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": "((p90 <= 0) OR (p98 <= 0))",
"processed_size": 27,
"rewrites": 212
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p86) AND (1 <= p95))",
"processed_size": 27,
"rewrites": 212
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"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": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E ((((1 <= p48) AND (1 <= p85)) U ((1 <= p90) AND (1 <= p98))))",
"processed_size": 63,
"rewrites": 215
},
"result":
{
"edges": 2600,
"markings": 1300,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "((1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38) OR (1 <= p40) OR (1 <= p43) OR (1 <= p23) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31))",
"processed_size": 250,
"rewrites": 245
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 1,
"aneg": 1,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "(((p42 <= 0) OR (p60 <= 0)) AND ((p44 <= 0) OR (p52 <= 0)) AND ((p42 <= 0) OR (p58 <= 0)) AND ((p42 <= 0) OR (p59 <= 0)) AND ((p41 <= 0) OR (p56 <= 0)) AND ((p41 <= 0) OR (p55 <= 0)) AND ((p41 <= 0) OR (p54 <= 0)) AND ((p42 <= 0) OR (p53 <= 0)) AND ((p44 <= 0) OR (p45 <= 0)) AND ((p44 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p44 <= 0) OR (p51 <= 0)))",
"processed_size": 381,
"rewrites": 215
},
"result":
{
"edges": 331,
"markings": 281,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 42
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 2,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G ((F (((p21 <= 0) AND (p22 <= 0) AND (p24 <= 0))) OR ((p80 <= 0) AND (p83 <= 0) AND (p69 <= 0) AND (p73 <= 0) AND (p72 <= 0) AND (p62 <= 0))))",
"processed_size": 143,
"rewrites": 222
},
"result":
{
"edges": 336,
"markings": 276,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"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": "((p90 <= 0) OR (p98 <= 0))",
"processed_size": 27,
"rewrites": 212
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p91) AND (1 <= p97))",
"processed_size": 27,
"rewrites": 212
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p86) AND (1 <= p95))",
"processed_size": 27,
"rewrites": 212
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p90) AND (1 <= p98))",
"processed_size": 27,
"rewrites": 212
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 19,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E ((((1 <= p48) AND (1 <= p85)) U ((1 <= p90) AND (1 <= p98))))",
"processed_size": 63,
"rewrites": 215
},
"result":
{
"edges": 2600,
"markings": 1300,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 89924,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(F(E(G(**)))) OR E(F((E(G(**)) AND **)))) : E(G(**)) : (A(G(E(F(**)))) OR (E((** U **)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** AND ((A(X(**)) OR (** OR **)) AND **)))))))))) : (A(F(**)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))))))))))) : A(G(E(F(**)))) : (E(X((E(F(**)) AND (** AND (** AND (** AND (** AND (** AND **)))))))) OR A((** U **))) : A(G(E(F(A(X(**)))))) : A(G(*)) : A(F((A(G(**)) OR (A(G(**)) AND **)))) : E(F(**)) : A(G(E(F(**)))) : E((E(X(**)) U DEADLOCK)) : (E((** U **)) OR (** OR (** AND (A(F(**)) AND (** OR (E(F(**)) AND **)))))) : E(F(A(X(**)))) : E((** U **)) : E(F(A(G(*))))"
},
"net":
{
"arcs": 384,
"conflict_clusters": 65,
"places": 102,
"places_significant": 91,
"singleton_clusters": 0,
"transitions": 126
},
"result":
{
"preliminary_value": "yes yes yes no yes no yes no no yes yes no no no yes no ",
"value": "yes yes yes no yes no yes no no yes yes no no no yes no "
},
"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: 228/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 102
lola: finding significant places
lola: 102 places, 126 transitions, 91 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: E (F ((E (G (((((1 <= p42) AND (1 <= p101)) OR ((1 <= p44) AND (1 <= p93)) OR ((1 <= p41) AND (1 <= p94))) AND (((1 <= p66) AND (1 <= p89)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p79)) OR ((1 <= p68) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p92)) OR ((1 <= p57) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p91)) OR ((1 <= p68) AND (1 <= p86)) OR ((1 <= p67) AND (1 <= p86)))))) OR (E (G (((1 <= p21) OR (1 <= p22) OR (1 <= p24)))) AND ((1 <= p80) OR (1 <= p83) OR (1 <= p69) OR (1 <= p73) OR (1 <= p72) OR (1 <= p62)))))) : E (G ((((p42 <= 0) OR (p60 <= 0)) AND ((p44 <= 0) OR (p52 <= 0)) AND ((p42 <= 0) OR (p58 <= 0)) AND ((p42 <= 0) OR (p59 <= 0)) AND ((p41 <= 0) OR (p56 <= 0)) AND ((p41 <= 0) OR (p55 <= 0)) AND ((p41 <= 0) OR (p54 <= 0)) AND ((p42 <= 0) OR (p53 <= 0)) AND ((p44 <= 0) OR (p45 <= 0)) AND ((p44 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p44 <= 0) OR (p51 <= 0))))) : ((((((((A (G (E (F (((1 <= p81) OR (1 <= p64) OR (1 <= p82) OR (1 <= p84) OR (1 <= p71) OR (1 <= p70) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p63) OR (1 <= p78)))))) OR E (((((1 <= p46) AND (1 <= p60)) OR ((1 <= p46) AND (1 <= p58)) OR ((1 <= p46) AND (1 <= p59)) OR ((1 <= p48) AND (1 <= p50)) OR ((1 <= p48) AND (1 <= p51)) OR ((1 <= p47) AND (1 <= p54)) OR ((1 <= p47) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p49)) OR ((1 <= p46) AND (1 <= p53)) OR ((1 <= p45) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p52))) U ((1 <= p17) OR (1 <= p19) OR (1 <= p20))))) OR (1 <= p16)) OR (1 <= p18)) OR (1 <= p12)) OR (1 <= p13)) OR (1 <= p14)) OR (1 <= p15)) OR ((((1 <= p21) OR (1 <= p22) OR (1 <= p24)) AND ((A (X ((((1 <= p46) AND (1 <= p60)) OR ((1 <= p46) AND (1 <= p58)) OR ((1 <= p46) AND (1 <= p59)) OR ((1 <= p48) AND (1 <= p50)) OR ((1 <= p48) AND (1 <= p51)) OR ((1 <= p47) AND (1 <= p54)) OR ((1 <= p47) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p49)) OR ((1 <= p46) AND (1 <= p53)) OR ((1 <= p45) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p52))))) OR (((p42 <= 0) OR (p60 <= 0)) AND ((p44 <= 0) OR (p52 <= 0)) AND ((p42 <= 0) OR (p58 <= 0)) AND ((p42 <= 0) OR (p59 <= 0)) AND ((p41 <= 0) OR (p56 <= 0)) AND ((p41 <= 0) OR (p55 <= 0)) AND ((p41 <= 0) OR (p54 <= 0)) AND ((p42 <= 0) OR (p53 <= 0)) AND ((p44 <= 0) OR (p45 <= 0)) AND ((p44 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p44 <= 0) OR (p51 <= 0)))) OR ((p81 <= 0) AND (p64 <= 0) AND (p82 <= 0) AND (p84 <= 0) AND (p71 <= 0) AND (p70 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p63 <= 0) AND (p78 <= 0)))) AND ((1 <= p17) OR (1 <= p19) OR (1 <= p20) OR ((1 <= p66) AND (1 <= p89)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p79)) OR ((1 <= p68) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p92)) OR ((1 <= p57) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p91)) OR ((1 <= p68) AND (1 <= p86)) OR ((1 <= p67) AND (1 <= p86))))) : ((((((((((((((((((A (F ((((1 <= p42) AND (1 <= p60)) OR ((1 <= p44) AND (1 <= p52)) OR ((1 <= p42) AND (1 <= p58)) OR ((1 <= p42) AND (1 <= p59)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p41) AND (1 <= p55)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p53)) OR ((1 <= p44) AND (1 <= p45)) OR ((1 <= p44) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51))))) OR (1 <= p32)) OR (1 <= p33)) OR (1 <= p34)) OR (1 <= p35)) OR (1 <= p37)) OR (1 <= p36)) OR (1 <= p39)) OR (1 <= p38)) OR (1 <= p40)) OR (1 <= p43)) OR (1 <= p23)) OR (1 <= p25)) OR (1 <= p26)) OR (1 <= p27)) OR (1 <= p28)) OR (1 <= p29)) OR (1 <= p30)) OR (1 <= p31)) : A (G (E (F ((((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90))))))) : (E (X (((((((E (F (((1 <= p81) OR (1 <= p64) OR (1 <= p82) OR (1 <= p84) OR (1 <= p71) OR (1 <= p70) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p63) OR (1 <= p78)))) AND ((p47 <= 0) OR (p88 <= 0))) AND ((p46 <= 0) OR (p87 <= 0))) AND ((p48 <= 0) OR (p85 <= 0))) AND ((p47 <= 0) OR (p88 <= 0))) AND ((p46 <= 0) OR (p87 <= 0))) AND ((p48 <= 0) OR (p85 <= 0))))) OR A (((((p32 <= 0) AND (p33 <= 0) AND (p34 <= 0) AND (p35 <= 0) AND (p37 <= 0) AND (p36 <= 0) AND (p39 <= 0) AND (p38 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p23 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0) AND (p31 <= 0)) OR ((((1 <= p46) AND (1 <= p60)) OR ((1 <= p46) AND (1 <= p58)) OR ((1 <= p46) AND (1 <= p59)) OR ((1 <= p48) AND (1 <= p50)) OR ((1 <= p48) AND (1 <= p51)) OR ((1 <= p47) AND (1 <= p54)) OR ((1 <= p47) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p49)) OR ((1 <= p46) AND (1 <= p53)) OR ((1 <= p45) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p52))) AND ((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)))) U ((1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38) OR (1 <= p40) OR (1 <= p43) OR (1 <= p23) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31))))) : A (G (E (F (A (X ((((1 <= p42) AND (1 <= p60)) OR ((1 <= p44) AND (1 <= p52)) OR ((1 <= p42) AND (1 <= p58)) OR ((1 <= p42) AND (1 <= p59)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p41) AND (1 <= p55)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p53)) OR ((1 <= p44) AND (1 <= p45)) OR ((1 <= p44) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51))))))))) : NOT(E (F (E (F ((((1 <= p17) OR (1 <= p19) OR (1 <= p20)) AND (((1 <= p42) AND (1 <= p101)) OR ((1 <= p44) AND (1 <= p93)) OR ((1 <= p41) AND (1 <= p94))))))))) : A (F ((A (G (((p46 <= 0) OR (p59 <= 0)))) OR (A (G (((1 <= p44) AND (1 <= p93)))) AND ((p46 <= 0) OR (p53 <= 0)))))) : E (((1 <= 0) U E (F (((1 <= p2) AND (1 <= p41) AND (1 <= p49)))))) : A (G (E (F (((p63 <= 0) AND ((p90 <= 0) OR (p95 <= 0))))))) : E ((E (X ((p20 <= 0))) U A (X ((1 <= 0))))) : ((E ((((1 <= p48) AND (1 <= p85)) U ((1 <= p90) AND (1 <= p98)))) OR ((1 <= p90) AND (1 <= p98))) OR ((((1 <= p86) AND (1 <= p95)) AND A (F ((((1 <= p41) AND (1 <= p54)) OR (1 <= p43))))) AND (((1 <= p91) AND (1 <= p97)) OR (E (F (((1 <= p68) AND (1 <= p90)))) AND ((p90 <= 0) OR (p98 <= 0)))))) : E (F (A (X (((1 <= p68) AND (1 <= p92)))))) : E ((((p39 <= 0) OR ((1 <= p61) AND (1 <= p92))) U ((p19 <= 0) AND ((p47 <= 0) OR (p49 <= 0)) AND ((1 <= p83) OR ((1 <= p41) AND (1 <= p55))) AND ((1 <= p29) OR ((1 <= p48) AND (1 <= p52)))))) : E (F (NOT(E (F ((p64 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:251
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:251
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:401
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F (((1 <= p81) OR (1 <= p64) OR (1 <= p82) OR (1 <= p84) OR (1 <= p71) OR (1 <= p70) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p63) OR (1 <= p78)))))) OR (E (((((1 <= p46) AND (1 <= p60)) OR ((1 <= p46) AND (1 <= p58)) OR ((1 <= p46) AND (1 <= p59)) OR ((1 <= p48) AND (1 <= p50)) OR ((1 <= p48) AND (1 <= p51)) OR ((1 <= p47) AND (1 <= p54)) OR ((1 ... (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: ((((p42 <= 0) OR (p60 <= 0)) AND ((p44 <= 0) OR (p52 <= 0)) AND ((p42 <= 0) OR (p58 <= 0)) AND ((p42 <= 0) OR (p59 <= 0)) AND ((p41 <= 0) OR (p56 <= 0)) AND ((p41 <= 0) OR (p55 <= 0)) AND ((p41 <= 0) OR (p54 <= 0)) AND ((p42 <= 0) OR (p53 <= 0)) AND ((p44 <= 0) OR (p45 <= 0)) AND ((p44 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p44 <= 0) OR (p51 <= 0))) OR ((p81 <= 0) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((((p42 <= 0) OR (p60 <= 0)) AND ((p44 <= 0) OR (p52 <= 0)) AND ((p42 <= 0) OR (p58 <= 0)) AND ((p42 <= 0) OR (p59 <= 0)) AND ((p41 <= 0) OR (p56 <= 0)) AND ((p41 <= 0) OR (p55 <= 0)) AND ((p41 <= 0) OR (p54 <= 0)) AND ((p42 <= 0) OR (p53 <= 0)) AND ((p44 <= 0) OR (p45 <= 0)) AND ((p44 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p44 <= 0) OR (p51 <= 0))) OR ((p81 <= 0) AN... (shortened)
lola: processed formula length: 564
lola: 213 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 36 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 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p15)
lola: processed formula length: 10
lola: 212 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p14)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p14)
lola: processed formula length: 10
lola: 212 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p13)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p13)
lola: processed formula length: 10
lola: 212 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p12)
lola: processed formula length: 10
lola: 212 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p18)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p18)
lola: processed formula length: 10
lola: 212 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p16)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p16)
lola: processed formula length: 10
lola: 212 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p21) OR (1 <= p22) OR (1 <= p24))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p21) OR (1 <= p22) OR (1 <= p24))
lola: processed formula length: 42
lola: 212 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= p46) AND (1 <= p60)) OR ((1 <= p46) AND (1 <= p58)) OR ((1 <= p46) AND (1 <= p59)) OR ((1 <= p48) AND (1 <= p50)) OR ((1 <= p48) AND (1 <= p51)) OR ((1 <= p47) AND (1 <= p54)) OR ((1 <= p47) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p49)) OR ((1 <= p46) AND (1 <= p53)) OR ((1 <= p45) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p52))) U ((1 <= p17) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((((1 <= p46) AND (1 <= p60)) OR ((1 <= p46) AND (1 <= p58)) OR ((1 <= p46) AND (1 <= p59)) OR ((1 <= p48) AND (1 <= p50)) OR ((1 <= p48) AND (1 <= p51)) OR ((1 <= p47) AND (1 <= p54)) OR ((1 <= p47) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p49)) OR ((1 <= p46) AND (1 <= p53)) OR ((1 <= p45) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p52))) U ((1 <= p17) ... (shortened)
lola: processed formula length: 432
lola: 215 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: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: state equation task get result unparse finished++ id 0
lola: 0 markings, 0 edges
lola: formula 0: ((1 <= p17) OR (1 <= p19) OR (1 <= p20))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p81) OR (1 <= p64) OR (1 <= p82) OR (1 <= p84) OR (1 <= p71) OR (1 <= p70) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p63) OR (1 <= p78))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p81) OR (1 <= p64) OR (1 <= p82) OR (1 <= p84) OR (1 <= p71) OR (1 <= p70) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p63) OR (1 <= p78))
lola: processed formula length: 177
lola: 215 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p81 <= 0) AND (p64 <= 0) AND (p82 <= 0) AND (p84 <= 0) AND (p71 <= 0) AND (p70 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p63 <= 0) AND (p78 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p81) OR (1 <= p64) OR (1 <= p82) OR (1 <= p84) OR (1 <= p71) OR (1 <= p70) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p63) OR (1 <= p78))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 12 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-1.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 20754 markings, 62262 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((E (F (((1 <= p81) OR (1 <= p64) OR (1 <= p82) OR (1 <= p84) OR (1 <= p71) OR (1 <= p70) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p63) OR (1 <= p78)))) AND (((p47 <= 0) OR (p88 <= 0)) AND (((p46 <= 0) OR (p87 <= 0)) AND (((p48 <= 0) OR (p85 <= 0)) AND (((p47 <= 0) OR (p88 <= 0)) AND (((p46 <= 0) OR (p87 <= 0)) AND ((p48 <= 0) OR (p85 <= 0)))))))))) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((p32 <= 0) AND (p33 <= 0) AND (p34 <= 0) AND (p35 <= 0) AND (p37 <= 0) AND (p36 <= 0) AND (p39 <= 0) AND (p38 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p23 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0) AND (p31 <= 0)) OR ((((1 <= p46) AND (1 <= p60)) OR ((1 <= p46) AND (1 <= p58)) OR ((1 <= p46) AND (1 <= p59)) OR ((1 <= p48) AND (1 <= p50... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((((p32 <= 0) AND (p33 <= 0) AND (p34 <= 0) AND (p35 <= 0) AND (p37 <= 0) AND (p36 <= 0) AND (p39 <= 0) AND (p38 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p23 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0) AND (p31 <= 0)) OR ((((1 <= p46) AND (1 <= p60)) OR ((1 <= p46) AND (1 <= p58)) OR ((1 <= p46) AND (1 <= p59)) OR ((1 <= p48) AND (1 <= p50... (shortened)
lola: processed formula length: 1105
lola: 217 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: 1
lola: formula 0: (((p32 <= 0) AND (p33 <= 0) AND (p34 <= 0) AND (p35 <= 0) AND (p37 <= 0) AND (p36 <= 0) AND (p39 <= 0) AND (p38 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p23 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0) AND (p31 <= 0)) OR ((((1 <= p46) AND (1 <= p60)) OR ((1 <= p46) AND (1 <= p58)) OR ((1 <= p46) AND (1 <= p59)) OR ((1 <= p48) AND (1 <= p50)) OR ((1 <= p48) AND (1 <= p51)) OR ((1 <= p47) AND (1 <= p54)) OR ((1 <= p47) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p49)) OR ((1 <= p46) AND (1 <= p53)) OR ((1 <= p45) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p52))) AND ((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))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 31 markings, 31 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 450 literals and 145 conjunctive subformulas
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((E (F (((1 <= p81) OR (1 <= p64) OR (1 <= p82) OR (1 <= p84) OR (1 <= p71) OR (1 <= p70) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p63) OR (1 <= p78)))) AND (((p47 <= 0) OR (p88 <= 0)) AND (((p46 <= 0) OR (p87 <= 0)) AND (((p48 <= 0) OR (p85 <= 0)) AND (((p47 <= 0) OR (p88 <= 0)) AND (((p46 <= 0) OR (p87 <= 0)) AND ((p48 <= 0) OR (p85 <= 0))))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((EF(((1 <= p81) OR (1 <= p64) OR (1 <= p82) OR (1 <= p84) OR (1 <= p71) OR (1 <= p70) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p63) OR (1 <= p78))) AND (((p47 <= 0) OR (p88 <= 0)) AND (((p46 <= 0) OR (p87 <= 0)) AND (((p48 <= 0) OR (p85 <= 0)) AND (((p47 <= 0) OR (p88 <= 0)) AND (((p46 <= 0) OR (p87 <= 0)) AND ((p48 <= 0) OR (p85 <= 0)))))))))
lola: processed formula length: 389
lola: 214 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 19 markings, 20 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (A (X ((((1 <= p42) AND (1 <= p60)) OR ((1 <= p44) AND (1 <= p52)) OR ((1 <= p42) AND (1 <= p58)) OR ((1 <= p42) AND (1 <= p59)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p41) AND (1 <= p55)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p53)) OR ((1 <= p44) AND (1 <= p45)) OR ((1 <= p44) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51))))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EF(AX((((1 <= p42) AND (1 <= p60)) OR ((1 <= p44) AND (1 <= p52)) OR ((1 <= p42) AND (1 <= p58)) OR ((1 <= p42) AND (1 <= p59)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p41) AND (1 <= p55)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p53)) OR ((1 <= p44) AND (1 <= p45)) OR ((1 <= p44) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51))))))
lola: processed formula length: 393
lola: 215 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: 20754 markings, 102578 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((p20 <= 0))) U DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EX((p20 <= 0)) U DEADLOCK)
lola: processed formula length: 28
lola: 214 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 20754 markings, 62262 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p68) AND (1 <= p92))))))
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 <= p68) AND (1 <= p92))))
lola: processed formula length: 35
lola: 214 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 20754 markings, 62262 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p2) AND (1 <= p41) AND (1 <= p49))))
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 <= p2) AND (1 <= p41) AND (1 <= p49))))
lola: processed formula length: 49
lola: 213 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 <= p2) AND (1 <= p41) AND (1 <= p49))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p17 <= 0) AND (p19 <= 0) AND (p20 <= 0)) OR (((p42 <= 0) OR (p101 <= 0)) AND ((p44 <= 0) OR (p93 <= 0)) AND ((p41 <= 0) OR (p94 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((((p17 <= 0) AND (p19 <= 0) AND (p20 <= 0)) OR (((p42 <= 0) OR (p101 <= 0)) AND ((p44 <= 0) OR (p93 <= 0)) AND ((p41 <= 0) OR (p94 <= 0))))))
lola: processed formula length: 151
lola: 214 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p17) OR (1 <= p19) OR (1 <= p20)) AND (((1 <= p42) AND (1 <= p101)) OR ((1 <= p44) AND (1 <= p93)) OR ((1 <= p41) AND (1 <= p94))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 27 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2120 markings, 4684 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= p64)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p64 <= 0)
lola: processed formula length: 10
lola: 216 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 <= p64)
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 task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p64 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-1.sara
lola: state equation: calling and running sara
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-1.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 1: solution produced

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 20754 markings, 58478 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((p63 <= 0) AND ((p90 <= 0) OR (p95 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((p63 <= 0) AND ((p90 <= 0) OR (p95 <= 0)))
lola: processed formula length: 44
lola: 215 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 0
lola: state equation task get result unparse finished++ id 1
lola: formula 0: ((1 <= p63) OR ((1 <= p90) AND (1 <= p95)))
lola: state equation task get result unparse finished id 0
lola: formula 1: ((p63 <= 0) AND ((p90 <= 0) OR (p95 <= 0)))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: state equation: write sara problem file to CTLFireability-8-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 20754 markings, 57949 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)))
lola: processed formula length: 189
lola: 215 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 0
lola: state equation task get result unparse finished++ id 1
lola: formula 0: (((p65 <= 0) OR (p89 <= 0)) AND ((p57 <= 0) OR (p79 <= 0)) AND ((p61 <= 0) OR (p86 <= 0)) AND ((p68 <= 0) OR (p92 <= 0)) AND ((p66 <= 0) OR (p91 <= 0)) AND ((p67 <= 0) OR (p90 <= 0)))
lola: formula 1: (((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 384 literals and 64 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-1.sara.
lola: state equation: write sara problem file to CTLFireability-9-0.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 20754 markings, 62262 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p42 <= 0) OR (p60 <= 0)) AND ((p44 <= 0) OR (p52 <= 0)) AND ((p42 <= 0) OR (p58 <= 0)) AND ((p42 <= 0) OR (p59 <= 0)) AND ((p41 <= 0) OR (p56 <= 0)) AND ((p41 <= 0) OR (p55 <= 0)) AND ((p41 <= 0) OR (p54 <= 0)) AND ((p42 <= 0) OR (p53 <= 0)) AND ((p44 <= 0) OR (p45 <= 0)) AND ((p44 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p44 <= 0) OR (p51 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p42 <= 0) OR (p60 <= 0)) AND ((p44 <= 0) OR (p52 <= 0)) AND ((p42 <= 0) OR (p58 <= 0)) AND ((p42 <= 0) OR (p59 <= 0)) AND ((p41 <= 0) OR (p56 <= 0)) AND ((p41 <= 0) OR (p55 <= 0)) AND ((p41 <= 0) OR (p54 <= 0)) AND ((p42 <= 0) OR (p53 <= 0)) AND ((p44 <= 0) OR (p45 <= 0)) AND ((p44 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p44 <= 0) OR (p51 <= 0)))))
lola: processed formula length: 389
lola: 213 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 <= p42) AND (1 <= p60)) OR ((1 <= p44) AND (1 <= p52)) OR ((1 <= p42) AND (1 <= p58)) OR ((1 <= p42) AND (1 <= p59)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p41) AND (1 <= p55)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p53)) OR ((1 <= p44) AND (1 <= p45)) OR ((1 <= p44) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 281 markings, 331 edges
lola: state equation: write sara problem file to CTLFireability-10-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G (((p46 <= 0) OR (p59 <= 0)))) OR (A (G (((1 <= p44) AND (1 <= p93)))) AND ((p46 <= 0) OR (p53 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AG(((p46 <= 0) OR (p59 <= 0))) OR (AG(((1 <= p44) AND (1 <= p93))) AND ((p46 <= 0) OR (p53 <= 0)))))
lola: processed formula length: 106
lola: 215 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).
sara: try reading problem file CTLFireability-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6060 markings, 18294 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p39 <= 0) OR ((1 <= p61) AND (1 <= p92))) U ((p19 <= 0) AND ((p47 <= 0) OR (p49 <= 0)) AND ((1 <= p83) OR ((1 <= p41) AND (1 <= p55))) AND ((1 <= p29) OR ((1 <= p48) AND (1 <= p52))))))
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 ((((p39 <= 0) OR ((1 <= p61) AND (1 <= p92))) U ((p19 <= 0) AND ((p47 <= 0) OR (p49 <= 0)) AND ((1 <= p83) OR ((1 <= p41) AND (1 <= p55))) AND ((1 <= p29) OR ((1 <= p48) AND (1 <= p52))))))
lola: processed formula length: 195
lola: 215 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: ((p19 <= 0) AND ((p47 <= 0) OR (p49 <= 0)) AND ((1 <= p83) OR ((1 <= p41) AND (1 <= p55))) AND ((1 <= p29) OR ((1 <= p48) AND (1 <= p52))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 40 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 6680 markings, 19715 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((1 <= p48) AND (1 <= p85)) U ((1 <= p90) AND (1 <= p98)))) OR (((1 <= p90) AND (1 <= p98)) OR (((1 <= p86) AND (1 <= p95)) AND (A (F ((((1 <= p41) AND (1 <= p54)) OR (1 <= p43)))) AND (((1 <= p91) AND (1 <= p97)) OR (E (F (((1 <= p68) AND (1 <= p90)))) AND ((p90 <= 0) OR (p98 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p90 <= 0) OR (p98 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p90 <= 0) OR (p98 <= 0))
lola: processed formula length: 27
lola: 212 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 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p91) AND (1 <= p97))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p91) AND (1 <= p97))
lola: processed formula length: 27
lola: 212 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p86) AND (1 <= p95))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p86) AND (1 <= p95))
lola: processed formula length: 27
lola: 212 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: 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 ((((1 <= p48) AND (1 <= p85)) U ((1 <= p90) AND (1 <= p98))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((1 <= p48) AND (1 <= p85)) U ((1 <= p90) AND (1 <= p98))))
lola: processed formula length: 63
lola: 215 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 <= p90) AND (1 <= p98))
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
sara: try reading problem file CTLFireability-17-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 1300 markings, 2600 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((1 <= p42) AND (1 <= p60)) OR ((1 <= p44) AND (1 <= p52)) OR ((1 <= p42) AND (1 <= p58)) OR ((1 <= p42) AND (1 <= p59)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p41) AND (1 <= p55)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p53)) OR ((1 <= p44) AND (1 <= p45)) OR ((1 <= p44) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51))))) OR ((1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p32) OR ((1 <= p33) OR ((1 <= p34) OR ((1 <= p35) OR ((1 <= p37) OR ((1 <= p36) OR ((1 <= p39) OR ((1 <= p38) OR ((1 <= p40) OR ((1 <= p43) OR ((1 <= p23) OR ((1 <= p25) OR ((1 <= p26) OR ((1 <= p27) OR ((1 <= p28) OR ((1 <= p29) OR ((1 <= p30) OR (1 <= p31))))))))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38) OR (1 <= p40) OR (1 <= p43) OR (1 <= p23) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31))
lola: processed formula length: 250
lola: 245 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 18 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p42) AND (1 <= p60)) OR ((1 <= p44) AND (1 <= p52)) OR ((1 <= p42) AND (1 <= p58)) OR ((1 <= p42) AND (1 <= p59)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p41) AND (1 <= p55)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p53)) OR ((1 <= p44) AND (1 <= p45)) OR ((1 <= p44) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51)))))
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: (((p42 <= 0) OR (p60 <= 0)) AND ((p44 <= 0) OR (p52 <= 0)) AND ((p42 <= 0) OR (p58 <= 0)) AND ((p42 <= 0) OR (p59 <= 0)) AND ((p41 <= 0) OR (p56 <= 0)) AND ((p41 <= 0) OR (p55 <= 0)) AND ((p41 <= 0) OR (p54 <= 0)) AND ((p42 <= 0) OR (p53 <= 0)) AND ((p44 <= 0) OR (p45 <= 0)) AND ((p44 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p49 <= 0)) AND ((p44 <= 0) OR (p51 <= 0)))
lola: processed formula length: 381
lola: 215 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 281 markings, 331 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G (((((1 <= p42) AND (1 <= p101)) OR ((1 <= p44) AND (1 <= p93)) OR ((1 <= p41) AND (1 <= p94))) AND (((1 <= p66) AND (1 <= p89)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p79)) OR ((1 <= p68) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p92)) OR ((1 <= p57) AND (1 <= p89)) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G (((1 <= p21) OR (1 <= p22) OR (1 <= p24)))) AND ((1 <= p80) OR (1 <= p83) OR (1 <= p69) OR (1 <= p73) OR (1 <= p72) OR (1 <= p62)))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((p21 <= 0) AND (p22 <= 0) AND (p24 <= 0))) OR ((p80 <= 0) AND (p83 <= 0) AND (p69 <= 0) AND (p73 <= 0) AND (p72 <= 0) AND (p62 <= 0))))
lola: processed formula length: 143
lola: 222 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 276 markings, 336 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E ((((1 <= p48) AND (1 <= p85)) U ((1 <= p90) AND (1 <= p98)))) OR (((1 <= p90) AND (1 <= p98)) OR (((1 <= p86) AND (1 <= p95)) AND (A (F ((((1 <= p41) AND (1 <= p54)) OR (1 <= p43)))) AND (((1 <= p91) AND (1 <= p97)) OR (E (F (((1 <= p68) AND (1 <= p90)))) AND ((p90 <= 0) OR (p98 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p90 <= 0) OR (p98 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p90 <= 0) OR (p98 <= 0))
lola: processed formula length: 27
lola: 212 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: ((1 <= p91) AND (1 <= p97))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p91) AND (1 <= p97))
lola: processed formula length: 27
lola: 212 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p86) AND (1 <= p95))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p86) AND (1 <= p95))
lola: processed formula length: 27
lola: 212 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p90) AND (1 <= p98))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p90) AND (1 <= p98))
lola: processed formula length: 27
lola: 212 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p48) AND (1 <= p85)) U ((1 <= p90) AND (1 <= p98))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((1 <= p48) AND (1 <= p85)) U ((1 <= p90) AND (1 <= p98))))
lola: processed formula length: 63
lola: 215 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 <= p90) AND (1 <= p98))
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-20-0.sara
lola: state equation: calling and running sara
sara: lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 1300 markings, 2600 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes no yes no no yes yes no no no yes no
lola:
preliminary result: yes yes yes no yes no yes no no yes yes no no no yes no
lola: memory consumption: 89924 KB
lola: time consumption: 5 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: 16055468 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16054948 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-2"
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-2, 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-158987853600708"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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