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.r211-tajo-159033477600519.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 ShieldPPPs-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477600519
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 3.2K May 14 01:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 01:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 19:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 19:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K May 13 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 08:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 08:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 528K May 12 20:42 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 ShieldPPPs-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591312119812

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 23:08:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 23:08:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 23:08:42] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2020-06-04 23:08:42] [INFO ] Transformed 2043 places.
[2020-06-04 23:08:42] [INFO ] Transformed 1893 transitions.
[2020-06-04 23:08:42] [INFO ] Found NUPN structural information;
[2020-06-04 23:08:42] [INFO ] Parsed PT model containing 2043 places and 1893 transitions in 260 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 49 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties seen :[1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0]
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 1893 rows 2043 cols
[2020-06-04 23:08:42] [INFO ] Computed 331 place invariants in 53 ms
[2020-06-04 23:08:43] [INFO ] [Real]Absence check using 331 positive place invariants in 370 ms returned sat
[2020-06-04 23:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:08:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 23:08:47] [INFO ] [Real]Absence check using state equation in 4039 ms returned (error "Failed to check-sat")
[2020-06-04 23:08:48] [INFO ] [Real]Absence check using 331 positive place invariants in 429 ms returned sat
[2020-06-04 23:08:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:08:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 23:08:52] [INFO ] [Real]Absence check using state equation in 4292 ms returned (error "Failed to check-sat")
[2020-06-04 23:08:53] [INFO ] [Real]Absence check using 331 positive place invariants in 428 ms returned sat
[2020-06-04 23:08:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:08:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 23:08:57] [INFO ] [Real]Absence check using state equation in 4284 ms returned (error "Failed to check-sat")
[2020-06-04 23:08:58] [INFO ] [Real]Absence check using 331 positive place invariants in 756 ms returned sat
[2020-06-04 23:08:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:09:02] [INFO ] [Real]Absence check using state equation in 3974 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 23:09:03] [INFO ] [Real]Absence check using 331 positive place invariants in 451 ms returned sat
[2020-06-04 23:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:09:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 23:09:07] [INFO ] [Real]Absence check using state equation in 4259 ms returned (error "Failed to check-sat")
Support contains 36 out of 2043 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 204 place count 2043 transition count 1689
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 1 with 204 rules applied. Total rules applied 408 place count 1839 transition count 1689
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 408 place count 1839 transition count 1538
Deduced a syphon composed of 151 places in 4 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 710 place count 1688 transition count 1538
Symmetric choice reduction at 2 with 206 rule applications. Total rules 916 place count 1688 transition count 1538
Deduced a syphon composed of 206 places in 9 ms
Reduce places removed 206 places and 206 transitions.
Iterating global reduction 2 with 412 rules applied. Total rules applied 1328 place count 1482 transition count 1332
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 1328 place count 1482 transition count 1251
Deduced a syphon composed of 81 places in 5 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 1490 place count 1401 transition count 1251
Performed 434 Post agglomeration using F-continuation condition.Transition count delta: 434
Deduced a syphon composed of 434 places in 2 ms
Reduce places removed 434 places and 0 transitions.
Iterating global reduction 2 with 868 rules applied. Total rules applied 2358 place count 967 transition count 817
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 255 times.
Drop transitions removed 255 transitions
Iterating global reduction 2 with 255 rules applied. Total rules applied 2613 place count 967 transition count 817
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 2615 place count 967 transition count 817
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2616 place count 966 transition count 816
Applied a total of 2616 rules in 1556 ms. Remains 966 /2043 variables (removed 1077) and now considering 816/1893 (removed 1077) transitions.
Finished structural reductions, in 1 iterations. Remains : 966/2043 places, 816/1893 transitions.
Incomplete random walk after 1000000 steps, including 132 resets, run finished after 7452 ms. (steps per millisecond=134 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7 resets, run finished after 4070 ms. (steps per millisecond=245 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 10 resets, run finished after 3820 ms. (steps per millisecond=261 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 13 resets, run finished after 4214 ms. (steps per millisecond=237 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 8 resets, run finished after 3711 ms. (steps per millisecond=269 ) properties seen :[0, 0, 0, 1, 0]
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 11 resets, run finished after 4025 ms. (steps per millisecond=248 ) properties seen :[0, 0, 0, 1]
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 816 rows 966 cols
[2020-06-04 23:09:36] [INFO ] Computed 331 place invariants in 51 ms
[2020-06-04 23:09:37] [INFO ] [Real]Absence check using 310 positive place invariants in 359 ms returned sat
[2020-06-04 23:09:37] [INFO ] [Real]Absence check using 310 positive and 21 generalized place invariants in 16 ms returned sat
[2020-06-04 23:09:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:09:39] [INFO ] [Real]Absence check using state equation in 1729 ms returned sat
[2020-06-04 23:09:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 23:09:39] [INFO ] [Nat]Absence check using 310 positive place invariants in 158 ms returned sat
[2020-06-04 23:09:39] [INFO ] [Nat]Absence check using 310 positive and 21 generalized place invariants in 12 ms returned sat
[2020-06-04 23:09:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 23:09:41] [INFO ] [Nat]Absence check using state equation in 1663 ms returned sat
[2020-06-04 23:09:41] [INFO ] Deduced a trap composed of 5 places in 282 ms
[2020-06-04 23:09:41] [INFO ] Deduced a trap composed of 5 places in 245 ms
[2020-06-04 23:09:42] [INFO ] Deduced a trap composed of 4 places in 259 ms
[2020-06-04 23:09:42] [INFO ] Deduced a trap composed of 5 places in 258 ms
[2020-06-04 23:09:42] [INFO ] Deduced a trap composed of 5 places in 263 ms
[2020-06-04 23:09:42] [INFO ] Deduced a trap composed of 5 places in 230 ms
[2020-06-04 23:09:43] [INFO ] Deduced a trap composed of 8 places in 261 ms
[2020-06-04 23:09:43] [INFO ] Deduced a trap composed of 3 places in 322 ms
[2020-06-04 23:09:44] [INFO ] Deduced a trap composed of 5 places in 305 ms
[2020-06-04 23:09:44] [INFO ] Deduced a trap composed of 9 places in 306 ms
[2020-06-04 23:09:44] [INFO ] Deduced a trap composed of 6 places in 264 ms
[2020-06-04 23:09:45] [INFO ] Deduced a trap composed of 4 places in 277 ms
[2020-06-04 23:09:45] [INFO ] Deduced a trap composed of 6 places in 257 ms
[2020-06-04 23:09:45] [INFO ] Deduced a trap composed of 6 places in 260 ms
[2020-06-04 23:09:46] [INFO ] Deduced a trap composed of 5 places in 268 ms
[2020-06-04 23:09:46] [INFO ] Deduced a trap composed of 11 places in 226 ms
[2020-06-04 23:09:46] [INFO ] Deduced a trap composed of 6 places in 237 ms
[2020-06-04 23:09:46] [INFO ] Deduced a trap composed of 6 places in 232 ms
[2020-06-04 23:09:47] [INFO ] Deduced a trap composed of 5 places in 223 ms
[2020-06-04 23:09:47] [INFO ] Deduced a trap composed of 9 places in 244 ms
[2020-06-04 23:09:47] [INFO ] Deduced a trap composed of 10 places in 218 ms
[2020-06-04 23:09:47] [INFO ] Deduced a trap composed of 8 places in 214 ms
[2020-06-04 23:09:48] [INFO ] Deduced a trap composed of 9 places in 225 ms
[2020-06-04 23:09:48] [INFO ] Deduced a trap composed of 4 places in 196 ms
[2020-06-04 23:09:48] [INFO ] Deduced a trap composed of 6 places in 214 ms
[2020-06-04 23:09:48] [INFO ] Deduced a trap composed of 6 places in 274 ms
[2020-06-04 23:09:49] [INFO ] Deduced a trap composed of 5 places in 218 ms
[2020-06-04 23:09:49] [INFO ] Deduced a trap composed of 17 places in 221 ms
[2020-06-04 23:09:49] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 8370 ms
[2020-06-04 23:09:49] [INFO ] Computed and/alt/rep : 800/2517/800 causal constraints in 84 ms.
[2020-06-04 23:10:10] [INFO ] Added : 739 causal constraints over 148 iterations in 20616 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 89 ms.
[2020-06-04 23:10:10] [INFO ] [Real]Absence check using 310 positive place invariants in 196 ms returned sat
[2020-06-04 23:10:10] [INFO ] [Real]Absence check using 310 positive and 21 generalized place invariants in 16 ms returned sat
[2020-06-04 23:10:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:10:12] [INFO ] [Real]Absence check using state equation in 2009 ms returned sat
[2020-06-04 23:10:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 23:10:13] [INFO ] [Nat]Absence check using 310 positive place invariants in 195 ms returned sat
[2020-06-04 23:10:13] [INFO ] [Nat]Absence check using 310 positive and 21 generalized place invariants in 16 ms returned sat
[2020-06-04 23:10:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 23:10:15] [INFO ] [Nat]Absence check using state equation in 1969 ms returned sat
[2020-06-04 23:10:15] [INFO ] Deduced a trap composed of 6 places in 316 ms
[2020-06-04 23:10:15] [INFO ] Deduced a trap composed of 9 places in 340 ms
[2020-06-04 23:10:16] [INFO ] Deduced a trap composed of 5 places in 363 ms
[2020-06-04 23:10:16] [INFO ] Deduced a trap composed of 9 places in 333 ms
[2020-06-04 23:10:16] [INFO ] Deduced a trap composed of 5 places in 259 ms
[2020-06-04 23:10:17] [INFO ] Deduced a trap composed of 5 places in 250 ms
[2020-06-04 23:10:17] [INFO ] Deduced a trap composed of 6 places in 244 ms
[2020-06-04 23:10:17] [INFO ] Deduced a trap composed of 5 places in 233 ms
[2020-06-04 23:10:18] [INFO ] Deduced a trap composed of 4 places in 193 ms
[2020-06-04 23:10:18] [INFO ] Deduced a trap composed of 3 places in 194 ms
[2020-06-04 23:10:18] [INFO ] Deduced a trap composed of 6 places in 188 ms
[2020-06-04 23:10:18] [INFO ] Deduced a trap composed of 6 places in 255 ms
[2020-06-04 23:10:19] [INFO ] Deduced a trap composed of 6 places in 174 ms
[2020-06-04 23:10:19] [INFO ] Deduced a trap composed of 5 places in 184 ms
[2020-06-04 23:10:19] [INFO ] Deduced a trap composed of 6 places in 243 ms
[2020-06-04 23:10:19] [INFO ] Deduced a trap composed of 14 places in 220 ms
[2020-06-04 23:10:20] [INFO ] Deduced a trap composed of 6 places in 252 ms
[2020-06-04 23:10:20] [INFO ] Deduced a trap composed of 6 places in 261 ms
[2020-06-04 23:10:20] [INFO ] Deduced a trap composed of 6 places in 288 ms
[2020-06-04 23:10:20] [INFO ] Deduced a trap composed of 6 places in 262 ms
[2020-06-04 23:10:21] [INFO ] Deduced a trap composed of 4 places in 286 ms
[2020-06-04 23:10:21] [INFO ] Deduced a trap composed of 7 places in 306 ms
[2020-06-04 23:10:21] [INFO ] Deduced a trap composed of 6 places in 268 ms
[2020-06-04 23:10:22] [INFO ] Deduced a trap composed of 5 places in 261 ms
[2020-06-04 23:10:22] [INFO ] Deduced a trap composed of 6 places in 223 ms
[2020-06-04 23:10:22] [INFO ] Deduced a trap composed of 4 places in 252 ms
[2020-06-04 23:10:23] [INFO ] Deduced a trap composed of 7 places in 223 ms
[2020-06-04 23:10:23] [INFO ] Deduced a trap composed of 8 places in 234 ms
[2020-06-04 23:10:23] [INFO ] Deduced a trap composed of 6 places in 215 ms
[2020-06-04 23:10:23] [INFO ] Deduced a trap composed of 4 places in 209 ms
[2020-06-04 23:10:24] [INFO ] Deduced a trap composed of 9 places in 255 ms
[2020-06-04 23:10:24] [INFO ] Deduced a trap composed of 6 places in 199 ms
[2020-06-04 23:10:24] [INFO ] Deduced a trap composed of 6 places in 235 ms
[2020-06-04 23:10:24] [INFO ] Deduced a trap composed of 5 places in 202 ms
[2020-06-04 23:10:25] [INFO ] Deduced a trap composed of 5 places in 233 ms
[2020-06-04 23:10:25] [INFO ] Deduced a trap composed of 9 places in 218 ms
[2020-06-04 23:10:25] [INFO ] Deduced a trap composed of 4 places in 223 ms
[2020-06-04 23:10:25] [INFO ] Deduced a trap composed of 7 places in 214 ms
[2020-06-04 23:10:26] [INFO ] Deduced a trap composed of 5 places in 138 ms
[2020-06-04 23:10:26] [INFO ] Deduced a trap composed of 4 places in 153 ms
[2020-06-04 23:10:26] [INFO ] Deduced a trap composed of 4 places in 145 ms
[2020-06-04 23:10:26] [INFO ] Deduced a trap composed of 8 places in 148 ms
[2020-06-04 23:10:26] [INFO ] Deduced a trap composed of 9 places in 148 ms
[2020-06-04 23:10:27] [INFO ] Deduced a trap composed of 8 places in 150 ms
[2020-06-04 23:10:27] [INFO ] Deduced a trap composed of 6 places in 115 ms
[2020-06-04 23:10:27] [INFO ] Deduced a trap composed of 6 places in 141 ms
[2020-06-04 23:10:27] [INFO ] Deduced a trap composed of 6 places in 118 ms
[2020-06-04 23:10:27] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-06-04 23:10:27] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 12551 ms
[2020-06-04 23:10:27] [INFO ] Computed and/alt/rep : 800/2517/800 causal constraints in 60 ms.
[2020-06-04 23:10:48] [INFO ] Added : 731 causal constraints over 149 iterations in 20428 ms.(timeout) Result :sat
[2020-06-04 23:10:48] [INFO ] Deduced a trap composed of 23 places in 214 ms
[2020-06-04 23:10:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 388 ms
Attempting to minimize the solution found.
Minimization took 96 ms.
[2020-06-04 23:10:49] [INFO ] [Real]Absence check using 310 positive place invariants in 206 ms returned sat
[2020-06-04 23:10:49] [INFO ] [Real]Absence check using 310 positive and 21 generalized place invariants in 17 ms returned sat
[2020-06-04 23:10:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:10:50] [INFO ] [Real]Absence check using state equation in 1661 ms returned sat
[2020-06-04 23:10:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 23:10:51] [INFO ] [Nat]Absence check using 310 positive place invariants in 136 ms returned sat
[2020-06-04 23:10:51] [INFO ] [Nat]Absence check using 310 positive and 21 generalized place invariants in 12 ms returned sat
[2020-06-04 23:10:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 23:10:52] [INFO ] [Nat]Absence check using state equation in 1548 ms returned sat
[2020-06-04 23:10:53] [INFO ] Deduced a trap composed of 6 places in 403 ms
[2020-06-04 23:10:53] [INFO ] Deduced a trap composed of 4 places in 294 ms
[2020-06-04 23:10:53] [INFO ] Deduced a trap composed of 6 places in 346 ms
[2020-06-04 23:10:54] [INFO ] Deduced a trap composed of 5 places in 231 ms
[2020-06-04 23:10:54] [INFO ] Deduced a trap composed of 6 places in 277 ms
[2020-06-04 23:10:54] [INFO ] Deduced a trap composed of 6 places in 276 ms
[2020-06-04 23:10:54] [INFO ] Deduced a trap composed of 5 places in 251 ms
[2020-06-04 23:10:55] [INFO ] Deduced a trap composed of 6 places in 240 ms
[2020-06-04 23:10:55] [INFO ] Deduced a trap composed of 5 places in 283 ms
[2020-06-04 23:10:55] [INFO ] Deduced a trap composed of 4 places in 226 ms
[2020-06-04 23:10:56] [INFO ] Deduced a trap composed of 5 places in 327 ms
[2020-06-04 23:10:56] [INFO ] Deduced a trap composed of 9 places in 295 ms
[2020-06-04 23:10:56] [INFO ] Deduced a trap composed of 7 places in 248 ms
[2020-06-04 23:10:57] [INFO ] Deduced a trap composed of 4 places in 259 ms
[2020-06-04 23:10:57] [INFO ] Deduced a trap composed of 6 places in 207 ms
[2020-06-04 23:10:57] [INFO ] Deduced a trap composed of 3 places in 212 ms
[2020-06-04 23:10:57] [INFO ] Deduced a trap composed of 5 places in 199 ms
[2020-06-04 23:10:57] [INFO ] Deduced a trap composed of 6 places in 209 ms
[2020-06-04 23:10:58] [INFO ] Deduced a trap composed of 6 places in 202 ms
[2020-06-04 23:10:58] [INFO ] Deduced a trap composed of 4 places in 197 ms
[2020-06-04 23:10:58] [INFO ] Deduced a trap composed of 6 places in 198 ms
[2020-06-04 23:10:58] [INFO ] Deduced a trap composed of 6 places in 287 ms
[2020-06-04 23:10:59] [INFO ] Deduced a trap composed of 9 places in 260 ms
[2020-06-04 23:10:59] [INFO ] Deduced a trap composed of 8 places in 272 ms
[2020-06-04 23:10:59] [INFO ] Deduced a trap composed of 6 places in 276 ms
[2020-06-04 23:11:00] [INFO ] Deduced a trap composed of 4 places in 249 ms
[2020-06-04 23:11:00] [INFO ] Deduced a trap composed of 4 places in 254 ms
[2020-06-04 23:11:00] [INFO ] Deduced a trap composed of 6 places in 253 ms
[2020-06-04 23:11:01] [INFO ] Deduced a trap composed of 6 places in 276 ms
[2020-06-04 23:11:01] [INFO ] Deduced a trap composed of 4 places in 287 ms
[2020-06-04 23:11:01] [INFO ] Deduced a trap composed of 6 places in 278 ms
[2020-06-04 23:11:01] [INFO ] Deduced a trap composed of 6 places in 265 ms
[2020-06-04 23:11:02] [INFO ] Deduced a trap composed of 6 places in 275 ms
[2020-06-04 23:11:02] [INFO ] Deduced a trap composed of 8 places in 242 ms
[2020-06-04 23:11:02] [INFO ] Deduced a trap composed of 6 places in 251 ms
[2020-06-04 23:11:03] [INFO ] Deduced a trap composed of 6 places in 210 ms
[2020-06-04 23:11:03] [INFO ] Deduced a trap composed of 4 places in 192 ms
[2020-06-04 23:11:03] [INFO ] Deduced a trap composed of 6 places in 211 ms
[2020-06-04 23:11:03] [INFO ] Deduced a trap composed of 6 places in 215 ms
[2020-06-04 23:11:04] [INFO ] Deduced a trap composed of 7 places in 294 ms
[2020-06-04 23:11:04] [INFO ] Deduced a trap composed of 6 places in 244 ms
[2020-06-04 23:11:04] [INFO ] Deduced a trap composed of 10 places in 243 ms
[2020-06-04 23:11:05] [INFO ] Deduced a trap composed of 7 places in 245 ms
[2020-06-04 23:11:05] [INFO ] Deduced a trap composed of 6 places in 251 ms
[2020-06-04 23:11:05] [INFO ] Deduced a trap composed of 6 places in 230 ms
[2020-06-04 23:11:05] [INFO ] Deduced a trap composed of 6 places in 236 ms
[2020-06-04 23:11:06] [INFO ] Deduced a trap composed of 4 places in 191 ms
[2020-06-04 23:11:06] [INFO ] Deduced a trap composed of 8 places in 178 ms
[2020-06-04 23:11:06] [INFO ] Deduced a trap composed of 6 places in 259 ms
[2020-06-04 23:11:06] [INFO ] Deduced a trap composed of 6 places in 233 ms
[2020-06-04 23:11:07] [INFO ] Deduced a trap composed of 8 places in 235 ms
[2020-06-04 23:11:07] [INFO ] Deduced a trap composed of 9 places in 233 ms
[2020-06-04 23:11:07] [INFO ] Deduced a trap composed of 8 places in 237 ms
[2020-06-04 23:11:07] [INFO ] Deduced a trap composed of 7 places in 240 ms
[2020-06-04 23:11:08] [INFO ] Deduced a trap composed of 20 places in 245 ms
[2020-06-04 23:11:08] [INFO ] Deduced a trap composed of 24 places in 213 ms
[2020-06-04 23:11:08] [INFO ] Deduced a trap composed of 9 places in 151 ms
[2020-06-04 23:11:08] [INFO ] Deduced a trap composed of 6 places in 121 ms
[2020-06-04 23:11:08] [INFO ] Deduced a trap composed of 11 places in 125 ms
[2020-06-04 23:11:09] [INFO ] Deduced a trap composed of 5 places in 120 ms
[2020-06-04 23:11:09] [INFO ] Deduced a trap composed of 5 places in 155 ms
[2020-06-04 23:11:09] [INFO ] Deduced a trap composed of 6 places in 121 ms
[2020-06-04 23:11:09] [INFO ] Deduced a trap composed of 18 places in 113 ms
[2020-06-04 23:11:09] [INFO ] Deduced a trap composed of 7 places in 179 ms
[2020-06-04 23:11:09] [INFO ] Deduced a trap composed of 7 places in 144 ms
[2020-06-04 23:11:10] [INFO ] Deduced a trap composed of 12 places in 204 ms
[2020-06-04 23:11:10] [INFO ] Trap strengthening (SAT) tested/added 67/66 trap constraints in 17572 ms
[2020-06-04 23:11:10] [INFO ] Computed and/alt/rep : 800/2517/800 causal constraints in 77 ms.
[2020-06-04 23:11:35] [INFO ] Added : 745 causal constraints over 149 iterations in 25024 ms.(timeout) Result :unknown
Incomplete Parikh walk after 67600 steps, including 685 resets, run finished after 359 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 36500 steps, including 322 resets, run finished after 175 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 67400 steps, including 720 resets, run finished after 336 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 18 out of 966 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 966/966 places, 816/816 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 966 transition count 815
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 965 transition count 815
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 965 transition count 813
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 963 transition count 813
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 955 transition count 805
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 955 transition count 805
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 955 transition count 805
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 954 transition count 804
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 953 transition count 803
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 952 transition count 802
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 951 transition count 801
Applied a total of 33 rules in 406 ms. Remains 951 /966 variables (removed 15) and now considering 801/816 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 951/966 places, 801/816 transitions.
Incomplete random walk after 1000000 steps, including 1 resets, run finished after 5787 ms. (steps per millisecond=172 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3727 ms. (steps per millisecond=268 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 3702 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 3890 ms. (steps per millisecond=257 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 2624715 steps, run timeout after 30001 ms. (steps per millisecond=87 ) properties seen :[0, 0, 0]
Probabilistic random walk after 2624715 steps, saw 243825 distinct states, run finished after 30001 ms. (steps per millisecond=87 ) properties seen :[0, 0, 0]
// Phase 1: matrix 801 rows 951 cols
[2020-06-04 23:12:23] [INFO ] Computed 331 place invariants in 41 ms
[2020-06-04 23:12:23] [INFO ] [Real]Absence check using 315 positive place invariants in 145 ms returned sat
[2020-06-04 23:12:24] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 7 ms returned sat
[2020-06-04 23:12:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:12:25] [INFO ] [Real]Absence check using state equation in 1566 ms returned sat
[2020-06-04 23:12:26] [INFO ] Deduced a trap composed of 6 places in 363 ms
[2020-06-04 23:12:26] [INFO ] Deduced a trap composed of 4 places in 323 ms
[2020-06-04 23:12:26] [INFO ] Deduced a trap composed of 6 places in 349 ms
[2020-06-04 23:12:27] [INFO ] Deduced a trap composed of 4 places in 329 ms
[2020-06-04 23:12:27] [INFO ] Deduced a trap composed of 7 places in 325 ms
[2020-06-04 23:12:27] [INFO ] Deduced a trap composed of 7 places in 326 ms
[2020-06-04 23:12:28] [INFO ] Deduced a trap composed of 5 places in 279 ms
[2020-06-04 23:12:28] [INFO ] Deduced a trap composed of 5 places in 288 ms
[2020-06-04 23:12:28] [INFO ] Deduced a trap composed of 6 places in 255 ms
[2020-06-04 23:12:29] [INFO ] Deduced a trap composed of 5 places in 267 ms
[2020-06-04 23:12:29] [INFO ] Deduced a trap composed of 6 places in 282 ms
[2020-06-04 23:12:29] [INFO ] Deduced a trap composed of 6 places in 246 ms
[2020-06-04 23:12:30] [INFO ] Deduced a trap composed of 13 places in 262 ms
[2020-06-04 23:12:30] [INFO ] Deduced a trap composed of 9 places in 246 ms
[2020-06-04 23:12:30] [INFO ] Deduced a trap composed of 6 places in 245 ms
[2020-06-04 23:12:30] [INFO ] Deduced a trap composed of 6 places in 244 ms
[2020-06-04 23:12:31] [INFO ] Deduced a trap composed of 6 places in 285 ms
[2020-06-04 23:12:31] [INFO ] Deduced a trap composed of 6 places in 295 ms
[2020-06-04 23:12:31] [INFO ] Deduced a trap composed of 5 places in 270 ms
[2020-06-04 23:12:32] [INFO ] Deduced a trap composed of 20 places in 263 ms
[2020-06-04 23:12:32] [INFO ] Deduced a trap composed of 6 places in 264 ms
[2020-06-04 23:12:32] [INFO ] Deduced a trap composed of 9 places in 235 ms
[2020-06-04 23:12:33] [INFO ] Deduced a trap composed of 6 places in 246 ms
[2020-06-04 23:12:33] [INFO ] Deduced a trap composed of 8 places in 250 ms
[2020-06-04 23:12:33] [INFO ] Deduced a trap composed of 9 places in 238 ms
[2020-06-04 23:12:33] [INFO ] Deduced a trap composed of 9 places in 226 ms
[2020-06-04 23:12:34] [INFO ] Deduced a trap composed of 6 places in 222 ms
[2020-06-04 23:12:34] [INFO ] Deduced a trap composed of 11 places in 225 ms
[2020-06-04 23:12:34] [INFO ] Deduced a trap composed of 9 places in 248 ms
[2020-06-04 23:12:34] [INFO ] Deduced a trap composed of 19 places in 234 ms
[2020-06-04 23:12:35] [INFO ] Deduced a trap composed of 11 places in 242 ms
[2020-06-04 23:12:35] [INFO ] Deduced a trap composed of 11 places in 227 ms
[2020-06-04 23:12:35] [INFO ] Deduced a trap composed of 14 places in 230 ms
[2020-06-04 23:12:36] [INFO ] Deduced a trap composed of 9 places in 216 ms
[2020-06-04 23:12:36] [INFO ] Deduced a trap composed of 6 places in 228 ms
[2020-06-04 23:12:36] [INFO ] Deduced a trap composed of 23 places in 191 ms
[2020-06-04 23:12:36] [INFO ] Deduced a trap composed of 6 places in 193 ms
[2020-06-04 23:12:37] [INFO ] Deduced a trap composed of 15 places in 217 ms
[2020-06-04 23:12:37] [INFO ] Deduced a trap composed of 11 places in 186 ms
[2020-06-04 23:12:37] [INFO ] Deduced a trap composed of 9 places in 217 ms
[2020-06-04 23:12:37] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 11930 ms
[2020-06-04 23:12:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 23:12:37] [INFO ] [Nat]Absence check using 315 positive place invariants in 188 ms returned sat
[2020-06-04 23:12:37] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 10 ms returned sat
[2020-06-04 23:12:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 23:12:39] [INFO ] [Nat]Absence check using state equation in 1636 ms returned sat
[2020-06-04 23:12:39] [INFO ] Deduced a trap composed of 6 places in 331 ms
[2020-06-04 23:12:40] [INFO ] Deduced a trap composed of 6 places in 293 ms
[2020-06-04 23:12:40] [INFO ] Deduced a trap composed of 6 places in 268 ms
[2020-06-04 23:12:40] [INFO ] Deduced a trap composed of 4 places in 242 ms
[2020-06-04 23:12:41] [INFO ] Deduced a trap composed of 6 places in 250 ms
[2020-06-04 23:12:41] [INFO ] Deduced a trap composed of 6 places in 221 ms
[2020-06-04 23:12:41] [INFO ] Deduced a trap composed of 6 places in 246 ms
[2020-06-04 23:12:41] [INFO ] Deduced a trap composed of 5 places in 253 ms
[2020-06-04 23:12:42] [INFO ] Deduced a trap composed of 6 places in 260 ms
[2020-06-04 23:12:42] [INFO ] Deduced a trap composed of 5 places in 262 ms
[2020-06-04 23:12:42] [INFO ] Deduced a trap composed of 4 places in 262 ms
[2020-06-04 23:12:43] [INFO ] Deduced a trap composed of 6 places in 262 ms
[2020-06-04 23:12:43] [INFO ] Deduced a trap composed of 7 places in 263 ms
[2020-06-04 23:12:43] [INFO ] Deduced a trap composed of 4 places in 267 ms
[2020-06-04 23:12:43] [INFO ] Deduced a trap composed of 5 places in 268 ms
[2020-06-04 23:12:44] [INFO ] Deduced a trap composed of 4 places in 291 ms
[2020-06-04 23:12:44] [INFO ] Deduced a trap composed of 4 places in 288 ms
[2020-06-04 23:12:44] [INFO ] Deduced a trap composed of 5 places in 273 ms
[2020-06-04 23:12:45] [INFO ] Deduced a trap composed of 6 places in 244 ms
[2020-06-04 23:12:45] [INFO ] Deduced a trap composed of 4 places in 243 ms
[2020-06-04 23:12:45] [INFO ] Deduced a trap composed of 6 places in 267 ms
[2020-06-04 23:12:46] [INFO ] Deduced a trap composed of 6 places in 247 ms
[2020-06-04 23:12:46] [INFO ] Deduced a trap composed of 6 places in 272 ms
[2020-06-04 23:12:46] [INFO ] Deduced a trap composed of 8 places in 247 ms
[2020-06-04 23:12:46] [INFO ] Deduced a trap composed of 6 places in 295 ms
[2020-06-04 23:12:47] [INFO ] Deduced a trap composed of 5 places in 246 ms
[2020-06-04 23:12:47] [INFO ] Deduced a trap composed of 6 places in 251 ms
[2020-06-04 23:12:47] [INFO ] Deduced a trap composed of 4 places in 248 ms
[2020-06-04 23:12:48] [INFO ] Deduced a trap composed of 9 places in 234 ms
[2020-06-04 23:12:48] [INFO ] Deduced a trap composed of 6 places in 238 ms
[2020-06-04 23:12:48] [INFO ] Deduced a trap composed of 12 places in 235 ms
[2020-06-04 23:12:48] [INFO ] Deduced a trap composed of 6 places in 223 ms
[2020-06-04 23:12:49] [INFO ] Deduced a trap composed of 6 places in 221 ms
[2020-06-04 23:12:49] [INFO ] Deduced a trap composed of 4 places in 232 ms
[2020-06-04 23:12:49] [INFO ] Deduced a trap composed of 14 places in 288 ms
[2020-06-04 23:12:49] [INFO ] Deduced a trap composed of 5 places in 269 ms
[2020-06-04 23:12:50] [INFO ] Deduced a trap composed of 6 places in 220 ms
[2020-06-04 23:12:50] [INFO ] Deduced a trap composed of 6 places in 221 ms
[2020-06-04 23:12:50] [INFO ] Deduced a trap composed of 12 places in 301 ms
[2020-06-04 23:12:51] [INFO ] Deduced a trap composed of 4 places in 257 ms
[2020-06-04 23:12:51] [INFO ] Deduced a trap composed of 6 places in 242 ms
[2020-06-04 23:12:51] [INFO ] Deduced a trap composed of 7 places in 281 ms
[2020-06-04 23:12:51] [INFO ] Deduced a trap composed of 6 places in 194 ms
[2020-06-04 23:12:52] [INFO ] Deduced a trap composed of 6 places in 196 ms
[2020-06-04 23:12:52] [INFO ] Deduced a trap composed of 5 places in 263 ms
[2020-06-04 23:12:52] [INFO ] Deduced a trap composed of 8 places in 204 ms
[2020-06-04 23:12:52] [INFO ] Deduced a trap composed of 6 places in 193 ms
[2020-06-04 23:12:53] [INFO ] Deduced a trap composed of 6 places in 204 ms
[2020-06-04 23:12:53] [INFO ] Deduced a trap composed of 6 places in 217 ms
[2020-06-04 23:12:53] [INFO ] Deduced a trap composed of 6 places in 249 ms
[2020-06-04 23:12:54] [INFO ] Deduced a trap composed of 6 places in 248 ms
[2020-06-04 23:12:54] [INFO ] Deduced a trap composed of 12 places in 234 ms
[2020-06-04 23:12:54] [INFO ] Deduced a trap composed of 8 places in 296 ms
[2020-06-04 23:12:54] [INFO ] Deduced a trap composed of 5 places in 295 ms
[2020-06-04 23:12:55] [INFO ] Deduced a trap composed of 6 places in 284 ms
[2020-06-04 23:12:55] [INFO ] Deduced a trap composed of 8 places in 295 ms
[2020-06-04 23:12:55] [INFO ] Deduced a trap composed of 4 places in 274 ms
[2020-06-04 23:12:56] [INFO ] Deduced a trap composed of 7 places in 275 ms
[2020-06-04 23:12:56] [INFO ] Deduced a trap composed of 6 places in 289 ms
[2020-06-04 23:12:56] [INFO ] Deduced a trap composed of 6 places in 291 ms
[2020-06-04 23:12:57] [INFO ] Deduced a trap composed of 12 places in 319 ms
[2020-06-04 23:12:57] [INFO ] Deduced a trap composed of 14 places in 294 ms
[2020-06-04 23:12:57] [INFO ] Deduced a trap composed of 12 places in 273 ms
[2020-06-04 23:12:58] [INFO ] Deduced a trap composed of 6 places in 300 ms
[2020-06-04 23:12:58] [INFO ] Trap strengthening (SAT) tested/added 65/64 trap constraints in 18800 ms
[2020-06-04 23:12:58] [INFO ] Computed and/alt/rep : 791/2505/791 causal constraints in 50 ms.
[2020-06-04 23:13:20] [INFO ] Added : 717 causal constraints over 147 iterations in 21676 ms. Result :unknown
[2020-06-04 23:13:20] [INFO ] [Real]Absence check using 315 positive place invariants in 220 ms returned sat
[2020-06-04 23:13:20] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 11 ms returned sat
[2020-06-04 23:13:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:13:21] [INFO ] [Real]Absence check using state equation in 1591 ms returned sat
[2020-06-04 23:13:22] [INFO ] Deduced a trap composed of 4 places in 326 ms
[2020-06-04 23:13:22] [INFO ] Deduced a trap composed of 6 places in 327 ms
[2020-06-04 23:13:23] [INFO ] Deduced a trap composed of 5 places in 303 ms
[2020-06-04 23:13:23] [INFO ] Deduced a trap composed of 6 places in 287 ms
[2020-06-04 23:13:23] [INFO ] Deduced a trap composed of 5 places in 269 ms
[2020-06-04 23:13:24] [INFO ] Deduced a trap composed of 4 places in 259 ms
[2020-06-04 23:13:24] [INFO ] Deduced a trap composed of 6 places in 281 ms
[2020-06-04 23:13:24] [INFO ] Deduced a trap composed of 6 places in 257 ms
[2020-06-04 23:13:24] [INFO ] Deduced a trap composed of 5 places in 248 ms
[2020-06-04 23:13:25] [INFO ] Deduced a trap composed of 19 places in 245 ms
[2020-06-04 23:13:25] [INFO ] Deduced a trap composed of 8 places in 254 ms
[2020-06-04 23:13:25] [INFO ] Deduced a trap composed of 11 places in 276 ms
[2020-06-04 23:13:26] [INFO ] Deduced a trap composed of 6 places in 243 ms
[2020-06-04 23:13:26] [INFO ] Deduced a trap composed of 6 places in 253 ms
[2020-06-04 23:13:26] [INFO ] Deduced a trap composed of 6 places in 260 ms
[2020-06-04 23:13:26] [INFO ] Deduced a trap composed of 9 places in 233 ms
[2020-06-04 23:13:27] [INFO ] Deduced a trap composed of 11 places in 252 ms
[2020-06-04 23:13:27] [INFO ] Deduced a trap composed of 6 places in 214 ms
[2020-06-04 23:13:27] [INFO ] Deduced a trap composed of 5 places in 203 ms
[2020-06-04 23:13:27] [INFO ] Deduced a trap composed of 6 places in 223 ms
[2020-06-04 23:13:28] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6025 ms
[2020-06-04 23:13:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 23:13:28] [INFO ] [Nat]Absence check using 315 positive place invariants in 190 ms returned sat
[2020-06-04 23:13:28] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 10 ms returned sat
[2020-06-04 23:13:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 23:13:30] [INFO ] [Nat]Absence check using state equation in 1666 ms returned sat
[2020-06-04 23:13:30] [INFO ] Deduced a trap composed of 6 places in 343 ms
[2020-06-04 23:13:30] [INFO ] Deduced a trap composed of 4 places in 326 ms
[2020-06-04 23:13:31] [INFO ] Deduced a trap composed of 6 places in 318 ms
[2020-06-04 23:13:31] [INFO ] Deduced a trap composed of 11 places in 322 ms
[2020-06-04 23:13:31] [INFO ] Deduced a trap composed of 11 places in 325 ms
[2020-06-04 23:13:32] [INFO ] Deduced a trap composed of 4 places in 261 ms
[2020-06-04 23:13:32] [INFO ] Deduced a trap composed of 5 places in 221 ms
[2020-06-04 23:13:32] [INFO ] Deduced a trap composed of 6 places in 225 ms
[2020-06-04 23:13:32] [INFO ] Deduced a trap composed of 4 places in 210 ms
[2020-06-04 23:13:33] [INFO ] Deduced a trap composed of 4 places in 213 ms
[2020-06-04 23:13:33] [INFO ] Deduced a trap composed of 6 places in 225 ms
[2020-06-04 23:13:33] [INFO ] Deduced a trap composed of 5 places in 214 ms
[2020-06-04 23:13:33] [INFO ] Deduced a trap composed of 5 places in 221 ms
[2020-06-04 23:13:34] [INFO ] Deduced a trap composed of 6 places in 218 ms
[2020-06-04 23:13:34] [INFO ] Deduced a trap composed of 6 places in 231 ms
[2020-06-04 23:13:34] [INFO ] Deduced a trap composed of 5 places in 224 ms
[2020-06-04 23:13:34] [INFO ] Deduced a trap composed of 5 places in 203 ms
[2020-06-04 23:13:35] [INFO ] Deduced a trap composed of 6 places in 202 ms
[2020-06-04 23:13:35] [INFO ] Deduced a trap composed of 4 places in 221 ms
[2020-06-04 23:13:35] [INFO ] Deduced a trap composed of 5 places in 324 ms
[2020-06-04 23:13:36] [INFO ] Deduced a trap composed of 9 places in 283 ms
[2020-06-04 23:13:36] [INFO ] Deduced a trap composed of 6 places in 286 ms
[2020-06-04 23:13:36] [INFO ] Deduced a trap composed of 5 places in 257 ms
[2020-06-04 23:13:36] [INFO ] Deduced a trap composed of 5 places in 241 ms
[2020-06-04 23:13:37] [INFO ] Deduced a trap composed of 6 places in 257 ms
[2020-06-04 23:13:37] [INFO ] Deduced a trap composed of 4 places in 277 ms
[2020-06-04 23:13:37] [INFO ] Deduced a trap composed of 10 places in 251 ms
[2020-06-04 23:13:38] [INFO ] Deduced a trap composed of 6 places in 243 ms
[2020-06-04 23:13:38] [INFO ] Deduced a trap composed of 8 places in 253 ms
[2020-06-04 23:13:38] [INFO ] Deduced a trap composed of 7 places in 281 ms
[2020-06-04 23:13:38] [INFO ] Deduced a trap composed of 13 places in 284 ms
[2020-06-04 23:13:39] [INFO ] Deduced a trap composed of 11 places in 198 ms
[2020-06-04 23:13:39] [INFO ] Deduced a trap composed of 6 places in 203 ms
[2020-06-04 23:13:39] [INFO ] Deduced a trap composed of 8 places in 227 ms
[2020-06-04 23:13:39] [INFO ] Deduced a trap composed of 4 places in 230 ms
[2020-06-04 23:13:40] [INFO ] Deduced a trap composed of 6 places in 189 ms
[2020-06-04 23:13:40] [INFO ] Deduced a trap composed of 6 places in 208 ms
[2020-06-04 23:13:40] [INFO ] Deduced a trap composed of 6 places in 180 ms
[2020-06-04 23:13:40] [INFO ] Deduced a trap composed of 4 places in 174 ms
[2020-06-04 23:13:41] [INFO ] Deduced a trap composed of 6 places in 172 ms
[2020-06-04 23:13:41] [INFO ] Deduced a trap composed of 9 places in 202 ms
[2020-06-04 23:13:41] [INFO ] Deduced a trap composed of 8 places in 211 ms
[2020-06-04 23:13:41] [INFO ] Deduced a trap composed of 8 places in 150 ms
[2020-06-04 23:13:41] [INFO ] Deduced a trap composed of 6 places in 150 ms
[2020-06-04 23:13:42] [INFO ] Deduced a trap composed of 9 places in 155 ms
[2020-06-04 23:13:42] [INFO ] Deduced a trap composed of 9 places in 242 ms
[2020-06-04 23:13:42] [INFO ] Deduced a trap composed of 8 places in 190 ms
[2020-06-04 23:13:42] [INFO ] Deduced a trap composed of 9 places in 196 ms
[2020-06-04 23:13:43] [INFO ] Deduced a trap composed of 11 places in 186 ms
[2020-06-04 23:13:43] [INFO ] Deduced a trap composed of 8 places in 202 ms
[2020-06-04 23:13:43] [INFO ] Deduced a trap composed of 8 places in 202 ms
[2020-06-04 23:13:43] [INFO ] Deduced a trap composed of 6 places in 211 ms
[2020-06-04 23:13:44] [INFO ] Deduced a trap composed of 14 places in 225 ms
[2020-06-04 23:13:44] [INFO ] Deduced a trap composed of 9 places in 197 ms
[2020-06-04 23:13:44] [INFO ] Deduced a trap composed of 9 places in 224 ms
[2020-06-04 23:13:44] [INFO ] Deduced a trap composed of 18 places in 216 ms
[2020-06-04 23:13:45] [INFO ] Deduced a trap composed of 5 places in 244 ms
[2020-06-04 23:13:45] [INFO ] Deduced a trap composed of 13 places in 212 ms
[2020-06-04 23:13:45] [INFO ] Deduced a trap composed of 10 places in 204 ms
[2020-06-04 23:13:45] [INFO ] Deduced a trap composed of 7 places in 202 ms
[2020-06-04 23:13:45] [INFO ] Deduced a trap composed of 4 places in 187 ms
[2020-06-04 23:13:46] [INFO ] Deduced a trap composed of 6 places in 192 ms
[2020-06-04 23:13:46] [INFO ] Deduced a trap composed of 8 places in 188 ms
[2020-06-04 23:13:46] [INFO ] Deduced a trap composed of 8 places in 189 ms
[2020-06-04 23:13:46] [INFO ] Trap strengthening (SAT) tested/added 65/64 trap constraints in 16541 ms
[2020-06-04 23:13:46] [INFO ] Computed and/alt/rep : 791/2505/791 causal constraints in 52 ms.
[2020-06-04 23:14:11] [INFO ] Added : 715 causal constraints over 145 iterations in 25072 ms.(timeout) Result :unknown
[2020-06-04 23:14:12] [INFO ] [Real]Absence check using 315 positive place invariants in 195 ms returned sat
[2020-06-04 23:14:12] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 10 ms returned sat
[2020-06-04 23:14:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:14:13] [INFO ] [Real]Absence check using state equation in 1616 ms returned sat
[2020-06-04 23:14:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 23:14:14] [INFO ] [Nat]Absence check using 315 positive place invariants in 239 ms returned sat
[2020-06-04 23:14:14] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 11 ms returned sat
[2020-06-04 23:14:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 23:14:16] [INFO ] [Nat]Absence check using state equation in 1841 ms returned sat
[2020-06-04 23:14:16] [INFO ] Deduced a trap composed of 4 places in 327 ms
[2020-06-04 23:14:16] [INFO ] Deduced a trap composed of 5 places in 313 ms
[2020-06-04 23:14:17] [INFO ] Deduced a trap composed of 6 places in 307 ms
[2020-06-04 23:14:17] [INFO ] Deduced a trap composed of 7 places in 333 ms
[2020-06-04 23:14:17] [INFO ] Deduced a trap composed of 4 places in 337 ms
[2020-06-04 23:14:18] [INFO ] Deduced a trap composed of 4 places in 332 ms
[2020-06-04 23:14:18] [INFO ] Deduced a trap composed of 4 places in 313 ms
[2020-06-04 23:14:18] [INFO ] Deduced a trap composed of 5 places in 299 ms
[2020-06-04 23:14:19] [INFO ] Deduced a trap composed of 4 places in 291 ms
[2020-06-04 23:14:19] [INFO ] Deduced a trap composed of 4 places in 278 ms
[2020-06-04 23:14:19] [INFO ] Deduced a trap composed of 5 places in 267 ms
[2020-06-04 23:14:20] [INFO ] Deduced a trap composed of 9 places in 270 ms
[2020-06-04 23:14:20] [INFO ] Deduced a trap composed of 6 places in 266 ms
[2020-06-04 23:14:20] [INFO ] Deduced a trap composed of 6 places in 290 ms
[2020-06-04 23:14:20] [INFO ] Deduced a trap composed of 8 places in 213 ms
[2020-06-04 23:14:21] [INFO ] Deduced a trap composed of 9 places in 209 ms
[2020-06-04 23:14:21] [INFO ] Deduced a trap composed of 4 places in 218 ms
[2020-06-04 23:14:21] [INFO ] Deduced a trap composed of 6 places in 324 ms
[2020-06-04 23:14:22] [INFO ] Deduced a trap composed of 4 places in 298 ms
[2020-06-04 23:14:22] [INFO ] Deduced a trap composed of 6 places in 293 ms
[2020-06-04 23:14:22] [INFO ] Deduced a trap composed of 5 places in 302 ms
[2020-06-04 23:14:23] [INFO ] Deduced a trap composed of 4 places in 350 ms
[2020-06-04 23:14:23] [INFO ] Deduced a trap composed of 4 places in 316 ms
[2020-06-04 23:14:23] [INFO ] Deduced a trap composed of 8 places in 353 ms
[2020-06-04 23:14:24] [INFO ] Deduced a trap composed of 4 places in 302 ms
[2020-06-04 23:14:24] [INFO ] Deduced a trap composed of 9 places in 293 ms
[2020-06-04 23:14:24] [INFO ] Deduced a trap composed of 5 places in 323 ms
[2020-06-04 23:14:25] [INFO ] Deduced a trap composed of 8 places in 299 ms
[2020-06-04 23:14:25] [INFO ] Deduced a trap composed of 8 places in 298 ms
[2020-06-04 23:14:25] [INFO ] Deduced a trap composed of 23 places in 282 ms
[2020-06-04 23:14:26] [INFO ] Deduced a trap composed of 6 places in 258 ms
[2020-06-04 23:14:26] [INFO ] Deduced a trap composed of 6 places in 214 ms
[2020-06-04 23:14:26] [INFO ] Deduced a trap composed of 9 places in 219 ms
[2020-06-04 23:14:26] [INFO ] Deduced a trap composed of 12 places in 234 ms
[2020-06-04 23:14:27] [INFO ] Deduced a trap composed of 13 places in 189 ms
[2020-06-04 23:14:27] [INFO ] Deduced a trap composed of 6 places in 253 ms
[2020-06-04 23:14:27] [INFO ] Deduced a trap composed of 9 places in 218 ms
[2020-06-04 23:14:27] [INFO ] Deduced a trap composed of 10 places in 228 ms
[2020-06-04 23:14:28] [INFO ] Deduced a trap composed of 30 places in 202 ms
[2020-06-04 23:14:28] [INFO ] Deduced a trap composed of 9 places in 182 ms
[2020-06-04 23:14:28] [INFO ] Deduced a trap composed of 8 places in 233 ms
[2020-06-04 23:14:28] [INFO ] Deduced a trap composed of 10 places in 178 ms
[2020-06-04 23:14:29] [INFO ] Deduced a trap composed of 23 places in 235 ms
[2020-06-04 23:14:29] [INFO ] Deduced a trap composed of 8 places in 210 ms
[2020-06-04 23:14:29] [INFO ] Deduced a trap composed of 4 places in 214 ms
[2020-06-04 23:14:29] [INFO ] Deduced a trap composed of 8 places in 170 ms
[2020-06-04 23:14:30] [INFO ] Deduced a trap composed of 8 places in 236 ms
[2020-06-04 23:14:30] [INFO ] Deduced a trap composed of 7 places in 177 ms
[2020-06-04 23:14:30] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 14359 ms
[2020-06-04 23:14:30] [INFO ] Computed and/alt/rep : 791/2505/791 causal constraints in 54 ms.
[2020-06-04 23:14:54] [INFO ] Added : 740 causal constraints over 148 iterations in 24400 ms.(timeout) Result :unknown
Incomplete Parikh walk after 52000 steps, including 458 resets, run finished after 270 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 37400 steps, including 350 resets, run finished after 190 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 62900 steps, including 595 resets, run finished after 302 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 18 out of 951 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 951/951 places, 801/801 transitions.
Applied a total of 0 rules in 17 ms. Remains 951 /951 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 951/951 places, 801/801 transitions.
Starting structural reductions, iteration 0 : 951/951 places, 801/801 transitions.
Applied a total of 0 rules in 16 ms. Remains 951 /951 variables (removed 0) and now considering 801/801 (removed 0) transitions.
// Phase 1: matrix 801 rows 951 cols
[2020-06-04 23:14:55] [INFO ] Computed 331 place invariants in 5 ms
[2020-06-04 23:14:58] [INFO ] Implicit Places using invariants in 2475 ms returned []
// Phase 1: matrix 801 rows 951 cols
[2020-06-04 23:14:58] [INFO ] Computed 331 place invariants in 7 ms
[2020-06-04 23:15:06] [INFO ] Implicit Places using invariants and state equation in 8484 ms returned []
Implicit Place search using SMT with State Equation took 10961 ms to find 0 implicit places.
[2020-06-04 23:15:06] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 801 rows 951 cols
[2020-06-04 23:15:06] [INFO ] Computed 331 place invariants in 10 ms
[2020-06-04 23:15:08] [INFO ] Dead Transitions using invariants and state equation in 2056 ms returned []
Finished structural reductions, in 1 iterations. Remains : 951/951 places, 801/801 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 890 ms. (steps per millisecond=112 ) properties seen :[0, 0, 0]
// Phase 1: matrix 801 rows 951 cols
[2020-06-04 23:15:09] [INFO ] Computed 331 place invariants in 8 ms
[2020-06-04 23:15:10] [INFO ] [Real]Absence check using 315 positive place invariants in 270 ms returned sat
[2020-06-04 23:15:10] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 23 ms returned sat
[2020-06-04 23:15:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:15:13] [INFO ] [Real]Absence check using state equation in 3105 ms returned sat
[2020-06-04 23:15:13] [INFO ] Deduced a trap composed of 6 places in 655 ms
[2020-06-04 23:15:14] [INFO ] Deduced a trap composed of 4 places in 478 ms
[2020-06-04 23:15:14] [INFO ] Deduced a trap composed of 6 places in 463 ms
[2020-06-04 23:15:15] [INFO ] Deduced a trap composed of 4 places in 421 ms
[2020-06-04 23:15:15] [INFO ] Deduced a trap composed of 7 places in 425 ms
[2020-06-04 23:15:16] [INFO ] Deduced a trap composed of 7 places in 412 ms
[2020-06-04 23:15:16] [INFO ] Deduced a trap composed of 5 places in 248 ms
[2020-06-04 23:15:16] [INFO ] Deduced a trap composed of 5 places in 243 ms
[2020-06-04 23:15:17] [INFO ] Deduced a trap composed of 6 places in 280 ms
[2020-06-04 23:15:17] [INFO ] Deduced a trap composed of 5 places in 231 ms
[2020-06-04 23:15:17] [INFO ] Deduced a trap composed of 6 places in 227 ms
[2020-06-04 23:15:18] [INFO ] Deduced a trap composed of 6 places in 225 ms
[2020-06-04 23:15:18] [INFO ] Deduced a trap composed of 13 places in 242 ms
[2020-06-04 23:15:18] [INFO ] Deduced a trap composed of 9 places in 244 ms
[2020-06-04 23:15:18] [INFO ] Deduced a trap composed of 6 places in 199 ms
[2020-06-04 23:15:19] [INFO ] Deduced a trap composed of 6 places in 262 ms
[2020-06-04 23:15:19] [INFO ] Deduced a trap composed of 6 places in 263 ms
[2020-06-04 23:15:19] [INFO ] Deduced a trap composed of 6 places in 259 ms
[2020-06-04 23:15:20] [INFO ] Deduced a trap composed of 5 places in 259 ms
[2020-06-04 23:15:20] [INFO ] Deduced a trap composed of 20 places in 261 ms
[2020-06-04 23:15:20] [INFO ] Deduced a trap composed of 6 places in 257 ms
[2020-06-04 23:15:20] [INFO ] Deduced a trap composed of 9 places in 246 ms
[2020-06-04 23:15:21] [INFO ] Deduced a trap composed of 6 places in 244 ms
[2020-06-04 23:15:21] [INFO ] Deduced a trap composed of 8 places in 246 ms
[2020-06-04 23:15:21] [INFO ] Deduced a trap composed of 9 places in 235 ms
[2020-06-04 23:15:22] [INFO ] Deduced a trap composed of 9 places in 274 ms
[2020-06-04 23:15:22] [INFO ] Deduced a trap composed of 6 places in 253 ms
[2020-06-04 23:15:22] [INFO ] Deduced a trap composed of 11 places in 214 ms
[2020-06-04 23:15:22] [INFO ] Deduced a trap composed of 9 places in 236 ms
[2020-06-04 23:15:23] [INFO ] Deduced a trap composed of 19 places in 234 ms
[2020-06-04 23:15:23] [INFO ] Deduced a trap composed of 11 places in 216 ms
[2020-06-04 23:15:23] [INFO ] Deduced a trap composed of 11 places in 205 ms
[2020-06-04 23:15:23] [INFO ] Deduced a trap composed of 14 places in 233 ms
[2020-06-04 23:15:24] [INFO ] Deduced a trap composed of 9 places in 245 ms
[2020-06-04 23:15:24] [INFO ] Deduced a trap composed of 6 places in 219 ms
[2020-06-04 23:15:24] [INFO ] Deduced a trap composed of 23 places in 207 ms
[2020-06-04 23:15:25] [INFO ] Deduced a trap composed of 6 places in 207 ms
[2020-06-04 23:15:25] [INFO ] Deduced a trap composed of 15 places in 227 ms
[2020-06-04 23:15:25] [INFO ] Deduced a trap composed of 11 places in 203 ms
[2020-06-04 23:15:25] [INFO ] Deduced a trap composed of 9 places in 208 ms
[2020-06-04 23:15:25] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 12663 ms
[2020-06-04 23:15:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 23:15:26] [INFO ] [Nat]Absence check using 315 positive place invariants in 196 ms returned sat
[2020-06-04 23:15:26] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 11 ms returned sat
[2020-06-04 23:15:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 23:15:27] [INFO ] [Nat]Absence check using state equation in 1736 ms returned sat
[2020-06-04 23:15:28] [INFO ] Deduced a trap composed of 6 places in 316 ms
[2020-06-04 23:15:28] [INFO ] Deduced a trap composed of 6 places in 288 ms
[2020-06-04 23:15:28] [INFO ] Deduced a trap composed of 6 places in 287 ms
[2020-06-04 23:15:29] [INFO ] Deduced a trap composed of 4 places in 291 ms
[2020-06-04 23:15:29] [INFO ] Deduced a trap composed of 6 places in 325 ms
[2020-06-04 23:15:30] [INFO ] Deduced a trap composed of 6 places in 334 ms
[2020-06-04 23:15:30] [INFO ] Deduced a trap composed of 6 places in 347 ms
[2020-06-04 23:15:30] [INFO ] Deduced a trap composed of 5 places in 349 ms
[2020-06-04 23:15:31] [INFO ] Deduced a trap composed of 6 places in 317 ms
[2020-06-04 23:15:31] [INFO ] Deduced a trap composed of 5 places in 349 ms
[2020-06-04 23:15:31] [INFO ] Deduced a trap composed of 4 places in 336 ms
[2020-06-04 23:15:32] [INFO ] Deduced a trap composed of 6 places in 298 ms
[2020-06-04 23:15:32] [INFO ] Deduced a trap composed of 7 places in 348 ms
[2020-06-04 23:15:33] [INFO ] Deduced a trap composed of 4 places in 363 ms
[2020-06-04 23:15:33] [INFO ] Deduced a trap composed of 5 places in 350 ms
[2020-06-04 23:15:33] [INFO ] Deduced a trap composed of 4 places in 385 ms
[2020-06-04 23:15:34] [INFO ] Deduced a trap composed of 4 places in 333 ms
[2020-06-04 23:15:34] [INFO ] Deduced a trap composed of 5 places in 307 ms
[2020-06-04 23:15:34] [INFO ] Deduced a trap composed of 6 places in 316 ms
[2020-06-04 23:15:35] [INFO ] Deduced a trap composed of 4 places in 318 ms
[2020-06-04 23:15:35] [INFO ] Deduced a trap composed of 6 places in 327 ms
[2020-06-04 23:15:36] [INFO ] Deduced a trap composed of 6 places in 357 ms
[2020-06-04 23:15:36] [INFO ] Deduced a trap composed of 6 places in 324 ms
[2020-06-04 23:15:36] [INFO ] Deduced a trap composed of 8 places in 347 ms
[2020-06-04 23:15:37] [INFO ] Deduced a trap composed of 6 places in 274 ms
[2020-06-04 23:15:37] [INFO ] Deduced a trap composed of 5 places in 265 ms
[2020-06-04 23:15:37] [INFO ] Deduced a trap composed of 6 places in 273 ms
[2020-06-04 23:15:37] [INFO ] Deduced a trap composed of 4 places in 263 ms
[2020-06-04 23:15:38] [INFO ] Deduced a trap composed of 9 places in 271 ms
[2020-06-04 23:15:38] [INFO ] Deduced a trap composed of 6 places in 251 ms
[2020-06-04 23:15:38] [INFO ] Deduced a trap composed of 12 places in 246 ms
[2020-06-04 23:15:39] [INFO ] Deduced a trap composed of 6 places in 324 ms
[2020-06-04 23:15:39] [INFO ] Deduced a trap composed of 6 places in 297 ms
[2020-06-04 23:15:39] [INFO ] Deduced a trap composed of 4 places in 289 ms
[2020-06-04 23:15:40] [INFO ] Deduced a trap composed of 14 places in 287 ms
[2020-06-04 23:15:40] [INFO ] Deduced a trap composed of 5 places in 297 ms
[2020-06-04 23:15:40] [INFO ] Deduced a trap composed of 6 places in 314 ms
[2020-06-04 23:15:41] [INFO ] Deduced a trap composed of 6 places in 327 ms
[2020-06-04 23:15:41] [INFO ] Deduced a trap composed of 12 places in 312 ms
[2020-06-04 23:15:41] [INFO ] Deduced a trap composed of 4 places in 286 ms
[2020-06-04 23:15:42] [INFO ] Deduced a trap composed of 6 places in 292 ms
[2020-06-04 23:15:42] [INFO ] Deduced a trap composed of 7 places in 338 ms
[2020-06-04 23:15:42] [INFO ] Deduced a trap composed of 6 places in 265 ms
[2020-06-04 23:15:43] [INFO ] Deduced a trap composed of 6 places in 280 ms
[2020-06-04 23:15:43] [INFO ] Deduced a trap composed of 5 places in 279 ms
[2020-06-04 23:15:43] [INFO ] Deduced a trap composed of 8 places in 281 ms
[2020-06-04 23:15:44] [INFO ] Deduced a trap composed of 6 places in 261 ms
[2020-06-04 23:15:44] [INFO ] Deduced a trap composed of 6 places in 257 ms
[2020-06-04 23:15:44] [INFO ] Deduced a trap composed of 6 places in 258 ms
[2020-06-04 23:15:45] [INFO ] Deduced a trap composed of 6 places in 258 ms
[2020-06-04 23:15:45] [INFO ] Deduced a trap composed of 6 places in 276 ms
[2020-06-04 23:15:45] [INFO ] Deduced a trap composed of 12 places in 256 ms
[2020-06-04 23:15:46] [INFO ] Deduced a trap composed of 8 places in 248 ms
[2020-06-04 23:15:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s829 s831 s832 s835 s838 s850 s856 s857) 0)") while checking expression at index 0
[2020-06-04 23:15:46] [INFO ] [Real]Absence check using 315 positive place invariants in 199 ms returned sat
[2020-06-04 23:15:46] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 14 ms returned sat
[2020-06-04 23:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:15:47] [INFO ] [Real]Absence check using state equation in 1600 ms returned sat
[2020-06-04 23:15:48] [INFO ] Deduced a trap composed of 4 places in 309 ms
[2020-06-04 23:15:48] [INFO ] Deduced a trap composed of 6 places in 272 ms
[2020-06-04 23:15:48] [INFO ] Deduced a trap composed of 5 places in 266 ms
[2020-06-04 23:15:49] [INFO ] Deduced a trap composed of 6 places in 244 ms
[2020-06-04 23:15:49] [INFO ] Deduced a trap composed of 5 places in 239 ms
[2020-06-04 23:15:49] [INFO ] Deduced a trap composed of 4 places in 245 ms
[2020-06-04 23:15:49] [INFO ] Deduced a trap composed of 6 places in 230 ms
[2020-06-04 23:15:50] [INFO ] Deduced a trap composed of 6 places in 221 ms
[2020-06-04 23:15:50] [INFO ] Deduced a trap composed of 5 places in 212 ms
[2020-06-04 23:15:50] [INFO ] Deduced a trap composed of 19 places in 175 ms
[2020-06-04 23:15:50] [INFO ] Deduced a trap composed of 8 places in 181 ms
[2020-06-04 23:15:51] [INFO ] Deduced a trap composed of 11 places in 228 ms
[2020-06-04 23:15:51] [INFO ] Deduced a trap composed of 6 places in 227 ms
[2020-06-04 23:15:51] [INFO ] Deduced a trap composed of 6 places in 210 ms
[2020-06-04 23:15:51] [INFO ] Deduced a trap composed of 6 places in 211 ms
[2020-06-04 23:15:52] [INFO ] Deduced a trap composed of 9 places in 261 ms
[2020-06-04 23:15:52] [INFO ] Deduced a trap composed of 11 places in 176 ms
[2020-06-04 23:15:52] [INFO ] Deduced a trap composed of 6 places in 200 ms
[2020-06-04 23:15:52] [INFO ] Deduced a trap composed of 5 places in 190 ms
[2020-06-04 23:15:53] [INFO ] Deduced a trap composed of 6 places in 200 ms
[2020-06-04 23:15:53] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5191 ms
[2020-06-04 23:15:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 23:15:53] [INFO ] [Nat]Absence check using 315 positive place invariants in 198 ms returned sat
[2020-06-04 23:15:53] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 10 ms returned sat
[2020-06-04 23:15:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 23:15:55] [INFO ] [Nat]Absence check using state equation in 1612 ms returned sat
[2020-06-04 23:15:55] [INFO ] Deduced a trap composed of 6 places in 279 ms
[2020-06-04 23:15:55] [INFO ] Deduced a trap composed of 4 places in 231 ms
[2020-06-04 23:15:56] [INFO ] Deduced a trap composed of 6 places in 231 ms
[2020-06-04 23:15:56] [INFO ] Deduced a trap composed of 11 places in 347 ms
[2020-06-04 23:15:56] [INFO ] Deduced a trap composed of 11 places in 245 ms
[2020-06-04 23:15:57] [INFO ] Deduced a trap composed of 4 places in 336 ms
[2020-06-04 23:15:57] [INFO ] Deduced a trap composed of 5 places in 352 ms
[2020-06-04 23:15:57] [INFO ] Deduced a trap composed of 6 places in 306 ms
[2020-06-04 23:15:58] [INFO ] Deduced a trap composed of 4 places in 320 ms
[2020-06-04 23:15:58] [INFO ] Deduced a trap composed of 4 places in 293 ms
[2020-06-04 23:15:58] [INFO ] Deduced a trap composed of 6 places in 288 ms
[2020-06-04 23:15:59] [INFO ] Deduced a trap composed of 5 places in 308 ms
[2020-06-04 23:15:59] [INFO ] Deduced a trap composed of 5 places in 299 ms
[2020-06-04 23:15:59] [INFO ] Deduced a trap composed of 6 places in 295 ms
[2020-06-04 23:16:00] [INFO ] Deduced a trap composed of 6 places in 246 ms
[2020-06-04 23:16:00] [INFO ] Deduced a trap composed of 5 places in 284 ms
[2020-06-04 23:16:00] [INFO ] Deduced a trap composed of 5 places in 260 ms
[2020-06-04 23:16:00] [INFO ] Deduced a trap composed of 6 places in 286 ms
[2020-06-04 23:16:01] [INFO ] Deduced a trap composed of 4 places in 267 ms
[2020-06-04 23:16:01] [INFO ] Deduced a trap composed of 5 places in 302 ms
[2020-06-04 23:16:01] [INFO ] Deduced a trap composed of 9 places in 277 ms
[2020-06-04 23:16:02] [INFO ] Deduced a trap composed of 6 places in 255 ms
[2020-06-04 23:16:02] [INFO ] Deduced a trap composed of 5 places in 298 ms
[2020-06-04 23:16:02] [INFO ] Deduced a trap composed of 5 places in 280 ms
[2020-06-04 23:16:03] [INFO ] Deduced a trap composed of 6 places in 308 ms
[2020-06-04 23:16:03] [INFO ] Deduced a trap composed of 4 places in 280 ms
[2020-06-04 23:16:03] [INFO ] Deduced a trap composed of 10 places in 287 ms
[2020-06-04 23:16:04] [INFO ] Deduced a trap composed of 6 places in 292 ms
[2020-06-04 23:16:04] [INFO ] Deduced a trap composed of 8 places in 276 ms
[2020-06-04 23:16:04] [INFO ] Deduced a trap composed of 7 places in 251 ms
[2020-06-04 23:16:04] [INFO ] Deduced a trap composed of 13 places in 205 ms
[2020-06-04 23:16:05] [INFO ] Deduced a trap composed of 11 places in 196 ms
[2020-06-04 23:16:05] [INFO ] Deduced a trap composed of 6 places in 201 ms
[2020-06-04 23:16:05] [INFO ] Deduced a trap composed of 8 places in 200 ms
[2020-06-04 23:16:05] [INFO ] Deduced a trap composed of 4 places in 269 ms
[2020-06-04 23:16:06] [INFO ] Deduced a trap composed of 6 places in 233 ms
[2020-06-04 23:16:06] [INFO ] Deduced a trap composed of 6 places in 275 ms
[2020-06-04 23:16:06] [INFO ] Deduced a trap composed of 6 places in 230 ms
[2020-06-04 23:16:07] [INFO ] Deduced a trap composed of 4 places in 236 ms
[2020-06-04 23:16:07] [INFO ] Deduced a trap composed of 6 places in 252 ms
[2020-06-04 23:16:07] [INFO ] Deduced a trap composed of 9 places in 251 ms
[2020-06-04 23:16:07] [INFO ] Deduced a trap composed of 8 places in 259 ms
[2020-06-04 23:16:08] [INFO ] Deduced a trap composed of 8 places in 240 ms
[2020-06-04 23:16:08] [INFO ] Deduced a trap composed of 6 places in 230 ms
[2020-06-04 23:16:08] [INFO ] Deduced a trap composed of 9 places in 230 ms
[2020-06-04 23:16:09] [INFO ] Deduced a trap composed of 9 places in 668 ms
[2020-06-04 23:16:09] [INFO ] Deduced a trap composed of 8 places in 193 ms
[2020-06-04 23:16:09] [INFO ] Deduced a trap composed of 9 places in 164 ms
[2020-06-04 23:16:10] [INFO ] Deduced a trap composed of 11 places in 169 ms
[2020-06-04 23:16:10] [INFO ] Deduced a trap composed of 8 places in 146 ms
[2020-06-04 23:16:10] [INFO ] Deduced a trap composed of 8 places in 142 ms
[2020-06-04 23:16:10] [INFO ] Deduced a trap composed of 6 places in 141 ms
[2020-06-04 23:16:10] [INFO ] Deduced a trap composed of 14 places in 142 ms
[2020-06-04 23:16:11] [INFO ] Deduced a trap composed of 9 places in 137 ms
[2020-06-04 23:16:11] [INFO ] Deduced a trap composed of 9 places in 144 ms
[2020-06-04 23:16:11] [INFO ] Deduced a trap composed of 18 places in 149 ms
[2020-06-04 23:16:11] [INFO ] Deduced a trap composed of 5 places in 156 ms
[2020-06-04 23:16:11] [INFO ] Deduced a trap composed of 13 places in 150 ms
[2020-06-04 23:16:11] [INFO ] Deduced a trap composed of 10 places in 181 ms
[2020-06-04 23:16:12] [INFO ] Deduced a trap composed of 7 places in 169 ms
[2020-06-04 23:16:12] [INFO ] Deduced a trap composed of 4 places in 189 ms
[2020-06-04 23:16:12] [INFO ] Deduced a trap composed of 6 places in 148 ms
[2020-06-04 23:16:12] [INFO ] Deduced a trap composed of 8 places in 126 ms
[2020-06-04 23:16:12] [INFO ] Deduced a trap composed of 8 places in 158 ms
[2020-06-04 23:16:12] [INFO ] Trap strengthening (SAT) tested/added 65/64 trap constraints in 17782 ms
[2020-06-04 23:16:13] [INFO ] Computed and/alt/rep : 791/2505/791 causal constraints in 56 ms.
[2020-06-04 23:16:13] [INFO ] Added : 15 causal constraints over 3 iterations in 245 ms. Result :(error "Failed to check-sat")
[2020-06-04 23:16:13] [INFO ] [Real]Absence check using 315 positive place invariants in 142 ms returned sat
[2020-06-04 23:16:13] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 8 ms returned sat
[2020-06-04 23:16:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:16:15] [INFO ] [Real]Absence check using state equation in 1739 ms returned sat
[2020-06-04 23:16:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 23:16:15] [INFO ] [Nat]Absence check using 315 positive place invariants in 193 ms returned sat
[2020-06-04 23:16:15] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 12 ms returned sat
[2020-06-04 23:16:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 23:16:17] [INFO ] [Nat]Absence check using state equation in 1566 ms returned sat
[2020-06-04 23:16:17] [INFO ] Deduced a trap composed of 4 places in 323 ms
[2020-06-04 23:16:17] [INFO ] Deduced a trap composed of 5 places in 309 ms
[2020-06-04 23:16:18] [INFO ] Deduced a trap composed of 6 places in 339 ms
[2020-06-04 23:16:18] [INFO ] Deduced a trap composed of 7 places in 331 ms
[2020-06-04 23:16:19] [INFO ] Deduced a trap composed of 4 places in 287 ms
[2020-06-04 23:16:19] [INFO ] Deduced a trap composed of 4 places in 318 ms
[2020-06-04 23:16:19] [INFO ] Deduced a trap composed of 4 places in 295 ms
[2020-06-04 23:16:20] [INFO ] Deduced a trap composed of 5 places in 300 ms
[2020-06-04 23:16:20] [INFO ] Deduced a trap composed of 4 places in 309 ms
[2020-06-04 23:16:20] [INFO ] Deduced a trap composed of 4 places in 259 ms
[2020-06-04 23:16:21] [INFO ] Deduced a trap composed of 5 places in 245 ms
[2020-06-04 23:16:21] [INFO ] Deduced a trap composed of 9 places in 279 ms
[2020-06-04 23:16:21] [INFO ] Deduced a trap composed of 6 places in 286 ms
[2020-06-04 23:16:21] [INFO ] Deduced a trap composed of 6 places in 264 ms
[2020-06-04 23:16:22] [INFO ] Deduced a trap composed of 8 places in 290 ms
[2020-06-04 23:16:22] [INFO ] Deduced a trap composed of 9 places in 280 ms
[2020-06-04 23:16:22] [INFO ] Deduced a trap composed of 4 places in 238 ms
[2020-06-04 23:16:23] [INFO ] Deduced a trap composed of 6 places in 273 ms
[2020-06-04 23:16:23] [INFO ] Deduced a trap composed of 4 places in 286 ms
[2020-06-04 23:16:23] [INFO ] Deduced a trap composed of 6 places in 282 ms
[2020-06-04 23:16:24] [INFO ] Deduced a trap composed of 5 places in 274 ms
[2020-06-04 23:16:24] [INFO ] Deduced a trap composed of 4 places in 308 ms
[2020-06-04 23:16:24] [INFO ] Deduced a trap composed of 4 places in 289 ms
[2020-06-04 23:16:25] [INFO ] Deduced a trap composed of 8 places in 313 ms
[2020-06-04 23:16:25] [INFO ] Deduced a trap composed of 4 places in 338 ms
[2020-06-04 23:16:25] [INFO ] Deduced a trap composed of 9 places in 318 ms
[2020-06-04 23:16:26] [INFO ] Deduced a trap composed of 5 places in 309 ms
[2020-06-04 23:16:26] [INFO ] Deduced a trap composed of 8 places in 332 ms
[2020-06-04 23:16:26] [INFO ] Deduced a trap composed of 8 places in 311 ms
[2020-06-04 23:16:27] [INFO ] Deduced a trap composed of 23 places in 289 ms
[2020-06-04 23:16:27] [INFO ] Deduced a trap composed of 6 places in 284 ms
[2020-06-04 23:16:27] [INFO ] Deduced a trap composed of 6 places in 308 ms
[2020-06-04 23:16:28] [INFO ] Deduced a trap composed of 9 places in 325 ms
[2020-06-04 23:16:28] [INFO ] Deduced a trap composed of 12 places in 236 ms
[2020-06-04 23:16:28] [INFO ] Deduced a trap composed of 13 places in 295 ms
[2020-06-04 23:16:29] [INFO ] Deduced a trap composed of 6 places in 302 ms
[2020-06-04 23:16:29] [INFO ] Deduced a trap composed of 9 places in 296 ms
[2020-06-04 23:16:29] [INFO ] Deduced a trap composed of 10 places in 270 ms
[2020-06-04 23:16:30] [INFO ] Deduced a trap composed of 30 places in 176 ms
[2020-06-04 23:16:30] [INFO ] Deduced a trap composed of 9 places in 264 ms
[2020-06-04 23:16:30] [INFO ] Deduced a trap composed of 8 places in 271 ms
[2020-06-04 23:16:30] [INFO ] Deduced a trap composed of 10 places in 252 ms
[2020-06-04 23:16:31] [INFO ] Deduced a trap composed of 23 places in 251 ms
[2020-06-04 23:16:31] [INFO ] Deduced a trap composed of 8 places in 229 ms
[2020-06-04 23:16:31] [INFO ] Deduced a trap composed of 4 places in 265 ms
[2020-06-04 23:16:32] [INFO ] Deduced a trap composed of 8 places in 222 ms
[2020-06-04 23:16:32] [INFO ] Deduced a trap composed of 8 places in 156 ms
[2020-06-04 23:16:32] [INFO ] Deduced a trap composed of 7 places in 241 ms
[2020-06-04 23:16:32] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 15293 ms
[2020-06-04 23:16:32] [INFO ] Computed and/alt/rep : 791/2505/791 causal constraints in 74 ms.
[2020-06-04 23:16:35] [INFO ] Added : 160 causal constraints over 32 iterations in 2822 ms. Result :(error "Failed to check-sat")
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 951 transition count 801
Applied a total of 2 rules in 84 ms. Remains 951 /951 variables (removed 0) and now considering 801/801 (removed 0) transitions.
// Phase 1: matrix 801 rows 951 cols
[2020-06-04 23:16:35] [INFO ] Computed 331 place invariants in 28 ms
[2020-06-04 23:16:35] [INFO ] [Real]Absence check using 315 positive place invariants in 209 ms returned sat
[2020-06-04 23:16:35] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 11 ms returned sat
[2020-06-04 23:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:16:37] [INFO ] [Real]Absence check using state equation in 1962 ms returned sat
[2020-06-04 23:16:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-04 23:16:37] [INFO ] [Real]Added 2 Read/Feed constraints in 46 ms returned sat
[2020-06-04 23:16:38] [INFO ] Deduced a trap composed of 6 places in 372 ms
[2020-06-04 23:16:38] [INFO ] Deduced a trap composed of 9 places in 375 ms
[2020-06-04 23:16:39] [INFO ] Deduced a trap composed of 4 places in 337 ms
[2020-06-04 23:16:39] [INFO ] Deduced a trap composed of 5 places in 320 ms
[2020-06-04 23:16:39] [INFO ] Deduced a trap composed of 6 places in 310 ms
[2020-06-04 23:16:40] [INFO ] Deduced a trap composed of 5 places in 316 ms
[2020-06-04 23:16:40] [INFO ] Deduced a trap composed of 5 places in 328 ms
[2020-06-04 23:16:40] [INFO ] Deduced a trap composed of 9 places in 252 ms
[2020-06-04 23:16:41] [INFO ] Deduced a trap composed of 5 places in 319 ms
[2020-06-04 23:16:41] [INFO ] Deduced a trap composed of 6 places in 314 ms
[2020-06-04 23:16:41] [INFO ] Deduced a trap composed of 9 places in 303 ms
[2020-06-04 23:16:42] [INFO ] Deduced a trap composed of 11 places in 373 ms
[2020-06-04 23:16:42] [INFO ] Deduced a trap composed of 6 places in 310 ms
[2020-06-04 23:16:43] [INFO ] Deduced a trap composed of 8 places in 354 ms
[2020-06-04 23:16:43] [INFO ] Deduced a trap composed of 9 places in 214 ms
[2020-06-04 23:16:43] [INFO ] Deduced a trap composed of 9 places in 215 ms
[2020-06-04 23:16:43] [INFO ] Deduced a trap composed of 6 places in 301 ms
[2020-06-04 23:16:44] [INFO ] Deduced a trap composed of 15 places in 265 ms
[2020-06-04 23:16:44] [INFO ] Deduced a trap composed of 14 places in 259 ms
[2020-06-04 23:16:44] [INFO ] Deduced a trap composed of 17 places in 246 ms
[2020-06-04 23:16:45] [INFO ] Deduced a trap composed of 6 places in 264 ms
[2020-06-04 23:16:45] [INFO ] Deduced a trap composed of 6 places in 242 ms
[2020-06-04 23:16:45] [INFO ] Deduced a trap composed of 9 places in 192 ms
[2020-06-04 23:16:45] [INFO ] Deduced a trap composed of 9 places in 222 ms
[2020-06-04 23:16:46] [INFO ] Deduced a trap composed of 12 places in 238 ms
[2020-06-04 23:16:46] [INFO ] Deduced a trap composed of 17 places in 235 ms
[2020-06-04 23:16:46] [INFO ] Deduced a trap composed of 12 places in 200 ms
[2020-06-04 23:16:46] [INFO ] Deduced a trap composed of 11 places in 199 ms
[2020-06-04 23:16:47] [INFO ] Deduced a trap composed of 6 places in 214 ms
[2020-06-04 23:16:47] [INFO ] Deduced a trap composed of 20 places in 228 ms
[2020-06-04 23:16:47] [INFO ] Deduced a trap composed of 20 places in 193 ms
[2020-06-04 23:16:47] [INFO ] Deduced a trap composed of 8 places in 180 ms
[2020-06-04 23:16:47] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 10004 ms
[2020-06-04 23:16:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 23:16:48] [INFO ] [Nat]Absence check using 315 positive place invariants in 163 ms returned sat
[2020-06-04 23:16:48] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 9 ms returned sat
[2020-06-04 23:16:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 23:16:49] [INFO ] [Nat]Absence check using state equation in 1641 ms returned sat
[2020-06-04 23:16:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 19 ms returned sat
[2020-06-04 23:16:50] [INFO ] Deduced a trap composed of 6 places in 291 ms
[2020-06-04 23:16:50] [INFO ] Deduced a trap composed of 6 places in 309 ms
[2020-06-04 23:16:50] [INFO ] Deduced a trap composed of 4 places in 305 ms
[2020-06-04 23:16:51] [INFO ] Deduced a trap composed of 6 places in 339 ms
[2020-06-04 23:16:51] [INFO ] Deduced a trap composed of 6 places in 301 ms
[2020-06-04 23:16:52] [INFO ] Deduced a trap composed of 6 places in 296 ms
[2020-06-04 23:16:52] [INFO ] Deduced a trap composed of 6 places in 275 ms
[2020-06-04 23:16:52] [INFO ] Deduced a trap composed of 8 places in 301 ms
[2020-06-04 23:16:53] [INFO ] Deduced a trap composed of 8 places in 258 ms
[2020-06-04 23:16:53] [INFO ] Deduced a trap composed of 6 places in 258 ms
[2020-06-04 23:16:53] [INFO ] Deduced a trap composed of 5 places in 310 ms
[2020-06-04 23:16:54] [INFO ] Deduced a trap composed of 6 places in 331 ms
[2020-06-04 23:16:54] [INFO ] Deduced a trap composed of 6 places in 312 ms
[2020-06-04 23:16:54] [INFO ] Deduced a trap composed of 8 places in 280 ms
[2020-06-04 23:16:55] [INFO ] Deduced a trap composed of 10 places in 249 ms
[2020-06-04 23:16:55] [INFO ] Deduced a trap composed of 4 places in 228 ms
[2020-06-04 23:16:55] [INFO ] Deduced a trap composed of 4 places in 213 ms
[2020-06-04 23:16:55] [INFO ] Deduced a trap composed of 7 places in 183 ms
[2020-06-04 23:16:56] [INFO ] Deduced a trap composed of 6 places in 278 ms
[2020-06-04 23:16:56] [INFO ] Deduced a trap composed of 6 places in 260 ms
[2020-06-04 23:16:56] [INFO ] Deduced a trap composed of 4 places in 221 ms
[2020-06-04 23:16:56] [INFO ] Deduced a trap composed of 6 places in 270 ms
[2020-06-04 23:16:57] [INFO ] Deduced a trap composed of 5 places in 216 ms
[2020-06-04 23:16:57] [INFO ] Deduced a trap composed of 6 places in 234 ms
[2020-06-04 23:16:57] [INFO ] Deduced a trap composed of 8 places in 299 ms
[2020-06-04 23:16:58] [INFO ] Deduced a trap composed of 10 places in 265 ms
[2020-06-04 23:16:58] [INFO ] Deduced a trap composed of 8 places in 302 ms
[2020-06-04 23:16:58] [INFO ] Deduced a trap composed of 6 places in 243 ms
[2020-06-04 23:16:59] [INFO ] Deduced a trap composed of 6 places in 242 ms
[2020-06-04 23:16:59] [INFO ] Deduced a trap composed of 6 places in 202 ms
[2020-06-04 23:16:59] [INFO ] Deduced a trap composed of 9 places in 193 ms
[2020-06-04 23:16:59] [INFO ] Deduced a trap composed of 6 places in 248 ms
[2020-06-04 23:17:00] [INFO ] Deduced a trap composed of 9 places in 188 ms
[2020-06-04 23:17:00] [INFO ] Deduced a trap composed of 6 places in 210 ms
[2020-06-04 23:17:00] [INFO ] Deduced a trap composed of 10 places in 178 ms
[2020-06-04 23:17:00] [INFO ] Deduced a trap composed of 5 places in 235 ms
[2020-06-04 23:17:01] [INFO ] Deduced a trap composed of 6 places in 187 ms
[2020-06-04 23:17:01] [INFO ] Deduced a trap composed of 6 places in 180 ms
[2020-06-04 23:17:01] [INFO ] Deduced a trap composed of 8 places in 207 ms
[2020-06-04 23:17:01] [INFO ] Deduced a trap composed of 6 places in 208 ms
[2020-06-04 23:17:02] [INFO ] Deduced a trap composed of 6 places in 198 ms
[2020-06-04 23:17:02] [INFO ] Deduced a trap composed of 4 places in 176 ms
[2020-06-04 23:17:02] [INFO ] Deduced a trap composed of 6 places in 161 ms
[2020-06-04 23:17:02] [INFO ] Deduced a trap composed of 6 places in 173 ms
[2020-06-04 23:17:02] [INFO ] Deduced a trap composed of 12 places in 215 ms
[2020-06-04 23:17:03] [INFO ] Deduced a trap composed of 6 places in 169 ms
[2020-06-04 23:17:03] [INFO ] Deduced a trap composed of 8 places in 176 ms
[2020-06-04 23:17:03] [INFO ] Deduced a trap composed of 6 places in 212 ms
[2020-06-04 23:17:03] [INFO ] Deduced a trap composed of 4 places in 175 ms
[2020-06-04 23:17:04] [INFO ] Deduced a trap composed of 11 places in 176 ms
[2020-06-04 23:17:04] [INFO ] Deduced a trap composed of 10 places in 154 ms
[2020-06-04 23:17:04] [INFO ] Deduced a trap composed of 6 places in 207 ms
[2020-06-04 23:17:04] [INFO ] Deduced a trap composed of 8 places in 192 ms
[2020-06-04 23:17:04] [INFO ] Deduced a trap composed of 8 places in 174 ms
[2020-06-04 23:17:05] [INFO ] Deduced a trap composed of 20 places in 155 ms
[2020-06-04 23:17:05] [INFO ] Deduced a trap composed of 18 places in 170 ms
[2020-06-04 23:17:05] [INFO ] Deduced a trap composed of 10 places in 164 ms
[2020-06-04 23:17:05] [INFO ] Deduced a trap composed of 7 places in 212 ms
[2020-06-04 23:17:05] [INFO ] Deduced a trap composed of 6 places in 205 ms
[2020-06-04 23:17:06] [INFO ] Deduced a trap composed of 6 places in 213 ms
[2020-06-04 23:17:06] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 16250 ms
[2020-06-04 23:17:06] [INFO ] Computed and/alt/rep : 791/2514/791 causal constraints in 52 ms.
[2020-06-04 23:17:28] [INFO ] Added : 714 causal constraints over 150 iterations in 22188 ms. Result :unknown
[2020-06-04 23:17:28] [INFO ] [Real]Absence check using 315 positive place invariants in 163 ms returned sat
[2020-06-04 23:17:28] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 13 ms returned sat
[2020-06-04 23:17:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:17:30] [INFO ] [Real]Absence check using state equation in 1697 ms returned sat
[2020-06-04 23:17:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 23:17:30] [INFO ] [Nat]Absence check using 315 positive place invariants in 148 ms returned sat
[2020-06-04 23:17:30] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 7 ms returned sat
[2020-06-04 23:17:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 23:17:32] [INFO ] [Nat]Absence check using state equation in 1558 ms returned sat
[2020-06-04 23:17:32] [INFO ] [Nat]Added 2 Read/Feed constraints in 38 ms returned sat
[2020-06-04 23:17:32] [INFO ] Deduced a trap composed of 5 places in 218 ms
[2020-06-04 23:17:32] [INFO ] Deduced a trap composed of 5 places in 193 ms
[2020-06-04 23:17:33] [INFO ] Deduced a trap composed of 5 places in 269 ms
[2020-06-04 23:17:33] [INFO ] Deduced a trap composed of 5 places in 191 ms
[2020-06-04 23:17:33] [INFO ] Deduced a trap composed of 6 places in 217 ms
[2020-06-04 23:17:33] [INFO ] Deduced a trap composed of 6 places in 366 ms
[2020-06-04 23:17:34] [INFO ] Deduced a trap composed of 5 places in 561 ms
[2020-06-04 23:17:34] [INFO ] Deduced a trap composed of 6 places in 257 ms
[2020-06-04 23:17:35] [INFO ] Deduced a trap composed of 4 places in 281 ms
[2020-06-04 23:17:35] [INFO ] Deduced a trap composed of 6 places in 237 ms
[2020-06-04 23:17:35] [INFO ] Deduced a trap composed of 6 places in 256 ms
[2020-06-04 23:17:36] [INFO ] Deduced a trap composed of 4 places in 247 ms
[2020-06-04 23:17:36] [INFO ] Deduced a trap composed of 5 places in 250 ms
[2020-06-04 23:17:36] [INFO ] Deduced a trap composed of 5 places in 477 ms
[2020-06-04 23:17:37] [INFO ] Deduced a trap composed of 5 places in 310 ms
[2020-06-04 23:17:37] [INFO ] Deduced a trap composed of 6 places in 268 ms
[2020-06-04 23:17:38] [INFO ] Deduced a trap composed of 8 places in 262 ms
[2020-06-04 23:17:38] [INFO ] Deduced a trap composed of 4 places in 293 ms
[2020-06-04 23:17:38] [INFO ] Deduced a trap composed of 5 places in 246 ms
[2020-06-04 23:17:39] [INFO ] Deduced a trap composed of 5 places in 281 ms
[2020-06-04 23:17:39] [INFO ] Deduced a trap composed of 6 places in 241 ms
[2020-06-04 23:17:39] [INFO ] Deduced a trap composed of 5 places in 271 ms
[2020-06-04 23:17:40] [INFO ] Deduced a trap composed of 6 places in 275 ms
[2020-06-04 23:17:40] [INFO ] Deduced a trap composed of 4 places in 220 ms
[2020-06-04 23:17:40] [INFO ] Deduced a trap composed of 6 places in 244 ms
[2020-06-04 23:17:40] [INFO ] Deduced a trap composed of 6 places in 245 ms
[2020-06-04 23:17:41] [INFO ] Deduced a trap composed of 5 places in 204 ms
[2020-06-04 23:17:41] [INFO ] Deduced a trap composed of 5 places in 216 ms
[2020-06-04 23:17:41] [INFO ] Deduced a trap composed of 7 places in 174 ms
[2020-06-04 23:17:41] [INFO ] Deduced a trap composed of 6 places in 178 ms
[2020-06-04 23:17:41] [INFO ] Deduced a trap composed of 7 places in 166 ms
[2020-06-04 23:17:42] [INFO ] Deduced a trap composed of 7 places in 166 ms
[2020-06-04 23:17:42] [INFO ] Deduced a trap composed of 6 places in 167 ms
[2020-06-04 23:17:42] [INFO ] Deduced a trap composed of 6 places in 158 ms
[2020-06-04 23:17:42] [INFO ] Deduced a trap composed of 6 places in 126 ms
[2020-06-04 23:17:42] [INFO ] Deduced a trap composed of 5 places in 124 ms
[2020-06-04 23:17:43] [INFO ] Deduced a trap composed of 6 places in 125 ms
[2020-06-04 23:17:43] [INFO ] Deduced a trap composed of 4 places in 133 ms
[2020-06-04 23:17:43] [INFO ] Deduced a trap composed of 6 places in 118 ms
[2020-06-04 23:17:43] [INFO ] Deduced a trap composed of 9 places in 112 ms
[2020-06-04 23:17:43] [INFO ] Deduced a trap composed of 11 places in 133 ms
[2020-06-04 23:17:43] [INFO ] Deduced a trap composed of 6 places in 136 ms
[2020-06-04 23:17:43] [INFO ] Deduced a trap composed of 5 places in 128 ms
[2020-06-04 23:17:44] [INFO ] Deduced a trap composed of 8 places in 146 ms
[2020-06-04 23:17:44] [INFO ] Deduced a trap composed of 6 places in 156 ms
[2020-06-04 23:17:44] [INFO ] Deduced a trap composed of 6 places in 128 ms
[2020-06-04 23:17:44] [INFO ] Deduced a trap composed of 9 places in 135 ms
[2020-06-04 23:17:44] [INFO ] Deduced a trap composed of 5 places in 152 ms
[2020-06-04 23:17:45] [INFO ] Deduced a trap composed of 6 places in 142 ms
[2020-06-04 23:17:45] [INFO ] Deduced a trap composed of 6 places in 156 ms
[2020-06-04 23:17:45] [INFO ] Deduced a trap composed of 6 places in 102 ms
[2020-06-04 23:17:45] [INFO ] Deduced a trap composed of 6 places in 93 ms
[2020-06-04 23:17:45] [INFO ] Deduced a trap composed of 5 places in 93 ms
[2020-06-04 23:17:45] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 13293 ms
[2020-06-04 23:17:45] [INFO ] Computed and/alt/rep : 791/2514/791 causal constraints in 48 ms.
[2020-06-04 23:18:06] [INFO ] Added : 705 causal constraints over 146 iterations in 21104 ms.(timeout) Result :sat
[2020-06-04 23:18:06] [INFO ] Deduced a trap composed of 27 places in 113 ms
[2020-06-04 23:18:07] [INFO ] Deduced a trap composed of 23 places in 105 ms
[2020-06-04 23:18:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 532 ms
Attempting to minimize the solution found.
Minimization took 104 ms.
[2020-06-04 23:18:07] [INFO ] [Real]Absence check using 315 positive place invariants in 183 ms returned sat
[2020-06-04 23:18:07] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 10 ms returned sat
[2020-06-04 23:18:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 23:18:09] [INFO ] [Real]Absence check using state equation in 1758 ms returned sat
[2020-06-04 23:18:09] [INFO ] [Real]Added 2 Read/Feed constraints in 6 ms returned sat
[2020-06-04 23:18:09] [INFO ] Deduced a trap composed of 5 places in 305 ms
[2020-06-04 23:18:10] [INFO ] Deduced a trap composed of 4 places in 307 ms
[2020-06-04 23:18:10] [INFO ] Deduced a trap composed of 8 places in 276 ms
[2020-06-04 23:18:10] [INFO ] Deduced a trap composed of 12 places in 257 ms
[2020-06-04 23:18:11] [INFO ] Deduced a trap composed of 5 places in 217 ms
[2020-06-04 23:18:11] [INFO ] Deduced a trap composed of 5 places in 233 ms
[2020-06-04 23:18:11] [INFO ] Deduced a trap composed of 6 places in 210 ms
[2020-06-04 23:18:11] [INFO ] Deduced a trap composed of 6 places in 222 ms
[2020-06-04 23:18:12] [INFO ] Deduced a trap composed of 6 places in 229 ms
[2020-06-04 23:18:12] [INFO ] Deduced a trap composed of 8 places in 206 ms
[2020-06-04 23:18:12] [INFO ] Deduced a trap composed of 6 places in 196 ms
[2020-06-04 23:18:12] [INFO ] Deduced a trap composed of 6 places in 209 ms
[2020-06-04 23:18:13] [INFO ] Deduced a trap composed of 6 places in 196 ms
[2020-06-04 23:18:13] [INFO ] Deduced a trap composed of 7 places in 184 ms
[2020-06-04 23:18:13] [INFO ] Deduced a trap composed of 5 places in 195 ms
[2020-06-04 23:18:13] [INFO ] Deduced a trap composed of 6 places in 184 ms
[2020-06-04 23:18:14] [INFO ] Deduced a trap composed of 6 places in 222 ms
[2020-06-04 23:18:14] [INFO ] Deduced a trap composed of 5 places in 175 ms
[2020-06-04 23:18:14] [INFO ] Deduced a trap composed of 11 places in 190 ms
[2020-06-04 23:18:14] [INFO ] Deduced a trap composed of 6 places in 165 ms
[2020-06-04 23:18:15] [INFO ] Deduced a trap composed of 6 places in 201 ms
[2020-06-04 23:18:15] [INFO ] Deduced a trap composed of 6 places in 165 ms
[2020-06-04 23:18:15] [INFO ] Deduced a trap composed of 9 places in 227 ms
[2020-06-04 23:18:15] [INFO ] Deduced a trap composed of 12 places in 185 ms
[2020-06-04 23:18:15] [INFO ] Deduced a trap composed of 6 places in 166 ms
[2020-06-04 23:18:16] [INFO ] Deduced a trap composed of 5 places in 148 ms
[2020-06-04 23:18:16] [INFO ] Deduced a trap composed of 11 places in 181 ms
[2020-06-04 23:18:16] [INFO ] Deduced a trap composed of 11 places in 141 ms
[2020-06-04 23:18:16] [INFO ] Deduced a trap composed of 12 places in 133 ms
[2020-06-04 23:18:16] [INFO ] Deduced a trap composed of 6 places in 136 ms
[2020-06-04 23:18:16] [INFO ] Deduced a trap composed of 6 places in 138 ms
[2020-06-04 23:18:17] [INFO ] Deduced a trap composed of 9 places in 137 ms
[2020-06-04 23:18:17] [INFO ] Deduced a trap composed of 9 places in 148 ms
[2020-06-04 23:18:17] [INFO ] Deduced a trap composed of 8 places in 151 ms
[2020-06-04 23:18:17] [INFO ] Deduced a trap composed of 15 places in 147 ms
[2020-06-04 23:18:17] [INFO ] Deduced a trap composed of 12 places in 139 ms
[2020-06-04 23:18:17] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 8347 ms
[2020-06-04 23:18:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 23:18:18] [INFO ] [Nat]Absence check using 315 positive place invariants in 132 ms returned sat
[2020-06-04 23:18:18] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 9 ms returned sat
[2020-06-04 23:18:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 23:18:19] [INFO ] [Nat]Absence check using state equation in 1454 ms returned sat
[2020-06-04 23:18:19] [INFO ] [Nat]Added 2 Read/Feed constraints in 21 ms returned sat
[2020-06-04 23:18:19] [INFO ] Deduced a trap composed of 4 places in 293 ms
[2020-06-04 23:18:20] [INFO ] Deduced a trap composed of 6 places in 314 ms
[2020-06-04 23:18:20] [INFO ] Deduced a trap composed of 6 places in 212 ms
[2020-06-04 23:18:20] [INFO ] Deduced a trap composed of 4 places in 186 ms
[2020-06-04 23:18:20] [INFO ] Deduced a trap composed of 6 places in 180 ms
[2020-06-04 23:18:21] [INFO ] Deduced a trap composed of 5 places in 180 ms
[2020-06-04 23:18:21] [INFO ] Deduced a trap composed of 6 places in 254 ms
[2020-06-04 23:18:21] [INFO ] Deduced a trap composed of 6 places in 253 ms
[2020-06-04 23:18:21] [INFO ] Deduced a trap composed of 5 places in 219 ms
[2020-06-04 23:18:22] [INFO ] Deduced a trap composed of 4 places in 216 ms
[2020-06-04 23:18:22] [INFO ] Deduced a trap composed of 6 places in 226 ms
[2020-06-04 23:18:22] [INFO ] Deduced a trap composed of 6 places in 265 ms
[2020-06-04 23:18:23] [INFO ] Deduced a trap composed of 5 places in 234 ms
[2020-06-04 23:18:23] [INFO ] Deduced a trap composed of 8 places in 225 ms
[2020-06-04 23:18:23] [INFO ] Deduced a trap composed of 5 places in 204 ms
[2020-06-04 23:18:23] [INFO ] Deduced a trap composed of 6 places in 193 ms
[2020-06-04 23:18:23] [INFO ] Deduced a trap composed of 6 places in 168 ms
[2020-06-04 23:18:24] [INFO ] Deduced a trap composed of 6 places in 150 ms
[2020-06-04 23:18:24] [INFO ] Deduced a trap composed of 5 places in 149 ms
[2020-06-04 23:18:24] [INFO ] Deduced a trap composed of 6 places in 165 ms
[2020-06-04 23:18:24] [INFO ] Deduced a trap composed of 6 places in 154 ms
[2020-06-04 23:18:24] [INFO ] Deduced a trap composed of 6 places in 152 ms
[2020-06-04 23:18:25] [INFO ] Deduced a trap composed of 4 places in 168 ms
[2020-06-04 23:18:25] [INFO ] Deduced a trap composed of 6 places in 165 ms
[2020-06-04 23:18:25] [INFO ] Deduced a trap composed of 4 places in 172 ms
[2020-06-04 23:18:25] [INFO ] Deduced a trap composed of 5 places in 188 ms
[2020-06-04 23:18:25] [INFO ] Deduced a trap composed of 4 places in 261 ms
[2020-06-04 23:18:26] [INFO ] Deduced a trap composed of 6 places in 245 ms
[2020-06-04 23:18:26] [INFO ] Deduced a trap composed of 5 places in 233 ms
[2020-06-04 23:18:26] [INFO ] Deduced a trap composed of 4 places in 222 ms
[2020-06-04 23:18:27] [INFO ] Deduced a trap composed of 9 places in 253 ms
[2020-06-04 23:18:27] [INFO ] Deduced a trap composed of 6 places in 232 ms
[2020-06-04 23:18:27] [INFO ] Deduced a trap composed of 4 places in 212 ms
[2020-06-04 23:18:27] [INFO ] Deduced a trap composed of 8 places in 201 ms
[2020-06-04 23:18:28] [INFO ] Deduced a trap composed of 7 places in 298 ms
[2020-06-04 23:18:28] [INFO ] Deduced a trap composed of 5 places in 232 ms
[2020-06-04 23:18:28] [INFO ] Deduced a trap composed of 6 places in 202 ms
[2020-06-04 23:18:28] [INFO ] Deduced a trap composed of 6 places in 212 ms
[2020-06-04 23:18:29] [INFO ] Deduced a trap composed of 6 places in 217 ms
[2020-06-04 23:18:29] [INFO ] Deduced a trap composed of 19 places in 207 ms
[2020-06-04 23:18:29] [INFO ] Deduced a trap composed of 8 places in 206 ms
[2020-06-04 23:18:29] [INFO ] Deduced a trap composed of 8 places in 188 ms
[2020-06-04 23:18:30] [INFO ] Deduced a trap composed of 9 places in 171 ms
[2020-06-04 23:18:30] [INFO ] Deduced a trap composed of 4 places in 185 ms
[2020-06-04 23:18:30] [INFO ] Deduced a trap composed of 9 places in 176 ms
[2020-06-04 23:18:30] [INFO ] Deduced a trap composed of 6 places in 152 ms
[2020-06-04 23:18:31] [INFO ] Deduced a trap composed of 6 places in 153 ms
[2020-06-04 23:18:31] [INFO ] Deduced a trap composed of 5 places in 160 ms
[2020-06-04 23:18:31] [INFO ] Deduced a trap composed of 5 places in 182 ms
[2020-06-04 23:18:31] [INFO ] Deduced a trap composed of 9 places in 163 ms
[2020-06-04 23:18:31] [INFO ] Deduced a trap composed of 6 places in 223 ms
[2020-06-04 23:18:32] [INFO ] Deduced a trap composed of 8 places in 207 ms
[2020-06-04 23:18:32] [INFO ] Deduced a trap composed of 8 places in 150 ms
[2020-06-04 23:18:32] [INFO ] Deduced a trap composed of 7 places in 133 ms
[2020-06-04 23:18:32] [INFO ] Deduced a trap composed of 8 places in 151 ms
[2020-06-04 23:18:32] [INFO ] Deduced a trap composed of 6 places in 144 ms
[2020-06-04 23:18:33] [INFO ] Deduced a trap composed of 6 places in 134 ms
[2020-06-04 23:18:33] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 13501 ms
[2020-06-04 23:18:33] [INFO ] Computed and/alt/rep : 791/2514/791 causal constraints in 47 ms.
[2020-06-04 23:18:51] [INFO ] Added : 725 causal constraints over 145 iterations in 18706 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 64 ms.
[2020-06-04 23:18:52] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2020-06-04 23:18:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 19 ms.
[2020-06-04 23:18:52] [INFO ] Flatten gal took : 135 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldPPPs-PT-030B @ 3570 seconds

FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-03 FALSE 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: 12643912 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16318632 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="ShieldPPPs-PT-030B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldPPPs-PT-030B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033477600519"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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