About the Execution of ITS-LoLa for DoubleExponent-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15741.750 | 3600000.00 | 1296146.00 | 5351.40 | ?FFT?F????F????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882900780.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-010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882900780
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 3.3K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 30 00:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 30 00:28 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.1K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 169K 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-010-CTLFireability-00
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-01
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-02
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-03
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-04
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-05
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-06
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-07
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-08
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-09
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-10
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-11
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-12
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-13
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-14
FORMULA_NAME DoubleExponent-PT-010-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591240079919
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 03:08:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 03:08:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 03:08:02] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2020-06-04 03:08:02] [INFO ] Transformed 534 places.
[2020-06-04 03:08:02] [INFO ] Transformed 498 transitions.
[2020-06-04 03:08:02] [INFO ] Parsed PT model containing 534 places and 498 transitions in 151 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 76 ms.
Incomplete random walk after 100000 steps, including 3316 resets, run finished after 492 ms. (steps per millisecond=203 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
// Phase 1: matrix 498 rows 534 cols
[2020-06-04 03:08:02] [INFO ] Computed 54 place invariants in 71 ms
[2020-06-04 03:08:03] [INFO ] [Real]Absence check using 2 positive place invariants in 25 ms returned sat
[2020-06-04 03:08:03] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 44 ms returned sat
[2020-06-04 03:08:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:08:04] [INFO ] [Real]Absence check using state equation in 1257 ms returned sat
[2020-06-04 03:08:04] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 36 ms.
[2020-06-04 03:08:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:08:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2020-06-04 03:08:04] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 53 ms returned sat
[2020-06-04 03:08:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:08:06] [INFO ] [Nat]Absence check using state equation in 1333 ms returned sat
[2020-06-04 03:08:06] [INFO ] Deduced a trap composed of 156 places in 209 ms
[2020-06-04 03:08:06] [INFO ] Deduced a trap composed of 149 places in 110 ms
[2020-06-04 03:08:06] [INFO ] Deduced a trap composed of 97 places in 131 ms
[2020-06-04 03:08:07] [INFO ] Deduced a trap composed of 83 places in 147 ms
[2020-06-04 03:08:07] [INFO ] Deduced a trap composed of 96 places in 145 ms
[2020-06-04 03:08:07] [INFO ] Deduced a trap composed of 65 places in 168 ms
[2020-06-04 03:08:07] [INFO ] Deduced a trap composed of 67 places in 156 ms
[2020-06-04 03:08:08] [INFO ] Deduced a trap composed of 79 places in 144 ms
[2020-06-04 03:08:08] [INFO ] Deduced a trap composed of 55 places in 146 ms
[2020-06-04 03:08:08] [INFO ] Deduced a trap composed of 53 places in 158 ms
[2020-06-04 03:08:08] [INFO ] Deduced a trap composed of 43 places in 188 ms
[2020-06-04 03:08:08] [INFO ] Deduced a trap composed of 41 places in 191 ms
[2020-06-04 03:08:09] [INFO ] Deduced a trap composed of 91 places in 194 ms
[2020-06-04 03:08:09] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3384 ms
[2020-06-04 03:08:09] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 44 ms.
[2020-06-04 03:08:13] [INFO ] Added : 279 causal constraints over 56 iterations in 4007 ms. Result :sat
[2020-06-04 03:08:13] [INFO ] Deduced a trap composed of 24 places in 278 ms
[2020-06-04 03:08:14] [INFO ] Deduced a trap composed of 37 places in 257 ms
[2020-06-04 03:08:14] [INFO ] Deduced a trap composed of 25 places in 270 ms
[2020-06-04 03:08:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 989 ms
[2020-06-04 03:08:14] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:08:14] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 48 ms returned sat
[2020-06-04 03:08:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:08:15] [INFO ] [Real]Absence check using state equation in 876 ms returned sat
[2020-06-04 03:08:15] [INFO ] Deduced a trap composed of 216 places in 197 ms
[2020-06-04 03:08:16] [INFO ] Deduced a trap composed of 209 places in 260 ms
[2020-06-04 03:08:16] [INFO ] Deduced a trap composed of 214 places in 234 ms
[2020-06-04 03:08:16] [INFO ] Deduced a trap composed of 227 places in 242 ms
[2020-06-04 03:08:17] [INFO ] Deduced a trap composed of 191 places in 229 ms
[2020-06-04 03:08:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1349 ms
[2020-06-04 03:08:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:08:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-06-04 03:08:17] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 45 ms returned sat
[2020-06-04 03:08:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:08:17] [INFO ] [Nat]Absence check using state equation in 799 ms returned sat
[2020-06-04 03:08:18] [INFO ] Deduced a trap composed of 216 places in 281 ms
[2020-06-04 03:08:18] [INFO ] Deduced a trap composed of 177 places in 247 ms
[2020-06-04 03:08:18] [INFO ] Deduced a trap composed of 168 places in 236 ms
[2020-06-04 03:08:19] [INFO ] Deduced a trap composed of 160 places in 229 ms
[2020-06-04 03:08:19] [INFO ] Deduced a trap composed of 211 places in 284 ms
[2020-06-04 03:08:19] [INFO ] Deduced a trap composed of 219 places in 256 ms
[2020-06-04 03:08:19] [INFO ] Deduced a trap composed of 215 places in 252 ms
[2020-06-04 03:08:20] [INFO ] Deduced a trap composed of 225 places in 248 ms
[2020-06-04 03:08:20] [INFO ] Deduced a trap composed of 55 places in 261 ms
[2020-06-04 03:08:20] [INFO ] Deduced a trap composed of 222 places in 247 ms
[2020-06-04 03:08:21] [INFO ] Deduced a trap composed of 29 places in 244 ms
[2020-06-04 03:08:21] [INFO ] Deduced a trap composed of 209 places in 241 ms
[2020-06-04 03:08:21] [INFO ] Deduced a trap composed of 213 places in 263 ms
[2020-06-04 03:08:21] [INFO ] Deduced a trap composed of 232 places in 245 ms
[2020-06-04 03:08:22] [INFO ] Deduced a trap composed of 65 places in 142 ms
[2020-06-04 03:08:22] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4128 ms
[2020-06-04 03:08:22] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 21 ms.
[2020-06-04 03:08:25] [INFO ] Added : 360 causal constraints over 72 iterations in 3248 ms. Result :sat
[2020-06-04 03:08:25] [INFO ] Deduced a trap composed of 60 places in 181 ms
[2020-06-04 03:08:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2020-06-04 03:08:25] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:08:25] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 33 ms returned unsat
[2020-06-04 03:08:25] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-06-04 03:08:25] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 30 ms returned unsat
[2020-06-04 03:08:25] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:08:25] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 29 ms returned unsat
[2020-06-04 03:08:25] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-06-04 03:08:26] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 51 ms returned sat
[2020-06-04 03:08:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:08:26] [INFO ] [Real]Absence check using state equation in 834 ms returned sat
[2020-06-04 03:08:27] [INFO ] Deduced a trap composed of 53 places in 215 ms
[2020-06-04 03:08:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2020-06-04 03:08:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:08:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2020-06-04 03:08:27] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 54 ms returned sat
[2020-06-04 03:08:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:08:28] [INFO ] [Nat]Absence check using state equation in 915 ms returned sat
[2020-06-04 03:08:28] [INFO ] Deduced a trap composed of 53 places in 223 ms
[2020-06-04 03:08:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2020-06-04 03:08:28] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 37 ms.
[2020-06-04 03:08:32] [INFO ] Added : 293 causal constraints over 60 iterations in 3778 ms. Result :sat
[2020-06-04 03:08:32] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:08:32] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 47 ms returned sat
[2020-06-04 03:08:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:08:33] [INFO ] [Real]Absence check using state equation in 962 ms returned sat
[2020-06-04 03:08:33] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 36 ms.
[2020-06-04 03:08:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:08:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2020-06-04 03:08:33] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 51 ms returned sat
[2020-06-04 03:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:08:34] [INFO ] [Nat]Absence check using state equation in 1071 ms returned sat
[2020-06-04 03:08:35] [INFO ] Deduced a trap composed of 41 places in 201 ms
[2020-06-04 03:08:35] [INFO ] Deduced a trap composed of 91 places in 113 ms
[2020-06-04 03:08:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 393 ms
[2020-06-04 03:08:35] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 35 ms.
[2020-06-04 03:08:40] [INFO ] Added : 494 causal constraints over 100 iterations in 5392 ms. Result :sat
[2020-06-04 03:08:40] [INFO ] Deduced a trap composed of 240 places in 262 ms
[2020-06-04 03:08:41] [INFO ] Deduced a trap composed of 247 places in 260 ms
[2020-06-04 03:08:41] [INFO ] Deduced a trap composed of 258 places in 248 ms
[2020-06-04 03:08:41] [INFO ] Deduced a trap composed of 55 places in 253 ms
[2020-06-04 03:08:42] [INFO ] Deduced a trap composed of 227 places in 285 ms
[2020-06-04 03:08:42] [INFO ] Deduced a trap composed of 214 places in 268 ms
[2020-06-04 03:08:42] [INFO ] Deduced a trap composed of 241 places in 272 ms
[2020-06-04 03:08:43] [INFO ] Deduced a trap composed of 220 places in 252 ms
[2020-06-04 03:08:43] [INFO ] Deduced a trap composed of 165 places in 243 ms
[2020-06-04 03:08:43] [INFO ] Deduced a trap composed of 219 places in 244 ms
[2020-06-04 03:08:44] [INFO ] Deduced a trap composed of 223 places in 248 ms
[2020-06-04 03:08:44] [INFO ] Deduced a trap composed of 167 places in 265 ms
[2020-06-04 03:08:44] [INFO ] Deduced a trap composed of 241 places in 261 ms
[2020-06-04 03:08:44] [INFO ] Deduced a trap composed of 171 places in 251 ms
[2020-06-04 03:08:45] [INFO ] Deduced a trap composed of 168 places in 256 ms
[2020-06-04 03:08:45] [INFO ] Deduced a trap composed of 65 places in 183 ms
[2020-06-04 03:08:45] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4991 ms
[2020-06-04 03:08:45] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-06-04 03:08:45] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 43 ms returned sat
[2020-06-04 03:08:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:08:46] [INFO ] [Real]Absence check using state equation in 728 ms returned sat
[2020-06-04 03:08:46] [INFO ] Deduced a trap composed of 53 places in 270 ms
[2020-06-04 03:08:47] [INFO ] Deduced a trap composed of 186 places in 243 ms
[2020-06-04 03:08:47] [INFO ] Deduced a trap composed of 204 places in 254 ms
[2020-06-04 03:08:47] [INFO ] Deduced a trap composed of 216 places in 229 ms
[2020-06-04 03:08:47] [INFO ] Deduced a trap composed of 171 places in 201 ms
[2020-06-04 03:08:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1367 ms
[2020-06-04 03:08:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:08:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-06-04 03:08:47] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 43 ms returned sat
[2020-06-04 03:08:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:08:48] [INFO ] [Nat]Absence check using state equation in 844 ms returned sat
[2020-06-04 03:08:49] [INFO ] Deduced a trap composed of 53 places in 237 ms
[2020-06-04 03:08:49] [INFO ] Deduced a trap composed of 183 places in 216 ms
[2020-06-04 03:08:49] [INFO ] Deduced a trap composed of 196 places in 251 ms
[2020-06-04 03:08:49] [INFO ] Deduced a trap composed of 55 places in 225 ms
[2020-06-04 03:08:50] [INFO ] Deduced a trap composed of 181 places in 243 ms
[2020-06-04 03:08:50] [INFO ] Deduced a trap composed of 186 places in 221 ms
[2020-06-04 03:08:50] [INFO ] Deduced a trap composed of 224 places in 202 ms
[2020-06-04 03:08:50] [INFO ] Deduced a trap composed of 193 places in 193 ms
[2020-06-04 03:08:51] [INFO ] Deduced a trap composed of 35 places in 247 ms
[2020-06-04 03:08:51] [INFO ] Deduced a trap composed of 163 places in 186 ms
[2020-06-04 03:08:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2542 ms
[2020-06-04 03:08:51] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 43 ms.
[2020-06-04 03:08:54] [INFO ] Added : 293 causal constraints over 59 iterations in 3178 ms. Result :sat
[2020-06-04 03:08:54] [INFO ] Deduced a trap composed of 38 places in 241 ms
[2020-06-04 03:08:55] [INFO ] Deduced a trap composed of 25 places in 221 ms
[2020-06-04 03:08:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 593 ms
[2020-06-04 03:08:55] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:08:55] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 52 ms returned sat
[2020-06-04 03:08:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:08:56] [INFO ] [Real]Absence check using state equation in 811 ms returned sat
[2020-06-04 03:08:56] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 32 ms.
[2020-06-04 03:08:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:08:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-06-04 03:08:56] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 51 ms returned sat
[2020-06-04 03:08:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:08:57] [INFO ] [Nat]Absence check using state equation in 818 ms returned sat
[2020-06-04 03:08:57] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 23 ms.
[2020-06-04 03:08:59] [INFO ] Added : 290 causal constraints over 58 iterations in 2322 ms. Result :sat
[2020-06-04 03:08:59] [INFO ] Deduced a trap composed of 43 places in 224 ms
[2020-06-04 03:08:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2020-06-04 03:08:59] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-06-04 03:08:59] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 52 ms returned sat
[2020-06-04 03:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:09:00] [INFO ] [Real]Absence check using state equation in 968 ms returned sat
[2020-06-04 03:09:01] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 33 ms.
[2020-06-04 03:09:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:09:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:09:01] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 46 ms returned sat
[2020-06-04 03:09:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:09:02] [INFO ] [Nat]Absence check using state equation in 899 ms returned sat
[2020-06-04 03:09:02] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 27 ms.
[2020-06-04 03:09:06] [INFO ] Added : 495 causal constraints over 99 iterations in 4022 ms. Result :sat
[2020-06-04 03:09:06] [INFO ] Deduced a trap composed of 95 places in 116 ms
[2020-06-04 03:09:06] [INFO ] Deduced a trap composed of 96 places in 142 ms
[2020-06-04 03:09:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 424 ms
[2020-06-04 03:09:06] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-06-04 03:09:06] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 40 ms returned sat
[2020-06-04 03:09:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:09:07] [INFO ] [Real]Absence check using state equation in 736 ms returned sat
[2020-06-04 03:09:07] [INFO ] Deduced a trap composed of 103 places in 147 ms
[2020-06-04 03:09:07] [INFO ] Deduced a trap composed of 135 places in 135 ms
[2020-06-04 03:09:07] [INFO ] Deduced a trap composed of 146 places in 128 ms
[2020-06-04 03:09:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 550 ms
[2020-06-04 03:09:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:09:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-06-04 03:09:08] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 46 ms returned sat
[2020-06-04 03:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:09:09] [INFO ] [Nat]Absence check using state equation in 889 ms returned sat
[2020-06-04 03:09:09] [INFO ] Deduced a trap composed of 65 places in 177 ms
[2020-06-04 03:09:09] [INFO ] Deduced a trap composed of 152 places in 144 ms
[2020-06-04 03:09:09] [INFO ] Deduced a trap composed of 103 places in 160 ms
[2020-06-04 03:09:09] [INFO ] Deduced a trap composed of 150 places in 175 ms
[2020-06-04 03:09:10] [INFO ] Deduced a trap composed of 121 places in 171 ms
[2020-06-04 03:09:10] [INFO ] Deduced a trap composed of 91 places in 162 ms
[2020-06-04 03:09:10] [INFO ] Deduced a trap composed of 89 places in 120 ms
[2020-06-04 03:09:10] [INFO ] Deduced a trap composed of 77 places in 160 ms
[2020-06-04 03:09:10] [INFO ] Deduced a trap composed of 79 places in 209 ms
[2020-06-04 03:09:11] [INFO ] Deduced a trap composed of 67 places in 203 ms
[2020-06-04 03:09:11] [INFO ] Deduced a trap composed of 53 places in 196 ms
[2020-06-04 03:09:11] [INFO ] Deduced a trap composed of 55 places in 210 ms
[2020-06-04 03:09:11] [INFO ] Deduced a trap composed of 113 places in 156 ms
[2020-06-04 03:09:12] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2996 ms
[2020-06-04 03:09:12] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 36 ms.
[2020-06-04 03:09:19] [INFO ] Added : 494 causal constraints over 99 iterations in 7704 ms. Result :sat
[2020-06-04 03:09:19] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:09:19] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 27 ms returned unsat
[2020-06-04 03:09:19] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-06-04 03:09:20] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 25 ms returned unsat
[2020-06-04 03:09:20] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-06-04 03:09:20] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 55 ms returned sat
[2020-06-04 03:09:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:09:20] [INFO ] [Real]Absence check using state equation in 683 ms returned sat
[2020-06-04 03:09:21] [INFO ] Deduced a trap composed of 18 places in 275 ms
[2020-06-04 03:09:21] [INFO ] Deduced a trap composed of 41 places in 242 ms
[2020-06-04 03:09:21] [INFO ] Deduced a trap composed of 186 places in 233 ms
[2020-06-04 03:09:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 931 ms
[2020-06-04 03:09:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:09:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:09:21] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 57 ms returned sat
[2020-06-04 03:09:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:09:22] [INFO ] [Nat]Absence check using state equation in 838 ms returned sat
[2020-06-04 03:09:23] [INFO ] Deduced a trap composed of 181 places in 233 ms
[2020-06-04 03:09:23] [INFO ] Deduced a trap composed of 53 places in 224 ms
[2020-06-04 03:09:23] [INFO ] Deduced a trap composed of 185 places in 191 ms
[2020-06-04 03:09:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 770 ms
[2020-06-04 03:09:23] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 27 ms.
[2020-06-04 03:09:25] [INFO ] Added : 259 causal constraints over 52 iterations in 2269 ms. Result :sat
[2020-06-04 03:09:26] [INFO ] Deduced a trap composed of 43 places in 212 ms
[2020-06-04 03:09:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2020-06-04 03:09:26] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-06-04 03:09:26] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 32 ms returned unsat
[2020-06-04 03:09:26] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-06-04 03:09:26] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 48 ms returned sat
[2020-06-04 03:09:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:09:27] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2020-06-04 03:09:27] [INFO ] Deduced a trap composed of 18 places in 263 ms
[2020-06-04 03:09:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2020-06-04 03:09:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:09:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-06-04 03:09:27] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 51 ms returned sat
[2020-06-04 03:09:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:09:28] [INFO ] [Nat]Absence check using state equation in 827 ms returned sat
[2020-06-04 03:09:28] [INFO ] Deduced a trap composed of 18 places in 281 ms
[2020-06-04 03:09:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2020-06-04 03:09:28] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 27 ms.
[2020-06-04 03:09:32] [INFO ] Added : 308 causal constraints over 62 iterations in 3271 ms. Result :sat
[2020-06-04 03:09:32] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:09:32] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 50 ms returned sat
[2020-06-04 03:09:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:09:33] [INFO ] [Real]Absence check using state equation in 906 ms returned sat
[2020-06-04 03:09:33] [INFO ] Deduced a trap composed of 18 places in 292 ms
[2020-06-04 03:09:33] [INFO ] Deduced a trap composed of 177 places in 262 ms
[2020-06-04 03:09:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 744 ms
[2020-06-04 03:09:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:09:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:09:34] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 50 ms returned sat
[2020-06-04 03:09:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:09:34] [INFO ] [Nat]Absence check using state equation in 842 ms returned sat
[2020-06-04 03:09:35] [INFO ] Deduced a trap composed of 18 places in 296 ms
[2020-06-04 03:09:35] [INFO ] Deduced a trap composed of 177 places in 266 ms
[2020-06-04 03:09:35] [INFO ] Deduced a trap composed of 41 places in 219 ms
[2020-06-04 03:09:36] [INFO ] Deduced a trap composed of 43 places in 242 ms
[2020-06-04 03:09:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1202 ms
[2020-06-04 03:09:36] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 43 ms.
[2020-06-04 03:09:38] [INFO ] Added : 260 causal constraints over 52 iterations in 2665 ms. Result :sat
[2020-06-04 03:09:38] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-06-04 03:09:39] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 53 ms returned sat
[2020-06-04 03:09:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:09:39] [INFO ] [Real]Absence check using state equation in 953 ms returned sat
[2020-06-04 03:09:40] [INFO ] Deduced a trap composed of 202 places in 262 ms
[2020-06-04 03:09:40] [INFO ] Deduced a trap composed of 208 places in 246 ms
[2020-06-04 03:09:40] [INFO ] Deduced a trap composed of 183 places in 219 ms
[2020-06-04 03:09:40] [INFO ] Deduced a trap composed of 187 places in 202 ms
[2020-06-04 03:09:41] [INFO ] Deduced a trap composed of 205 places in 195 ms
[2020-06-04 03:09:41] [INFO ] Deduced a trap composed of 212 places in 195 ms
[2020-06-04 03:09:41] [INFO ] Deduced a trap composed of 214 places in 229 ms
[2020-06-04 03:09:41] [INFO ] Deduced a trap composed of 183 places in 222 ms
[2020-06-04 03:09:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2016 ms
[2020-06-04 03:09:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:09:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-06-04 03:09:42] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 34 ms returned sat
[2020-06-04 03:09:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:09:42] [INFO ] [Nat]Absence check using state equation in 767 ms returned sat
[2020-06-04 03:09:43] [INFO ] Deduced a trap composed of 202 places in 234 ms
[2020-06-04 03:09:43] [INFO ] Deduced a trap composed of 89 places in 193 ms
[2020-06-04 03:09:43] [INFO ] Deduced a trap composed of 186 places in 226 ms
[2020-06-04 03:09:43] [INFO ] Deduced a trap composed of 213 places in 184 ms
[2020-06-04 03:09:43] [INFO ] Deduced a trap composed of 189 places in 180 ms
[2020-06-04 03:09:44] [INFO ] Deduced a trap composed of 211 places in 175 ms
[2020-06-04 03:09:44] [INFO ] Deduced a trap composed of 107 places in 173 ms
[2020-06-04 03:09:44] [INFO ] Deduced a trap composed of 103 places in 169 ms
[2020-06-04 03:09:44] [INFO ] Deduced a trap composed of 91 places in 174 ms
[2020-06-04 03:09:44] [INFO ] Deduced a trap composed of 190 places in 174 ms
[2020-06-04 03:09:45] [INFO ] Deduced a trap composed of 177 places in 347 ms
[2020-06-04 03:09:45] [INFO ] Deduced a trap composed of 77 places in 166 ms
[2020-06-04 03:09:45] [INFO ] Deduced a trap composed of 79 places in 123 ms
[2020-06-04 03:09:45] [INFO ] Deduced a trap composed of 65 places in 122 ms
[2020-06-04 03:09:45] [INFO ] Deduced a trap composed of 67 places in 149 ms
[2020-06-04 03:09:46] [INFO ] Deduced a trap composed of 41 places in 182 ms
[2020-06-04 03:09:46] [INFO ] Deduced a trap composed of 55 places in 175 ms
[2020-06-04 03:09:46] [INFO ] Deduced a trap composed of 53 places in 154 ms
[2020-06-04 03:09:46] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4057 ms
[2020-06-04 03:09:46] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 47 ms.
[2020-06-04 03:09:52] [INFO ] Added : 395 causal constraints over 81 iterations in 5760 ms. Result :sat
[2020-06-04 03:09:52] [INFO ] Deduced a trap composed of 43 places in 185 ms
[2020-06-04 03:09:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
[2020-06-04 03:09:53] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-06-04 03:09:53] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 42 ms returned sat
[2020-06-04 03:09:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:09:54] [INFO ] [Real]Absence check using state equation in 918 ms returned sat
[2020-06-04 03:09:54] [INFO ] Deduced a trap composed of 182 places in 263 ms
[2020-06-04 03:09:54] [INFO ] Deduced a trap composed of 89 places in 194 ms
[2020-06-04 03:09:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 550 ms
[2020-06-04 03:09:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:09:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-06-04 03:09:54] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 43 ms returned sat
[2020-06-04 03:09:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:09:55] [INFO ] [Nat]Absence check using state equation in 929 ms returned sat
[2020-06-04 03:09:55] [INFO ] Deduced a trap composed of 222 places in 192 ms
[2020-06-04 03:09:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2020-06-04 03:09:55] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 28 ms.
[2020-06-04 03:09:59] [INFO ] Added : 410 causal constraints over 82 iterations in 3801 ms. Result :sat
[2020-06-04 03:09:59] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-06-04 03:09:59] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 35 ms returned sat
[2020-06-04 03:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:10:00] [INFO ] [Real]Absence check using state equation in 782 ms returned sat
[2020-06-04 03:10:00] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 37 ms.
[2020-06-04 03:10:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:10:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-06-04 03:10:00] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 50 ms returned sat
[2020-06-04 03:10:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:10:01] [INFO ] [Nat]Absence check using state equation in 810 ms returned sat
[2020-06-04 03:10:01] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 32 ms.
[2020-06-04 03:10:07] [INFO ] Added : 494 causal constraints over 100 iterations in 5730 ms. Result :sat
[2020-06-04 03:10:07] [INFO ] Deduced a trap composed of 43 places in 212 ms
[2020-06-04 03:10:08] [INFO ] Deduced a trap composed of 53 places in 189 ms
[2020-06-04 03:10:08] [INFO ] Deduced a trap composed of 79 places in 129 ms
[2020-06-04 03:10:08] [INFO ] Deduced a trap composed of 89 places in 154 ms
[2020-06-04 03:10:08] [INFO ] Deduced a trap composed of 121 places in 68 ms
[2020-06-04 03:10:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1020 ms
[2020-06-04 03:10:08] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-06-04 03:10:08] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 42 ms returned sat
[2020-06-04 03:10:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:10:09] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2020-06-04 03:10:09] [INFO ] Deduced a trap composed of 53 places in 203 ms
[2020-06-04 03:10:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2020-06-04 03:10:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:10:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-06-04 03:10:09] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 35 ms returned sat
[2020-06-04 03:10:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:10:10] [INFO ] [Nat]Absence check using state equation in 771 ms returned sat
[2020-06-04 03:10:10] [INFO ] Deduced a trap composed of 53 places in 195 ms
[2020-06-04 03:10:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2020-06-04 03:10:10] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 31 ms.
[2020-06-04 03:10:14] [INFO ] Added : 353 causal constraints over 71 iterations in 3189 ms. Result :sat
[2020-06-04 03:10:14] [INFO ] Deduced a trap composed of 205 places in 263 ms
[2020-06-04 03:10:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2020-06-04 03:10:14] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-06-04 03:10:14] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 53 ms returned sat
[2020-06-04 03:10:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:10:15] [INFO ] [Real]Absence check using state equation in 828 ms returned sat
[2020-06-04 03:10:15] [INFO ] Deduced a trap composed of 18 places in 264 ms
[2020-06-04 03:10:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2020-06-04 03:10:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:10:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-06-04 03:10:15] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 50 ms returned sat
[2020-06-04 03:10:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:10:16] [INFO ] [Nat]Absence check using state equation in 781 ms returned sat
[2020-06-04 03:10:16] [INFO ] Deduced a trap composed of 18 places in 190 ms
[2020-06-04 03:10:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2020-06-04 03:10:16] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 29 ms.
[2020-06-04 03:10:18] [INFO ] Added : 192 causal constraints over 39 iterations in 1803 ms. Result :sat
[2020-06-04 03:10:18] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-06-04 03:10:18] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 53 ms returned sat
[2020-06-04 03:10:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:10:19] [INFO ] [Real]Absence check using state equation in 833 ms returned sat
[2020-06-04 03:10:19] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 27 ms.
[2020-06-04 03:10:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:10:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-06-04 03:10:20] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 52 ms returned sat
[2020-06-04 03:10:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:10:20] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2020-06-04 03:10:20] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 45 ms.
[2020-06-04 03:10:24] [INFO ] Added : 394 causal constraints over 79 iterations in 3820 ms. Result :sat
[2020-06-04 03:10:24] [INFO ] Deduced a trap composed of 35 places in 223 ms
[2020-06-04 03:10:25] [INFO ] Deduced a trap composed of 29 places in 216 ms
[2020-06-04 03:10:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 572 ms
[2020-06-04 03:10:25] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-06-04 03:10:25] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 44 ms returned sat
[2020-06-04 03:10:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:10:26] [INFO ] [Real]Absence check using state equation in 785 ms returned sat
[2020-06-04 03:10:26] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 38 ms.
[2020-06-04 03:10:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:10:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:10:26] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 49 ms returned sat
[2020-06-04 03:10:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:10:27] [INFO ] [Nat]Absence check using state equation in 818 ms returned sat
[2020-06-04 03:10:27] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 45 ms.
[2020-06-04 03:10:30] [INFO ] Added : 276 causal constraints over 56 iterations in 3028 ms. Result :sat
[2020-06-04 03:10:30] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-06-04 03:10:30] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 49 ms returned sat
[2020-06-04 03:10:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:10:31] [INFO ] [Real]Absence check using state equation in 841 ms returned sat
[2020-06-04 03:10:31] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 45 ms.
[2020-06-04 03:10:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:10:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:10:31] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 60 ms returned sat
[2020-06-04 03:10:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:10:32] [INFO ] [Nat]Absence check using state equation in 867 ms returned sat
[2020-06-04 03:10:32] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 31 ms.
[2020-06-04 03:10:35] [INFO ] Added : 361 causal constraints over 73 iterations in 3089 ms. Result :sat
[2020-06-04 03:10:35] [INFO ] Deduced a trap composed of 168 places in 155 ms
[2020-06-04 03:10:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2020-06-04 03:10:35] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-06-04 03:10:35] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 32 ms returned sat
[2020-06-04 03:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:10:36] [INFO ] [Real]Absence check using state equation in 690 ms returned sat
[2020-06-04 03:10:36] [INFO ] Deduced a trap composed of 189 places in 268 ms
[2020-06-04 03:10:37] [INFO ] Deduced a trap composed of 43 places in 199 ms
[2020-06-04 03:10:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 561 ms
[2020-06-04 03:10:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:10:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-06-04 03:10:37] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 47 ms returned sat
[2020-06-04 03:10:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:10:38] [INFO ] [Nat]Absence check using state equation in 911 ms returned sat
[2020-06-04 03:10:38] [INFO ] Deduced a trap composed of 189 places in 264 ms
[2020-06-04 03:10:38] [INFO ] Deduced a trap composed of 43 places in 187 ms
[2020-06-04 03:10:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 544 ms
[2020-06-04 03:10:38] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 34 ms.
[2020-06-04 03:10:42] [INFO ] Added : 353 causal constraints over 71 iterations in 3886 ms. Result :sat
[2020-06-04 03:10:42] [INFO ] Deduced a trap composed of 67 places in 197 ms
[2020-06-04 03:10:43] [INFO ] Deduced a trap composed of 65 places in 143 ms
[2020-06-04 03:10:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2020-06-04 03:10:43] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:10:43] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 49 ms returned sat
[2020-06-04 03:10:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:10:44] [INFO ] [Real]Absence check using state equation in 944 ms returned sat
[2020-06-04 03:10:44] [INFO ] Deduced a trap composed of 103 places in 155 ms
[2020-06-04 03:10:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2020-06-04 03:10:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:10:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-06-04 03:10:44] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 45 ms returned sat
[2020-06-04 03:10:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:10:45] [INFO ] [Nat]Absence check using state equation in 942 ms returned sat
[2020-06-04 03:10:45] [INFO ] Deduced a trap composed of 103 places in 131 ms
[2020-06-04 03:10:45] [INFO ] Deduced a trap composed of 195 places in 191 ms
[2020-06-04 03:10:46] [INFO ] Deduced a trap composed of 212 places in 234 ms
[2020-06-04 03:10:46] [INFO ] Deduced a trap composed of 200 places in 177 ms
[2020-06-04 03:10:46] [INFO ] Deduced a trap composed of 197 places in 240 ms
[2020-06-04 03:10:46] [INFO ] Deduced a trap composed of 215 places in 248 ms
[2020-06-04 03:10:47] [INFO ] Deduced a trap composed of 239 places in 243 ms
[2020-06-04 03:10:47] [INFO ] Deduced a trap composed of 106 places in 234 ms
[2020-06-04 03:10:47] [INFO ] Deduced a trap composed of 53 places in 203 ms
[2020-06-04 03:10:47] [INFO ] Deduced a trap composed of 195 places in 180 ms
[2020-06-04 03:10:48] [INFO ] Deduced a trap composed of 41 places in 267 ms
[2020-06-04 03:10:48] [INFO ] Deduced a trap composed of 43 places in 153 ms
[2020-06-04 03:10:48] [INFO ] Deduced a trap composed of 224 places in 155 ms
[2020-06-04 03:10:48] [INFO ] Deduced a trap composed of 203 places in 152 ms
[2020-06-04 03:10:48] [INFO ] Deduced a trap composed of 91 places in 111 ms
[2020-06-04 03:10:49] [INFO ] Deduced a trap composed of 146 places in 137 ms
[2020-06-04 03:10:49] [INFO ] Deduced a trap composed of 149 places in 86 ms
[2020-06-04 03:10:49] [INFO ] Deduced a trap composed of 113 places in 97 ms
[2020-06-04 03:10:49] [INFO ] Deduced a trap composed of 208 places in 152 ms
[2020-06-04 03:10:49] [INFO ] Deduced a trap composed of 232 places in 160 ms
[2020-06-04 03:10:49] [INFO ] Deduced a trap composed of 89 places in 163 ms
[2020-06-04 03:10:49] [INFO ] Deduced a trap composed of 198 places in 198 ms
[2020-06-04 03:10:50] [INFO ] Deduced a trap composed of 118 places in 177 ms
[2020-06-04 03:10:50] [INFO ] Deduced a trap composed of 77 places in 173 ms
[2020-06-04 03:10:50] [INFO ] Deduced a trap composed of 108 places in 172 ms
[2020-06-04 03:10:50] [INFO ] Deduced a trap composed of 65 places in 133 ms
[2020-06-04 03:10:50] [INFO ] Deduced a trap composed of 67 places in 109 ms
[2020-06-04 03:10:51] [INFO ] Deduced a trap composed of 55 places in 119 ms
[2020-06-04 03:10:51] [INFO ] Deduced a trap composed of 127 places in 124 ms
[2020-06-04 03:10:51] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 5749 ms
[2020-06-04 03:10:51] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 37 ms.
[2020-06-04 03:10:56] [INFO ] Added : 495 causal constraints over 99 iterations in 5614 ms. Result :sat
[2020-06-04 03:10:57] [INFO ] Deduced a trap composed of 24 places in 214 ms
[2020-06-04 03:10:57] [INFO ] Deduced a trap composed of 26 places in 223 ms
[2020-06-04 03:10:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 568 ms
[2020-06-04 03:10:57] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-06-04 03:10:57] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 80 ms returned sat
[2020-06-04 03:10:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:10:58] [INFO ] [Real]Absence check using state equation in 1135 ms returned sat
[2020-06-04 03:10:58] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 50 ms.
[2020-06-04 03:10:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:10:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-06-04 03:10:59] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 45 ms returned sat
[2020-06-04 03:10:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:11:00] [INFO ] [Nat]Absence check using state equation in 1074 ms returned sat
[2020-06-04 03:11:00] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 44 ms.
[2020-06-04 03:11:04] [INFO ] Added : 407 causal constraints over 82 iterations in 4403 ms. Result :sat
[2020-06-04 03:11:04] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:11:04] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 29 ms returned unsat
[2020-06-04 03:11:04] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-06-04 03:11:04] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 23 ms returned unsat
[2020-06-04 03:11:04] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-06-04 03:11:04] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 32 ms returned sat
[2020-06-04 03:11:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:11:05] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2020-06-04 03:11:05] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 41 ms.
[2020-06-04 03:11:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:11:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-06-04 03:11:06] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 40 ms returned sat
[2020-06-04 03:11:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:11:06] [INFO ] [Nat]Absence check using state equation in 893 ms returned sat
[2020-06-04 03:11:07] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 44 ms.
[2020-06-04 03:11:12] [INFO ] Added : 492 causal constraints over 99 iterations in 5085 ms. Result :sat
[2020-06-04 03:11:12] [INFO ] Deduced a trap composed of 77 places in 126 ms
[2020-06-04 03:11:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2020-06-04 03:11:12] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-06-04 03:11:12] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 33 ms returned unsat
[2020-06-04 03:11:12] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-06-04 03:11:12] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 49 ms returned sat
[2020-06-04 03:11:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:11:13] [INFO ] [Real]Absence check using state equation in 736 ms returned sat
[2020-06-04 03:11:13] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 38 ms.
[2020-06-04 03:11:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:11:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2020-06-04 03:11:13] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 57 ms returned sat
[2020-06-04 03:11:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:11:14] [INFO ] [Nat]Absence check using state equation in 961 ms returned sat
[2020-06-04 03:11:14] [INFO ] Deduced a trap composed of 143 places in 142 ms
[2020-06-04 03:11:14] [INFO ] Deduced a trap composed of 103 places in 152 ms
[2020-06-04 03:11:15] [INFO ] Deduced a trap composed of 89 places in 115 ms
[2020-06-04 03:11:15] [INFO ] Deduced a trap composed of 137 places in 122 ms
[2020-06-04 03:11:15] [INFO ] Deduced a trap composed of 133 places in 137 ms
[2020-06-04 03:11:15] [INFO ] Deduced a trap composed of 138 places in 134 ms
[2020-06-04 03:11:15] [INFO ] Deduced a trap composed of 148 places in 126 ms
[2020-06-04 03:11:15] [INFO ] Deduced a trap composed of 113 places in 123 ms
[2020-06-04 03:11:15] [INFO ] Deduced a trap composed of 101 places in 135 ms
[2020-06-04 03:11:16] [INFO ] Deduced a trap composed of 91 places in 110 ms
[2020-06-04 03:11:16] [INFO ] Deduced a trap composed of 77 places in 115 ms
[2020-06-04 03:11:16] [INFO ] Deduced a trap composed of 79 places in 143 ms
[2020-06-04 03:11:16] [INFO ] Deduced a trap composed of 65 places in 154 ms
[2020-06-04 03:11:16] [INFO ] Deduced a trap composed of 67 places in 145 ms
[2020-06-04 03:11:16] [INFO ] Deduced a trap composed of 109 places in 140 ms
[2020-06-04 03:11:17] [INFO ] Deduced a trap composed of 115 places in 215 ms
[2020-06-04 03:11:17] [INFO ] Deduced a trap composed of 55 places in 202 ms
[2020-06-04 03:11:17] [INFO ] Deduced a trap composed of 53 places in 194 ms
[2020-06-04 03:11:17] [INFO ] Deduced a trap composed of 41 places in 210 ms
[2020-06-04 03:11:18] [INFO ] Deduced a trap composed of 43 places in 207 ms
[2020-06-04 03:11:18] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3895 ms
[2020-06-04 03:11:18] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 36 ms.
[2020-06-04 03:11:23] [INFO ] Added : 449 causal constraints over 90 iterations in 4684 ms. Result :sat
[2020-06-04 03:11:23] [INFO ] Deduced a trap composed of 48 places in 217 ms
[2020-06-04 03:11:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2020-06-04 03:11:23] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:11:23] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 53 ms returned sat
[2020-06-04 03:11:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:11:24] [INFO ] [Real]Absence check using state equation in 883 ms returned sat
[2020-06-04 03:11:24] [INFO ] Deduced a trap composed of 101 places in 164 ms
[2020-06-04 03:11:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2020-06-04 03:11:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:11:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-06-04 03:11:24] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 44 ms returned sat
[2020-06-04 03:11:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:11:25] [INFO ] [Nat]Absence check using state equation in 784 ms returned sat
[2020-06-04 03:11:25] [INFO ] Deduced a trap composed of 101 places in 105 ms
[2020-06-04 03:11:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2020-06-04 03:11:25] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 32 ms.
[2020-06-04 03:11:29] [INFO ] Added : 411 causal constraints over 83 iterations in 3525 ms. Result :sat
[2020-06-04 03:11:29] [INFO ] Deduced a trap composed of 53 places in 220 ms
[2020-06-04 03:11:29] [INFO ] Deduced a trap composed of 67 places in 213 ms
[2020-06-04 03:11:30] [INFO ] Deduced a trap composed of 65 places in 224 ms
[2020-06-04 03:11:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 815 ms
[2020-06-04 03:11:30] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-06-04 03:11:30] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 46 ms returned sat
[2020-06-04 03:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:11:31] [INFO ] [Real]Absence check using state equation in 1215 ms returned sat
[2020-06-04 03:11:31] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 44 ms.
[2020-06-04 03:11:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:11:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-06-04 03:11:31] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 43 ms returned sat
[2020-06-04 03:11:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:11:32] [INFO ] [Nat]Absence check using state equation in 1028 ms returned sat
[2020-06-04 03:11:32] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 33 ms.
[2020-06-04 03:11:39] [INFO ] Added : 492 causal constraints over 99 iterations in 6405 ms. Result :sat
[2020-06-04 03:11:39] [INFO ] Deduced a trap composed of 218 places in 220 ms
[2020-06-04 03:11:39] [INFO ] Deduced a trap composed of 43 places in 188 ms
[2020-06-04 03:11:40] [INFO ] Deduced a trap composed of 208 places in 194 ms
[2020-06-04 03:11:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 785 ms
[2020-06-04 03:11:40] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-06-04 03:11:40] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 41 ms returned sat
[2020-06-04 03:11:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:11:40] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2020-06-04 03:11:41] [INFO ] Deduced a trap composed of 55 places in 286 ms
[2020-06-04 03:11:41] [INFO ] Deduced a trap composed of 215 places in 244 ms
[2020-06-04 03:11:41] [INFO ] Deduced a trap composed of 145 places in 379 ms
[2020-06-04 03:11:42] [INFO ] Deduced a trap composed of 103 places in 263 ms
[2020-06-04 03:11:42] [INFO ] Deduced a trap composed of 89 places in 246 ms
[2020-06-04 03:11:42] [INFO ] Deduced a trap composed of 193 places in 171 ms
[2020-06-04 03:11:42] [INFO ] Deduced a trap composed of 213 places in 272 ms
[2020-06-04 03:11:43] [INFO ] Deduced a trap composed of 154 places in 240 ms
[2020-06-04 03:11:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2336 ms
[2020-06-04 03:11:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:11:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-06-04 03:11:43] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 54 ms returned sat
[2020-06-04 03:11:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:11:44] [INFO ] [Nat]Absence check using state equation in 907 ms returned sat
[2020-06-04 03:11:44] [INFO ] Deduced a trap composed of 55 places in 260 ms
[2020-06-04 03:11:44] [INFO ] Deduced a trap composed of 177 places in 241 ms
[2020-06-04 03:11:45] [INFO ] Deduced a trap composed of 193 places in 230 ms
[2020-06-04 03:11:45] [INFO ] Deduced a trap composed of 203 places in 198 ms
[2020-06-04 03:11:45] [INFO ] Deduced a trap composed of 194 places in 193 ms
[2020-06-04 03:11:45] [INFO ] Deduced a trap composed of 211 places in 220 ms
[2020-06-04 03:11:46] [INFO ] Deduced a trap composed of 53 places in 230 ms
[2020-06-04 03:11:46] [INFO ] Deduced a trap composed of 41 places in 212 ms
[2020-06-04 03:11:46] [INFO ] Deduced a trap composed of 199 places in 273 ms
[2020-06-04 03:11:46] [INFO ] Deduced a trap composed of 192 places in 242 ms
[2020-06-04 03:11:47] [INFO ] Deduced a trap composed of 231 places in 262 ms
[2020-06-04 03:11:47] [INFO ] Deduced a trap composed of 67 places in 258 ms
[2020-06-04 03:11:47] [INFO ] Deduced a trap composed of 249 places in 231 ms
[2020-06-04 03:11:48] [INFO ] Deduced a trap composed of 198 places in 230 ms
[2020-06-04 03:11:48] [INFO ] Deduced a trap composed of 201 places in 251 ms
[2020-06-04 03:11:48] [INFO ] Deduced a trap composed of 215 places in 264 ms
[2020-06-04 03:11:48] [INFO ] Deduced a trap composed of 43 places in 254 ms
[2020-06-04 03:11:49] [INFO ] Deduced a trap composed of 187 places in 236 ms
[2020-06-04 03:11:49] [INFO ] Deduced a trap composed of 208 places in 237 ms
[2020-06-04 03:11:49] [INFO ] Deduced a trap composed of 96 places in 228 ms
[2020-06-04 03:11:50] [INFO ] Deduced a trap composed of 136 places in 253 ms
[2020-06-04 03:11:50] [INFO ] Deduced a trap composed of 108 places in 197 ms
[2020-06-04 03:11:50] [INFO ] Deduced a trap composed of 89 places in 257 ms
[2020-06-04 03:11:51] [INFO ] Deduced a trap composed of 181 places in 282 ms
[2020-06-04 03:11:51] [INFO ] Deduced a trap composed of 91 places in 287 ms
[2020-06-04 03:11:51] [INFO ] Deduced a trap composed of 103 places in 153 ms
[2020-06-04 03:11:51] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 7470 ms
[2020-06-04 03:11:51] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 46 ms.
[2020-06-04 03:11:56] [INFO ] Added : 411 causal constraints over 83 iterations in 5253 ms. Result :sat
[2020-06-04 03:11:57] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-06-04 03:11:57] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 46 ms returned sat
[2020-06-04 03:11:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:11:58] [INFO ] [Real]Absence check using state equation in 870 ms returned sat
[2020-06-04 03:11:58] [INFO ] Deduced a trap composed of 59 places in 179 ms
[2020-06-04 03:11:58] [INFO ] Deduced a trap composed of 60 places in 303 ms
[2020-06-04 03:11:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 563 ms
[2020-06-04 03:11:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:11:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2020-06-04 03:11:58] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 41 ms returned sat
[2020-06-04 03:11:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:11:59] [INFO ] [Nat]Absence check using state equation in 820 ms returned sat
[2020-06-04 03:11:59] [INFO ] Deduced a trap composed of 41 places in 165 ms
[2020-06-04 03:11:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2020-06-04 03:11:59] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 46 ms.
[2020-06-04 03:12:01] [INFO ] Added : 210 causal constraints over 42 iterations in 1984 ms. Result :sat
[2020-06-04 03:12:01] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2020-06-04 03:12:01] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 51 ms returned sat
[2020-06-04 03:12:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:12:02] [INFO ] [Real]Absence check using state equation in 1028 ms returned sat
[2020-06-04 03:12:03] [INFO ] Deduced a trap composed of 53 places in 139 ms
[2020-06-04 03:12:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2020-06-04 03:12:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:12:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:12:03] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 47 ms returned sat
[2020-06-04 03:12:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:12:04] [INFO ] [Nat]Absence check using state equation in 892 ms returned sat
[2020-06-04 03:12:04] [INFO ] Deduced a trap composed of 53 places in 143 ms
[2020-06-04 03:12:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2020-06-04 03:12:04] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 31 ms.
[2020-06-04 03:12:07] [INFO ] Added : 293 causal constraints over 60 iterations in 3569 ms. Result :sat
[2020-06-04 03:12:08] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-06-04 03:12:08] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 49 ms returned sat
[2020-06-04 03:12:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:12:08] [INFO ] [Real]Absence check using state equation in 774 ms returned sat
[2020-06-04 03:12:09] [INFO ] Deduced a trap composed of 192 places in 192 ms
[2020-06-04 03:12:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2020-06-04 03:12:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:12:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:12:09] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 49 ms returned sat
[2020-06-04 03:12:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:12:10] [INFO ] [Nat]Absence check using state equation in 960 ms returned sat
[2020-06-04 03:12:10] [INFO ] Deduced a trap composed of 192 places in 192 ms
[2020-06-04 03:12:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2020-06-04 03:12:10] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 34 ms.
[2020-06-04 03:12:16] [INFO ] Added : 493 causal constraints over 99 iterations in 5954 ms. Result :sat
[2020-06-04 03:12:16] [INFO ] Deduced a trap composed of 184 places in 192 ms
[2020-06-04 03:12:16] [INFO ] Deduced a trap composed of 103 places in 191 ms
[2020-06-04 03:12:17] [INFO ] Deduced a trap composed of 115 places in 193 ms
[2020-06-04 03:12:17] [INFO ] Deduced a trap composed of 235 places in 245 ms
[2020-06-04 03:12:17] [INFO ] Deduced a trap composed of 235 places in 215 ms
[2020-06-04 03:12:18] [INFO ] Deduced a trap composed of 243 places in 219 ms
[2020-06-04 03:12:18] [INFO ] Deduced a trap composed of 248 places in 242 ms
[2020-06-04 03:12:18] [INFO ] Deduced a trap composed of 181 places in 246 ms
[2020-06-04 03:12:18] [INFO ] Deduced a trap composed of 170 places in 248 ms
[2020-06-04 03:12:19] [INFO ] Deduced a trap composed of 208 places in 253 ms
[2020-06-04 03:12:19] [INFO ] Deduced a trap composed of 141 places in 257 ms
[2020-06-04 03:12:19] [INFO ] Deduced a trap composed of 196 places in 276 ms
[2020-06-04 03:12:20] [INFO ] Deduced a trap composed of 259 places in 259 ms
[2020-06-04 03:12:20] [INFO ] Deduced a trap composed of 242 places in 276 ms
[2020-06-04 03:12:20] [INFO ] Deduced a trap composed of 132 places in 269 ms
[2020-06-04 03:12:21] [INFO ] Deduced a trap composed of 224 places in 252 ms
[2020-06-04 03:12:21] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4714 ms
[2020-06-04 03:12:21] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-06-04 03:12:21] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 54 ms returned sat
[2020-06-04 03:12:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:12:22] [INFO ] [Real]Absence check using state equation in 1122 ms returned sat
[2020-06-04 03:12:22] [INFO ] Deduced a trap composed of 53 places in 218 ms
[2020-06-04 03:12:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2020-06-04 03:12:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:12:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-06-04 03:12:22] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 51 ms returned sat
[2020-06-04 03:12:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:12:23] [INFO ] [Nat]Absence check using state equation in 987 ms returned sat
[2020-06-04 03:12:24] [INFO ] Deduced a trap composed of 53 places in 192 ms
[2020-06-04 03:12:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2020-06-04 03:12:24] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 44 ms.
[2020-06-04 03:12:29] [INFO ] Added : 492 causal constraints over 99 iterations in 4834 ms. Result :sat
[2020-06-04 03:12:29] [INFO ] Deduced a trap composed of 101 places in 150 ms
[2020-06-04 03:12:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
Successfully simplified 9 atomic propositions for a total of 9 simplifications.
[2020-06-04 03:12:29] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-04 03:12:29] [INFO ] Flatten gal took : 139 ms
[2020-06-04 03:12:29] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-04 03:12:29] [INFO ] Flatten gal took : 39 ms
FORMULA DoubleExponent-PT-010-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 03:12:29] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-04 03:12:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ DoubleExponent-PT-010 @ 3570 seconds
FORMULA DoubleExponent-PT-010-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-010-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 16108004 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16109296 kB
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-010"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DoubleExponent-PT-010, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987882900780"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-010.tgz
mv DoubleExponent-PT-010 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;