Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.6K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 30 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 30 00:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 67K Mar 24 05:37 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 DoubleExponent-PT-004-00
FORMULA_NAME DoubleExponent-PT-004-01
FORMULA_NAME DoubleExponent-PT-004-02
FORMULA_NAME DoubleExponent-PT-004-03
FORMULA_NAME DoubleExponent-PT-004-04
FORMULA_NAME DoubleExponent-PT-004-05
FORMULA_NAME DoubleExponent-PT-004-06
FORMULA_NAME DoubleExponent-PT-004-07
FORMULA_NAME DoubleExponent-PT-004-08
FORMULA_NAME DoubleExponent-PT-004-09
FORMULA_NAME DoubleExponent-PT-004-10
FORMULA_NAME DoubleExponent-PT-004-11
FORMULA_NAME DoubleExponent-PT-004-12
FORMULA_NAME DoubleExponent-PT-004-13
FORMULA_NAME DoubleExponent-PT-004-14
FORMULA_NAME DoubleExponent-PT-004-15

=== Now, execution of the tool begins

BK_START 1591239219328

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:53:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 02:53:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:53:41] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2020-06-04 02:53:41] [INFO ] Transformed 216 places.
[2020-06-04 02:53:41] [INFO ] Transformed 198 transitions.
[2020-06-04 02:53:41] [INFO ] Parsed PT model containing 216 places and 198 transitions in 107 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3342 resets, run finished after 216 ms. (steps per millisecond=462 ) properties seen :[0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1]
// Phase 1: matrix 198 rows 216 cols
[2020-06-04 02:53:41] [INFO ] Computed 24 place invariants in 14 ms
[2020-06-04 02:53:41] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-06-04 02:53:41] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 14 ms returned sat
[2020-06-04 02:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:41] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2020-06-04 02:53:41] [INFO ] Deduced a trap composed of 66 places in 128 ms
[2020-06-04 02:53:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2020-06-04 02:53:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:53:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-06-04 02:53:42] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2020-06-04 02:53:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:42] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2020-06-04 02:53:42] [INFO ] Deduced a trap composed of 66 places in 67 ms
[2020-06-04 02:53:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2020-06-04 02:53:42] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 16 ms.
[2020-06-04 02:53:42] [INFO ] Added : 97 causal constraints over 20 iterations in 285 ms. Result :sat
[2020-06-04 02:53:42] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-04 02:53:42] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2020-06-04 02:53:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:42] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2020-06-04 02:53:42] [INFO ] Deduced a trap composed of 79 places in 81 ms
[2020-06-04 02:53:42] [INFO ] Deduced a trap composed of 31 places in 63 ms
[2020-06-04 02:53:42] [INFO ] Deduced a trap composed of 86 places in 76 ms
[2020-06-04 02:53:43] [INFO ] Deduced a trap composed of 93 places in 61 ms
[2020-06-04 02:53:43] [INFO ] Deduced a trap composed of 61 places in 67 ms
[2020-06-04 02:53:43] [INFO ] Deduced a trap composed of 77 places in 59 ms
[2020-06-04 02:53:43] [INFO ] Deduced a trap composed of 84 places in 55 ms
[2020-06-04 02:53:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 535 ms
[2020-06-04 02:53:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:53:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-04 02:53:43] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 7 ms returned sat
[2020-06-04 02:53:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:43] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2020-06-04 02:53:43] [INFO ] Deduced a trap composed of 79 places in 92 ms
[2020-06-04 02:53:43] [INFO ] Deduced a trap composed of 31 places in 74 ms
[2020-06-04 02:53:43] [INFO ] Deduced a trap composed of 100 places in 68 ms
[2020-06-04 02:53:43] [INFO ] Deduced a trap composed of 81 places in 88 ms
[2020-06-04 02:53:43] [INFO ] Deduced a trap composed of 95 places in 78 ms
[2020-06-04 02:53:44] [INFO ] Deduced a trap composed of 61 places in 89 ms
[2020-06-04 02:53:44] [INFO ] Deduced a trap composed of 77 places in 84 ms
[2020-06-04 02:53:44] [INFO ] Deduced a trap composed of 106 places in 80 ms
[2020-06-04 02:53:44] [INFO ] Deduced a trap composed of 93 places in 79 ms
[2020-06-04 02:53:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 910 ms
[2020-06-04 02:53:44] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 25 ms.
[2020-06-04 02:53:45] [INFO ] Added : 154 causal constraints over 31 iterations in 706 ms. Result :sat
[2020-06-04 02:53:45] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 02:53:45] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 34 ms returned sat
[2020-06-04 02:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:45] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2020-06-04 02:53:45] [INFO ] Deduced a trap composed of 18 places in 120 ms
[2020-06-04 02:53:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2020-06-04 02:53:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:53:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-06-04 02:53:45] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 22 ms returned sat
[2020-06-04 02:53:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:46] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2020-06-04 02:53:46] [INFO ] Deduced a trap composed of 18 places in 107 ms
[2020-06-04 02:53:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2020-06-04 02:53:46] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 14 ms.
[2020-06-04 02:53:47] [INFO ] Added : 123 causal constraints over 25 iterations in 1006 ms. Result :sat
[2020-06-04 02:53:47] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-04 02:53:47] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 61 ms returned sat
[2020-06-04 02:53:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:47] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2020-06-04 02:53:47] [INFO ] Deduced a trap composed of 54 places in 43 ms
[2020-06-04 02:53:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2020-06-04 02:53:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:53:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-06-04 02:53:47] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2020-06-04 02:53:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:47] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2020-06-04 02:53:47] [INFO ] Deduced a trap composed of 54 places in 45 ms
[2020-06-04 02:53:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2020-06-04 02:53:47] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 14 ms.
[2020-06-04 02:53:49] [INFO ] Added : 195 causal constraints over 39 iterations in 1150 ms. Result :sat
[2020-06-04 02:53:49] [INFO ] Deduced a trap composed of 66 places in 245 ms
[2020-06-04 02:53:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2020-06-04 02:53:49] [INFO ] [Real]Absence check using 3 positive place invariants in 29 ms returned sat
[2020-06-04 02:53:49] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 23 ms returned sat
[2020-06-04 02:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:49] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2020-06-04 02:53:49] [INFO ] Deduced a trap composed of 70 places in 107 ms
[2020-06-04 02:53:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2020-06-04 02:53:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:53:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-06-04 02:53:50] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 34 ms returned sat
[2020-06-04 02:53:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:50] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2020-06-04 02:53:50] [INFO ] Deduced a trap composed of 70 places in 117 ms
[2020-06-04 02:53:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2020-06-04 02:53:50] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 19 ms.
[2020-06-04 02:53:51] [INFO ] Added : 192 causal constraints over 39 iterations in 815 ms. Result :sat
[2020-06-04 02:53:51] [INFO ] Deduced a trap composed of 88 places in 121 ms
[2020-06-04 02:53:51] [INFO ] Deduced a trap composed of 70 places in 93 ms
[2020-06-04 02:53:51] [INFO ] Deduced a trap composed of 71 places in 85 ms
[2020-06-04 02:53:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 424 ms
[2020-06-04 02:53:51] [INFO ] [Real]Absence check using 3 positive place invariants in 35 ms returned sat
[2020-06-04 02:53:51] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 20 ms returned sat
[2020-06-04 02:53:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:52] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2020-06-04 02:53:52] [INFO ] Deduced a trap composed of 52 places in 121 ms
[2020-06-04 02:53:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2020-06-04 02:53:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:53:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 24 ms returned sat
[2020-06-04 02:53:52] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2020-06-04 02:53:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:52] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2020-06-04 02:53:52] [INFO ] Deduced a trap composed of 52 places in 34 ms
[2020-06-04 02:53:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2020-06-04 02:53:52] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 12 ms.
[2020-06-04 02:53:53] [INFO ] Added : 194 causal constraints over 39 iterations in 747 ms. Result :sat
[2020-06-04 02:53:53] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 02:53:53] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-06-04 02:53:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:53] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2020-06-04 02:53:53] [INFO ] Deduced a trap composed of 65 places in 154 ms
[2020-06-04 02:53:53] [INFO ] Deduced a trap composed of 90 places in 173 ms
[2020-06-04 02:53:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2020-06-04 02:53:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:53:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 23 ms returned sat
[2020-06-04 02:53:54] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 52 ms returned sat
[2020-06-04 02:53:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:54] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2020-06-04 02:53:54] [INFO ] Deduced a trap composed of 65 places in 115 ms
[2020-06-04 02:53:54] [INFO ] Deduced a trap composed of 87 places in 145 ms
[2020-06-04 02:53:54] [INFO ] Deduced a trap composed of 87 places in 79 ms
[2020-06-04 02:53:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 422 ms
[2020-06-04 02:53:54] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 12 ms.
[2020-06-04 02:53:56] [INFO ] Added : 194 causal constraints over 41 iterations in 1365 ms. Result :sat
[2020-06-04 02:53:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-04 02:53:56] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 13 ms returned sat
[2020-06-04 02:53:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:56] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2020-06-04 02:53:56] [INFO ] Deduced a trap composed of 68 places in 63 ms
[2020-06-04 02:53:56] [INFO ] Deduced a trap composed of 55 places in 75 ms
[2020-06-04 02:53:56] [INFO ] Deduced a trap composed of 77 places in 55 ms
[2020-06-04 02:53:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 237 ms
[2020-06-04 02:53:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:53:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 31 ms returned sat
[2020-06-04 02:53:56] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 157 ms returned sat
[2020-06-04 02:53:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:53:58] [INFO ] [Nat]Absence check using state equation in 1786 ms returned sat
[2020-06-04 02:53:58] [INFO ] Deduced a trap composed of 68 places in 58 ms
[2020-06-04 02:53:58] [INFO ] Deduced a trap composed of 41 places in 76 ms
[2020-06-04 02:54:01] [INFO ] Deduced a trap composed of 59 places in 2518 ms
[2020-06-04 02:54:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2695 ms
[2020-06-04 02:54:01] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 8 ms.
[2020-06-04 02:54:02] [INFO ] Added : 194 causal constraints over 39 iterations in 772 ms. Result :sat
[2020-06-04 02:54:02] [INFO ] Deduced a trap composed of 25 places in 132 ms
[2020-06-04 02:54:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2020-06-04 02:54:02] [INFO ] [Real]Absence check using 3 positive place invariants in 29 ms returned sat
[2020-06-04 02:54:02] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-06-04 02:54:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:02] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2020-06-04 02:54:02] [INFO ] Deduced a trap composed of 54 places in 54 ms
[2020-06-04 02:54:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2020-06-04 02:54:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-06-04 02:54:03] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2020-06-04 02:54:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:03] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2020-06-04 02:54:03] [INFO ] Deduced a trap composed of 54 places in 106 ms
[2020-06-04 02:54:03] [INFO ] Deduced a trap composed of 89 places in 111 ms
[2020-06-04 02:54:03] [INFO ] Deduced a trap composed of 91 places in 133 ms
[2020-06-04 02:54:03] [INFO ] Deduced a trap composed of 29 places in 132 ms
[2020-06-04 02:54:03] [INFO ] Deduced a trap composed of 31 places in 118 ms
[2020-06-04 02:54:03] [INFO ] Deduced a trap composed of 92 places in 92 ms
[2020-06-04 02:54:04] [INFO ] Deduced a trap composed of 104 places in 116 ms
[2020-06-04 02:54:04] [INFO ] Deduced a trap composed of 80 places in 143 ms
[2020-06-04 02:54:04] [INFO ] Deduced a trap composed of 72 places in 126 ms
[2020-06-04 02:54:04] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1207 ms
[2020-06-04 02:54:04] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 18 ms.
[2020-06-04 02:54:05] [INFO ] Added : 187 causal constraints over 38 iterations in 778 ms. Result :sat
[2020-06-04 02:54:05] [INFO ] Deduced a trap composed of 60 places in 189 ms
[2020-06-04 02:54:05] [INFO ] Deduced a trap composed of 43 places in 91 ms
[2020-06-04 02:54:05] [INFO ] Deduced a trap composed of 41 places in 74 ms
[2020-06-04 02:54:05] [INFO ] Deduced a trap composed of 52 places in 165 ms
[2020-06-04 02:54:05] [INFO ] Deduced a trap composed of 48 places in 71 ms
[2020-06-04 02:54:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 731 ms
[2020-06-04 02:54:05] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-04 02:54:05] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 23 ms returned sat
[2020-06-04 02:54:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:06] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2020-06-04 02:54:06] [INFO ] Deduced a trap composed of 74 places in 105 ms
[2020-06-04 02:54:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2020-06-04 02:54:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-06-04 02:54:06] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2020-06-04 02:54:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:06] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2020-06-04 02:54:07] [INFO ] Deduced a trap composed of 74 places in 90 ms
[2020-06-04 02:54:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2020-06-04 02:54:07] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 13 ms.
[2020-06-04 02:54:07] [INFO ] Added : 195 causal constraints over 39 iterations in 932 ms. Result :sat
[2020-06-04 02:54:08] [INFO ] Deduced a trap composed of 101 places in 103 ms
[2020-06-04 02:54:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2020-06-04 02:54:08] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-04 02:54:08] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2020-06-04 02:54:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:08] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2020-06-04 02:54:08] [INFO ] Deduced a trap composed of 25 places in 125 ms
[2020-06-04 02:54:08] [INFO ] Deduced a trap composed of 18 places in 150 ms
[2020-06-04 02:54:08] [INFO ] Deduced a trap composed of 31 places in 73 ms
[2020-06-04 02:54:08] [INFO ] Deduced a trap composed of 35 places in 153 ms
[2020-06-04 02:54:08] [INFO ] Deduced a trap composed of 84 places in 69 ms
[2020-06-04 02:54:09] [INFO ] Deduced a trap composed of 80 places in 280 ms
[2020-06-04 02:54:09] [INFO ] Deduced a trap composed of 105 places in 117 ms
[2020-06-04 02:54:09] [INFO ] Deduced a trap composed of 93 places in 91 ms
[2020-06-04 02:54:09] [INFO ] Deduced a trap composed of 94 places in 107 ms
[2020-06-04 02:54:09] [INFO ] Deduced a trap composed of 89 places in 98 ms
[2020-06-04 02:54:09] [INFO ] Deduced a trap composed of 80 places in 95 ms
[2020-06-04 02:54:09] [INFO ] Deduced a trap composed of 87 places in 92 ms
[2020-06-04 02:54:09] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1614 ms
[2020-06-04 02:54:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-06-04 02:54:10] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2020-06-04 02:54:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:10] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2020-06-04 02:54:10] [INFO ] Deduced a trap composed of 25 places in 71 ms
[2020-06-04 02:54:10] [INFO ] Deduced a trap composed of 18 places in 75 ms
[2020-06-04 02:54:10] [INFO ] Deduced a trap composed of 31 places in 596 ms
[2020-06-04 02:54:11] [INFO ] Deduced a trap composed of 35 places in 83 ms
[2020-06-04 02:54:11] [INFO ] Deduced a trap composed of 82 places in 70 ms
[2020-06-04 02:54:11] [INFO ] Deduced a trap composed of 77 places in 82 ms
[2020-06-04 02:54:11] [INFO ] Deduced a trap composed of 87 places in 118 ms
[2020-06-04 02:54:11] [INFO ] Deduced a trap composed of 76 places in 110 ms
[2020-06-04 02:54:11] [INFO ] Deduced a trap composed of 81 places in 81 ms
[2020-06-04 02:54:11] [INFO ] Deduced a trap composed of 92 places in 76 ms
[2020-06-04 02:54:11] [INFO ] Deduced a trap composed of 84 places in 90 ms
[2020-06-04 02:54:11] [INFO ] Deduced a trap composed of 43 places in 91 ms
[2020-06-04 02:54:12] [INFO ] Deduced a trap composed of 93 places in 78 ms
[2020-06-04 02:54:12] [INFO ] Deduced a trap composed of 89 places in 79 ms
[2020-06-04 02:54:12] [INFO ] Deduced a trap composed of 95 places in 84 ms
[2020-06-04 02:54:12] [INFO ] Deduced a trap composed of 89 places in 95 ms
[2020-06-04 02:54:12] [INFO ] Deduced a trap composed of 95 places in 79 ms
[2020-06-04 02:54:12] [INFO ] Deduced a trap composed of 100 places in 79 ms
[2020-06-04 02:54:12] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2319 ms
[2020-06-04 02:54:12] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 17 ms.
[2020-06-04 02:54:13] [INFO ] Added : 158 causal constraints over 32 iterations in 648 ms. Result :sat
[2020-06-04 02:54:13] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-04 02:54:13] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 16 ms returned sat
[2020-06-04 02:54:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:13] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2020-06-04 02:54:13] [INFO ] Deduced a trap composed of 85 places in 118 ms
[2020-06-04 02:54:13] [INFO ] Deduced a trap composed of 90 places in 80 ms
[2020-06-04 02:54:13] [INFO ] Deduced a trap composed of 78 places in 88 ms
[2020-06-04 02:54:13] [INFO ] Deduced a trap composed of 59 places in 76 ms
[2020-06-04 02:54:13] [INFO ] Deduced a trap composed of 41 places in 49 ms
[2020-06-04 02:54:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 501 ms
[2020-06-04 02:54:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-06-04 02:54:14] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2020-06-04 02:54:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:14] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2020-06-04 02:54:14] [INFO ] Deduced a trap composed of 85 places in 100 ms
[2020-06-04 02:54:14] [INFO ] Deduced a trap composed of 72 places in 92 ms
[2020-06-04 02:54:14] [INFO ] Deduced a trap composed of 93 places in 75 ms
[2020-06-04 02:54:14] [INFO ] Deduced a trap composed of 59 places in 81 ms
[2020-06-04 02:54:14] [INFO ] Deduced a trap composed of 41 places in 37 ms
[2020-06-04 02:54:14] [INFO ] Deduced a trap composed of 43 places in 45 ms
[2020-06-04 02:54:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 539 ms
[2020-06-04 02:54:14] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 16 ms.
[2020-06-04 02:54:15] [INFO ] Added : 193 causal constraints over 40 iterations in 766 ms. Result :sat
[2020-06-04 02:54:15] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-04 02:54:15] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2020-06-04 02:54:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:15] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2020-06-04 02:54:15] [INFO ] Deduced a trap composed of 86 places in 165 ms
[2020-06-04 02:54:16] [INFO ] Deduced a trap composed of 89 places in 122 ms
[2020-06-04 02:54:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 324 ms
[2020-06-04 02:54:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-06-04 02:54:16] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2020-06-04 02:54:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:17] [INFO ] [Nat]Absence check using state equation in 1618 ms returned sat
[2020-06-04 02:54:17] [INFO ] Deduced a trap composed of 86 places in 100 ms
[2020-06-04 02:54:17] [INFO ] Deduced a trap composed of 41 places in 88 ms
[2020-06-04 02:54:18] [INFO ] Deduced a trap composed of 80 places in 188 ms
[2020-06-04 02:54:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 441 ms
[2020-06-04 02:54:18] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 12 ms.
[2020-06-04 02:54:18] [INFO ] Added : 156 causal constraints over 32 iterations in 512 ms. Result :sat
[2020-06-04 02:54:18] [INFO ] Deduced a trap composed of 77 places in 101 ms
[2020-06-04 02:54:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2020-06-04 02:54:18] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 02:54:18] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-06-04 02:54:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:19] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2020-06-04 02:54:19] [INFO ] Deduced a trap composed of 86 places in 92 ms
[2020-06-04 02:54:19] [INFO ] Deduced a trap composed of 89 places in 111 ms
[2020-06-04 02:54:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 290 ms
[2020-06-04 02:54:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-06-04 02:54:19] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 16 ms returned sat
[2020-06-04 02:54:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:19] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2020-06-04 02:54:19] [INFO ] Deduced a trap composed of 86 places in 112 ms
[2020-06-04 02:54:19] [INFO ] Deduced a trap composed of 41 places in 170 ms
[2020-06-04 02:54:20] [INFO ] Deduced a trap composed of 80 places in 115 ms
[2020-06-04 02:54:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 443 ms
[2020-06-04 02:54:20] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 26 ms.
[2020-06-04 02:54:20] [INFO ] Added : 156 causal constraints over 32 iterations in 732 ms. Result :sat
[2020-06-04 02:54:20] [INFO ] Deduced a trap composed of 77 places in 103 ms
[2020-06-04 02:54:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2020-06-04 02:54:21] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 02:54:21] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 16 ms returned sat
[2020-06-04 02:54:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:21] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2020-06-04 02:54:21] [INFO ] Deduced a trap composed of 49 places in 651 ms
[2020-06-04 02:54:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 685 ms
[2020-06-04 02:54:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-06-04 02:54:22] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 29 ms returned sat
[2020-06-04 02:54:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:22] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2020-06-04 02:54:22] [INFO ] Deduced a trap composed of 49 places in 45 ms
[2020-06-04 02:54:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2020-06-04 02:54:22] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 13 ms.
[2020-06-04 02:54:23] [INFO ] Added : 194 causal constraints over 39 iterations in 888 ms. Result :sat
[2020-06-04 02:54:23] [INFO ] Deduced a trap composed of 18 places in 100 ms
[2020-06-04 02:54:23] [INFO ] Deduced a trap composed of 16 places in 85 ms
[2020-06-04 02:54:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
[2020-06-04 02:54:23] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 02:54:23] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 18 ms returned sat
[2020-06-04 02:54:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:23] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2020-06-04 02:54:23] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2020-06-04 02:54:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2020-06-04 02:54:23] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2020-06-04 02:54:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:24] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2020-06-04 02:54:24] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 15 ms.
[2020-06-04 02:54:24] [INFO ] Added : 192 causal constraints over 39 iterations in 781 ms. Result :sat
[2020-06-04 02:54:25] [INFO ] Deduced a trap composed of 78 places in 118 ms
[2020-06-04 02:54:25] [INFO ] Deduced a trap composed of 91 places in 103 ms
[2020-06-04 02:54:25] [INFO ] Deduced a trap composed of 80 places in 78 ms
[2020-06-04 02:54:25] [INFO ] Deduced a trap composed of 97 places in 96 ms
[2020-06-04 02:54:25] [INFO ] Deduced a trap composed of 81 places in 83 ms
[2020-06-04 02:54:25] [INFO ] Deduced a trap composed of 107 places in 80 ms
[2020-06-04 02:54:25] [INFO ] Deduced a trap composed of 80 places in 84 ms
[2020-06-04 02:54:25] [INFO ] Deduced a trap composed of 79 places in 80 ms
[2020-06-04 02:54:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 890 ms
[2020-06-04 02:54:25] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-04 02:54:25] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 13 ms returned sat
[2020-06-04 02:54:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:26] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2020-06-04 02:54:26] [INFO ] Deduced a trap composed of 58 places in 58 ms
[2020-06-04 02:54:26] [INFO ] Deduced a trap composed of 60 places in 55 ms
[2020-06-04 02:54:26] [INFO ] Deduced a trap composed of 68 places in 57 ms
[2020-06-04 02:54:26] [INFO ] Deduced a trap composed of 54 places in 47 ms
[2020-06-04 02:54:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 283 ms
[2020-06-04 02:54:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2020-06-04 02:54:26] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-06-04 02:54:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:26] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2020-06-04 02:54:26] [INFO ] Deduced a trap composed of 58 places in 57 ms
[2020-06-04 02:54:26] [INFO ] Deduced a trap composed of 77 places in 45 ms
[2020-06-04 02:54:26] [INFO ] Deduced a trap composed of 54 places in 43 ms
[2020-06-04 02:54:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 190 ms
[2020-06-04 02:54:26] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 14 ms.
[2020-06-04 02:54:27] [INFO ] Added : 195 causal constraints over 40 iterations in 797 ms. Result :sat
[2020-06-04 02:54:27] [INFO ] Deduced a trap composed of 55 places in 76 ms
[2020-06-04 02:54:27] [INFO ] Deduced a trap composed of 43 places in 62 ms
[2020-06-04 02:54:27] [INFO ] Deduced a trap composed of 49 places in 48 ms
[2020-06-04 02:54:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 280 ms
[2020-06-04 02:54:28] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-04 02:54:28] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 14 ms returned sat
[2020-06-04 02:54:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:28] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2020-06-04 02:54:28] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 17 ms.
[2020-06-04 02:54:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-04 02:54:28] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 13 ms returned sat
[2020-06-04 02:54:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:28] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2020-06-04 02:54:28] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 13 ms.
[2020-06-04 02:54:29] [INFO ] Added : 193 causal constraints over 40 iterations in 684 ms. Result :sat
[2020-06-04 02:54:29] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 02:54:29] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 18 ms returned sat
[2020-06-04 02:54:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:29] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2020-06-04 02:54:29] [INFO ] Deduced a trap composed of 61 places in 91 ms
[2020-06-04 02:54:29] [INFO ] Deduced a trap composed of 83 places in 108 ms
[2020-06-04 02:54:29] [INFO ] Deduced a trap composed of 82 places in 88 ms
[2020-06-04 02:54:29] [INFO ] Deduced a trap composed of 61 places in 78 ms
[2020-06-04 02:54:30] [INFO ] Deduced a trap composed of 89 places in 80 ms
[2020-06-04 02:54:30] [INFO ] Deduced a trap composed of 63 places in 80 ms
[2020-06-04 02:54:30] [INFO ] Deduced a trap composed of 82 places in 77 ms
[2020-06-04 02:54:30] [INFO ] Deduced a trap composed of 83 places in 71 ms
[2020-06-04 02:54:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 777 ms
[2020-06-04 02:54:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-06-04 02:54:30] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2020-06-04 02:54:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:30] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2020-06-04 02:54:30] [INFO ] Deduced a trap composed of 61 places in 100 ms
[2020-06-04 02:54:30] [INFO ] Deduced a trap composed of 41 places in 80 ms
[2020-06-04 02:54:30] [INFO ] Deduced a trap composed of 86 places in 99 ms
[2020-06-04 02:54:30] [INFO ] Deduced a trap composed of 77 places in 75 ms
[2020-06-04 02:54:31] [INFO ] Deduced a trap composed of 78 places in 104 ms
[2020-06-04 02:54:31] [INFO ] Deduced a trap composed of 82 places in 83 ms
[2020-06-04 02:54:31] [INFO ] Deduced a trap composed of 16 places in 110 ms
[2020-06-04 02:54:31] [INFO ] Deduced a trap composed of 81 places in 104 ms
[2020-06-04 02:54:31] [INFO ] Deduced a trap composed of 63 places in 62 ms
[2020-06-04 02:54:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 970 ms
[2020-06-04 02:54:31] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 13 ms.
[2020-06-04 02:54:32] [INFO ] Added : 194 causal constraints over 39 iterations in 1013 ms. Result :sat
[2020-06-04 02:54:32] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 02:54:32] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 16 ms returned sat
[2020-06-04 02:54:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:32] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2020-06-04 02:54:32] [INFO ] Deduced a trap composed of 61 places in 101 ms
[2020-06-04 02:54:33] [INFO ] Deduced a trap composed of 83 places in 86 ms
[2020-06-04 02:54:33] [INFO ] Deduced a trap composed of 61 places in 100 ms
[2020-06-04 02:54:33] [INFO ] Deduced a trap composed of 82 places in 77 ms
[2020-06-04 02:54:33] [INFO ] Deduced a trap composed of 87 places in 73 ms
[2020-06-04 02:54:33] [INFO ] Deduced a trap composed of 41 places in 58 ms
[2020-06-04 02:54:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 569 ms
[2020-06-04 02:54:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-06-04 02:54:33] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 12 ms returned sat
[2020-06-04 02:54:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:33] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2020-06-04 02:54:33] [INFO ] Deduced a trap composed of 61 places in 95 ms
[2020-06-04 02:54:33] [INFO ] Deduced a trap composed of 41 places in 85 ms
[2020-06-04 02:54:33] [INFO ] Deduced a trap composed of 86 places in 77 ms
[2020-06-04 02:54:33] [INFO ] Deduced a trap composed of 77 places in 77 ms
[2020-06-04 02:54:34] [INFO ] Deduced a trap composed of 86 places in 99 ms
[2020-06-04 02:54:34] [INFO ] Deduced a trap composed of 95 places in 88 ms
[2020-06-04 02:54:34] [INFO ] Deduced a trap composed of 63 places in 70 ms
[2020-06-04 02:54:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 682 ms
[2020-06-04 02:54:34] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 27 ms.
[2020-06-04 02:54:35] [INFO ] Added : 185 causal constraints over 38 iterations in 1125 ms. Result :sat
[2020-06-04 02:54:35] [INFO ] [Real]Absence check using 3 positive place invariants in 26 ms returned sat
[2020-06-04 02:54:35] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 35 ms returned sat
[2020-06-04 02:54:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:35] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2020-06-04 02:54:35] [INFO ] Deduced a trap composed of 75 places in 105 ms
[2020-06-04 02:54:37] [INFO ] Deduced a trap composed of 85 places in 1498 ms
[2020-06-04 02:54:37] [INFO ] Deduced a trap composed of 99 places in 85 ms
[2020-06-04 02:54:37] [INFO ] Deduced a trap composed of 87 places in 75 ms
[2020-06-04 02:54:37] [INFO ] Deduced a trap composed of 78 places in 81 ms
[2020-06-04 02:54:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1970 ms
[2020-06-04 02:54:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-06-04 02:54:37] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2020-06-04 02:54:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:38] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2020-06-04 02:54:38] [INFO ] Deduced a trap composed of 75 places in 106 ms
[2020-06-04 02:54:38] [INFO ] Deduced a trap composed of 94 places in 87 ms
[2020-06-04 02:54:38] [INFO ] Deduced a trap composed of 92 places in 135 ms
[2020-06-04 02:54:38] [INFO ] Deduced a trap composed of 86 places in 109 ms
[2020-06-04 02:54:38] [INFO ] Deduced a trap composed of 41 places in 126 ms
[2020-06-04 02:54:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 629 ms
[2020-06-04 02:54:38] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 12 ms.
[2020-06-04 02:54:39] [INFO ] Added : 195 causal constraints over 39 iterations in 790 ms. Result :sat
[2020-06-04 02:54:39] [INFO ] Deduced a trap composed of 86 places in 132 ms
[2020-06-04 02:54:39] [INFO ] Deduced a trap composed of 107 places in 91 ms
[2020-06-04 02:54:39] [INFO ] Deduced a trap composed of 68 places in 60 ms
[2020-06-04 02:54:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 384 ms
[2020-06-04 02:54:39] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-04 02:54:39] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2020-06-04 02:54:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:40] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2020-06-04 02:54:40] [INFO ] Deduced a trap composed of 83 places in 140 ms
[2020-06-04 02:54:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2020-06-04 02:54:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-06-04 02:54:40] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 14 ms returned sat
[2020-06-04 02:54:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:40] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2020-06-04 02:54:40] [INFO ] Deduced a trap composed of 83 places in 157 ms
[2020-06-04 02:54:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2020-06-04 02:54:40] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2020-06-04 02:54:41] [INFO ] Added : 193 causal constraints over 39 iterations in 840 ms. Result :sat
[2020-06-04 02:54:41] [INFO ] Deduced a trap composed of 41 places in 52 ms
[2020-06-04 02:54:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2020-06-04 02:54:41] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-04 02:54:41] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-06-04 02:54:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:41] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2020-06-04 02:54:42] [INFO ] Deduced a trap composed of 87 places in 94 ms
[2020-06-04 02:54:42] [INFO ] Deduced a trap composed of 94 places in 472 ms
[2020-06-04 02:54:42] [INFO ] Deduced a trap composed of 86 places in 96 ms
[2020-06-04 02:54:42] [INFO ] Deduced a trap composed of 94 places in 185 ms
[2020-06-04 02:54:43] [INFO ] Deduced a trap composed of 92 places in 143 ms
[2020-06-04 02:54:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1072 ms
[2020-06-04 02:54:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 02:54:43] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2020-06-04 02:54:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:43] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2020-06-04 02:54:43] [INFO ] Deduced a trap composed of 87 places in 107 ms
[2020-06-04 02:54:43] [INFO ] Deduced a trap composed of 97 places in 78 ms
[2020-06-04 02:54:43] [INFO ] Deduced a trap composed of 88 places in 103 ms
[2020-06-04 02:54:43] [INFO ] Deduced a trap composed of 58 places in 74 ms
[2020-06-04 02:54:44] [INFO ] Deduced a trap composed of 113 places in 73 ms
[2020-06-04 02:54:44] [INFO ] Deduced a trap composed of 106 places in 111 ms
[2020-06-04 02:54:44] [INFO ] Deduced a trap composed of 84 places in 72 ms
[2020-06-04 02:54:46] [INFO ] Deduced a trap composed of 46 places in 1952 ms
[2020-06-04 02:54:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2769 ms
[2020-06-04 02:54:46] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 16 ms.
[2020-06-04 02:54:47] [INFO ] Added : 195 causal constraints over 40 iterations in 999 ms. Result :sat
[2020-06-04 02:54:47] [INFO ] Deduced a trap composed of 79 places in 87 ms
[2020-06-04 02:54:47] [INFO ] Deduced a trap composed of 101 places in 85 ms
[2020-06-04 02:54:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 290 ms
[2020-06-04 02:54:47] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 02:54:47] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-06-04 02:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:47] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2020-06-04 02:54:47] [INFO ] Deduced a trap composed of 70 places in 64 ms
[2020-06-04 02:54:47] [INFO ] Deduced a trap composed of 43 places in 63 ms
[2020-06-04 02:54:47] [INFO ] Deduced a trap composed of 41 places in 61 ms
[2020-06-04 02:54:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 233 ms
[2020-06-04 02:54:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 28 ms returned sat
[2020-06-04 02:54:48] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 157 ms returned sat
[2020-06-04 02:54:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:50] [INFO ] [Nat]Absence check using state equation in 1789 ms returned sat
[2020-06-04 02:54:50] [INFO ] Deduced a trap composed of 70 places in 58 ms
[2020-06-04 02:54:50] [INFO ] Deduced a trap composed of 43 places in 221 ms
[2020-06-04 02:54:50] [INFO ] Deduced a trap composed of 61 places in 52 ms
[2020-06-04 02:54:50] [INFO ] Deduced a trap composed of 41 places in 49 ms
[2020-06-04 02:54:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 450 ms
[2020-06-04 02:54:50] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 12 ms.
[2020-06-04 02:54:51] [INFO ] Added : 194 causal constraints over 39 iterations in 1165 ms. Result :sat
[2020-06-04 02:54:51] [INFO ] Deduced a trap composed of 49 places in 59 ms
[2020-06-04 02:54:51] [INFO ] Deduced a trap composed of 55 places in 68 ms
[2020-06-04 02:54:51] [INFO ] Deduced a trap composed of 68 places in 49 ms
[2020-06-04 02:54:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 311 ms
[2020-06-04 02:54:51] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-04 02:54:51] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2020-06-04 02:54:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:52] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2020-06-04 02:54:52] [INFO ] Deduced a trap composed of 76 places in 73 ms
[2020-06-04 02:54:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2020-06-04 02:54:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-06-04 02:54:52] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 14 ms returned sat
[2020-06-04 02:54:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:52] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2020-06-04 02:54:52] [INFO ] Deduced a trap composed of 76 places in 108 ms
[2020-06-04 02:54:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2020-06-04 02:54:52] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2020-06-04 02:54:53] [INFO ] Added : 110 causal constraints over 22 iterations in 489 ms. Result :sat
[2020-06-04 02:54:53] [INFO ] [Real]Absence check using 3 positive place invariants in 20 ms returned sat
[2020-06-04 02:54:53] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 138 ms returned sat
[2020-06-04 02:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:53] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2020-06-04 02:54:53] [INFO ] Deduced a trap composed of 73 places in 76 ms
[2020-06-04 02:54:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2020-06-04 02:54:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-06-04 02:54:53] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 13 ms returned sat
[2020-06-04 02:54:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:54] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2020-06-04 02:54:54] [INFO ] Deduced a trap composed of 73 places in 105 ms
[2020-06-04 02:54:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2020-06-04 02:54:54] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2020-06-04 02:54:54] [INFO ] Added : 101 causal constraints over 21 iterations in 358 ms. Result :sat
[2020-06-04 02:54:54] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 02:54:54] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-06-04 02:54:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:54] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2020-06-04 02:54:54] [INFO ] Deduced a trap composed of 70 places in 75 ms
[2020-06-04 02:54:55] [INFO ] Deduced a trap composed of 81 places in 94 ms
[2020-06-04 02:54:55] [INFO ] Deduced a trap composed of 74 places in 100 ms
[2020-06-04 02:54:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 341 ms
[2020-06-04 02:54:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:54:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-06-04 02:54:55] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 12 ms returned sat
[2020-06-04 02:54:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:55] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2020-06-04 02:54:55] [INFO ] Deduced a trap composed of 70 places in 443 ms
[2020-06-04 02:54:56] [INFO ] Deduced a trap composed of 48 places in 402 ms
[2020-06-04 02:54:56] [INFO ] Deduced a trap composed of 55 places in 67 ms
[2020-06-04 02:54:56] [INFO ] Deduced a trap composed of 51 places in 40 ms
[2020-06-04 02:54:56] [INFO ] Deduced a trap composed of 59 places in 49 ms
[2020-06-04 02:54:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1063 ms
[2020-06-04 02:54:56] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2020-06-04 02:54:57] [INFO ] Added : 161 causal constraints over 33 iterations in 596 ms. Result :sat
[2020-06-04 02:54:57] [INFO ] Deduced a trap composed of 29 places in 130 ms
[2020-06-04 02:54:57] [INFO ] Deduced a trap composed of 31 places in 134 ms
[2020-06-04 02:54:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2020-06-04 02:54:57] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-04 02:54:57] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 13 ms returned sat
[2020-06-04 02:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:54:57] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2020-06-04 02:55:00] [INFO ] Deduced a trap composed of 70 places in 2783 ms
[2020-06-04 02:55:00] [INFO ] Deduced a trap composed of 81 places in 73 ms
[2020-06-04 02:55:00] [INFO ] Deduced a trap composed of 74 places in 76 ms
[2020-06-04 02:55:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2978 ms
[2020-06-04 02:55:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:55:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-06-04 02:55:00] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 16 ms returned sat
[2020-06-04 02:55:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:55:00] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2020-06-04 02:55:00] [INFO ] Deduced a trap composed of 70 places in 86 ms
[2020-06-04 02:55:01] [INFO ] Deduced a trap composed of 48 places in 97 ms
[2020-06-04 02:55:01] [INFO ] Deduced a trap composed of 55 places in 49 ms
[2020-06-04 02:55:01] [INFO ] Deduced a trap composed of 51 places in 36 ms
[2020-06-04 02:55:01] [INFO ] Deduced a trap composed of 59 places in 36 ms
[2020-06-04 02:55:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 370 ms
[2020-06-04 02:55:01] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2020-06-04 02:55:01] [INFO ] Added : 161 causal constraints over 33 iterations in 703 ms. Result :sat
[2020-06-04 02:55:02] [INFO ] Deduced a trap composed of 29 places in 78 ms
[2020-06-04 02:55:02] [INFO ] Deduced a trap composed of 31 places in 80 ms
[2020-06-04 02:55:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 240 ms
[2020-06-04 02:55:02] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 02:55:02] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-06-04 02:55:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:55:02] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2020-06-04 02:55:02] [INFO ] Deduced a trap composed of 73 places in 172 ms
[2020-06-04 02:55:02] [INFO ] Deduced a trap composed of 94 places in 99 ms
[2020-06-04 02:55:02] [INFO ] Deduced a trap composed of 96 places in 123 ms
[2020-06-04 02:55:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 432 ms
[2020-06-04 02:55:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:55:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-06-04 02:55:02] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2020-06-04 02:55:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:55:03] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2020-06-04 02:55:03] [INFO ] Deduced a trap composed of 73 places in 81 ms
[2020-06-04 02:55:04] [INFO ] Deduced a trap composed of 94 places in 1178 ms
[2020-06-04 02:55:04] [INFO ] Deduced a trap composed of 41 places in 94 ms
[2020-06-04 02:55:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1427 ms
[2020-06-04 02:55:04] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 12 ms.
[2020-06-04 02:55:06] [INFO ] Added : 192 causal constraints over 39 iterations in 1457 ms. Result :sat
[2020-06-04 02:55:06] [INFO ] [Real]Absence check using 3 positive place invariants in 27 ms returned sat
[2020-06-04 02:55:06] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 108 ms returned sat
[2020-06-04 02:55:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:55:06] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2020-06-04 02:55:06] [INFO ] Deduced a trap composed of 63 places in 86 ms
[2020-06-04 02:55:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2020-06-04 02:55:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:55:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-06-04 02:55:06] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 14 ms returned sat
[2020-06-04 02:55:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:55:06] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2020-06-04 02:55:06] [INFO ] Deduced a trap composed of 63 places in 83 ms
[2020-06-04 02:55:07] [INFO ] Deduced a trap composed of 41 places in 104 ms
[2020-06-04 02:55:07] [INFO ] Deduced a trap composed of 67 places in 65 ms
[2020-06-04 02:55:07] [INFO ] Deduced a trap composed of 43 places in 61 ms
[2020-06-04 02:55:07] [INFO ] Deduced a trap composed of 68 places in 69 ms
[2020-06-04 02:55:07] [INFO ] Deduced a trap composed of 69 places in 48 ms
[2020-06-04 02:55:08] [INFO ] Deduced a trap composed of 72 places in 1301 ms
[2020-06-04 02:55:08] [INFO ] Deduced a trap composed of 64 places in 76 ms
[2020-06-04 02:55:08] [INFO ] Deduced a trap composed of 69 places in 69 ms
[2020-06-04 02:55:09] [INFO ] Deduced a trap composed of 69 places in 86 ms
[2020-06-04 02:55:10] [INFO ] Deduced a trap composed of 70 places in 1221 ms
[2020-06-04 02:55:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3413 ms
[2020-06-04 02:55:10] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 18 ms.
[2020-06-04 02:55:11] [INFO ] Added : 191 causal constraints over 39 iterations in 936 ms. Result :sat
[2020-06-04 02:55:11] [INFO ] Deduced a trap composed of 78 places in 145 ms
[2020-06-04 02:55:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2020-06-04 02:55:11] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-04 02:55:11] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2020-06-04 02:55:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:55:11] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2020-06-04 02:55:13] [INFO ] Deduced a trap composed of 16 places in 2060 ms
[2020-06-04 02:55:14] [INFO ] Deduced a trap composed of 57 places in 673 ms
[2020-06-04 02:55:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2781 ms
[2020-06-04 02:55:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:55:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-06-04 02:55:14] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 14 ms returned sat
[2020-06-04 02:55:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:55:14] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2020-06-04 02:55:15] [INFO ] Deduced a trap composed of 16 places in 358 ms
[2020-06-04 02:55:15] [INFO ] Deduced a trap composed of 57 places in 41 ms
[2020-06-04 02:55:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 431 ms
[2020-06-04 02:55:15] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2020-06-04 02:55:15] [INFO ] Added : 161 causal constraints over 33 iterations in 620 ms. Result :sat
[2020-06-04 02:55:15] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned unsat
[2020-06-04 02:55:15] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 02:55:15] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-06-04 02:55:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:55:16] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2020-06-04 02:55:16] [INFO ] Deduced a trap composed of 63 places in 84 ms
[2020-06-04 02:55:16] [INFO ] Deduced a trap composed of 69 places in 92 ms
[2020-06-04 02:55:16] [INFO ] Deduced a trap composed of 71 places in 64 ms
[2020-06-04 02:55:16] [INFO ] Deduced a trap composed of 69 places in 59 ms
[2020-06-04 02:55:17] [INFO ] Deduced a trap composed of 64 places in 572 ms
[2020-06-04 02:55:17] [INFO ] Deduced a trap composed of 67 places in 86 ms
[2020-06-04 02:55:17] [INFO ] Deduced a trap composed of 76 places in 120 ms
[2020-06-04 02:55:17] [INFO ] Deduced a trap composed of 70 places in 77 ms
[2020-06-04 02:55:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1322 ms
[2020-06-04 02:55:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:55:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-06-04 02:55:17] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 12 ms returned sat
[2020-06-04 02:55:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:55:17] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2020-06-04 02:55:17] [INFO ] Deduced a trap composed of 63 places in 61 ms
[2020-06-04 02:55:20] [INFO ] Deduced a trap composed of 69 places in 2118 ms
[2020-06-04 02:55:21] [INFO ] Deduced a trap composed of 71 places in 1422 ms
[2020-06-04 02:55:21] [INFO ] Deduced a trap composed of 69 places in 90 ms
[2020-06-04 02:55:21] [INFO ] Deduced a trap composed of 64 places in 63 ms
[2020-06-04 02:55:21] [INFO ] Deduced a trap composed of 81 places in 100 ms
[2020-06-04 02:55:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4013 ms
[2020-06-04 02:55:21] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 14 ms.
[2020-06-04 02:55:22] [INFO ] Added : 195 causal constraints over 39 iterations in 988 ms. Result :sat
[2020-06-04 02:55:22] [INFO ] Deduced a trap composed of 94 places in 103 ms
[2020-06-04 02:55:23] [INFO ] Deduced a trap composed of 74 places in 65 ms
[2020-06-04 02:55:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-04 02:55:23] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-04 02:55:23] [INFO ] Flatten gal took : 56 ms
FORMULA DoubleExponent-PT-004-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 02:55:23] [INFO ] Flatten gal took : 20 ms
[2020-06-04 02:55:23] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2020-06-04 02:55:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DoubleExponent-PT-004 @ 3570 seconds

FORMULA DoubleExponent-PT-004-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1643
rslt: Output for LTLFireability @ DoubleExponent-PT-004

{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 02:55:23 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p167) AND (1 <= p202)))",
"processed_size": 33,
"rewrites": 53
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((X (F (((1 <= p182) AND (1 <= p199)))) OR ((p6 <= 0) OR (p140 <= 0)))))",
"processed_size": 77,
"rewrites": 53
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((F ((1 <= p40)) AND (F ((1 <= p108)) OR X ((1 <= p40))))))",
"processed_size": 64,
"rewrites": 53
},
"result":
{
"edges": 29,
"markings": 28,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p86) AND (1 <= p106))))",
"processed_size": 36,
"rewrites": 53
},
"result":
{
"edges": 27,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p6) AND (1 <= p140))) OR ((1 <= p1) AND (1 <= p215))))",
"processed_size": 68,
"rewrites": 53
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 401
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((X (X (((p62 <= 0) R (p200 <= 0)))) AND ((1 <= p45) AND (1 <= p194)))))",
"processed_size": 77,
"rewrites": 53
},
"result":
{
"edges": 27,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 458
},
"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 <= p71) AND (1 <= p97))",
"processed_size": 27,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 535
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 3,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (X (G (((((p28 <= 0) OR (p48 <= 0)) U ((1 <= p28) AND (1 <= p48))) OR ((1 <= p28) AND (1 <= p48)))))))",
"processed_size": 108,
"rewrites": 53
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((F ((1 <= p188)) AND ((1 <= p82) U (1 <= p188))))",
"processed_size": 52,
"rewrites": 53
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 710
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p31 <= 0)",
"processed_size": 10,
"rewrites": 55
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 947
},
"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 <= p45) AND (1 <= p194))",
"processed_size": 28,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1421
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((1 <= p27))",
"processed_size": 14,
"rewrites": 53
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2843
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p8 <= 0) OR (p160 <= 0))",
"processed_size": 27,
"rewrites": 55
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1421
},
"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 <= p182) AND (1 <= p191))",
"processed_size": 29,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2843
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p182 <= 0) OR (p191 <= 0))",
"processed_size": 29,
"rewrites": 55
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2843
},
"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 <= p31)",
"processed_size": 10,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"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 <= p31)",
"processed_size": 10,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p92 <= 0))",
"processed_size": 14,
"rewrites": 53
},
"result":
{
"edges": 2479507,
"markings": 2241666,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3812,
"runtime": 1927.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(F((X(F(**)) OR (** OR **)))) OR G(**)) : (G(*) AND F(**)) : F(G((F(**) AND (F(**) OR X(**))))) : G(F(*)) : (F(G(**)) AND F(G((F(**) AND (** OR X(**)))))) : (F(G(*)) OR (G(*) OR **)) : X(F((G(**) OR (F(G(**)) AND F(G(**)))))) : X((F(**) OR **)) : F((F(**) AND (** U **))) : X(G((X(X((* R *))) AND (** AND **)))) : (** OR (F(**) AND F(G(**)))) : (X(X(X(G(((** U **) OR **))))) OR **) : (F(**) OR (G(**) OR **))"
},
"net":
{
"arcs": 558,
"conflict_clusters": 143,
"places": 216,
"places_significant": 192,
"singleton_clusters": 0,
"transitions": 198
},
"result":
{
"preliminary_value": "yes no no unknown no unknown unknown no no no no no no ",
"value": "yes no no unknown no unknown unknown no no no no no 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: 414/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6912
lola: finding significant places
lola: 216 places, 198 transitions, 192 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 LTLFireability.xml
lola: (F (X (((F (X (((1 <= p182) AND (1 <= p199)))) OR (p6 <= 0)) OR (p140 <= 0)))) OR G (((1 <= p167) AND (1 <= p202)))) : (NOT(F (((1 <= p1) AND (1 <= p67)))) AND (F ((X ((((1 <= p1) AND (1 <= p67)) OR ((1 <= p86) AND (1 <= p115)))) OR (1 <= p119))) U F ((1 <= p31)))) : F (G (X ((F ((1 <= p108)) U X ((1 <= p40)))))) : F (NOT(F (G (X (((1 <= p64) AND (1 <= p199))))))) : (F (X (X (G (((1 <= p86) AND (1 <= p106)))))) AND F (G (((p122 <= 0) U X (((1 <= p151) AND (1 <= p194))))))) : ((NOT(G (F (((1 <= p168) AND (1 <= p189))))) OR NOT(F ((1 <= p92)))) OR (1 <= p31)) : X ((F (X (F (((p59 <= 0) OR (p168 <= 0))))) U F ((F (G (((1 <= p59) AND (1 <= p168)))) U G (((p14 <= 0) OR (p49 <= 0))))))) : X ((F (((1 <= p6) AND (1 <= p140))) OR ((1 <= p1) AND (1 <= p215)))) : F ((F ((1 <= p188)) AND ((1 <= p82) U (1 <= p188)))) : X (G (((X (X (NOT(((1 <= p62) U (1 <= p200))))) AND (1 <= p45)) AND (1 <= p194)))) : ((F ((p177 <= 0)) U F (G (X ((p177 <= 0))))) U ((1 <= p182) AND (1 <= p191))) : (G (X (X (X (((((p28 <= 0) OR (p48 <= 0)) U ((1 <= p28) AND (1 <= p48))) OR ((1 <= p28) AND (1 <= p48))))))) OR ((1 <= p71) AND (1 <= p97))) : ((F (((1 <= p8) AND (1 <= p160))) OR G ((1 <= p27))) OR ((1 <= p45) AND (1 <= p194)))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((X (F (((1 <= p182) AND (1 <= p199)))) OR ((p6 <= 0) OR (p140 <= 0))))) OR G (((1 <= p167) AND (1 <= p202))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p167) AND (1 <= p202)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p167) AND (1 <= p202)))
lola: processed formula length: 33
lola: 53 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (F (((1 <= p182) AND (1 <= p199)))) OR ((p6 <= 0) OR (p140 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (F (((1 <= p182) AND (1 <= p199)))) OR ((p6 <= 0) OR (p140 <= 0)))))
lola: processed formula length: 77
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p40)) AND (F ((1 <= p108)) OR X ((1 <= p40))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p40)) AND (F ((1 <= p108)) OR X ((1 <= p40))))))
lola: processed formula length: 64
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 28 markings, 29 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p86) AND (1 <= p106)))) AND F (G ((F (((1 <= p151) AND (1 <= p194))) AND ((p122 <= 0) OR X (((1 <= p151) AND (1 <= p194))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p86) AND (1 <= p106))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p86) AND (1 <= p106))))
lola: processed formula length: 36
lola: 53 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 27 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((p14 <= 0) OR (p49 <= 0))) OR (F (G (((p14 <= 0) OR (p49 <= 0)))) AND F (G (((1 <= p59) AND (1 <= p168))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((p14 <= 0) OR (p49 <= 0))) OR (F (G (((p14 <= 0) OR (p49 <= 0)))) AND F (G (((1 <= p59) AND (1 <= p168))))))))
lola: processed formula length: 123
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2007834 markings, 2288923 edges, 401567 markings/sec, 0 secs
lola: 3944334 markings, 4987111 edges, 387300 markings/sec, 5 secs
lola: 5770865 markings, 7678344 edges, 365306 markings/sec, 10 secs
lola: 7577238 markings, 10340488 edges, 361275 markings/sec, 15 secs
lola: 9369997 markings, 12982794 edges, 358552 markings/sec, 20 secs
lola: 11154835 markings, 15613335 edges, 356968 markings/sec, 25 secs
lola: 12929448 markings, 18228938 edges, 354923 markings/sec, 30 secs
lola: 14693195 markings, 20829036 edges, 352749 markings/sec, 35 secs
lola: 16388261 markings, 23327378 edges, 339013 markings/sec, 40 secs
lola: 17984180 markings, 25680154 edges, 319184 markings/sec, 45 secs
lola: 19728100 markings, 28250390 edges, 348784 markings/sec, 50 secs
lola: 21468376 markings, 30815952 edges, 348055 markings/sec, 55 secs
lola: 23239322 markings, 33426058 edges, 354189 markings/sec, 60 secs
lola: 24967459 markings, 35973786 edges, 345627 markings/sec, 65 secs
lola: 26746862 markings, 38596395 edges, 355881 markings/sec, 70 secs
lola: 28503856 markings, 41186533 edges, 351399 markings/sec, 75 secs
lola: 30269482 markings, 43789180 edges, 353125 markings/sec, 80 secs
lola: 32040015 markings, 46398949 edges, 354107 markings/sec, 85 secs
lola: 33778798 markings, 48962235 edges, 347757 markings/sec, 90 secs
lola: 35551114 markings, 51574534 edges, 354463 markings/sec, 95 secs
lola: 37334385 markings, 54203306 edges, 356654 markings/sec, 100 secs
lola: 39096141 markings, 56800465 edges, 352351 markings/sec, 105 secs
lola: 40876729 markings, 59424910 edges, 356118 markings/sec, 110 secs
lola: 42652062 markings, 62042001 edges, 355067 markings/sec, 115 secs
lola: 44401949 markings, 64621660 edges, 349977 markings/sec, 120 secs
lola: 46156167 markings, 67207316 edges, 350844 markings/sec, 125 secs
lola: 47958304 markings, 69863669 edges, 360427 markings/sec, 130 secs
lola: 49729465 markings, 72474699 edges, 354232 markings/sec, 135 secs
lola: 51488888 markings, 75068417 edges, 351885 markings/sec, 140 secs
lola: 53275243 markings, 77701252 edges, 357271 markings/sec, 145 secs
lola: 55050135 markings, 80317793 edges, 354978 markings/sec, 150 secs
lola: 56801309 markings, 82899380 edges, 350235 markings/sec, 155 secs
lola: 58552822 markings, 85481279 edges, 350303 markings/sec, 160 secs
lola: 60332507 markings, 88104346 edges, 355937 markings/sec, 165 secs
lola: 62109680 markings, 90724141 edges, 355435 markings/sec, 170 secs
lola: 63865907 markings, 93313232 edges, 351245 markings/sec, 175 secs
lola: 65616107 markings, 95893161 edges, 350040 markings/sec, 180 secs
lola: 67385464 markings, 98501141 edges, 353871 markings/sec, 185 secs
lola: 69040192 markings, 100940288 edges, 330946 markings/sec, 190 secs
lola: 70654548 markings, 103320221 edges, 322871 markings/sec, 195 secs
lola: 72372904 markings, 105853076 edges, 343671 markings/sec, 200 secs
lola: 74115265 markings, 108421687 edges, 348472 markings/sec, 205 secs
lola: 75891976 markings, 111040427 edges, 355342 markings/sec, 210 secs
lola: 77690495 markings, 113691634 edges, 359704 markings/sec, 215 secs
lola: 79470844 markings, 116316334 edges, 356070 markings/sec, 220 secs
lola: 81241886 markings, 118926975 edges, 354208 markings/sec, 225 secs
lola: 83009638 markings, 121532878 edges, 353550 markings/sec, 230 secs
lola: 84753577 markings, 124103346 edges, 348788 markings/sec, 235 secs
lola: 86339967 markings, 126441932 edges, 317278 markings/sec, 240 secs
lola: 87967255 markings, 128840884 edges, 325458 markings/sec, 245 secs
lola: 89715079 markings, 131417407 edges, 349565 markings/sec, 250 secs
lola: 91452235 markings, 133978219 edges, 347431 markings/sec, 255 secs
lola: 93214123 markings, 136575415 edges, 352378 markings/sec, 260 secs
lola: 95005886 markings, 139216310 edges, 358353 markings/sec, 265 secs
lola: 96783554 markings, 141836902 edges, 355534 markings/sec, 270 secs
lola: 98542931 markings, 144430667 edges, 351875 markings/sec, 275 secs
lola: 100306348 markings, 147030112 edges, 352683 markings/sec, 280 secs
lola: 102059773 markings, 149614873 edges, 350685 markings/sec, 285 secs
lola: 103713292 markings, 152052444 edges, 330704 markings/sec, 290 secs
lola: 105368652 markings, 154492317 edges, 331072 markings/sec, 295 secs
lola: 107061862 markings, 156988440 edges, 338642 markings/sec, 300 secs
lola: 108793370 markings, 159540988 edges, 346302 markings/sec, 305 secs
lola: 110400008 markings, 161909331 edges, 321328 markings/sec, 310 secs
lola: 111948808 markings, 164192423 edges, 309760 markings/sec, 315 secs
lola: 113591194 markings, 166613368 edges, 328477 markings/sec, 320 secs
lola: 115325798 markings, 169170429 edges, 346921 markings/sec, 325 secs
lola: 117115063 markings, 171808047 edges, 357853 markings/sec, 330 secs
lola: 118886622 markings, 174419725 edges, 354312 markings/sec, 335 secs
lola: 120603358 markings, 176950354 edges, 343347 markings/sec, 340 secs
lola: 122083909 markings, 179133808 edges, 296110 markings/sec, 345 secs
lola: 123325929 markings, 180964492 edges, 248404 markings/sec, 350 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown no unknown no unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p6) AND (1 <= p140))) OR ((1 <= p1) AND (1 <= p215))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p6) AND (1 <= p140))) OR ((1 <= p1) AND (1 <= p215))))
lola: processed formula length: 68
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: subprocess 5 will run for 401 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((X (X (((p62 <= 0) R (p200 <= 0)))) AND ((1 <= p45) AND (1 <= p194)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (X (((p62 <= 0) R (p200 <= 0)))) AND ((1 <= p45) AND (1 <= p194)))))
lola: processed formula length: 77
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 27 edges
lola: ========================================
lola: subprocess 6 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (G (((((p28 <= 0) OR (p48 <= 0)) U ((1 <= p28) AND (1 <= p48))) OR ((1 <= p28) AND (1 <= p48))))))) OR ((1 <= p71) AND (1 <= p97)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p71) AND (1 <= p97))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p71) AND (1 <= p97))
lola: processed formula length: 27
lola: 53 rewrites
lola: closed formula file LTLFireability.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 7 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G (((((p28 <= 0) OR (p48 <= 0)) U ((1 <= p28) AND (1 <= p48))) OR ((1 <= p28) AND (1 <= p48)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G (((((p28 <= 0) OR (p48 <= 0)) U ((1 <= p28) AND (1 <= p48))) OR ((1 <= p28) AND (1 <= p48)))))))
lola: processed formula length: 108
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p64 <= 0) OR (p199 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p64 <= 0) OR (p199 <= 0))))
lola: processed formula length: 36
lola: 53 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 1876302 markings, 2075433 edges, 375260 markings/sec, 0 secs
lola: 3802542 markings, 4205694 edges, 385248 markings/sec, 5 secs
lola: 5602641 markings, 6196467 edges, 360020 markings/sec, 10 secs
lola: 7492161 markings, 8286103 edges, 377904 markings/sec, 15 secs
lola: 9365040 markings, 10357339 edges, 374576 markings/sec, 20 secs
lola: 11242337 markings, 12433459 edges, 375459 markings/sec, 25 secs
lola: 13005290 markings, 14383609 edges, 352591 markings/sec, 30 secs
lola: 14905740 markings, 16485320 edges, 380090 markings/sec, 35 secs
lola: 16799041 markings, 18579175 edges, 378660 markings/sec, 40 secs
lola: 18576839 markings, 20545238 edges, 355560 markings/sec, 45 secs
lola: 20448174 markings, 22614785 edges, 374267 markings/sec, 50 secs
lola: 22299292 markings, 24662394 edges, 370224 markings/sec, 55 secs
lola: 24046812 markings, 26594985 edges, 349504 markings/sec, 60 secs
lola: 25907476 markings, 28652742 edges, 372133 markings/sec, 65 secs
lola: 27768535 markings, 30710878 edges, 372212 markings/sec, 70 secs
lola: 29643403 markings, 32784337 edges, 374974 markings/sec, 75 secs
lola: 31511205 markings, 34849974 edges, 373560 markings/sec, 80 secs
lola: 33383541 markings, 36921060 edges, 374467 markings/sec, 85 secs
lola: 35251206 markings, 38986551 edges, 373533 markings/sec, 90 secs
lola: 37137005 markings, 41072077 edges, 377160 markings/sec, 95 secs
lola: 39024801 markings, 43159835 edges, 377559 markings/sec, 100 secs
lola: 40901538 markings, 45235358 edges, 375347 markings/sec, 105 secs
lola: 42768493 markings, 47300015 edges, 373391 markings/sec, 110 secs
lola: 44488432 markings, 49202558 edges, 343988 markings/sec, 115 secs
lola: 46224048 markings, 51121989 edges, 347123 markings/sec, 120 secs
lola: 48079017 markings, 53173400 edges, 370994 markings/sec, 125 secs
lola: 49929465 markings, 55219834 edges, 370090 markings/sec, 130 secs
lola: 51767709 markings, 57252771 edges, 367649 markings/sec, 135 secs
lola: 53602327 markings, 59282174 edges, 366924 markings/sec, 140 secs
lola: 55448227 markings, 61323586 edges, 369180 markings/sec, 145 secs
lola: 57295940 markings, 63366988 edges, 369543 markings/sec, 150 secs
lola: 59145272 markings, 65412160 edges, 369866 markings/sec, 155 secs
lola: 60995211 markings, 67458022 edges, 369988 markings/sec, 160 secs
lola: 62836471 markings, 69494289 edges, 368252 markings/sec, 165 secs
lola: 64683378 markings, 71537303 edges, 369381 markings/sec, 170 secs
lola: 66530170 markings, 73579700 edges, 369358 markings/sec, 175 secs
lola: 68374592 markings, 75619477 edges, 368884 markings/sec, 180 secs
lola: 70221323 markings, 77661753 edges, 369346 markings/sec, 185 secs
lola: 72061449 markings, 79696764 edges, 368025 markings/sec, 190 secs
lola: 73910885 markings, 81742558 edges, 369887 markings/sec, 195 secs
lola: 75749643 markings, 83776065 edges, 367752 markings/sec, 200 secs
lola: 77593837 markings, 85815580 edges, 368839 markings/sec, 205 secs
lola: 79438907 markings, 87856067 edges, 369014 markings/sec, 210 secs
lola: 81283796 markings, 89896321 edges, 368978 markings/sec, 215 secs
lola: 83000841 markings, 91795190 edges, 343409 markings/sec, 220 secs
lola: 84781311 markings, 93764686 edges, 356094 markings/sec, 225 secs
lola: 86550663 markings, 95721442 edges, 353870 markings/sec, 230 secs
lola: 88332293 markings, 97691723 edges, 356326 markings/sec, 235 secs
lola: 90126558 markings, 99676009 edges, 358853 markings/sec, 240 secs
lola: 91933656 markings, 101674484 edges, 361420 markings/sec, 245 secs
lola: 93719871 markings, 103650364 edges, 357243 markings/sec, 250 secs
lola: 95518462 markings, 105639424 edges, 359718 markings/sec, 255 secs
lola: 97306003 markings, 107616263 edges, 357508 markings/sec, 260 secs
lola: 99084766 markings, 109583385 edges, 355753 markings/sec, 265 secs
lola: 100865327 markings, 111553017 edges, 356112 markings/sec, 270 secs
lola: 102634633 markings, 113509666 edges, 353861 markings/sec, 275 secs
lola: 104417464 markings, 115481295 edges, 356566 markings/sec, 280 secs
lola: 106079126 markings, 117319280 edges, 332332 markings/sec, 285 secs
lola: 107608448 markings, 119010725 edges, 305864 markings/sec, 290 secs
lola: 108999796 markings, 120549211 edges, 278270 markings/sec, 295 secs
lola: 110599173 markings, 122317881 edges, 319875 markings/sec, 300 secs
lola: 112261983 markings, 124156747 edges, 332562 markings/sec, 305 secs
lola: 113911641 markings, 125981569 edges, 329932 markings/sec, 310 secs
lola: 115645974 markings, 127899531 edges, 346867 markings/sec, 315 secs
lola: 117382299 markings, 129819742 edges, 347265 markings/sec, 320 secs
lola: 119125054 markings, 131747016 edges, 348551 markings/sec, 325 secs
lola: 120836957 markings, 133640688 edges, 342381 markings/sec, 330 secs
lola: 122511542 markings, 135492577 edges, 334917 markings/sec, 335 secs
lola: 124127559 markings, 137279723 edges, 323203 markings/sec, 340 secs
lola: 125851085 markings, 139185722 edges, 344705 markings/sec, 345 secs
lola: 127574283 markings, 141091880 edges, 344640 markings/sec, 350 secs
lola: 129269963 markings, 142967119 edges, 339136 markings/sec, 355 secs
lola: 130811678 markings, 144672038 edges, 308343 markings/sec, 360 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((1 <= p188)) AND ((1 <= p82) U (1 <= p188))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((1 <= p188)) AND ((1 <= p82) U (1 <= p188))))
lola: processed formula length: 52
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 9 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p1 <= 0) OR (p67 <= 0))) AND F ((1 <= p31)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p31))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p31 <= 0)
lola: processed formula length: 10
lola: 55 rewrites
lola: closed formula file LTLFireability.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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 25 markings, 24 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 947 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p8) AND (1 <= p160))) OR (G ((1 <= p27)) OR ((1 <= p45) AND (1 <= p194))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 947 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p45) AND (1 <= p194))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p45) AND (1 <= p194))
lola: processed formula length: 28
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 1421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p27))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p27))
lola: processed formula length: 14
lola: 53 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 12 will run for 2843 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p8) AND (1 <= p160)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p8 <= 0) OR (p160 <= 0))
lola: processed formula length: 27
lola: 55 rewrites
lola: closed formula file LTLFireability.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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 25 markings, 24 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 1421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p182) AND (1 <= p191)) OR (F (((1 <= p182) AND (1 <= p191))) AND F (G ((p177 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p182) AND (1 <= p191))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p182) AND (1 <= p191))
lola: processed formula length: 29
lola: 53 rewrites
lola: closed formula file LTLFireability.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 12 will run for 2843 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p182) AND (1 <= p191)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p182 <= 0) OR (p191 <= 0))
lola: processed formula length: 29
lola: 55 rewrites
lola: closed formula file LTLFireability.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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 25 markings, 24 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 2843 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((p168 <= 0) OR (p189 <= 0)))) OR (G ((p92 <= 0)) OR (1 <= p31)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 2843 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p31)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p31)
lola: processed formula length: 10
lola: 53 rewrites
lola: closed formula file LTLFireability.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: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p168 <= 0) OR (p189 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p168 <= 0) OR (p189 <= 0))))
lola: processed formula length: 37
lola: 53 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: yes no no unknown no unknown unknown no no no no no no
lola: memory consumption: 57872 KB
lola: time consumption: 728 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (F ((G (((p14 <= 0) OR (p49 <= 0))) OR (F (G (((p14 <= 0) OR (p49 <= 0)))) AND F (G (((1 <= p59) AND (1 <= p168))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((p14 <= 0) OR (p49 <= 0))) OR (F (G (((p14 <= 0) OR (p49 <= 0)))) AND F (G (((1 <= p59) AND (1 <= p168))))))))
lola: processed formula length: 123
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2120887 markings, 2428551 edges, 424177 markings/sec, 0 secs
lola: 4010009 markings, 5083810 edges, 377824 markings/sec, 5 secs
lola: 5796568 markings, 7716246 edges, 357312 markings/sec, 10 secs
lola: 7382431 markings, 10053361 edges, 317173 markings/sec, 15 secs
lola: 8966726 markings, 12388304 edges, 316859 markings/sec, 20 secs
lola: 10625938 markings, 14833674 edges, 331842 markings/sec, 25 secs
lola: 12350403 markings, 17375651 edges, 344893 markings/sec, 30 secs
lola: 14107080 markings, 19964967 edges, 351335 markings/sec, 35 secs
lola: 15847856 markings, 22530701 edges, 348155 markings/sec, 40 secs
lola: 17581067 markings, 25085833 edges, 346642 markings/sec, 45 secs
lola: 19328152 markings, 27660774 edges, 349417 markings/sec, 50 secs
lola: 21004075 markings, 30131439 edges, 335185 markings/sec, 55 secs
lola: 22571535 markings, 32441698 edges, 313492 markings/sec, 60 secs
lola: 24120387 markings, 34725010 edges, 309770 markings/sec, 65 secs
lola: 25802591 markings, 37204647 edges, 336441 markings/sec, 70 secs
lola: 27346219 markings, 39479909 edges, 308726 markings/sec, 75 secs
lola: 28898739 markings, 41768642 edges, 310504 markings/sec, 80 secs
lola: 30602404 markings, 44279757 edges, 340733 markings/sec, 85 secs
lola: 32226870 markings, 46674440 edges, 324893 markings/sec, 90 secs
lola: 33734380 markings, 48896746 edges, 301502 markings/sec, 95 secs
lola: 35263397 markings, 51150524 edges, 305803 markings/sec, 100 secs
lola: 36840462 markings, 53475208 edges, 315413 markings/sec, 105 secs
lola: 38576878 markings, 56035026 edges, 347283 markings/sec, 110 secs
lola: 40315718 markings, 58597978 edges, 347768 markings/sec, 115 secs
lola: 42087311 markings, 61209344 edges, 354319 markings/sec, 120 secs
lola: 43710094 markings, 63601746 edges, 324557 markings/sec, 125 secs
lola: 45258568 markings, 65884440 edges, 309695 markings/sec, 130 secs
lola: 46888136 markings, 68286120 edges, 325914 markings/sec, 135 secs
lola: 48619771 markings, 70838809 edges, 346327 markings/sec, 140 secs
lola: 50130846 markings, 73066490 edges, 302215 markings/sec, 145 secs
lola: 51678038 markings, 75347222 edges, 309438 markings/sec, 150 secs
lola: 53307275 markings, 77748417 edges, 325847 markings/sec, 155 secs
lola: 55063039 markings, 80336788 edges, 351153 markings/sec, 160 secs
lola: 56794809 markings, 82889713 edges, 346354 markings/sec, 165 secs
lola: 58527734 markings, 85444203 edges, 346585 markings/sec, 170 secs
lola: 60287064 markings, 88037347 edges, 351866 markings/sec, 175 secs
lola: 62044164 markings, 90627592 edges, 351420 markings/sec, 180 secs
lola: 63782917 markings, 93190815 edges, 347751 markings/sec, 185 secs
lola: 65514213 markings, 95742996 edges, 346259 markings/sec, 190 secs
lola: 67244912 markings, 98294057 edges, 346140 markings/sec, 195 secs
lola: 68999726 markings, 100880578 edges, 350963 markings/sec, 200 secs
lola: 70725838 markings, 103425301 edges, 345222 markings/sec, 205 secs
lola: 72444082 markings, 105958270 edges, 343649 markings/sec, 210 secs
lola: 74165730 markings, 108496134 edges, 344330 markings/sec, 215 secs
lola: 75916441 markings, 111076437 edges, 350142 markings/sec, 220 secs
lola: 77677101 markings, 113671968 edges, 352132 markings/sec, 225 secs
lola: 79429460 markings, 116255262 edges, 350472 markings/sec, 230 secs
lola: 81177233 markings, 118831693 edges, 349555 markings/sec, 235 secs
lola: 82922224 markings, 121404022 edges, 348998 markings/sec, 240 secs
lola: 84688773 markings, 124007814 edges, 353310 markings/sec, 245 secs
lola: 86467356 markings, 126629705 edges, 355717 markings/sec, 250 secs
lola: 88214915 markings, 129205925 edges, 349512 markings/sec, 255 secs
lola: 89967440 markings, 131789343 edges, 350505 markings/sec, 260 secs
lola: 91710008 markings, 134358104 edges, 348514 markings/sec, 265 secs
lola: 93469603 markings, 136951682 edges, 351919 markings/sec, 270 secs
lola: 95281421 markings, 139622497 edges, 362364 markings/sec, 275 secs
lola: 97058270 markings, 142241951 edges, 355370 markings/sec, 280 secs
lola: 98822492 markings, 144842711 edges, 352844 markings/sec, 285 secs
lola: 100568051 markings, 147415626 edges, 349112 markings/sec, 290 secs
lola: 102303054 markings, 149973433 edges, 347001 markings/sec, 295 secs
lola: 104040323 markings, 152534263 edges, 347454 markings/sec, 300 secs
lola: 105796233 markings, 155122613 edges, 351182 markings/sec, 305 secs
lola: 107421061 markings, 157518018 edges, 324966 markings/sec, 310 secs
lola: 109152194 markings, 160069990 edges, 346227 markings/sec, 315 secs
lola: 110886322 markings, 162626134 edges, 346826 markings/sec, 320 secs
lola: 112623655 markings, 165187369 edges, 347467 markings/sec, 325 secs
lola: 114365964 markings, 167755456 edges, 348462 markings/sec, 330 secs
lola: 116137718 markings, 170367413 edges, 354351 markings/sec, 335 secs
lola: 117934759 markings, 173016431 edges, 359408 markings/sec, 340 secs
lola: 119702220 markings, 175621966 edges, 353492 markings/sec, 345 secs
lola: 121469214 markings, 178226848 edges, 353399 markings/sec, 350 secs
lola: 123168217 markings, 180732428 edges, 339801 markings/sec, 355 secs
lola: 124853979 markings, 183216203 edges, 337152 markings/sec, 360 secs
lola: 126528483 markings, 185684700 edges, 334901 markings/sec, 365 secs
lola: 128149488 markings, 188074502 edges, 324201 markings/sec, 370 secs
lola: 129732630 markings, 190408123 edges, 316628 markings/sec, 375 secs
lola: 131363271 markings, 192812002 edges, 326128 markings/sec, 380 secs
lola: 132987408 markings, 195206332 edges, 324827 markings/sec, 385 secs
lola: 134546726 markings, 197504613 edges, 311864 markings/sec, 390 secs
lola: 136136511 markings, 199848440 edges, 317957 markings/sec, 395 secs
lola: 137726078 markings, 202191827 edges, 317913 markings/sec, 400 secs
lola: 139127284 markings, 204257515 edges, 280241 markings/sec, 405 secs
lola: 140655947 markings, 206510806 edges, 305733 markings/sec, 410 secs
lola: 142338050 markings, 208990260 edges, 336421 markings/sec, 415 secs
lola: 143971550 markings, 211398378 edges, 326700 markings/sec, 420 secs
lola: 145585044 markings, 213776766 edges, 322699 markings/sec, 425 secs
lola: 147210503 markings, 216173076 edges, 325092 markings/sec, 430 secs
lola: 148809895 markings, 218530488 edges, 319878 markings/sec, 435 secs
lola: 150267795 markings, 220679756 edges, 291580 markings/sec, 440 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G (F (((p64 <= 0) OR (p199 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p64 <= 0) OR (p199 <= 0))))
lola: processed formula length: 36
lola: 53 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 1871663 markings, 2070309 edges, 374333 markings/sec, 0 secs
lola: 3782873 markings, 4183940 edges, 382242 markings/sec, 5 secs
lola: 5690664 markings, 6293819 edges, 381558 markings/sec, 10 secs
lola: 7603587 markings, 8409342 edges, 382585 markings/sec, 15 secs
lola: 9508335 markings, 10515859 edges, 380950 markings/sec, 20 secs
lola: 11412857 markings, 12622085 edges, 380904 markings/sec, 25 secs
lola: 13295294 markings, 14704408 edges, 376487 markings/sec, 30 secs
lola: 15192615 markings, 16802661 edges, 379464 markings/sec, 35 secs
lola: 17082691 markings, 18892931 edges, 378015 markings/sec, 40 secs
lola: 18862078 markings, 20860752 edges, 355877 markings/sec, 45 secs
lola: 20751290 markings, 22950045 edges, 377842 markings/sec, 50 secs
lola: 22627188 markings, 25024636 edges, 375180 markings/sec, 55 secs
lola: 24388056 markings, 26972452 edges, 352174 markings/sec, 60 secs
lola: 26266523 markings, 29049884 edges, 375693 markings/sec, 65 secs
lola: 28148867 markings, 31131625 edges, 376469 markings/sec, 70 secs
lola: 29886878 markings, 33053641 edges, 347602 markings/sec, 75 secs
lola: 31727046 markings, 35088714 edges, 368034 markings/sec, 80 secs
lola: 33555205 markings, 37110960 edges, 365632 markings/sec, 85 secs
lola: 35297941 markings, 39038254 edges, 348547 markings/sec, 90 secs
lola: 37168642 markings, 41107077 edges, 374140 markings/sec, 95 secs
lola: 39051746 markings, 43189649 edges, 376621 markings/sec, 100 secs
lola: 40915047 markings, 45250319 edges, 372660 markings/sec, 105 secs
lola: 42787682 markings, 47321252 edges, 374527 markings/sec, 110 secs
lola: 44618774 markings, 49346750 edges, 366218 markings/sec, 115 secs
lola: 46483061 markings, 51408499 edges, 372857 markings/sec, 120 secs
lola: 48330170 markings, 53451240 edges, 369422 markings/sec, 125 secs
lola: 49946900 markings, 55239126 edges, 323346 markings/sec, 130 secs
lola: 51532024 markings, 56992561 edges, 317025 markings/sec, 135 secs
lola: 53142693 markings, 58773729 edges, 322134 markings/sec, 140 secs
lola: 54999392 markings, 60827075 edges, 371340 markings/sec, 145 secs
lola: 56874270 markings, 62900560 edges, 374976 markings/sec, 150 secs
lola: 58736163 markings, 64959616 edges, 372379 markings/sec, 155 secs
lola: 60596498 markings, 67016993 edges, 372067 markings/sec, 160 secs
lola: 62448919 markings, 69066095 edges, 370484 markings/sec, 165 secs
lola: 64239153 markings, 71045899 edges, 358047 markings/sec, 170 secs
lola: 65901004 markings, 72883705 edges, 332370 markings/sec, 175 secs
lola: 67508100 markings, 74660970 edges, 321419 markings/sec, 180 secs
lola: 69175104 markings, 76504955 edges, 333401 markings/sec, 185 secs
lola: 70859723 markings, 78367954 edges, 336924 markings/sec, 190 secs
lola: 72636611 markings, 80332989 edges, 355378 markings/sec, 195 secs
lola: 74489850 markings, 82382515 edges, 370648 markings/sec, 200 secs
lola: 76347840 markings, 84437314 edges, 371598 markings/sec, 205 secs
lola: 78197479 markings, 86483289 edges, 369928 markings/sec, 210 secs
lola: 80037970 markings, 88518706 edges, 368098 markings/sec, 215 secs
lola: 81878375 markings, 90554037 edges, 368081 markings/sec, 220 secs
lola: 83697583 markings, 92565904 edges, 363842 markings/sec, 225 secs
lola: 85515294 markings, 94576128 edges, 363542 markings/sec, 230 secs
lola: 87350145 markings, 96605787 edges, 366970 markings/sec, 235 secs
lola: 89165735 markings, 98613650 edges, 363118 markings/sec, 240 secs
lola: 90998198 markings, 100640183 edges, 366493 markings/sec, 245 secs
lola: 92839594 markings, 102676622 edges, 368279 markings/sec, 250 secs
lola: 94672565 markings, 104703719 edges, 366594 markings/sec, 255 secs
lola: 96487062 markings, 106710378 edges, 362899 markings/sec, 260 secs
lola: 98302321 markings, 108718363 edges, 363052 markings/sec, 265 secs
lola: 100125842 markings, 110735000 edges, 364704 markings/sec, 270 secs
lola: 101896632 markings, 112693309 edges, 354158 markings/sec, 275 secs
lola: 103682623 markings, 114668475 edges, 357198 markings/sec, 280 secs
lola: 105506221 markings, 116685196 edges, 364720 markings/sec, 285 secs
lola: 107205294 markings, 118564991 edges, 339815 markings/sec, 290 secs
lola: 108825901 markings, 120356823 edges, 324121 markings/sec, 295 secs
lola: 110267761 markings, 121951303 edges, 288372 markings/sec, 300 secs
lola: 111624391 markings, 123451944 edges, 271326 markings/sec, 305 secs
lola: 113181860 markings, 125174304 edges, 311494 markings/sec, 310 secs
lola: 114714493 markings, 126869169 edges, 306527 markings/sec, 315 secs
lola: 116091734 markings, 128392622 edges, 275448 markings/sec, 320 secs
lola: 117701605 markings, 130172968 edges, 321974 markings/sec, 325 secs
lola: 119145183 markings, 131769299 edges, 288716 markings/sec, 330 secs
lola: 120801317 markings, 133601268 edges, 331227 markings/sec, 335 secs
lola: 122384326 markings, 135351858 edges, 316602 markings/sec, 340 secs
lola: 124011438 markings, 137151241 edges, 325422 markings/sec, 345 secs
lola: 125416518 markings, 138705495 edges, 281016 markings/sec, 350 secs
lola: 127028828 markings, 140488512 edges, 322462 markings/sec, 355 secs
lola: 128634652 markings, 142264348 edges, 321165 markings/sec, 360 secs
lola: 130267493 markings, 144070076 edges, 326568 markings/sec, 365 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (G (((p168 <= 0) OR (p189 <= 0)))) OR (G ((p92 <= 0)) OR (1 <= p31)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p31)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p31)
lola: processed formula length: 10
lola: 53 rewrites
lola: closed formula file LTLFireability.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: ========================================
lola: ...considering subproblem: G ((p92 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p92 <= 0))
lola: processed formula length: 14
lola: 53 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 1639445 markings, 1813643 edges, 327889 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2241666 markings, 2479507 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G (((p168 <= 0) OR (p189 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p168 <= 0) OR (p189 <= 0))))
lola: processed formula length: 37
lola: 53 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 1798201 markings, 1996762 edges, 359640 markings/sec, 0 secs
lola: 3672411 markings, 4077402 edges, 374842 markings/sec, 5 secs
lola: 5457962 markings, 6059676 edges, 357110 markings/sec, 10 secs
lola: 7343044 markings, 8152418 edges, 377016 markings/sec, 15 secs
lola: 9107691 markings, 10111465 edges, 352929 markings/sec, 20 secs
lola: 10973861 markings, 12183719 edges, 373234 markings/sec, 25 secs
lola: 12841157 markings, 14256751 edges, 373459 markings/sec, 30 secs
lola: 14707972 markings, 16329235 edges, 373363 markings/sec, 35 secs
lola: 16566409 markings, 18392400 edges, 371687 markings/sec, 40 secs
lola: 18426740 markings, 20457669 edges, 372066 markings/sec, 45 secs
lola: 20178114 markings, 22402475 edges, 350275 markings/sec, 50 secs
lola: 22033122 markings, 24461862 edges, 371002 markings/sec, 55 secs
lola: 23790789 markings, 26413128 edges, 351533 markings/sec, 60 secs
lola: 25661015 markings, 28489414 edges, 374045 markings/sec, 65 secs
lola: 27529393 markings, 30563631 edges, 373676 markings/sec, 70 secs
lola: 29400203 markings, 32640518 edges, 374162 markings/sec, 75 secs
lola: 31249478 markings, 34694023 edges, 369855 markings/sec, 80 secs
lola: 33117095 markings, 36767403 edges, 373523 markings/sec, 85 secs
lola: 34974690 markings, 38829679 edges, 371519 markings/sec, 90 secs
lola: 36848110 markings, 40909458 edges, 374684 markings/sec, 95 secs
lola: 38727956 markings, 42996440 edges, 375969 markings/sec, 100 secs
lola: 40589665 markings, 45063257 edges, 372342 markings/sec, 105 secs
lola: 42455850 markings, 47135535 edges, 373237 markings/sec, 110 secs
lola: 44322957 markings, 49208333 edges, 373421 markings/sec, 115 secs
lola: 46192760 markings, 51284145 edges, 373961 markings/sec, 120 secs
lola: 48043973 markings, 53339284 edges, 370243 markings/sec, 125 secs
lola: 49884784 markings, 55382914 edges, 368162 markings/sec, 130 secs
lola: 51743131 markings, 57446503 edges, 371669 markings/sec, 135 secs
lola: 53596828 markings, 59504378 edges, 370739 markings/sec, 140 secs
lola: 55466799 markings, 61580389 edges, 373994 markings/sec, 145 secs
lola: 57333327 markings, 63652549 edges, 373306 markings/sec, 150 secs
lola: 59197529 markings, 65722116 edges, 372840 markings/sec, 155 secs
lola: 61056866 markings, 67786292 edges, 371867 markings/sec, 160 secs
lola: 62906577 markings, 69840301 edges, 369942 markings/sec, 165 secs
lola: 64771481 markings, 71910667 edges, 372981 markings/sec, 170 secs
lola: 66617201 markings, 73959709 edges, 369144 markings/sec, 175 secs
lola: 68461192 markings, 76006871 edges, 368798 markings/sec, 180 secs
lola: 70306457 markings, 78055400 edges, 369053 markings/sec, 185 secs
lola: 72144453 markings, 80095856 edges, 367599 markings/sec, 190 secs
lola: 74005086 markings, 82162001 edges, 372127 markings/sec, 195 secs
lola: 75861053 markings, 84222444 edges, 371193 markings/sec, 200 secs
lola: 77607038 markings, 86160762 edges, 349197 markings/sec, 205 secs
lola: 79464684 markings, 88223026 edges, 371529 markings/sec, 210 secs
lola: 81309459 markings, 90271042 edges, 368955 markings/sec, 215 secs
lola: 83049266 markings, 92203015 edges, 347961 markings/sec, 220 secs
lola: 84665627 markings, 93997347 edges, 323272 markings/sec, 225 secs
lola: 86521734 markings, 96057947 edges, 371221 markings/sec, 230 secs
lola: 88367476 markings, 98107027 edges, 369148 markings/sec, 235 secs
lola: 90096610 markings, 100026650 edges, 345827 markings/sec, 240 secs
lola: 91811179 markings, 101930584 edges, 342914 markings/sec, 245 secs
lola: 93541568 markings, 103851544 edges, 346078 markings/sec, 250 secs
lola: 95227721 markings, 105723400 edges, 337231 markings/sec, 255 secs
lola: 97016745 markings, 107709527 edges, 357805 markings/sec, 260 secs
lola: 98819250 markings, 109711094 edges, 360501 markings/sec, 265 secs
lola: 100633532 markings, 111725249 edges, 362856 markings/sec, 270 secs
lola: 102447890 markings, 113739456 edges, 362872 markings/sec, 275 secs
lola: 104207117 markings, 115692457 edges, 351845 markings/sec, 280 secs
lola: 105938110 markings, 117614775 edges, 346199 markings/sec, 285 secs
lola: 107515218 markings, 119366178 edges, 315422 markings/sec, 290 secs
lola: 109242897 markings, 121283421 edges, 345536 markings/sec, 295 secs
lola: 110858314 markings, 123076722 edges, 323083 markings/sec, 300 secs
lola: 112547831 markings, 124952326 edges, 337903 markings/sec, 305 secs
lola: 114003349 markings, 126568595 edges, 291104 markings/sec, 310 secs
lola: 115523229 markings, 128255829 edges, 303976 markings/sec, 315 secs
lola: 117196272 markings, 130113121 edges, 334609 markings/sec, 320 secs
lola: 118876687 markings, 131979129 edges, 336083 markings/sec, 325 secs
lola: 120558839 markings, 133846535 edges, 336430 markings/sec, 330 secs
lola: 122246086 markings, 135719615 edges, 337449 markings/sec, 335 secs
lola: 123953531 markings, 137615153 edges, 341489 markings/sec, 340 secs
lola: 125645959 markings, 139494474 edges, 338486 markings/sec, 345 secs
lola: 127357529 markings, 141394596 edges, 342314 markings/sec, 350 secs
lola: 129071788 markings, 143297676 edges, 342852 markings/sec, 355 secs
lola: 130727947 markings, 145136207 edges, 331232 markings/sec, 360 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no unknown no unknown unknown no no no no no no
lola:
preliminary result: yes no no unknown no unknown unknown no no no no no no
lola: memory consumption: 3812 KB
lola: time consumption: 1927 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-004"
export BK_EXAMINATION="LTLFireability"
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 DoubleExponent-PT-004, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987882900770"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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