Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853600743.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Peterson-PT-6, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853600743
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 66K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 54K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 187K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 84K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 254K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 96K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 250K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 211K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 45K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 1.5M Apr 27 15:14 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-00
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-01
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-02
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-03
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-04
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-05
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-06
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-07
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-08
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-09
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-10
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-11
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-12
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-13
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-14
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591166843914

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:47:26] [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-03 06:47:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:47:26] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2020-06-03 06:47:26] [INFO ] Transformed 1330 places.
[2020-06-03 06:47:26] [INFO ] Transformed 2030 transitions.
[2020-06-03 06:47:26] [INFO ] Parsed PT model containing 1330 places and 2030 transitions in 243 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 91 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-6-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 87 ms. (steps per millisecond=114 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0]
FORMULA Peterson-PT-6-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2020-06-03 06:47:27] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2020-06-03 06:47:27] [INFO ] Computed 27 place invariants in 62 ms
[2020-06-03 06:47:27] [INFO ] [Real]Absence check using 20 positive place invariants in 77 ms returned sat
[2020-06-03 06:47:27] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 14 ms returned sat
[2020-06-03 06:47:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:47:32] [INFO ] [Real]Absence check using state equation in 4653 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 06:47:32] [INFO ] [Real]Absence check using 20 positive place invariants in 120 ms returned sat
[2020-06-03 06:47:32] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 14 ms returned sat
[2020-06-03 06:47:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:47:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 06:47:37] [INFO ] [Real]Absence check using state equation in 4721 ms returned (error "Failed to check-sat")
[2020-06-03 06:47:37] [INFO ] [Real]Absence check using 20 positive place invariants in 46 ms returned sat
[2020-06-03 06:47:37] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2020-06-03 06:47:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:47:41] [INFO ] [Real]Absence check using state equation in 4268 ms returned sat
[2020-06-03 06:47:42] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 06:47:42] [INFO ] [Real]Added 366 Read/Feed constraints in 79 ms returned sat
[2020-06-03 06:47:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:47:42] [INFO ] [Nat]Absence check using 20 positive place invariants in 141 ms returned sat
[2020-06-03 06:47:42] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 17 ms returned sat
[2020-06-03 06:47:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:47:47] [INFO ] [Nat]Absence check using state equation in 4347 ms returned sat
[2020-06-03 06:47:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 06:47:47] [INFO ] [Nat]Added 366 Read/Feed constraints in 127 ms returned (error "Failed to check-sat")
[2020-06-03 06:47:47] [INFO ] [Real]Absence check using 20 positive place invariants in 43 ms returned sat
[2020-06-03 06:47:47] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2020-06-03 06:47:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:47:51] [INFO ] [Real]Absence check using state equation in 3792 ms returned sat
[2020-06-03 06:47:51] [INFO ] [Real]Added 366 Read/Feed constraints in 96 ms returned sat
[2020-06-03 06:47:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:47:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 44 ms returned sat
[2020-06-03 06:47:51] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2020-06-03 06:47:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:47:55] [INFO ] [Nat]Absence check using state equation in 4111 ms returned sat
[2020-06-03 06:47:56] [INFO ] [Nat]Added 366 Read/Feed constraints in 133 ms returned sat
[2020-06-03 06:47:57] [INFO ] Deduced a trap composed of 59 places in 1315 ms
[2020-06-03 06:47:57] [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 (> (+ s1 s3 s10 s40 s41 s90 s311 s313 s318 s320 s327 s360 s361 s408 s409 s430 s439 s457 s639 s645 s666 s671 s673 s679 s681 s683 s731 s735 s757 s904 s905 s912 s913 s943 s950 s952 s962 s981 s989 s991 s998 s1095 s1123 s1165 s1175 s1177 s1179 s1184 s1188 s1192 s1197 s1201 s1203 s1207 s1211 s1297 s1299 s1306 s1308) 0)") while checking expression at index 3
[2020-06-03 06:47:57] [INFO ] [Real]Absence check using 20 positive place invariants in 44 ms returned sat
[2020-06-03 06:47:57] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 8 ms returned sat
[2020-06-03 06:47:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:48:01] [INFO ] [Real]Absence check using state equation in 4014 ms returned sat
[2020-06-03 06:48:01] [INFO ] [Real]Added 366 Read/Feed constraints in 108 ms returned sat
[2020-06-03 06:48:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:48:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 47 ms returned sat
[2020-06-03 06:48:02] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2020-06-03 06:48:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:48:06] [INFO ] [Nat]Absence check using state equation in 4536 ms returned sat
[2020-06-03 06:48:06] [INFO ] [Nat]Added 366 Read/Feed constraints in 195 ms returned sat
[2020-06-03 06:48:08] [INFO ] Deduced a trap composed of 22 places in 1283 ms
[2020-06-03 06:48:08] [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 (> (+ s331 s379 s670 s682 s691 s908 s929 s947 s1020 s1167 s1172 s1173 s1176 s1178 s1183 s1190 s1193 s1196 s1199 s1204 s1209 s1307) 0)") while checking expression at index 4
[2020-06-03 06:48:08] [INFO ] [Real]Absence check using 20 positive place invariants in 47 ms returned sat
[2020-06-03 06:48:08] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2020-06-03 06:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:48:12] [INFO ] [Real]Absence check using state equation in 4017 ms returned sat
[2020-06-03 06:48:12] [INFO ] [Real]Added 366 Read/Feed constraints in 140 ms returned sat
[2020-06-03 06:48:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:48:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 47 ms returned sat
[2020-06-03 06:48:12] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 13 ms returned sat
[2020-06-03 06:48:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:48:17] [INFO ] [Nat]Absence check using state equation in 4201 ms returned sat
[2020-06-03 06:48:17] [INFO ] [Nat]Added 366 Read/Feed constraints in 130 ms returned sat
[2020-06-03 06:48:18] [INFO ] Deduced a trap composed of 60 places in 1036 ms
[2020-06-03 06:48:18] [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 (> (+ s0 s7 s44 s52 s79 s88 s286 s287 s310 s313 s318 s321 s327 s330 s357 s366 s412 s436 s443 s451 s460 s641 s668 s671 s673 s682 s683 s695 s720 s726 s739 s762 s896 s901 s904 s905 s909 s936 s943 s946 s950 s953 s993 s1002 s1085 s1094 s1118 s1142 s1166 s1180 s1181 s1187 s1202 s1212 s1286 s1291 s1294 s1297 s1306 s1307) 0)") while checking expression at index 5
[2020-06-03 06:48:18] [INFO ] [Real]Absence check using 20 positive place invariants in 44 ms returned sat
[2020-06-03 06:48:18] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 8 ms returned sat
[2020-06-03 06:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:48:22] [INFO ] [Real]Absence check using state equation in 3832 ms returned sat
[2020-06-03 06:48:22] [INFO ] [Real]Added 366 Read/Feed constraints in 133 ms returned sat
[2020-06-03 06:48:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:48:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 46 ms returned sat
[2020-06-03 06:48:22] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 15 ms returned sat
[2020-06-03 06:48:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:48:26] [INFO ] [Nat]Absence check using state equation in 3946 ms returned sat
[2020-06-03 06:48:26] [INFO ] [Nat]Added 366 Read/Feed constraints in 188 ms returned sat
[2020-06-03 06:48:28] [INFO ] Deduced a trap composed of 12 places in 1330 ms
[2020-06-03 06:48:28] [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 (> (+ s331 s670 s682 s908 s947 s1172 s1176 s1178 s1183 s1193 s1204 s1307) 0)") while checking expression at index 6
Support contains 88 out of 1330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 553 Post agglomeration using F-continuation condition.Transition count delta: 553
Iterating post reduction 0 with 553 rules applied. Total rules applied 553 place count 1330 transition count 1477
Reduce places removed 553 places and 0 transitions.
Iterating post reduction 1 with 553 rules applied. Total rules applied 1106 place count 777 transition count 1477
Performed 287 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 287 Pre rules applied. Total rules applied 1106 place count 777 transition count 1190
Deduced a syphon composed of 287 places in 2 ms
Reduce places removed 287 places and 0 transitions.
Iterating global reduction 2 with 574 rules applied. Total rules applied 1680 place count 490 transition count 1190
Applied a total of 1680 rules in 457 ms. Remains 490 /1330 variables (removed 840) and now considering 1190/2030 (removed 840) transitions.
Finished structural reductions, in 1 iterations. Remains : 490/1330 places, 1190/2030 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3853 ms. (steps per millisecond=259 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1428 ms. (steps per millisecond=700 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 897 ms. (steps per millisecond=1114 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 957 ms. (steps per millisecond=1044 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 872 ms. (steps per millisecond=1146 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 927 ms. (steps per millisecond=1078 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1134 ms. (steps per millisecond=881 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 9718008 steps, run timeout after 30001 ms. (steps per millisecond=323 ) properties seen :[0, 0, 0, 1, 0, 0, 0]
Probabilistic random walk after 9718008 steps, saw 1214752 distinct states, run finished after 30001 ms. (steps per millisecond=323 ) properties seen :[0, 0, 0, 1, 0, 0, 0]
FORMULA Peterson-PT-6-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2020-06-03 06:49:09] [INFO ] Flow matrix only has 980 transitions (discarded 210 similar events)
// Phase 1: matrix 980 rows 490 cols
[2020-06-03 06:49:09] [INFO ] Computed 27 place invariants in 4 ms
[2020-06-03 06:49:09] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2020-06-03 06:49:09] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 13 ms returned sat
[2020-06-03 06:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:49:10] [INFO ] [Real]Absence check using state equation in 778 ms returned sat
[2020-06-03 06:49:10] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 06:49:10] [INFO ] [Real]Added 366 Read/Feed constraints in 65 ms returned sat
[2020-06-03 06:49:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:49:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2020-06-03 06:49:10] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 12 ms returned sat
[2020-06-03 06:49:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:49:11] [INFO ] [Nat]Absence check using state equation in 741 ms returned sat
[2020-06-03 06:49:11] [INFO ] [Nat]Added 366 Read/Feed constraints in 63 ms returned sat
[2020-06-03 06:49:12] [INFO ] Deduced a trap composed of 10 places in 775 ms
[2020-06-03 06:49:12] [INFO ] Deduced a trap composed of 29 places in 261 ms
[2020-06-03 06:49:12] [INFO ] Deduced a trap composed of 12 places in 250 ms
[2020-06-03 06:49:13] [INFO ] Deduced a trap composed of 10 places in 248 ms
[2020-06-03 06:49:13] [INFO ] Deduced a trap composed of 20 places in 269 ms
[2020-06-03 06:49:13] [INFO ] Deduced a trap composed of 10 places in 263 ms
[2020-06-03 06:49:14] [INFO ] Deduced a trap composed of 10 places in 260 ms
[2020-06-03 06:49:14] [INFO ] Deduced a trap composed of 10 places in 238 ms
[2020-06-03 06:49:14] [INFO ] Deduced a trap composed of 11 places in 234 ms
[2020-06-03 06:49:14] [INFO ] Deduced a trap composed of 20 places in 235 ms
[2020-06-03 06:49:15] [INFO ] Deduced a trap composed of 23 places in 239 ms
[2020-06-03 06:49:15] [INFO ] Deduced a trap composed of 23 places in 223 ms
[2020-06-03 06:49:15] [INFO ] Deduced a trap composed of 19 places in 218 ms
[2020-06-03 06:49:16] [INFO ] Deduced a trap composed of 53 places in 255 ms
[2020-06-03 06:49:16] [INFO ] Deduced a trap composed of 20 places in 278 ms
[2020-06-03 06:49:16] [INFO ] Deduced a trap composed of 53 places in 268 ms
[2020-06-03 06:49:16] [INFO ] Deduced a trap composed of 63 places in 255 ms
[2020-06-03 06:49:17] [INFO ] Deduced a trap composed of 20 places in 233 ms
[2020-06-03 06:49:17] [INFO ] Deduced a trap composed of 22 places in 263 ms
[2020-06-03 06:49:17] [INFO ] Deduced a trap composed of 46 places in 233 ms
[2020-06-03 06:49:18] [INFO ] Deduced a trap composed of 40 places in 221 ms
[2020-06-03 06:49:18] [INFO ] Deduced a trap composed of 54 places in 247 ms
[2020-06-03 06:49:18] [INFO ] Deduced a trap composed of 20 places in 237 ms
[2020-06-03 06:49:18] [INFO ] Deduced a trap composed of 38 places in 216 ms
[2020-06-03 06:49:19] [INFO ] Deduced a trap composed of 41 places in 182 ms
[2020-06-03 06:49:19] [INFO ] Deduced a trap composed of 29 places in 261 ms
[2020-06-03 06:49:19] [INFO ] Deduced a trap composed of 27 places in 211 ms
[2020-06-03 06:49:19] [INFO ] Deduced a trap composed of 29 places in 194 ms
[2020-06-03 06:49:20] [INFO ] Deduced a trap composed of 34 places in 184 ms
[2020-06-03 06:49:20] [INFO ] Deduced a trap composed of 29 places in 182 ms
[2020-06-03 06:49:20] [INFO ] Deduced a trap composed of 29 places in 210 ms
[2020-06-03 06:49:20] [INFO ] Deduced a trap composed of 29 places in 216 ms
[2020-06-03 06:49:20] [INFO ] Deduced a trap composed of 39 places in 165 ms
[2020-06-03 06:49:21] [INFO ] Deduced a trap composed of 43 places in 198 ms
[2020-06-03 06:49:21] [INFO ] Deduced a trap composed of 43 places in 160 ms
[2020-06-03 06:49:21] [INFO ] Deduced a trap composed of 42 places in 160 ms
[2020-06-03 06:49:21] [INFO ] Deduced a trap composed of 39 places in 188 ms
[2020-06-03 06:49:22] [INFO ] Deduced a trap composed of 66 places in 240 ms
[2020-06-03 06:49:22] [INFO ] Deduced a trap composed of 43 places in 188 ms
[2020-06-03 06:49:22] [INFO ] Deduced a trap composed of 70 places in 175 ms
[2020-06-03 06:49:22] [INFO ] Deduced a trap composed of 41 places in 137 ms
[2020-06-03 06:49:22] [INFO ] Deduced a trap composed of 54 places in 166 ms
[2020-06-03 06:49:23] [INFO ] Deduced a trap composed of 47 places in 212 ms
[2020-06-03 06:49:23] [INFO ] Deduced a trap composed of 53 places in 176 ms
[2020-06-03 06:49:23] [INFO ] Deduced a trap composed of 88 places in 150 ms
[2020-06-03 06:49:23] [INFO ] Deduced a trap composed of 58 places in 155 ms
[2020-06-03 06:49:23] [INFO ] Deduced a trap composed of 53 places in 137 ms
[2020-06-03 06:49:24] [INFO ] Deduced a trap composed of 41 places in 129 ms
[2020-06-03 06:49:24] [INFO ] Deduced a trap composed of 40 places in 191 ms
[2020-06-03 06:49:24] [INFO ] Deduced a trap composed of 64 places in 136 ms
[2020-06-03 06:49:24] [INFO ] Deduced a trap composed of 63 places in 147 ms
[2020-06-03 06:49:24] [INFO ] Deduced a trap composed of 65 places in 157 ms
[2020-06-03 06:49:24] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 13329 ms
[2020-06-03 06:49:24] [INFO ] Computed and/alt/rep : 1183/8222/973 causal constraints in 73 ms.
[2020-06-03 06:49:42] [INFO ] Added : 762 causal constraints over 153 iterations in 17615 ms. Result :sat
[2020-06-03 06:49:42] [INFO ] Deduced a trap composed of 31 places in 332 ms
[2020-06-03 06:49:43] [INFO ] Deduced a trap composed of 21 places in 279 ms
[2020-06-03 06:49:43] [INFO ] Deduced a trap composed of 31 places in 266 ms
[2020-06-03 06:49:44] [INFO ] Deduced a trap composed of 87 places in 257 ms
[2020-06-03 06:49:44] [INFO ] Deduced a trap composed of 42 places in 282 ms
[2020-06-03 06:49:44] [INFO ] Deduced a trap composed of 41 places in 277 ms
[2020-06-03 06:49:45] [INFO ] Deduced a trap composed of 43 places in 281 ms
[2020-06-03 06:49:45] [INFO ] Deduced a trap composed of 68 places in 331 ms
[2020-06-03 06:49:46] [INFO ] Deduced a trap composed of 33 places in 297 ms
[2020-06-03 06:49:46] [INFO ] Deduced a trap composed of 22 places in 315 ms
[2020-06-03 06:49:47] [INFO ] Deduced a trap composed of 29 places in 271 ms
[2020-06-03 06:49:47] [INFO ] Deduced a trap composed of 104 places in 271 ms
[2020-06-03 06:49:48] [INFO ] Deduced a trap composed of 30 places in 243 ms
[2020-06-03 06:49:48] [INFO ] Deduced a trap composed of 60 places in 296 ms
[2020-06-03 06:49:48] [INFO ] Deduced a trap composed of 48 places in 291 ms
[2020-06-03 06:49:49] [INFO ] Deduced a trap composed of 37 places in 248 ms
[2020-06-03 06:49:49] [INFO ] Deduced a trap composed of 66 places in 234 ms
[2020-06-03 06:49:50] [INFO ] Deduced a trap composed of 46 places in 332 ms
[2020-06-03 06:49:50] [INFO ] Deduced a trap composed of 62 places in 222 ms
[2020-06-03 06:49:51] [INFO ] Deduced a trap composed of 42 places in 283 ms
[2020-06-03 06:49:51] [INFO ] Deduced a trap composed of 68 places in 214 ms
[2020-06-03 06:49:51] [INFO ] Deduced a trap composed of 62 places in 171 ms
[2020-06-03 06:49:52] [INFO ] Deduced a trap composed of 50 places in 123 ms
[2020-06-03 06:49:52] [INFO ] Deduced a trap composed of 50 places in 142 ms
[2020-06-03 06:49:52] [INFO ] Deduced a trap composed of 60 places in 178 ms
[2020-06-03 06:49:52] [INFO ] Deduced a trap composed of 52 places in 147 ms
[2020-06-03 06:49:53] [INFO ] Deduced a trap composed of 51 places in 125 ms
[2020-06-03 06:49:53] [INFO ] Deduced a trap composed of 39 places in 232 ms
[2020-06-03 06:49:53] [INFO ] Deduced a trap composed of 12 places in 289 ms
[2020-06-03 06:49:54] [INFO ] Deduced a trap composed of 50 places in 239 ms
[2020-06-03 06:49:54] [INFO ] Deduced a trap composed of 13 places in 265 ms
[2020-06-03 06:49:54] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 12325 ms
Attempting to minimize the solution found.
Minimization took 105 ms.
[2020-06-03 06:49:55] [INFO ] [Real]Absence check using 20 positive place invariants in 33 ms returned sat
[2020-06-03 06:49:55] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-06-03 06:49:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:49:56] [INFO ] [Real]Absence check using state equation in 960 ms returned sat
[2020-06-03 06:49:56] [INFO ] [Real]Added 366 Read/Feed constraints in 98 ms returned sat
[2020-06-03 06:49:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:49:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 34 ms returned sat
[2020-06-03 06:49:56] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2020-06-03 06:49:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:49:57] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2020-06-03 06:49:57] [INFO ] [Nat]Added 366 Read/Feed constraints in 55 ms returned sat
[2020-06-03 06:49:57] [INFO ] Deduced a trap composed of 31 places in 313 ms
[2020-06-03 06:49:57] [INFO ] Deduced a trap composed of 22 places in 297 ms
[2020-06-03 06:49:58] [INFO ] Deduced a trap composed of 11 places in 271 ms
[2020-06-03 06:49:58] [INFO ] Deduced a trap composed of 62 places in 273 ms
[2020-06-03 06:49:58] [INFO ] Deduced a trap composed of 33 places in 208 ms
[2020-06-03 06:49:59] [INFO ] Deduced a trap composed of 42 places in 380 ms
[2020-06-03 06:49:59] [INFO ] Deduced a trap composed of 25 places in 235 ms
[2020-06-03 06:49:59] [INFO ] Deduced a trap composed of 63 places in 227 ms
[2020-06-03 06:49:59] [INFO ] Deduced a trap composed of 21 places in 239 ms
[2020-06-03 06:50:00] [INFO ] Deduced a trap composed of 20 places in 220 ms
[2020-06-03 06:50:00] [INFO ] Deduced a trap composed of 72 places in 246 ms
[2020-06-03 06:50:00] [INFO ] Deduced a trap composed of 21 places in 231 ms
[2020-06-03 06:50:00] [INFO ] Deduced a trap composed of 48 places in 236 ms
[2020-06-03 06:50:01] [INFO ] Deduced a trap composed of 53 places in 202 ms
[2020-06-03 06:50:01] [INFO ] Deduced a trap composed of 24 places in 204 ms
[2020-06-03 06:50:01] [INFO ] Deduced a trap composed of 30 places in 278 ms
[2020-06-03 06:50:01] [INFO ] Deduced a trap composed of 38 places in 243 ms
[2020-06-03 06:50:02] [INFO ] Deduced a trap composed of 10 places in 244 ms
[2020-06-03 06:50:02] [INFO ] Deduced a trap composed of 73 places in 218 ms
[2020-06-03 06:50:02] [INFO ] Deduced a trap composed of 10 places in 262 ms
[2020-06-03 06:50:03] [INFO ] Deduced a trap composed of 29 places in 240 ms
[2020-06-03 06:50:03] [INFO ] Deduced a trap composed of 31 places in 238 ms
[2020-06-03 06:50:03] [INFO ] Deduced a trap composed of 26 places in 238 ms
[2020-06-03 06:50:03] [INFO ] Deduced a trap composed of 10 places in 239 ms
[2020-06-03 06:50:04] [INFO ] Deduced a trap composed of 13 places in 268 ms
[2020-06-03 06:50:04] [INFO ] Deduced a trap composed of 45 places in 253 ms
[2020-06-03 06:50:04] [INFO ] Deduced a trap composed of 12 places in 228 ms
[2020-06-03 06:50:04] [INFO ] Deduced a trap composed of 21 places in 224 ms
[2020-06-03 06:50:05] [INFO ] Deduced a trap composed of 20 places in 246 ms
[2020-06-03 06:50:05] [INFO ] Deduced a trap composed of 42 places in 227 ms
[2020-06-03 06:50:05] [INFO ] Deduced a trap composed of 61 places in 289 ms
[2020-06-03 06:50:06] [INFO ] Deduced a trap composed of 13 places in 254 ms
[2020-06-03 06:50:06] [INFO ] Deduced a trap composed of 55 places in 258 ms
[2020-06-03 06:50:06] [INFO ] Deduced a trap composed of 55 places in 257 ms
[2020-06-03 06:50:06] [INFO ] Deduced a trap composed of 31 places in 217 ms
[2020-06-03 06:50:07] [INFO ] Deduced a trap composed of 53 places in 267 ms
[2020-06-03 06:50:07] [INFO ] Deduced a trap composed of 61 places in 247 ms
[2020-06-03 06:50:07] [INFO ] Deduced a trap composed of 42 places in 208 ms
[2020-06-03 06:50:07] [INFO ] Deduced a trap composed of 44 places in 192 ms
[2020-06-03 06:50:08] [INFO ] Deduced a trap composed of 42 places in 188 ms
[2020-06-03 06:50:08] [INFO ] Deduced a trap composed of 43 places in 227 ms
[2020-06-03 06:50:08] [INFO ] Deduced a trap composed of 29 places in 248 ms
[2020-06-03 06:50:08] [INFO ] Deduced a trap composed of 48 places in 212 ms
[2020-06-03 06:50:09] [INFO ] Deduced a trap composed of 53 places in 217 ms
[2020-06-03 06:50:09] [INFO ] Deduced a trap composed of 57 places in 173 ms
[2020-06-03 06:50:09] [INFO ] Deduced a trap composed of 57 places in 190 ms
[2020-06-03 06:50:09] [INFO ] Deduced a trap composed of 57 places in 186 ms
[2020-06-03 06:50:10] [INFO ] Deduced a trap composed of 44 places in 164 ms
[2020-06-03 06:50:10] [INFO ] Deduced a trap composed of 48 places in 137 ms
[2020-06-03 06:50:10] [INFO ] Deduced a trap composed of 32 places in 207 ms
[2020-06-03 06:50:10] [INFO ] Deduced a trap composed of 34 places in 261 ms
[2020-06-03 06:50:11] [INFO ] Deduced a trap composed of 20 places in 238 ms
[2020-06-03 06:50:11] [INFO ] Deduced a trap composed of 14 places in 246 ms
[2020-06-03 06:50:11] [INFO ] Deduced a trap composed of 44 places in 230 ms
[2020-06-03 06:50:11] [INFO ] Deduced a trap composed of 12 places in 252 ms
[2020-06-03 06:50:12] [INFO ] Deduced a trap composed of 30 places in 250 ms
[2020-06-03 06:50:12] [INFO ] Deduced a trap composed of 11 places in 228 ms
[2020-06-03 06:50:12] [INFO ] Deduced a trap composed of 42 places in 159 ms
[2020-06-03 06:50:12] [INFO ] Deduced a trap composed of 50 places in 162 ms
[2020-06-03 06:50:13] [INFO ] Deduced a trap composed of 61 places in 159 ms
[2020-06-03 06:50:13] [INFO ] Deduced a trap composed of 62 places in 157 ms
[2020-06-03 06:50:13] [INFO ] Deduced a trap composed of 60 places in 195 ms
[2020-06-03 06:50:13] [INFO ] Trap strengthening (SAT) tested/added 63/62 trap constraints in 16404 ms
[2020-06-03 06:50:13] [INFO ] Computed and/alt/rep : 1183/8222/973 causal constraints in 107 ms.
[2020-06-03 06:50:33] [INFO ] Added : 725 causal constraints over 145 iterations in 20090 ms.(timeout) Result :sat
[2020-06-03 06:50:33] [INFO ] Deduced a trap composed of 31 places in 232 ms
[2020-06-03 06:50:34] [INFO ] Deduced a trap composed of 52 places in 183 ms
[2020-06-03 06:50:34] [INFO ] Deduced a trap composed of 45 places in 213 ms
[2020-06-03 06:50:34] [INFO ] Deduced a trap composed of 58 places in 188 ms
[2020-06-03 06:50:35] [INFO ] Deduced a trap composed of 42 places in 164 ms
[2020-06-03 06:50:35] [INFO ] Deduced a trap composed of 61 places in 158 ms
[2020-06-03 06:50:35] [INFO ] Deduced a trap composed of 51 places in 165 ms
[2020-06-03 06:50:36] [INFO ] Deduced a trap composed of 43 places in 158 ms
[2020-06-03 06:50:37] [INFO ] Deduced a trap composed of 15 places in 236 ms
[2020-06-03 06:50:37] [INFO ] Deduced a trap composed of 15 places in 235 ms
[2020-06-03 06:50:37] [INFO ] Deduced a trap composed of 21 places in 219 ms
[2020-06-03 06:50:38] [INFO ] Deduced a trap composed of 53 places in 173 ms
[2020-06-03 06:50:39] [INFO ] Deduced a trap composed of 24 places in 279 ms
[2020-06-03 06:50:39] [INFO ] Deduced a trap composed of 30 places in 301 ms
[2020-06-03 06:50:39] [INFO ] Deduced a trap composed of 120 places in 264 ms
[2020-06-03 06:50:40] [INFO ] Deduced a trap composed of 13 places in 238 ms
[2020-06-03 06:50:40] [INFO ] Deduced a trap composed of 10 places in 254 ms
[2020-06-03 06:50:41] [INFO ] Deduced a trap composed of 20 places in 240 ms
[2020-06-03 06:50:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 06:50:41] [INFO ] Deduced a trap composed of 58 places in 301 ms
[2020-06-03 06:50:41] [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 (> (+ s37 s44 s45 s58 s64 s68 s70 s76 s82 s87 s96 s104 s108 s112 s114 s125 s133 s135 s147 s151 s155 s165 s170 s173 s176 s184 s194 s200 s204 s208 s216 s224 s225 s237 s248 s250 s255 s264 s267 s274 s285 s294 s300 s307 s316 s331 s337 s338 s370 s372 s388 s394 s399 s408 s414 s421 s470 s486) 0)") while checking expression at index 1
[2020-06-03 06:50:41] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2020-06-03 06:50:41] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2020-06-03 06:50:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:50:42] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2020-06-03 06:50:42] [INFO ] [Real]Added 366 Read/Feed constraints in 105 ms returned sat
[2020-06-03 06:50:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:50:42] [INFO ] [Nat]Absence check using 20 positive place invariants in 29 ms returned sat
[2020-06-03 06:50:42] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2020-06-03 06:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:50:43] [INFO ] [Nat]Absence check using state equation in 871 ms returned sat
[2020-06-03 06:50:43] [INFO ] [Nat]Added 366 Read/Feed constraints in 53 ms returned sat
[2020-06-03 06:50:44] [INFO ] Deduced a trap composed of 21 places in 454 ms
[2020-06-03 06:50:44] [INFO ] Deduced a trap composed of 20 places in 261 ms
[2020-06-03 06:50:44] [INFO ] Deduced a trap composed of 31 places in 272 ms
[2020-06-03 06:50:45] [INFO ] Deduced a trap composed of 12 places in 276 ms
[2020-06-03 06:50:45] [INFO ] Deduced a trap composed of 13 places in 288 ms
[2020-06-03 06:50:45] [INFO ] Deduced a trap composed of 12 places in 291 ms
[2020-06-03 06:50:45] [INFO ] Deduced a trap composed of 122 places in 258 ms
[2020-06-03 06:50:46] [INFO ] Deduced a trap composed of 33 places in 255 ms
[2020-06-03 06:50:46] [INFO ] Deduced a trap composed of 30 places in 260 ms
[2020-06-03 06:50:46] [INFO ] Deduced a trap composed of 30 places in 239 ms
[2020-06-03 06:50:47] [INFO ] Deduced a trap composed of 35 places in 236 ms
[2020-06-03 06:50:47] [INFO ] Deduced a trap composed of 53 places in 284 ms
[2020-06-03 06:50:47] [INFO ] Deduced a trap composed of 54 places in 281 ms
[2020-06-03 06:50:47] [INFO ] Deduced a trap composed of 25 places in 261 ms
[2020-06-03 06:50:48] [INFO ] Deduced a trap composed of 72 places in 242 ms
[2020-06-03 06:50:48] [INFO ] Deduced a trap composed of 21 places in 254 ms
[2020-06-03 06:50:48] [INFO ] Deduced a trap composed of 22 places in 293 ms
[2020-06-03 06:50:49] [INFO ] Deduced a trap composed of 22 places in 275 ms
[2020-06-03 06:50:49] [INFO ] Deduced a trap composed of 30 places in 290 ms
[2020-06-03 06:50:49] [INFO ] Deduced a trap composed of 42 places in 249 ms
[2020-06-03 06:50:50] [INFO ] Deduced a trap composed of 73 places in 260 ms
[2020-06-03 06:50:50] [INFO ] Deduced a trap composed of 61 places in 242 ms
[2020-06-03 06:50:50] [INFO ] Deduced a trap composed of 58 places in 241 ms
[2020-06-03 06:50:50] [INFO ] Deduced a trap composed of 56 places in 254 ms
[2020-06-03 06:50:51] [INFO ] Deduced a trap composed of 51 places in 235 ms
[2020-06-03 06:50:51] [INFO ] Deduced a trap composed of 61 places in 251 ms
[2020-06-03 06:50:51] [INFO ] Deduced a trap composed of 61 places in 220 ms
[2020-06-03 06:50:51] [INFO ] Deduced a trap composed of 42 places in 197 ms
[2020-06-03 06:50:52] [INFO ] Deduced a trap composed of 44 places in 214 ms
[2020-06-03 06:50:52] [INFO ] Deduced a trap composed of 48 places in 214 ms
[2020-06-03 06:50:52] [INFO ] Deduced a trap composed of 43 places in 197 ms
[2020-06-03 06:50:52] [INFO ] Deduced a trap composed of 12 places in 197 ms
[2020-06-03 06:50:53] [INFO ] Deduced a trap composed of 46 places in 197 ms
[2020-06-03 06:50:53] [INFO ] Deduced a trap composed of 11 places in 199 ms
[2020-06-03 06:50:53] [INFO ] Deduced a trap composed of 12 places in 200 ms
[2020-06-03 06:50:53] [INFO ] Deduced a trap composed of 22 places in 252 ms
[2020-06-03 06:50:54] [INFO ] Deduced a trap composed of 12 places in 220 ms
[2020-06-03 06:50:54] [INFO ] Deduced a trap composed of 12 places in 193 ms
[2020-06-03 06:50:54] [INFO ] Deduced a trap composed of 42 places in 156 ms
[2020-06-03 06:50:54] [INFO ] Deduced a trap composed of 54 places in 193 ms
[2020-06-03 06:50:54] [INFO ] Deduced a trap composed of 50 places in 190 ms
[2020-06-03 06:50:55] [INFO ] Deduced a trap composed of 56 places in 204 ms
[2020-06-03 06:50:55] [INFO ] Deduced a trap composed of 45 places in 199 ms
[2020-06-03 06:50:55] [INFO ] Deduced a trap composed of 51 places in 159 ms
[2020-06-03 06:50:55] [INFO ] Deduced a trap composed of 51 places in 121 ms
[2020-06-03 06:50:55] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 12134 ms
[2020-06-03 06:50:55] [INFO ] Computed and/alt/rep : 1183/8222/973 causal constraints in 44 ms.
[2020-06-03 06:51:15] [INFO ] Added : 811 causal constraints over 163 iterations in 19867 ms. Result :sat
[2020-06-03 06:51:15] [INFO ] Deduced a trap composed of 55 places in 263 ms
[2020-06-03 06:51:16] [INFO ] Deduced a trap composed of 52 places in 232 ms
[2020-06-03 06:51:16] [INFO ] Deduced a trap composed of 34 places in 226 ms
[2020-06-03 06:51:17] [INFO ] Deduced a trap composed of 41 places in 225 ms
[2020-06-03 06:51:17] [INFO ] Deduced a trap composed of 31 places in 242 ms
[2020-06-03 06:51:17] [INFO ] Deduced a trap composed of 30 places in 259 ms
[2020-06-03 06:51:18] [INFO ] Deduced a trap composed of 77 places in 203 ms
[2020-06-03 06:51:18] [INFO ] Deduced a trap composed of 51 places in 197 ms
[2020-06-03 06:51:19] [INFO ] Deduced a trap composed of 59 places in 163 ms
[2020-06-03 06:51:19] [INFO ] Deduced a trap composed of 67 places in 193 ms
[2020-06-03 06:51:19] [INFO ] Deduced a trap composed of 60 places in 211 ms
[2020-06-03 06:51:20] [INFO ] Deduced a trap composed of 66 places in 197 ms
[2020-06-03 06:51:20] [INFO ] Deduced a trap composed of 74 places in 206 ms
[2020-06-03 06:51:20] [INFO ] Deduced a trap composed of 53 places in 207 ms
[2020-06-03 06:51:21] [INFO ] Deduced a trap composed of 58 places in 185 ms
[2020-06-03 06:51:21] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5669 ms
Attempting to minimize the solution found.
Minimization took 107 ms.
[2020-06-03 06:51:21] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2020-06-03 06:51:21] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-06-03 06:51:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:51:22] [INFO ] [Real]Absence check using state equation in 723 ms returned sat
[2020-06-03 06:51:22] [INFO ] [Real]Added 366 Read/Feed constraints in 47 ms returned sat
[2020-06-03 06:51:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:51:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2020-06-03 06:51:22] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-06-03 06:51:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:51:23] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2020-06-03 06:51:23] [INFO ] [Nat]Added 366 Read/Feed constraints in 55 ms returned sat
[2020-06-03 06:51:23] [INFO ] Deduced a trap composed of 10 places in 247 ms
[2020-06-03 06:51:23] [INFO ] Deduced a trap composed of 10 places in 231 ms
[2020-06-03 06:51:24] [INFO ] Deduced a trap composed of 21 places in 230 ms
[2020-06-03 06:51:24] [INFO ] Deduced a trap composed of 29 places in 237 ms
[2020-06-03 06:51:24] [INFO ] Deduced a trap composed of 35 places in 213 ms
[2020-06-03 06:51:24] [INFO ] Deduced a trap composed of 61 places in 222 ms
[2020-06-03 06:51:25] [INFO ] Deduced a trap composed of 30 places in 230 ms
[2020-06-03 06:51:25] [INFO ] Deduced a trap composed of 30 places in 256 ms
[2020-06-03 06:51:25] [INFO ] Deduced a trap composed of 29 places in 245 ms
[2020-06-03 06:51:25] [INFO ] Deduced a trap composed of 13 places in 270 ms
[2020-06-03 06:51:26] [INFO ] Deduced a trap composed of 85 places in 223 ms
[2020-06-03 06:51:26] [INFO ] Deduced a trap composed of 35 places in 227 ms
[2020-06-03 06:51:26] [INFO ] Deduced a trap composed of 22 places in 207 ms
[2020-06-03 06:51:26] [INFO ] Deduced a trap composed of 22 places in 252 ms
[2020-06-03 06:51:27] [INFO ] Deduced a trap composed of 20 places in 235 ms
[2020-06-03 06:51:27] [INFO ] Deduced a trap composed of 35 places in 199 ms
[2020-06-03 06:51:27] [INFO ] Deduced a trap composed of 12 places in 245 ms
[2020-06-03 06:51:27] [INFO ] Deduced a trap composed of 44 places in 199 ms
[2020-06-03 06:51:28] [INFO ] Deduced a trap composed of 43 places in 223 ms
[2020-06-03 06:51:28] [INFO ] Deduced a trap composed of 43 places in 242 ms
[2020-06-03 06:51:28] [INFO ] Deduced a trap composed of 98 places in 215 ms
[2020-06-03 06:51:28] [INFO ] Deduced a trap composed of 98 places in 192 ms
[2020-06-03 06:51:29] [INFO ] Deduced a trap composed of 46 places in 218 ms
[2020-06-03 06:51:29] [INFO ] Deduced a trap composed of 63 places in 157 ms
[2020-06-03 06:51:29] [INFO ] Deduced a trap composed of 48 places in 200 ms
[2020-06-03 06:51:29] [INFO ] Deduced a trap composed of 77 places in 184 ms
[2020-06-03 06:51:30] [INFO ] Deduced a trap composed of 58 places in 204 ms
[2020-06-03 06:51:30] [INFO ] Deduced a trap composed of 45 places in 196 ms
[2020-06-03 06:51:30] [INFO ] Deduced a trap composed of 51 places in 201 ms
[2020-06-03 06:51:30] [INFO ] Deduced a trap composed of 43 places in 183 ms
[2020-06-03 06:51:31] [INFO ] Deduced a trap composed of 54 places in 180 ms
[2020-06-03 06:51:31] [INFO ] Deduced a trap composed of 42 places in 218 ms
[2020-06-03 06:51:31] [INFO ] Deduced a trap composed of 51 places in 185 ms
[2020-06-03 06:51:31] [INFO ] Deduced a trap composed of 52 places in 210 ms
[2020-06-03 06:51:31] [INFO ] Deduced a trap composed of 47 places in 203 ms
[2020-06-03 06:51:32] [INFO ] Deduced a trap composed of 60 places in 141 ms
[2020-06-03 06:51:32] [INFO ] Deduced a trap composed of 59 places in 158 ms
[2020-06-03 06:51:32] [INFO ] Deduced a trap composed of 12 places in 208 ms
[2020-06-03 06:51:32] [INFO ] Deduced a trap composed of 13 places in 228 ms
[2020-06-03 06:51:33] [INFO ] Deduced a trap composed of 21 places in 243 ms
[2020-06-03 06:51:33] [INFO ] Deduced a trap composed of 22 places in 220 ms
[2020-06-03 06:51:33] [INFO ] Deduced a trap composed of 23 places in 214 ms
[2020-06-03 06:51:33] [INFO ] Deduced a trap composed of 39 places in 251 ms
[2020-06-03 06:51:34] [INFO ] Deduced a trap composed of 24 places in 225 ms
[2020-06-03 06:51:34] [INFO ] Deduced a trap composed of 29 places in 206 ms
[2020-06-03 06:51:34] [INFO ] Deduced a trap composed of 53 places in 153 ms
[2020-06-03 06:51:34] [INFO ] Deduced a trap composed of 58 places in 154 ms
[2020-06-03 06:51:35] [INFO ] Deduced a trap composed of 60 places in 147 ms
[2020-06-03 06:51:35] [INFO ] Deduced a trap composed of 61 places in 158 ms
[2020-06-03 06:51:35] [INFO ] Deduced a trap composed of 60 places in 168 ms
[2020-06-03 06:51:35] [INFO ] Deduced a trap composed of 69 places in 156 ms
[2020-06-03 06:51:35] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 12428 ms
[2020-06-03 06:51:35] [INFO ] Computed and/alt/rep : 1183/8222/973 causal constraints in 47 ms.
[2020-06-03 06:51:57] [INFO ] Added : 895 causal constraints over 179 iterations in 22130 ms.(timeout) Result :sat
[2020-06-03 06:51:58] [INFO ] Deduced a trap composed of 31 places in 273 ms
[2020-06-03 06:51:58] [INFO ] Deduced a trap composed of 71 places in 182 ms
[2020-06-03 06:51:59] [INFO ] Deduced a trap composed of 11 places in 434 ms
[2020-06-03 06:51:59] [INFO ] Deduced a trap composed of 20 places in 294 ms
[2020-06-03 06:51:59] [INFO ] Deduced a trap composed of 21 places in 267 ms
[2020-06-03 06:52:00] [INFO ] Deduced a trap composed of 22 places in 311 ms
[2020-06-03 06:52:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2698 ms
Attempting to minimize the solution found.
Minimization took 135 ms.
[2020-06-03 06:52:00] [INFO ] [Real]Absence check using 20 positive place invariants in 23 ms returned sat
[2020-06-03 06:52:00] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2020-06-03 06:52:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:52:01] [INFO ] [Real]Absence check using state equation in 834 ms returned sat
[2020-06-03 06:52:01] [INFO ] [Real]Added 366 Read/Feed constraints in 63 ms returned sat
[2020-06-03 06:52:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:52:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 24 ms returned sat
[2020-06-03 06:52:01] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-06-03 06:52:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:52:02] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2020-06-03 06:52:02] [INFO ] [Nat]Added 366 Read/Feed constraints in 64 ms returned sat
[2020-06-03 06:52:02] [INFO ] Deduced a trap composed of 20 places in 253 ms
[2020-06-03 06:52:03] [INFO ] Deduced a trap composed of 31 places in 258 ms
[2020-06-03 06:52:03] [INFO ] Deduced a trap composed of 35 places in 235 ms
[2020-06-03 06:52:03] [INFO ] Deduced a trap composed of 28 places in 228 ms
[2020-06-03 06:52:04] [INFO ] Deduced a trap composed of 44 places in 243 ms
[2020-06-03 06:52:04] [INFO ] Deduced a trap composed of 31 places in 228 ms
[2020-06-03 06:52:04] [INFO ] Deduced a trap composed of 28 places in 229 ms
[2020-06-03 06:52:04] [INFO ] Deduced a trap composed of 20 places in 219 ms
[2020-06-03 06:52:05] [INFO ] Deduced a trap composed of 96 places in 222 ms
[2020-06-03 06:52:05] [INFO ] Deduced a trap composed of 21 places in 252 ms
[2020-06-03 06:52:05] [INFO ] Deduced a trap composed of 34 places in 240 ms
[2020-06-03 06:52:05] [INFO ] Deduced a trap composed of 53 places in 246 ms
[2020-06-03 06:52:06] [INFO ] Deduced a trap composed of 29 places in 239 ms
[2020-06-03 06:52:06] [INFO ] Deduced a trap composed of 47 places in 265 ms
[2020-06-03 06:52:06] [INFO ] Deduced a trap composed of 63 places in 296 ms
[2020-06-03 06:52:07] [INFO ] Deduced a trap composed of 42 places in 255 ms
[2020-06-03 06:52:07] [INFO ] Deduced a trap composed of 19 places in 236 ms
[2020-06-03 06:52:07] [INFO ] Deduced a trap composed of 57 places in 208 ms
[2020-06-03 06:52:07] [INFO ] Deduced a trap composed of 65 places in 274 ms
[2020-06-03 06:52:08] [INFO ] Deduced a trap composed of 49 places in 255 ms
[2020-06-03 06:52:08] [INFO ] Deduced a trap composed of 31 places in 467 ms
[2020-06-03 06:52:09] [INFO ] Deduced a trap composed of 52 places in 252 ms
[2020-06-03 06:52:09] [INFO ] Deduced a trap composed of 55 places in 537 ms
[2020-06-03 06:52:09] [INFO ] Deduced a trap composed of 49 places in 258 ms
[2020-06-03 06:52:10] [INFO ] Deduced a trap composed of 30 places in 228 ms
[2020-06-03 06:52:10] [INFO ] Deduced a trap composed of 12 places in 254 ms
[2020-06-03 06:52:10] [INFO ] Deduced a trap composed of 29 places in 213 ms
[2020-06-03 06:52:11] [INFO ] Deduced a trap composed of 31 places in 270 ms
[2020-06-03 06:52:11] [INFO ] Deduced a trap composed of 44 places in 298 ms
[2020-06-03 06:52:11] [INFO ] Deduced a trap composed of 22 places in 240 ms
[2020-06-03 06:52:11] [INFO ] Deduced a trap composed of 31 places in 263 ms
[2020-06-03 06:52:12] [INFO ] Deduced a trap composed of 70 places in 272 ms
[2020-06-03 06:52:12] [INFO ] Deduced a trap composed of 70 places in 282 ms
[2020-06-03 06:52:13] [INFO ] Deduced a trap composed of 23 places in 292 ms
[2020-06-03 06:52:13] [INFO ] Deduced a trap composed of 24 places in 270 ms
[2020-06-03 06:52:13] [INFO ] Deduced a trap composed of 54 places in 263 ms
[2020-06-03 06:52:13] [INFO ] Deduced a trap composed of 60 places in 234 ms
[2020-06-03 06:52:14] [INFO ] Deduced a trap composed of 42 places in 190 ms
[2020-06-03 06:52:14] [INFO ] Deduced a trap composed of 65 places in 212 ms
[2020-06-03 06:52:14] [INFO ] Deduced a trap composed of 77 places in 206 ms
[2020-06-03 06:52:14] [INFO ] Deduced a trap composed of 73 places in 190 ms
[2020-06-03 06:52:15] [INFO ] Deduced a trap composed of 20 places in 271 ms
[2020-06-03 06:52:15] [INFO ] Deduced a trap composed of 29 places in 252 ms
[2020-06-03 06:52:15] [INFO ] Deduced a trap composed of 29 places in 207 ms
[2020-06-03 06:52:16] [INFO ] Deduced a trap composed of 49 places in 224 ms
[2020-06-03 06:52:16] [INFO ] Deduced a trap composed of 44 places in 220 ms
[2020-06-03 06:52:16] [INFO ] Deduced a trap composed of 46 places in 249 ms
[2020-06-03 06:52:16] [INFO ] Deduced a trap composed of 20 places in 212 ms
[2020-06-03 06:52:17] [INFO ] Deduced a trap composed of 49 places in 211 ms
[2020-06-03 06:52:17] [INFO ] Deduced a trap composed of 25 places in 233 ms
[2020-06-03 06:52:17] [INFO ] Deduced a trap composed of 14 places in 262 ms
[2020-06-03 06:52:18] [INFO ] Deduced a trap composed of 51 places in 151 ms
[2020-06-03 06:52:18] [INFO ] Deduced a trap composed of 51 places in 180 ms
[2020-06-03 06:52:18] [INFO ] Deduced a trap composed of 51 places in 183 ms
[2020-06-03 06:52:18] [INFO ] Deduced a trap composed of 54 places in 146 ms
[2020-06-03 06:52:19] [INFO ] Deduced a trap composed of 55 places in 199 ms
[2020-06-03 06:52:19] [INFO ] Deduced a trap composed of 71 places in 184 ms
[2020-06-03 06:52:19] [INFO ] Deduced a trap composed of 43 places in 248 ms
[2020-06-03 06:52:20] [INFO ] Deduced a trap composed of 68 places in 263 ms
[2020-06-03 06:52:20] [INFO ] Deduced a trap composed of 62 places in 261 ms
[2020-06-03 06:52:20] [INFO ] Deduced a trap composed of 59 places in 278 ms
[2020-06-03 06:52:20] [INFO ] Deduced a trap composed of 33 places in 244 ms
[2020-06-03 06:52:21] [INFO ] Deduced a trap composed of 52 places in 186 ms
[2020-06-03 06:52:21] [INFO ] Deduced a trap composed of 53 places in 202 ms
[2020-06-03 06:52:21] [INFO ] Deduced a trap composed of 60 places in 185 ms
[2020-06-03 06:52:21] [INFO ] Deduced a trap composed of 52 places in 177 ms
[2020-06-03 06:52:22] [INFO ] Deduced a trap composed of 25 places in 250 ms
[2020-06-03 06:52:22] [INFO ] Deduced a trap composed of 32 places in 219 ms
[2020-06-03 06:52:22] [INFO ] Deduced a trap composed of 47 places in 212 ms
[2020-06-03 06:52:22] [INFO ] Deduced a trap composed of 47 places in 192 ms
[2020-06-03 06:52:23] [INFO ] Deduced a trap composed of 43 places in 186 ms
[2020-06-03 06:52:23] [INFO ] Deduced a trap composed of 34 places in 238 ms
[2020-06-03 06:52:23] [INFO ] Deduced a trap composed of 33 places in 237 ms
[2020-06-03 06:52:24] [INFO ] Deduced a trap composed of 12 places in 343 ms
[2020-06-03 06:52:24] [INFO ] Deduced a trap composed of 47 places in 290 ms
[2020-06-03 06:52:25] [INFO ] Deduced a trap composed of 12 places in 310 ms
[2020-06-03 06:52:25] [INFO ] Deduced a trap composed of 61 places in 215 ms
[2020-06-03 06:52:25] [INFO ] Deduced a trap composed of 115 places in 224 ms
[2020-06-03 06:52:25] [INFO ] Deduced a trap composed of 44 places in 205 ms
[2020-06-03 06:52:26] [INFO ] Deduced a trap composed of 14 places in 264 ms
[2020-06-03 06:52:26] [INFO ] Deduced a trap composed of 63 places in 203 ms
[2020-06-03 06:52:26] [INFO ] Deduced a trap composed of 43 places in 222 ms
[2020-06-03 06:52:27] [INFO ] Deduced a trap composed of 20 places in 306 ms
[2020-06-03 06:52:27] [INFO ] Deduced a trap composed of 50 places in 315 ms
[2020-06-03 06:52:28] [INFO ] Deduced a trap composed of 35 places in 225 ms
[2020-06-03 06:52:28] [INFO ] Deduced a trap composed of 59 places in 244 ms
[2020-06-03 06:52:28] [INFO ] Deduced a trap composed of 34 places in 229 ms
[2020-06-03 06:52:29] [INFO ] Deduced a trap composed of 12 places in 276 ms
[2020-06-03 06:52:29] [INFO ] Deduced a trap composed of 61 places in 167 ms
[2020-06-03 06:52:29] [INFO ] Deduced a trap composed of 62 places in 159 ms
[2020-06-03 06:52:30] [INFO ] Deduced a trap composed of 99 places in 171 ms
[2020-06-03 06:52:33] [INFO ] Deduced a trap composed of 50 places in 266 ms
[2020-06-03 06:52:33] [INFO ] Deduced a trap composed of 10 places in 216 ms
[2020-06-03 06:52:33] [INFO ] Deduced a trap composed of 54 places in 213 ms
[2020-06-03 06:52:34] [INFO ] Deduced a trap composed of 10 places in 240 ms
[2020-06-03 06:52:34] [INFO ] Deduced a trap composed of 14 places in 260 ms
[2020-06-03 06:52:34] [INFO ] Deduced a trap composed of 10 places in 289 ms
[2020-06-03 06:52:35] [INFO ] Deduced a trap composed of 21 places in 230 ms
[2020-06-03 06:52:35] [INFO ] Deduced a trap composed of 40 places in 193 ms
[2020-06-03 06:52:35] [INFO ] Deduced a trap composed of 39 places in 187 ms
[2020-06-03 06:52:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 06:52:47] [INFO ] Deduced a trap composed of 58 places in 521 ms
[2020-06-03 06:52:47] [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 (> (+ s37 s44 s45 s58 s64 s68 s70 s76 s82 s87 s96 s104 s108 s112 s114 s125 s133 s135 s147 s151 s155 s165 s170 s173 s176 s184 s194 s200 s204 s208 s216 s224 s225 s237 s248 s250 s255 s264 s267 s274 s285 s294 s300 s307 s316 s331 s337 s338 s370 s372 s388 s394 s399 s408 s414 s421 s470 s486) 0)") while checking expression at index 4
[2020-06-03 06:52:47] [INFO ] [Real]Absence check using 20 positive place invariants in 43 ms returned sat
[2020-06-03 06:52:47] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2020-06-03 06:52:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:52:48] [INFO ] [Real]Absence check using state equation in 938 ms returned sat
[2020-06-03 06:52:48] [INFO ] [Real]Added 366 Read/Feed constraints in 58 ms returned sat
[2020-06-03 06:52:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:52:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 29 ms returned sat
[2020-06-03 06:52:48] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-06-03 06:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:52:49] [INFO ] [Nat]Absence check using state equation in 967 ms returned sat
[2020-06-03 06:52:49] [INFO ] [Nat]Added 366 Read/Feed constraints in 72 ms returned sat
[2020-06-03 06:52:49] [INFO ] Deduced a trap composed of 65 places in 279 ms
[2020-06-03 06:52:50] [INFO ] Deduced a trap composed of 42 places in 312 ms
[2020-06-03 06:52:50] [INFO ] Deduced a trap composed of 42 places in 309 ms
[2020-06-03 06:52:50] [INFO ] Deduced a trap composed of 42 places in 293 ms
[2020-06-03 06:52:51] [INFO ] Deduced a trap composed of 43 places in 287 ms
[2020-06-03 06:52:51] [INFO ] Deduced a trap composed of 43 places in 282 ms
[2020-06-03 06:52:51] [INFO ] Deduced a trap composed of 62 places in 294 ms
[2020-06-03 06:52:52] [INFO ] Deduced a trap composed of 29 places in 254 ms
[2020-06-03 06:52:52] [INFO ] Deduced a trap composed of 44 places in 305 ms
[2020-06-03 06:52:52] [INFO ] Deduced a trap composed of 10 places in 279 ms
[2020-06-03 06:52:53] [INFO ] Deduced a trap composed of 10 places in 335 ms
[2020-06-03 06:52:53] [INFO ] Deduced a trap composed of 43 places in 272 ms
[2020-06-03 06:52:53] [INFO ] Deduced a trap composed of 10 places in 321 ms
[2020-06-03 06:52:54] [INFO ] Deduced a trap composed of 44 places in 287 ms
[2020-06-03 06:52:54] [INFO ] Deduced a trap composed of 33 places in 281 ms
[2020-06-03 06:52:54] [INFO ] Deduced a trap composed of 12 places in 330 ms
[2020-06-03 06:52:55] [INFO ] Deduced a trap composed of 16 places in 255 ms
[2020-06-03 06:52:55] [INFO ] Deduced a trap composed of 33 places in 253 ms
[2020-06-03 06:52:55] [INFO ] Deduced a trap composed of 36 places in 266 ms
[2020-06-03 06:52:55] [INFO ] Deduced a trap composed of 25 places in 266 ms
[2020-06-03 06:52:56] [INFO ] Deduced a trap composed of 24 places in 236 ms
[2020-06-03 06:52:56] [INFO ] Deduced a trap composed of 22 places in 296 ms
[2020-06-03 06:52:56] [INFO ] Deduced a trap composed of 70 places in 282 ms
[2020-06-03 06:52:57] [INFO ] Deduced a trap composed of 34 places in 290 ms
[2020-06-03 06:52:57] [INFO ] Deduced a trap composed of 59 places in 276 ms
[2020-06-03 06:52:57] [INFO ] Deduced a trap composed of 29 places in 287 ms
[2020-06-03 06:52:58] [INFO ] Deduced a trap composed of 13 places in 291 ms
[2020-06-03 06:52:58] [INFO ] Deduced a trap composed of 51 places in 289 ms
[2020-06-03 06:52:58] [INFO ] Deduced a trap composed of 14 places in 363 ms
[2020-06-03 06:52:59] [INFO ] Deduced a trap composed of 27 places in 305 ms
[2020-06-03 06:52:59] [INFO ] Deduced a trap composed of 23 places in 292 ms
[2020-06-03 06:52:59] [INFO ] Deduced a trap composed of 22 places in 285 ms
[2020-06-03 06:53:00] [INFO ] Deduced a trap composed of 32 places in 349 ms
[2020-06-03 06:53:00] [INFO ] Deduced a trap composed of 10 places in 287 ms
[2020-06-03 06:53:00] [INFO ] Deduced a trap composed of 11 places in 313 ms
[2020-06-03 06:53:01] [INFO ] Deduced a trap composed of 31 places in 270 ms
[2020-06-03 06:53:01] [INFO ] Deduced a trap composed of 35 places in 246 ms
[2020-06-03 06:53:01] [INFO ] Deduced a trap composed of 39 places in 233 ms
[2020-06-03 06:53:01] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 12329 ms
[2020-06-03 06:53:02] [INFO ] Computed and/alt/rep : 1183/8222/973 causal constraints in 112 ms.
[2020-06-03 06:53:21] [INFO ] Added : 939 causal constraints over 188 iterations in 19192 ms. Result :sat
[2020-06-03 06:53:21] [INFO ] Deduced a trap composed of 58 places in 191 ms
[2020-06-03 06:53:21] [INFO ] Deduced a trap composed of 67 places in 223 ms
[2020-06-03 06:53:22] [INFO ] Deduced a trap composed of 71 places in 209 ms
[2020-06-03 06:53:22] [INFO ] Deduced a trap composed of 44 places in 235 ms
[2020-06-03 06:53:22] [INFO ] Deduced a trap composed of 63 places in 193 ms
[2020-06-03 06:53:23] [INFO ] Deduced a trap composed of 101 places in 247 ms
[2020-06-03 06:53:23] [INFO ] Deduced a trap composed of 47 places in 222 ms
[2020-06-03 06:53:23] [INFO ] Deduced a trap composed of 64 places in 203 ms
[2020-06-03 06:53:24] [INFO ] Deduced a trap composed of 76 places in 242 ms
[2020-06-03 06:53:24] [INFO ] Deduced a trap composed of 22 places in 266 ms
[2020-06-03 06:53:25] [INFO ] Deduced a trap composed of 23 places in 241 ms
[2020-06-03 06:53:25] [INFO ] Deduced a trap composed of 72 places in 271 ms
[2020-06-03 06:53:25] [INFO ] Deduced a trap composed of 71 places in 257 ms
[2020-06-03 06:53:26] [INFO ] Deduced a trap composed of 21 places in 230 ms
[2020-06-03 06:53:26] [INFO ] Deduced a trap composed of 29 places in 259 ms
[2020-06-03 06:53:26] [INFO ] Deduced a trap composed of 61 places in 255 ms
[2020-06-03 06:53:27] [INFO ] Deduced a trap composed of 58 places in 191 ms
[2020-06-03 06:53:27] [INFO ] Deduced a trap composed of 70 places in 281 ms
[2020-06-03 06:53:28] [INFO ] Deduced a trap composed of 25 places in 224 ms
[2020-06-03 06:53:28] [INFO ] Deduced a trap composed of 41 places in 254 ms
[2020-06-03 06:53:28] [INFO ] Deduced a trap composed of 42 places in 216 ms
[2020-06-03 06:53:29] [INFO ] Deduced a trap composed of 43 places in 256 ms
[2020-06-03 06:53:29] [INFO ] Deduced a trap composed of 41 places in 251 ms
[2020-06-03 06:53:30] [INFO ] Deduced a trap composed of 42 places in 293 ms
[2020-06-03 06:53:30] [INFO ] Deduced a trap composed of 59 places in 239 ms
[2020-06-03 06:53:30] [INFO ] Deduced a trap composed of 69 places in 289 ms
[2020-06-03 06:53:31] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 10016 ms
Attempting to minimize the solution found.
Minimization took 131 ms.
Incomplete Parikh walk after 209000 steps, including 1000 resets, run finished after 603 ms. (steps per millisecond=346 ) properties seen :[1, 0, 0, 0, 0, 0] could not realise parikh vector
FORMULA Peterson-PT-6-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 272900 steps, including 1000 resets, run finished after 730 ms. (steps per millisecond=373 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 227200 steps, including 1000 resets, run finished after 543 ms. (steps per millisecond=418 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 184500 steps, including 1000 resets, run finished after 468 ms. (steps per millisecond=394 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 44 out of 490 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 490/490 places, 1190/1190 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 490 transition count 1184
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 484 transition count 1184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 484 transition count 1183
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 483 transition count 1183
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 96 place count 442 transition count 1142
Applied a total of 96 rules in 64 ms. Remains 442 /490 variables (removed 48) and now considering 1142/1190 (removed 48) transitions.
Finished structural reductions, in 1 iterations. Remains : 442/490 places, 1142/1190 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2280 ms. (steps per millisecond=438 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 617 ms. (steps per millisecond=1620 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 811 ms. (steps per millisecond=1233 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 774 ms. (steps per millisecond=1291 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 864 ms. (steps per millisecond=1157 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1063 ms. (steps per millisecond=940 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 11069552 steps, run timeout after 30001 ms. (steps per millisecond=368 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 11069552 steps, saw 1383695 distinct states, run finished after 30001 ms. (steps per millisecond=368 ) properties seen :[0, 0, 0, 0, 0]
[2020-06-03 06:54:10] [INFO ] Flow matrix only has 932 transitions (discarded 210 similar events)
// Phase 1: matrix 932 rows 442 cols
[2020-06-03 06:54:10] [INFO ] Computed 27 place invariants in 5 ms
[2020-06-03 06:54:10] [INFO ] [Real]Absence check using 20 positive place invariants in 17 ms returned sat
[2020-06-03 06:54:10] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-06-03 06:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:54:11] [INFO ] [Real]Absence check using state equation in 740 ms returned sat
[2020-06-03 06:54:11] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 06:54:11] [INFO ] [Real]Added 366 Read/Feed constraints in 76 ms returned sat
[2020-06-03 06:54:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:54:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 33 ms returned sat
[2020-06-03 06:54:11] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2020-06-03 06:54:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:54:11] [INFO ] [Nat]Absence check using state equation in 685 ms returned sat
[2020-06-03 06:54:12] [INFO ] [Nat]Added 366 Read/Feed constraints in 55 ms returned sat
[2020-06-03 06:54:12] [INFO ] Deduced a trap composed of 41 places in 262 ms
[2020-06-03 06:54:12] [INFO ] Deduced a trap composed of 40 places in 229 ms
[2020-06-03 06:54:12] [INFO ] Deduced a trap composed of 39 places in 245 ms
[2020-06-03 06:54:13] [INFO ] Deduced a trap composed of 38 places in 182 ms
[2020-06-03 06:54:13] [INFO ] Deduced a trap composed of 40 places in 205 ms
[2020-06-03 06:54:13] [INFO ] Deduced a trap composed of 40 places in 208 ms
[2020-06-03 06:54:13] [INFO ] Deduced a trap composed of 41 places in 160 ms
[2020-06-03 06:54:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1766 ms
[2020-06-03 06:54:13] [INFO ] Computed and/alt/rep : 1135/8180/925 causal constraints in 46 ms.
[2020-06-03 06:54:34] [INFO ] Added : 850 causal constraints over 170 iterations in 20266 ms.(timeout) Result :sat
[2020-06-03 06:54:34] [INFO ] Deduced a trap composed of 39 places in 268 ms
[2020-06-03 06:54:34] [INFO ] Deduced a trap composed of 38 places in 267 ms
[2020-06-03 06:54:35] [INFO ] Deduced a trap composed of 13 places in 268 ms
[2020-06-03 06:54:35] [INFO ] Deduced a trap composed of 12 places in 277 ms
[2020-06-03 06:54:36] [INFO ] Deduced a trap composed of 10 places in 278 ms
[2020-06-03 06:54:36] [INFO ] Deduced a trap composed of 33 places in 293 ms
[2020-06-03 06:54:36] [INFO ] Deduced a trap composed of 73 places in 290 ms
[2020-06-03 06:54:37] [INFO ] Deduced a trap composed of 54 places in 239 ms
[2020-06-03 06:54:37] [INFO ] Deduced a trap composed of 75 places in 276 ms
[2020-06-03 06:54:38] [INFO ] Deduced a trap composed of 65 places in 250 ms
[2020-06-03 06:54:38] [INFO ] Deduced a trap composed of 34 places in 240 ms
[2020-06-03 06:54:38] [INFO ] Deduced a trap composed of 27 places in 237 ms
[2020-06-03 06:54:39] [INFO ] Deduced a trap composed of 13 places in 225 ms
[2020-06-03 06:54:39] [INFO ] Deduced a trap composed of 11 places in 236 ms
[2020-06-03 06:54:39] [INFO ] Deduced a trap composed of 20 places in 258 ms
[2020-06-03 06:54:40] [INFO ] Deduced a trap composed of 47 places in 230 ms
[2020-06-03 06:54:40] [INFO ] Deduced a trap composed of 68 places in 234 ms
[2020-06-03 06:54:41] [INFO ] Deduced a trap composed of 22 places in 229 ms
[2020-06-03 06:54:41] [INFO ] Deduced a trap composed of 28 places in 227 ms
[2020-06-03 06:54:41] [INFO ] Deduced a trap composed of 21 places in 253 ms
[2020-06-03 06:54:42] [INFO ] Deduced a trap composed of 56 places in 250 ms
[2020-06-03 06:54:42] [INFO ] Deduced a trap composed of 70 places in 253 ms
[2020-06-03 06:54:42] [INFO ] Deduced a trap composed of 32 places in 264 ms
[2020-06-03 06:54:43] [INFO ] Deduced a trap composed of 46 places in 226 ms
[2020-06-03 06:54:43] [INFO ] Deduced a trap composed of 31 places in 258 ms
[2020-06-03 06:54:44] [INFO ] Deduced a trap composed of 54 places in 268 ms
[2020-06-03 06:54:44] [INFO ] Deduced a trap composed of 70 places in 247 ms
[2020-06-03 06:54:44] [INFO ] Deduced a trap composed of 62 places in 217 ms
[2020-06-03 06:54:45] [INFO ] Deduced a trap composed of 24 places in 242 ms
[2020-06-03 06:54:45] [INFO ] Deduced a trap composed of 24 places in 238 ms
[2020-06-03 06:54:46] [INFO ] Deduced a trap composed of 25 places in 279 ms
[2020-06-03 06:54:46] [INFO ] Deduced a trap composed of 26 places in 238 ms
[2020-06-03 06:54:46] [INFO ] Deduced a trap composed of 46 places in 207 ms
[2020-06-03 06:54:47] [INFO ] Deduced a trap composed of 46 places in 255 ms
[2020-06-03 06:54:47] [INFO ] Deduced a trap composed of 46 places in 270 ms
[2020-06-03 06:54:48] [INFO ] Deduced a trap composed of 52 places in 252 ms
[2020-06-03 06:54:48] [INFO ] Deduced a trap composed of 48 places in 269 ms
[2020-06-03 06:54:49] [INFO ] Deduced a trap composed of 26 places in 241 ms
[2020-06-03 06:54:49] [INFO ] Deduced a trap composed of 66 places in 683 ms
[2020-06-03 06:54:50] [INFO ] Deduced a trap composed of 40 places in 272 ms
[2020-06-03 06:54:50] [INFO ] Deduced a trap composed of 51 places in 245 ms
[2020-06-03 06:54:51] [INFO ] Deduced a trap composed of 10 places in 285 ms
[2020-06-03 06:54:51] [INFO ] Deduced a trap composed of 12 places in 274 ms
[2020-06-03 06:54:52] [INFO ] Deduced a trap composed of 22 places in 267 ms
[2020-06-03 06:54:52] [INFO ] Deduced a trap composed of 19 places in 249 ms
[2020-06-03 06:54:52] [INFO ] Deduced a trap composed of 25 places in 195 ms
[2020-06-03 06:54:53] [INFO ] Deduced a trap composed of 33 places in 231 ms
[2020-06-03 06:54:53] [INFO ] Deduced a trap composed of 20 places in 293 ms
[2020-06-03 06:54:54] [INFO ] Deduced a trap composed of 38 places in 231 ms
[2020-06-03 06:54:54] [INFO ] Deduced a trap composed of 26 places in 238 ms
[2020-06-03 06:54:55] [INFO ] Deduced a trap composed of 13 places in 307 ms
[2020-06-03 06:54:55] [INFO ] Deduced a trap composed of 31 places in 274 ms
[2020-06-03 06:54:55] [INFO ] Deduced a trap composed of 26 places in 200 ms
[2020-06-03 06:54:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 06:54:56] [INFO ] Deduced a trap composed of 2 places in 334 ms
[2020-06-03 06:54:56] [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 (> (+ s301 s309) 0)") while checking expression at index 0
[2020-06-03 06:54:56] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2020-06-03 06:54:56] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-06-03 06:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:54:57] [INFO ] [Real]Absence check using state equation in 909 ms returned sat
[2020-06-03 06:54:57] [INFO ] [Real]Added 366 Read/Feed constraints in 68 ms returned sat
[2020-06-03 06:54:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:54:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 24 ms returned sat
[2020-06-03 06:54:57] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2020-06-03 06:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:54:58] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2020-06-03 06:54:58] [INFO ] [Nat]Added 366 Read/Feed constraints in 65 ms returned sat
[2020-06-03 06:54:58] [INFO ] Deduced a trap composed of 30 places in 295 ms
[2020-06-03 06:54:59] [INFO ] Deduced a trap composed of 29 places in 258 ms
[2020-06-03 06:54:59] [INFO ] Deduced a trap composed of 23 places in 264 ms
[2020-06-03 06:54:59] [INFO ] Deduced a trap composed of 48 places in 220 ms
[2020-06-03 06:54:59] [INFO ] Deduced a trap composed of 41 places in 185 ms
[2020-06-03 06:55:00] [INFO ] Deduced a trap composed of 72 places in 194 ms
[2020-06-03 06:55:00] [INFO ] Deduced a trap composed of 73 places in 212 ms
[2020-06-03 06:55:00] [INFO ] Deduced a trap composed of 93 places in 213 ms
[2020-06-03 06:55:00] [INFO ] Deduced a trap composed of 32 places in 184 ms
[2020-06-03 06:55:01] [INFO ] Deduced a trap composed of 92 places in 189 ms
[2020-06-03 06:55:01] [INFO ] Deduced a trap composed of 88 places in 187 ms
[2020-06-03 06:55:01] [INFO ] Deduced a trap composed of 31 places in 204 ms
[2020-06-03 06:55:01] [INFO ] Deduced a trap composed of 33 places in 207 ms
[2020-06-03 06:55:01] [INFO ] Deduced a trap composed of 32 places in 204 ms
[2020-06-03 06:55:02] [INFO ] Deduced a trap composed of 67 places in 244 ms
[2020-06-03 06:55:02] [INFO ] Deduced a trap composed of 68 places in 222 ms
[2020-06-03 06:55:02] [INFO ] Deduced a trap composed of 30 places in 162 ms
[2020-06-03 06:55:02] [INFO ] Deduced a trap composed of 70 places in 251 ms
[2020-06-03 06:55:03] [INFO ] Deduced a trap composed of 70 places in 208 ms
[2020-06-03 06:55:03] [INFO ] Deduced a trap composed of 41 places in 251 ms
[2020-06-03 06:55:03] [INFO ] Deduced a trap composed of 46 places in 124 ms
[2020-06-03 06:55:03] [INFO ] Deduced a trap composed of 55 places in 120 ms
[2020-06-03 06:55:04] [INFO ] Deduced a trap composed of 40 places in 155 ms
[2020-06-03 06:55:04] [INFO ] Deduced a trap composed of 41 places in 131 ms
[2020-06-03 06:55:04] [INFO ] Deduced a trap composed of 31 places in 206 ms
[2020-06-03 06:55:04] [INFO ] Deduced a trap composed of 22 places in 243 ms
[2020-06-03 06:55:04] [INFO ] Deduced a trap composed of 38 places in 183 ms
[2020-06-03 06:55:05] [INFO ] Deduced a trap composed of 21 places in 213 ms
[2020-06-03 06:55:05] [INFO ] Deduced a trap composed of 20 places in 368 ms
[2020-06-03 06:55:05] [INFO ] Deduced a trap composed of 55 places in 151 ms
[2020-06-03 06:55:06] [INFO ] Deduced a trap composed of 56 places in 159 ms
[2020-06-03 06:55:06] [INFO ] Deduced a trap composed of 55 places in 167 ms
[2020-06-03 06:55:06] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 7778 ms
[2020-06-03 06:55:06] [INFO ] Computed and/alt/rep : 1135/8180/925 causal constraints in 44 ms.
[2020-06-03 06:55:26] [INFO ] Added : 820 causal constraints over 164 iterations in 20093 ms.(timeout) Result :sat
[2020-06-03 06:55:26] [INFO ] Deduced a trap composed of 10 places in 370 ms
[2020-06-03 06:55:27] [INFO ] Deduced a trap composed of 38 places in 340 ms
[2020-06-03 06:55:27] [INFO ] Deduced a trap composed of 44 places in 342 ms
[2020-06-03 06:55:28] [INFO ] Deduced a trap composed of 13 places in 853 ms
[2020-06-03 06:55:29] [INFO ] Deduced a trap composed of 30 places in 278 ms
[2020-06-03 06:55:29] [INFO ] Deduced a trap composed of 14 places in 256 ms
[2020-06-03 06:55:30] [INFO ] Deduced a trap composed of 14 places in 270 ms
[2020-06-03 06:55:30] [INFO ] Deduced a trap composed of 14 places in 268 ms
[2020-06-03 06:55:31] [INFO ] Deduced a trap composed of 14 places in 338 ms
[2020-06-03 06:55:31] [INFO ] Deduced a trap composed of 21 places in 296 ms
[2020-06-03 06:55:31] [INFO ] Deduced a trap composed of 21 places in 306 ms
[2020-06-03 06:55:32] [INFO ] Deduced a trap composed of 42 places in 299 ms
[2020-06-03 06:55:32] [INFO ] Deduced a trap composed of 98 places in 268 ms
[2020-06-03 06:55:33] [INFO ] Deduced a trap composed of 15 places in 272 ms
[2020-06-03 06:55:33] [INFO ] Deduced a trap composed of 20 places in 272 ms
[2020-06-03 06:55:34] [INFO ] Deduced a trap composed of 57 places in 269 ms
[2020-06-03 06:55:34] [INFO ] Deduced a trap composed of 68 places in 189 ms
[2020-06-03 06:55:34] [INFO ] Deduced a trap composed of 34 places in 160 ms
[2020-06-03 06:55:35] [INFO ] Deduced a trap composed of 27 places in 270 ms
[2020-06-03 06:55:36] [INFO ] Deduced a trap composed of 12 places in 262 ms
[2020-06-03 06:55:36] [INFO ] Deduced a trap composed of 49 places in 215 ms
[2020-06-03 06:55:36] [INFO ] Deduced a trap composed of 56 places in 171 ms
[2020-06-03 06:55:37] [INFO ] Deduced a trap composed of 59 places in 176 ms
[2020-06-03 06:55:37] [INFO ] Deduced a trap composed of 72 places in 166 ms
[2020-06-03 06:55:37] [INFO ] Deduced a trap composed of 19 places in 282 ms
[2020-06-03 06:55:38] [INFO ] Deduced a trap composed of 31 places in 233 ms
[2020-06-03 06:55:38] [INFO ] Deduced a trap composed of 30 places in 250 ms
[2020-06-03 06:55:38] [INFO ] Deduced a trap composed of 65 places in 202 ms
[2020-06-03 06:55:39] [INFO ] Deduced a trap composed of 61 places in 117 ms
[2020-06-03 06:55:39] [INFO ] Deduced a trap composed of 55 places in 171 ms
[2020-06-03 06:55:39] [INFO ] Deduced a trap composed of 43 places in 255 ms
[2020-06-03 06:55:40] [INFO ] Deduced a trap composed of 24 places in 246 ms
[2020-06-03 06:55:40] [INFO ] Deduced a trap composed of 19 places in 217 ms
[2020-06-03 06:55:40] [INFO ] Deduced a trap composed of 28 places in 215 ms
[2020-06-03 06:55:41] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 14676 ms
Attempting to minimize the solution found.
Minimization took 118 ms.
[2020-06-03 06:55:41] [INFO ] [Real]Absence check using 20 positive place invariants in 130 ms returned sat
[2020-06-03 06:55:41] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 33 ms returned sat
[2020-06-03 06:55:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:55:42] [INFO ] [Real]Absence check using state equation in 829 ms returned sat
[2020-06-03 06:55:42] [INFO ] [Real]Added 366 Read/Feed constraints in 139 ms returned sat
[2020-06-03 06:55:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:55:42] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2020-06-03 06:55:42] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-06-03 06:55:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:55:43] [INFO ] [Nat]Absence check using state equation in 939 ms returned sat
[2020-06-03 06:55:43] [INFO ] [Nat]Added 366 Read/Feed constraints in 68 ms returned sat
[2020-06-03 06:55:43] [INFO ] Deduced a trap composed of 46 places in 300 ms
[2020-06-03 06:55:44] [INFO ] Deduced a trap composed of 21 places in 242 ms
[2020-06-03 06:55:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 636 ms
[2020-06-03 06:55:44] [INFO ] Computed and/alt/rep : 1135/8180/925 causal constraints in 57 ms.
[2020-06-03 06:56:04] [INFO ] Added : 870 causal constraints over 174 iterations in 20104 ms.(timeout) Result :sat
[2020-06-03 06:56:04] [INFO ] Deduced a trap composed of 20 places in 279 ms
[2020-06-03 06:56:05] [INFO ] Deduced a trap composed of 28 places in 315 ms
[2020-06-03 06:56:05] [INFO ] Deduced a trap composed of 11 places in 333 ms
[2020-06-03 06:56:05] [INFO ] Deduced a trap composed of 12 places in 286 ms
[2020-06-03 06:56:06] [INFO ] Deduced a trap composed of 70 places in 289 ms
[2020-06-03 06:56:06] [INFO ] Deduced a trap composed of 72 places in 317 ms
[2020-06-03 06:56:07] [INFO ] Deduced a trap composed of 14 places in 284 ms
[2020-06-03 06:56:07] [INFO ] Deduced a trap composed of 14 places in 293 ms
[2020-06-03 06:56:08] [INFO ] Deduced a trap composed of 14 places in 292 ms
[2020-06-03 06:56:08] [INFO ] Deduced a trap composed of 20 places in 281 ms
[2020-06-03 06:56:08] [INFO ] Deduced a trap composed of 19 places in 270 ms
[2020-06-03 06:56:09] [INFO ] Deduced a trap composed of 129 places in 254 ms
[2020-06-03 06:56:09] [INFO ] Deduced a trap composed of 57 places in 292 ms
[2020-06-03 06:56:10] [INFO ] Deduced a trap composed of 51 places in 223 ms
[2020-06-03 06:56:10] [INFO ] Deduced a trap composed of 13 places in 247 ms
[2020-06-03 06:56:10] [INFO ] Deduced a trap composed of 35 places in 269 ms
[2020-06-03 06:56:11] [INFO ] Deduced a trap composed of 57 places in 290 ms
[2020-06-03 06:56:11] [INFO ] Deduced a trap composed of 20 places in 299 ms
[2020-06-03 06:56:12] [INFO ] Deduced a trap composed of 28 places in 229 ms
[2020-06-03 06:56:12] [INFO ] Deduced a trap composed of 57 places in 247 ms
[2020-06-03 06:56:12] [INFO ] Deduced a trap composed of 37 places in 238 ms
[2020-06-03 06:56:13] [INFO ] Deduced a trap composed of 53 places in 198 ms
[2020-06-03 06:56:13] [INFO ] Deduced a trap composed of 51 places in 209 ms
[2020-06-03 06:56:13] [INFO ] Deduced a trap composed of 27 places in 206 ms
[2020-06-03 06:56:14] [INFO ] Deduced a trap composed of 38 places in 268 ms
[2020-06-03 06:56:14] [INFO ] Deduced a trap composed of 11 places in 256 ms
[2020-06-03 06:56:15] [INFO ] Deduced a trap composed of 47 places in 280 ms
[2020-06-03 06:56:15] [INFO ] Deduced a trap composed of 59 places in 277 ms
[2020-06-03 06:56:16] [INFO ] Deduced a trap composed of 21 places in 242 ms
[2020-06-03 06:56:16] [INFO ] Deduced a trap composed of 21 places in 225 ms
[2020-06-03 06:56:16] [INFO ] Deduced a trap composed of 36 places in 217 ms
[2020-06-03 06:56:17] [INFO ] Deduced a trap composed of 28 places in 264 ms
[2020-06-03 06:56:17] [INFO ] Deduced a trap composed of 20 places in 271 ms
[2020-06-03 06:56:18] [INFO ] Deduced a trap composed of 21 places in 278 ms
[2020-06-03 06:56:18] [INFO ] Deduced a trap composed of 19 places in 270 ms
[2020-06-03 06:56:19] [INFO ] Deduced a trap composed of 42 places in 226 ms
[2020-06-03 06:56:19] [INFO ] Deduced a trap composed of 63 places in 282 ms
[2020-06-03 06:56:19] [INFO ] Deduced a trap composed of 78 places in 245 ms
[2020-06-03 06:56:20] [INFO ] Deduced a trap composed of 14 places in 259 ms
[2020-06-03 06:56:20] [INFO ] Deduced a trap composed of 59 places in 180 ms
[2020-06-03 06:56:21] [INFO ] Deduced a trap composed of 40 places in 215 ms
[2020-06-03 06:56:21] [INFO ] Deduced a trap composed of 44 places in 220 ms
[2020-06-03 06:56:22] [INFO ] Deduced a trap composed of 39 places in 257 ms
[2020-06-03 06:56:22] [INFO ] Deduced a trap composed of 49 places in 236 ms
[2020-06-03 06:56:22] [INFO ] Deduced a trap composed of 39 places in 243 ms
[2020-06-03 06:56:23] [INFO ] Deduced a trap composed of 31 places in 261 ms
[2020-06-03 06:56:23] [INFO ] Deduced a trap composed of 61 places in 238 ms
[2020-06-03 06:56:24] [INFO ] Deduced a trap composed of 29 places in 240 ms
[2020-06-03 06:56:24] [INFO ] Deduced a trap composed of 40 places in 242 ms
[2020-06-03 06:56:25] [INFO ] Deduced a trap composed of 38 places in 247 ms
[2020-06-03 06:56:26] [INFO ] Deduced a trap composed of 55 places in 582 ms
[2020-06-03 06:56:26] [INFO ] Deduced a trap composed of 55 places in 257 ms
[2020-06-03 06:56:27] [INFO ] Deduced a trap composed of 64 places in 299 ms
[2020-06-03 06:56:27] [INFO ] Deduced a trap composed of 2 places in 314 ms
[2020-06-03 06:56:27] [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 (> (+ s301 s309) 0)") while checking expression at index 2
[2020-06-03 06:56:27] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2020-06-03 06:56:27] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2020-06-03 06:56:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:56:28] [INFO ] [Real]Absence check using state equation in 803 ms returned sat
[2020-06-03 06:56:28] [INFO ] [Real]Added 366 Read/Feed constraints in 150 ms returned sat
[2020-06-03 06:56:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:56:29] [INFO ] [Nat]Absence check using 20 positive place invariants in 118 ms returned sat
[2020-06-03 06:56:29] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 15 ms returned sat
[2020-06-03 06:56:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:56:30] [INFO ] [Nat]Absence check using state equation in 879 ms returned sat
[2020-06-03 06:56:30] [INFO ] [Nat]Added 366 Read/Feed constraints in 138 ms returned sat
[2020-06-03 06:56:30] [INFO ] Deduced a trap composed of 39 places in 354 ms
[2020-06-03 06:56:31] [INFO ] Deduced a trap composed of 10 places in 333 ms
[2020-06-03 06:56:31] [INFO ] Deduced a trap composed of 20 places in 239 ms
[2020-06-03 06:56:31] [INFO ] Deduced a trap composed of 28 places in 308 ms
[2020-06-03 06:56:31] [INFO ] Deduced a trap composed of 66 places in 284 ms
[2020-06-03 06:56:32] [INFO ] Deduced a trap composed of 28 places in 304 ms
[2020-06-03 06:56:32] [INFO ] Deduced a trap composed of 28 places in 444 ms
[2020-06-03 06:56:33] [INFO ] Deduced a trap composed of 34 places in 265 ms
[2020-06-03 06:56:33] [INFO ] Deduced a trap composed of 34 places in 223 ms
[2020-06-03 06:56:33] [INFO ] Deduced a trap composed of 37 places in 274 ms
[2020-06-03 06:56:34] [INFO ] Deduced a trap composed of 20 places in 288 ms
[2020-06-03 06:56:34] [INFO ] Deduced a trap composed of 41 places in 244 ms
[2020-06-03 06:56:34] [INFO ] Deduced a trap composed of 21 places in 275 ms
[2020-06-03 06:56:35] [INFO ] Deduced a trap composed of 40 places in 270 ms
[2020-06-03 06:56:35] [INFO ] Deduced a trap composed of 59 places in 268 ms
[2020-06-03 06:56:35] [INFO ] Deduced a trap composed of 60 places in 547 ms
[2020-06-03 06:56:37] [INFO ] Deduced a trap composed of 30 places in 1219 ms
[2020-06-03 06:56:37] [INFO ] Deduced a trap composed of 19 places in 260 ms
[2020-06-03 06:56:37] [INFO ] Deduced a trap composed of 20 places in 255 ms
[2020-06-03 06:56:38] [INFO ] Deduced a trap composed of 54 places in 265 ms
[2020-06-03 06:56:38] [INFO ] Deduced a trap composed of 19 places in 305 ms
[2020-06-03 06:56:38] [INFO ] Deduced a trap composed of 52 places in 217 ms
[2020-06-03 06:56:39] [INFO ] Deduced a trap composed of 40 places in 250 ms
[2020-06-03 06:56:39] [INFO ] Deduced a trap composed of 32 places in 266 ms
[2020-06-03 06:56:39] [INFO ] Deduced a trap composed of 32 places in 268 ms
[2020-06-03 06:56:39] [INFO ] Deduced a trap composed of 48 places in 250 ms
[2020-06-03 06:56:40] [INFO ] Deduced a trap composed of 32 places in 210 ms
[2020-06-03 06:56:40] [INFO ] Deduced a trap composed of 27 places in 228 ms
[2020-06-03 06:56:40] [INFO ] Deduced a trap composed of 47 places in 230 ms
[2020-06-03 06:56:41] [INFO ] Deduced a trap composed of 48 places in 237 ms
[2020-06-03 06:56:41] [INFO ] Deduced a trap composed of 50 places in 232 ms
[2020-06-03 06:56:41] [INFO ] Deduced a trap composed of 67 places in 220 ms
[2020-06-03 06:56:41] [INFO ] Deduced a trap composed of 31 places in 252 ms
[2020-06-03 06:56:42] [INFO ] Deduced a trap composed of 48 places in 231 ms
[2020-06-03 06:56:42] [INFO ] Deduced a trap composed of 19 places in 231 ms
[2020-06-03 06:56:42] [INFO ] Deduced a trap composed of 19 places in 243 ms
[2020-06-03 06:56:42] [INFO ] Deduced a trap composed of 89 places in 227 ms
[2020-06-03 06:56:43] [INFO ] Deduced a trap composed of 56 places in 216 ms
[2020-06-03 06:56:43] [INFO ] Deduced a trap composed of 63 places in 238 ms
[2020-06-03 06:56:43] [INFO ] Deduced a trap composed of 97 places in 225 ms
[2020-06-03 06:56:44] [INFO ] Deduced a trap composed of 27 places in 455 ms
[2020-06-03 06:56:44] [INFO ] Deduced a trap composed of 30 places in 246 ms
[2020-06-03 06:56:44] [INFO ] Deduced a trap composed of 19 places in 237 ms
[2020-06-03 06:56:45] [INFO ] Deduced a trap composed of 47 places in 204 ms
[2020-06-03 06:56:45] [INFO ] Deduced a trap composed of 26 places in 224 ms
[2020-06-03 06:56:45] [INFO ] Deduced a trap composed of 48 places in 204 ms
[2020-06-03 06:56:45] [INFO ] Deduced a trap composed of 39 places in 328 ms
[2020-06-03 06:56:46] [INFO ] Deduced a trap composed of 64 places in 205 ms
[2020-06-03 06:56:46] [INFO ] Deduced a trap composed of 63 places in 187 ms
[2020-06-03 06:56:46] [INFO ] Deduced a trap composed of 65 places in 211 ms
[2020-06-03 06:56:46] [INFO ] Deduced a trap composed of 27 places in 193 ms
[2020-06-03 06:56:47] [INFO ] Deduced a trap composed of 50 places in 212 ms
[2020-06-03 06:56:47] [INFO ] Deduced a trap composed of 22 places in 311 ms
[2020-06-03 06:56:47] [INFO ] Deduced a trap composed of 22 places in 286 ms
[2020-06-03 06:56:48] [INFO ] Deduced a trap composed of 29 places in 245 ms
[2020-06-03 06:56:48] [INFO ] Deduced a trap composed of 40 places in 233 ms
[2020-06-03 06:56:48] [INFO ] Deduced a trap composed of 13 places in 259 ms
[2020-06-03 06:56:49] [INFO ] Deduced a trap composed of 29 places in 213 ms
[2020-06-03 06:56:49] [INFO ] Deduced a trap composed of 80 places in 211 ms
[2020-06-03 06:56:49] [INFO ] Deduced a trap composed of 40 places in 240 ms
[2020-06-03 06:56:49] [INFO ] Deduced a trap composed of 115 places in 243 ms
[2020-06-03 06:56:50] [INFO ] Deduced a trap composed of 29 places in 190 ms
[2020-06-03 06:56:50] [INFO ] Deduced a trap composed of 29 places in 222 ms
[2020-06-03 06:56:50] [INFO ] Deduced a trap composed of 33 places in 239 ms
[2020-06-03 06:56:50] [INFO ] Deduced a trap composed of 31 places in 187 ms
[2020-06-03 06:56:51] [INFO ] Deduced a trap composed of 26 places in 183 ms
[2020-06-03 06:56:51] [INFO ] Deduced a trap composed of 25 places in 197 ms
[2020-06-03 06:56:51] [INFO ] Deduced a trap composed of 40 places in 184 ms
[2020-06-03 06:56:51] [INFO ] Deduced a trap composed of 57 places in 214 ms
[2020-06-03 06:56:52] [INFO ] Deduced a trap composed of 65 places in 168 ms
[2020-06-03 06:56:52] [INFO ] Deduced a trap composed of 55 places in 185 ms
[2020-06-03 06:56:52] [INFO ] Deduced a trap composed of 56 places in 175 ms
[2020-06-03 06:56:52] [INFO ] Deduced a trap composed of 61 places in 213 ms
[2020-06-03 06:56:53] [INFO ] Deduced a trap composed of 67 places in 234 ms
[2020-06-03 06:56:53] [INFO ] Deduced a trap composed of 99 places in 193 ms
[2020-06-03 06:56:55] [INFO ] Deduced a trap composed of 23 places in 252 ms
[2020-06-03 06:56:55] [INFO ] Deduced a trap composed of 39 places in 277 ms
[2020-06-03 06:56:55] [INFO ] Deduced a trap composed of 56 places in 177 ms
[2020-06-03 06:56:56] [INFO ] Deduced a trap composed of 58 places in 138 ms
[2020-06-03 06:56:56] [INFO ] Deduced a trap composed of 55 places in 174 ms
[2020-06-03 06:56:56] [INFO ] Deduced a trap composed of 99 places in 169 ms
[2020-06-03 06:56:57] [INFO ] Deduced a trap composed of 12 places in 175 ms
[2020-06-03 06:56:58] [INFO ] Deduced a trap composed of 93 places in 139 ms
[2020-06-03 06:56:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 83 trap constraints in 27795 ms
[2020-06-03 06:56:58] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2020-06-03 06:56:58] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2020-06-03 06:56:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:56:58] [INFO ] [Real]Absence check using state equation in 782 ms returned sat
[2020-06-03 06:56:59] [INFO ] [Real]Added 366 Read/Feed constraints in 78 ms returned sat
[2020-06-03 06:56:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:56:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 24 ms returned sat
[2020-06-03 06:56:59] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2020-06-03 06:56:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:56:59] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2020-06-03 06:56:59] [INFO ] [Nat]Added 366 Read/Feed constraints in 80 ms returned sat
[2020-06-03 06:57:00] [INFO ] Deduced a trap composed of 27 places in 301 ms
[2020-06-03 06:57:00] [INFO ] Deduced a trap composed of 93 places in 235 ms
[2020-06-03 06:57:00] [INFO ] Deduced a trap composed of 22 places in 238 ms
[2020-06-03 06:57:01] [INFO ] Deduced a trap composed of 21 places in 263 ms
[2020-06-03 06:57:01] [INFO ] Deduced a trap composed of 47 places in 233 ms
[2020-06-03 06:57:01] [INFO ] Deduced a trap composed of 46 places in 250 ms
[2020-06-03 06:57:01] [INFO ] Deduced a trap composed of 51 places in 236 ms
[2020-06-03 06:57:02] [INFO ] Deduced a trap composed of 12 places in 234 ms
[2020-06-03 06:57:02] [INFO ] Deduced a trap composed of 12 places in 241 ms
[2020-06-03 06:57:02] [INFO ] Deduced a trap composed of 20 places in 231 ms
[2020-06-03 06:57:02] [INFO ] Deduced a trap composed of 41 places in 239 ms
[2020-06-03 06:57:03] [INFO ] Deduced a trap composed of 30 places in 416 ms
[2020-06-03 06:57:03] [INFO ] Deduced a trap composed of 12 places in 344 ms
[2020-06-03 06:57:04] [INFO ] Deduced a trap composed of 11 places in 246 ms
[2020-06-03 06:57:04] [INFO ] Deduced a trap composed of 37 places in 209 ms
[2020-06-03 06:57:04] [INFO ] Deduced a trap composed of 13 places in 454 ms
[2020-06-03 06:57:05] [INFO ] Deduced a trap composed of 19 places in 233 ms
[2020-06-03 06:57:05] [INFO ] Deduced a trap composed of 51 places in 227 ms
[2020-06-03 06:57:05] [INFO ] Deduced a trap composed of 51 places in 193 ms
[2020-06-03 06:57:05] [INFO ] Deduced a trap composed of 62 places in 168 ms
[2020-06-03 06:57:06] [INFO ] Deduced a trap composed of 40 places in 224 ms
[2020-06-03 06:57:06] [INFO ] Deduced a trap composed of 35 places in 185 ms
[2020-06-03 06:57:06] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6364 ms
[2020-06-03 06:57:06] [INFO ] Computed and/alt/rep : 1135/8180/925 causal constraints in 47 ms.
[2020-06-03 06:57:22] [INFO ] Added : 783 causal constraints over 157 iterations in 16686 ms. Result :sat
[2020-06-03 06:57:23] [INFO ] Deduced a trap composed of 29 places in 306 ms
[2020-06-03 06:57:23] [INFO ] Deduced a trap composed of 10 places in 343 ms
[2020-06-03 06:57:24] [INFO ] Deduced a trap composed of 19 places in 313 ms
[2020-06-03 06:57:24] [INFO ] Deduced a trap composed of 40 places in 297 ms
[2020-06-03 06:57:25] [INFO ] Deduced a trap composed of 10 places in 232 ms
[2020-06-03 06:57:25] [INFO ] Deduced a trap composed of 67 places in 268 ms
[2020-06-03 06:57:26] [INFO ] Deduced a trap composed of 67 places in 420 ms
[2020-06-03 06:57:26] [INFO ] Deduced a trap composed of 64 places in 218 ms
[2020-06-03 06:57:26] [INFO ] Deduced a trap composed of 40 places in 228 ms
[2020-06-03 06:57:27] [INFO ] Deduced a trap composed of 10 places in 224 ms
[2020-06-03 06:57:27] [INFO ] Deduced a trap composed of 57 places in 232 ms
[2020-06-03 06:57:27] [INFO ] Deduced a trap composed of 57 places in 208 ms
[2020-06-03 06:57:28] [INFO ] Deduced a trap composed of 57 places in 221 ms
[2020-06-03 06:57:28] [INFO ] Deduced a trap composed of 42 places in 211 ms
[2020-06-03 06:57:28] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5539 ms
Attempting to minimize the solution found.
Minimization took 85 ms.
FORMULA Peterson-PT-6-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 174500 steps, including 1000 resets, run finished after 420 ms. (steps per millisecond=415 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 222300 steps, including 1000 resets, run finished after 496 ms. (steps per millisecond=448 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 34 out of 442 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 442/442 places, 1142/1142 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 442 transition count 1141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 441 transition count 1141
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 441 transition count 1136
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 436 transition count 1136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 435 transition count 1135
Applied a total of 14 rules in 59 ms. Remains 435 /442 variables (removed 7) and now considering 1135/1142 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 435/442 places, 1135/1142 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2156 ms. (steps per millisecond=463 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 587 ms. (steps per millisecond=1703 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 743 ms. (steps per millisecond=1345 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 770 ms. (steps per millisecond=1298 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1007 ms. (steps per millisecond=993 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 10711512 steps, run timeout after 30001 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 10711512 steps, saw 1338940 distinct states, run finished after 30001 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0]
[2020-06-03 06:58:04] [INFO ] Flow matrix only has 925 transitions (discarded 210 similar events)
// Phase 1: matrix 925 rows 435 cols
[2020-06-03 06:58:04] [INFO ] Computed 27 place invariants in 3 ms
[2020-06-03 06:58:04] [INFO ] [Real]Absence check using 20 positive place invariants in 18 ms returned sat
[2020-06-03 06:58:04] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-06-03 06:58:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:05] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2020-06-03 06:58:05] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 06:58:05] [INFO ] [Real]Added 366 Read/Feed constraints in 46 ms returned sat
[2020-06-03 06:58:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:58:05] [INFO ] [Nat]Absence check using 20 positive place invariants in 33 ms returned sat
[2020-06-03 06:58:05] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2020-06-03 06:58:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:06] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2020-06-03 06:58:06] [INFO ] [Nat]Added 366 Read/Feed constraints in 57 ms returned sat
[2020-06-03 06:58:06] [INFO ] Deduced a trap composed of 123 places in 266 ms
[2020-06-03 06:58:07] [INFO ] Deduced a trap composed of 66 places in 266 ms
[2020-06-03 06:58:07] [INFO ] Deduced a trap composed of 116 places in 270 ms
[2020-06-03 06:58:07] [INFO ] Deduced a trap composed of 29 places in 278 ms
[2020-06-03 06:58:08] [INFO ] Deduced a trap composed of 51 places in 252 ms
[2020-06-03 06:58:08] [INFO ] Deduced a trap composed of 12 places in 246 ms
[2020-06-03 06:58:08] [INFO ] Deduced a trap composed of 57 places in 231 ms
[2020-06-03 06:58:08] [INFO ] Deduced a trap composed of 29 places in 202 ms
[2020-06-03 06:58:09] [INFO ] Deduced a trap composed of 39 places in 256 ms
[2020-06-03 06:58:09] [INFO ] Deduced a trap composed of 29 places in 223 ms
[2020-06-03 06:58:09] [INFO ] Deduced a trap composed of 28 places in 230 ms
[2020-06-03 06:58:09] [INFO ] Deduced a trap composed of 29 places in 222 ms
[2020-06-03 06:58:10] [INFO ] Deduced a trap composed of 51 places in 281 ms
[2020-06-03 06:58:10] [INFO ] Deduced a trap composed of 31 places in 212 ms
[2020-06-03 06:58:10] [INFO ] Deduced a trap composed of 35 places in 234 ms
[2020-06-03 06:58:10] [INFO ] Deduced a trap composed of 18 places in 239 ms
[2020-06-03 06:58:11] [INFO ] Deduced a trap composed of 18 places in 231 ms
[2020-06-03 06:58:11] [INFO ] Deduced a trap composed of 49 places in 242 ms
[2020-06-03 06:58:11] [INFO ] Deduced a trap composed of 18 places in 242 ms
[2020-06-03 06:58:12] [INFO ] Deduced a trap composed of 18 places in 630 ms
[2020-06-03 06:58:12] [INFO ] Deduced a trap composed of 18 places in 224 ms
[2020-06-03 06:58:12] [INFO ] Deduced a trap composed of 18 places in 227 ms
[2020-06-03 06:58:13] [INFO ] Deduced a trap composed of 58 places in 229 ms
[2020-06-03 06:58:13] [INFO ] Deduced a trap composed of 41 places in 254 ms
[2020-06-03 06:58:13] [INFO ] Deduced a trap composed of 11 places in 244 ms
[2020-06-03 06:58:13] [INFO ] Deduced a trap composed of 39 places in 226 ms
[2020-06-03 06:58:14] [INFO ] Deduced a trap composed of 39 places in 232 ms
[2020-06-03 06:58:14] [INFO ] Deduced a trap composed of 13 places in 242 ms
[2020-06-03 06:58:14] [INFO ] Deduced a trap composed of 10 places in 217 ms
[2020-06-03 06:58:15] [INFO ] Deduced a trap composed of 13 places in 224 ms
[2020-06-03 06:58:15] [INFO ] Deduced a trap composed of 39 places in 207 ms
[2020-06-03 06:58:15] [INFO ] Deduced a trap composed of 13 places in 195 ms
[2020-06-03 06:58:15] [INFO ] Deduced a trap composed of 51 places in 209 ms
[2020-06-03 06:58:15] [INFO ] Deduced a trap composed of 51 places in 204 ms
[2020-06-03 06:58:16] [INFO ] Deduced a trap composed of 40 places in 179 ms
[2020-06-03 06:58:16] [INFO ] Deduced a trap composed of 11 places in 210 ms
[2020-06-03 06:58:16] [INFO ] Deduced a trap composed of 38 places in 199 ms
[2020-06-03 06:58:16] [INFO ] Deduced a trap composed of 52 places in 197 ms
[2020-06-03 06:58:17] [INFO ] Deduced a trap composed of 20 places in 185 ms
[2020-06-03 06:58:17] [INFO ] Deduced a trap composed of 14 places in 195 ms
[2020-06-03 06:58:17] [INFO ] Deduced a trap composed of 10 places in 206 ms
[2020-06-03 06:58:17] [INFO ] Deduced a trap composed of 14 places in 210 ms
[2020-06-03 06:58:18] [INFO ] Deduced a trap composed of 40 places in 196 ms
[2020-06-03 06:58:18] [INFO ] Deduced a trap composed of 49 places in 157 ms
[2020-06-03 06:58:18] [INFO ] Deduced a trap composed of 27 places in 164 ms
[2020-06-03 06:58:18] [INFO ] Deduced a trap composed of 48 places in 132 ms
[2020-06-03 06:58:19] [INFO ] Deduced a trap composed of 43 places in 385 ms
[2020-06-03 06:58:19] [INFO ] Deduced a trap composed of 43 places in 145 ms
[2020-06-03 06:58:19] [INFO ] Deduced a trap composed of 43 places in 158 ms
[2020-06-03 06:58:19] [INFO ] Deduced a trap composed of 12 places in 245 ms
[2020-06-03 06:58:19] [INFO ] Deduced a trap composed of 57 places in 171 ms
[2020-06-03 06:58:20] [INFO ] Deduced a trap composed of 55 places in 168 ms
[2020-06-03 06:58:20] [INFO ] Deduced a trap composed of 56 places in 153 ms
[2020-06-03 06:58:20] [INFO ] Deduced a trap composed of 57 places in 148 ms
[2020-06-03 06:58:20] [INFO ] Deduced a trap composed of 57 places in 175 ms
[2020-06-03 06:58:20] [INFO ] Deduced a trap composed of 49 places in 131 ms
[2020-06-03 06:58:21] [INFO ] Deduced a trap composed of 46 places in 130 ms
[2020-06-03 06:58:21] [INFO ] Deduced a trap composed of 49 places in 149 ms
[2020-06-03 06:58:21] [INFO ] Deduced a trap composed of 51 places in 134 ms
[2020-06-03 06:58:21] [INFO ] Trap strengthening (SAT) tested/added 60/59 trap constraints in 14923 ms
[2020-06-03 06:58:21] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 49 ms.
[2020-06-03 06:58:38] [INFO ] Added : 694 causal constraints over 139 iterations in 17502 ms. Result :sat
[2020-06-03 06:58:39] [INFO ] Deduced a trap composed of 28 places in 242 ms
[2020-06-03 06:58:39] [INFO ] Deduced a trap composed of 52 places in 243 ms
[2020-06-03 06:58:39] [INFO ] Deduced a trap composed of 38 places in 245 ms
[2020-06-03 06:58:40] [INFO ] Deduced a trap composed of 21 places in 265 ms
[2020-06-03 06:58:40] [INFO ] Deduced a trap composed of 21 places in 197 ms
[2020-06-03 06:58:41] [INFO ] Deduced a trap composed of 19 places in 226 ms
[2020-06-03 06:58:41] [INFO ] Deduced a trap composed of 22 places in 269 ms
[2020-06-03 06:58:41] [INFO ] Deduced a trap composed of 13 places in 282 ms
[2020-06-03 06:58:42] [INFO ] Deduced a trap composed of 39 places in 269 ms
[2020-06-03 06:58:44] [INFO ] Deduced a trap composed of 70 places in 1984 ms
[2020-06-03 06:58:44] [INFO ] Deduced a trap composed of 20 places in 247 ms
[2020-06-03 06:58:45] [INFO ] Deduced a trap composed of 48 places in 238 ms
[2020-06-03 06:58:45] [INFO ] Deduced a trap composed of 22 places in 218 ms
[2020-06-03 06:58:45] [INFO ] Deduced a trap composed of 55 places in 143 ms
[2020-06-03 06:58:45] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 7011 ms
Attempting to minimize the solution found.
Minimization took 100 ms.
[2020-06-03 06:58:46] [INFO ] [Real]Absence check using 20 positive place invariants in 31 ms returned sat
[2020-06-03 06:58:46] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-06-03 06:58:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:46] [INFO ] [Real]Absence check using state equation in 768 ms returned sat
[2020-06-03 06:58:47] [INFO ] [Real]Added 366 Read/Feed constraints in 54 ms returned sat
[2020-06-03 06:58:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:58:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2020-06-03 06:58:47] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2020-06-03 06:58:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:47] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2020-06-03 06:58:47] [INFO ] [Nat]Added 366 Read/Feed constraints in 54 ms returned sat
[2020-06-03 06:58:48] [INFO ] Deduced a trap composed of 30 places in 171 ms
[2020-06-03 06:58:48] [INFO ] Deduced a trap composed of 39 places in 169 ms
[2020-06-03 06:58:48] [INFO ] Deduced a trap composed of 37 places in 199 ms
[2020-06-03 06:58:48] [INFO ] Deduced a trap composed of 20 places in 184 ms
[2020-06-03 06:58:48] [INFO ] Deduced a trap composed of 29 places in 156 ms
[2020-06-03 06:58:49] [INFO ] Deduced a trap composed of 31 places in 152 ms
[2020-06-03 06:58:49] [INFO ] Deduced a trap composed of 31 places in 158 ms
[2020-06-03 06:58:49] [INFO ] Deduced a trap composed of 29 places in 152 ms
[2020-06-03 06:58:49] [INFO ] Deduced a trap composed of 29 places in 149 ms
[2020-06-03 06:58:49] [INFO ] Deduced a trap composed of 29 places in 155 ms
[2020-06-03 06:58:50] [INFO ] Deduced a trap composed of 20 places in 188 ms
[2020-06-03 06:58:50] [INFO ] Deduced a trap composed of 21 places in 197 ms
[2020-06-03 06:58:50] [INFO ] Deduced a trap composed of 25 places in 163 ms
[2020-06-03 06:58:50] [INFO ] Deduced a trap composed of 70 places in 185 ms
[2020-06-03 06:58:50] [INFO ] Deduced a trap composed of 39 places in 149 ms
[2020-06-03 06:58:51] [INFO ] Deduced a trap composed of 41 places in 193 ms
[2020-06-03 06:58:51] [INFO ] Deduced a trap composed of 20 places in 152 ms
[2020-06-03 06:58:51] [INFO ] Deduced a trap composed of 12 places in 180 ms
[2020-06-03 06:58:51] [INFO ] Deduced a trap composed of 59 places in 169 ms
[2020-06-03 06:58:51] [INFO ] Deduced a trap composed of 13 places in 164 ms
[2020-06-03 06:58:52] [INFO ] Deduced a trap composed of 13 places in 171 ms
[2020-06-03 06:58:52] [INFO ] Deduced a trap composed of 13 places in 190 ms
[2020-06-03 06:58:52] [INFO ] Deduced a trap composed of 11 places in 259 ms
[2020-06-03 06:58:52] [INFO ] Deduced a trap composed of 13 places in 170 ms
[2020-06-03 06:58:53] [INFO ] Deduced a trap composed of 57 places in 239 ms
[2020-06-03 06:58:53] [INFO ] Deduced a trap composed of 38 places in 175 ms
[2020-06-03 06:58:53] [INFO ] Deduced a trap composed of 20 places in 205 ms
[2020-06-03 06:58:53] [INFO ] Deduced a trap composed of 29 places in 228 ms
[2020-06-03 06:58:54] [INFO ] Deduced a trap composed of 44 places in 219 ms
[2020-06-03 06:58:54] [INFO ] Deduced a trap composed of 10 places in 184 ms
[2020-06-03 06:58:54] [INFO ] Deduced a trap composed of 29 places in 222 ms
[2020-06-03 06:58:54] [INFO ] Deduced a trap composed of 37 places in 191 ms
[2020-06-03 06:58:55] [INFO ] Deduced a trap composed of 21 places in 223 ms
[2020-06-03 06:58:55] [INFO ] Deduced a trap composed of 12 places in 239 ms
[2020-06-03 06:58:55] [INFO ] Deduced a trap composed of 48 places in 204 ms
[2020-06-03 06:58:55] [INFO ] Deduced a trap composed of 56 places in 130 ms
[2020-06-03 06:58:55] [INFO ] Deduced a trap composed of 56 places in 134 ms
[2020-06-03 06:58:56] [INFO ] Deduced a trap composed of 55 places in 137 ms
[2020-06-03 06:58:56] [INFO ] Deduced a trap composed of 55 places in 119 ms
[2020-06-03 06:58:56] [INFO ] Deduced a trap composed of 57 places in 181 ms
[2020-06-03 06:58:56] [INFO ] Deduced a trap composed of 55 places in 121 ms
[2020-06-03 06:58:56] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 8784 ms
[2020-06-03 06:58:56] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 57 ms.
[2020-06-03 06:59:16] [INFO ] Added : 875 causal constraints over 175 iterations in 20191 ms.(timeout) Result :sat
[2020-06-03 06:59:17] [INFO ] Deduced a trap composed of 56 places in 221 ms
[2020-06-03 06:59:17] [INFO ] Deduced a trap composed of 47 places in 249 ms
[2020-06-03 06:59:17] [INFO ] Deduced a trap composed of 60 places in 217 ms
[2020-06-03 06:59:18] [INFO ] Deduced a trap composed of 57 places in 222 ms
[2020-06-03 06:59:18] [INFO ] Deduced a trap composed of 57 places in 232 ms
[2020-06-03 06:59:18] [INFO ] Deduced a trap composed of 47 places in 263 ms
[2020-06-03 06:59:19] [INFO ] Deduced a trap composed of 38 places in 236 ms
[2020-06-03 06:59:19] [INFO ] Deduced a trap composed of 12 places in 287 ms
[2020-06-03 06:59:20] [INFO ] Deduced a trap composed of 28 places in 236 ms
[2020-06-03 06:59:20] [INFO ] Deduced a trap composed of 11 places in 225 ms
[2020-06-03 06:59:21] [INFO ] Deduced a trap composed of 41 places in 252 ms
[2020-06-03 06:59:21] [INFO ] Deduced a trap composed of 35 places in 264 ms
[2020-06-03 06:59:22] [INFO ] Deduced a trap composed of 72 places in 290 ms
[2020-06-03 06:59:22] [INFO ] Deduced a trap composed of 15 places in 290 ms
[2020-06-03 06:59:23] [INFO ] Deduced a trap composed of 53 places in 208 ms
[2020-06-03 06:59:23] [INFO ] Deduced a trap composed of 79 places in 209 ms
[2020-06-03 06:59:23] [INFO ] Deduced a trap composed of 30 places in 240 ms
[2020-06-03 06:59:24] [INFO ] Deduced a trap composed of 58 places in 223 ms
[2020-06-03 06:59:24] [INFO ] Deduced a trap composed of 47 places in 218 ms
[2020-06-03 06:59:25] [INFO ] Deduced a trap composed of 31 places in 152 ms
[2020-06-03 06:59:25] [INFO ] Deduced a trap composed of 41 places in 141 ms
[2020-06-03 06:59:25] [INFO ] Deduced a trap composed of 30 places in 119 ms
[2020-06-03 06:59:25] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 8886 ms
Attempting to minimize the solution found.
Minimization took 136 ms.
[2020-06-03 06:59:26] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned sat
[2020-06-03 06:59:26] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-06-03 06:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:26] [INFO ] [Real]Absence check using state equation in 753 ms returned sat
[2020-06-03 06:59:26] [INFO ] [Real]Added 366 Read/Feed constraints in 60 ms returned sat
[2020-06-03 06:59:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:59:26] [INFO ] [Nat]Absence check using 20 positive place invariants in 32 ms returned sat
[2020-06-03 06:59:26] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2020-06-03 06:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:59:27] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2020-06-03 06:59:27] [INFO ] [Nat]Added 366 Read/Feed constraints in 56 ms returned sat
[2020-06-03 06:59:28] [INFO ] Deduced a trap composed of 14 places in 327 ms
[2020-06-03 06:59:28] [INFO ] Deduced a trap composed of 18 places in 265 ms
[2020-06-03 06:59:28] [INFO ] Deduced a trap composed of 18 places in 302 ms
[2020-06-03 06:59:28] [INFO ] Deduced a trap composed of 10 places in 279 ms
[2020-06-03 06:59:29] [INFO ] Deduced a trap composed of 12 places in 334 ms
[2020-06-03 06:59:29] [INFO ] Deduced a trap composed of 26 places in 262 ms
[2020-06-03 06:59:29] [INFO ] Deduced a trap composed of 26 places in 245 ms
[2020-06-03 06:59:30] [INFO ] Deduced a trap composed of 26 places in 254 ms
[2020-06-03 06:59:30] [INFO ] Deduced a trap composed of 26 places in 250 ms
[2020-06-03 06:59:30] [INFO ] Deduced a trap composed of 26 places in 242 ms
[2020-06-03 06:59:30] [INFO ] Deduced a trap composed of 10 places in 241 ms
[2020-06-03 06:59:31] [INFO ] Deduced a trap composed of 40 places in 213 ms
[2020-06-03 06:59:31] [INFO ] Deduced a trap composed of 19 places in 222 ms
[2020-06-03 06:59:31] [INFO ] Deduced a trap composed of 79 places in 236 ms
[2020-06-03 06:59:32] [INFO ] Deduced a trap composed of 18 places in 288 ms
[2020-06-03 06:59:32] [INFO ] Deduced a trap composed of 77 places in 272 ms
[2020-06-03 06:59:32] [INFO ] Deduced a trap composed of 20 places in 584 ms
[2020-06-03 06:59:33] [INFO ] Deduced a trap composed of 39 places in 221 ms
[2020-06-03 06:59:33] [INFO ] Deduced a trap composed of 18 places in 223 ms
[2020-06-03 06:59:33] [INFO ] Deduced a trap composed of 27 places in 294 ms
[2020-06-03 06:59:34] [INFO ] Deduced a trap composed of 18 places in 268 ms
[2020-06-03 06:59:34] [INFO ] Deduced a trap composed of 38 places in 197 ms
[2020-06-03 06:59:34] [INFO ] Deduced a trap composed of 47 places in 186 ms
[2020-06-03 06:59:34] [INFO ] Deduced a trap composed of 58 places in 219 ms
[2020-06-03 06:59:35] [INFO ] Deduced a trap composed of 58 places in 204 ms
[2020-06-03 06:59:35] [INFO ] Deduced a trap composed of 55 places in 147 ms
[2020-06-03 06:59:35] [INFO ] Deduced a trap composed of 39 places in 154 ms
[2020-06-03 06:59:35] [INFO ] Deduced a trap composed of 63 places in 190 ms
[2020-06-03 06:59:35] [INFO ] Deduced a trap composed of 47 places in 190 ms
[2020-06-03 06:59:36] [INFO ] Deduced a trap composed of 56 places in 199 ms
[2020-06-03 06:59:36] [INFO ] Deduced a trap composed of 50 places in 180 ms
[2020-06-03 06:59:36] [INFO ] Deduced a trap composed of 48 places in 198 ms
[2020-06-03 06:59:36] [INFO ] Deduced a trap composed of 75 places in 175 ms
[2020-06-03 06:59:36] [INFO ] Deduced a trap composed of 47 places in 196 ms
[2020-06-03 06:59:37] [INFO ] Deduced a trap composed of 68 places in 170 ms
[2020-06-03 06:59:37] [INFO ] Deduced a trap composed of 37 places in 154 ms
[2020-06-03 06:59:37] [INFO ] Deduced a trap composed of 37 places in 153 ms
[2020-06-03 06:59:37] [INFO ] Deduced a trap composed of 58 places in 166 ms
[2020-06-03 06:59:37] [INFO ] Deduced a trap composed of 70 places in 170 ms
[2020-06-03 06:59:38] [INFO ] Deduced a trap composed of 57 places in 164 ms
[2020-06-03 06:59:38] [INFO ] Deduced a trap composed of 71 places in 145 ms
[2020-06-03 06:59:38] [INFO ] Deduced a trap composed of 48 places in 168 ms
[2020-06-03 06:59:38] [INFO ] Deduced a trap composed of 47 places in 160 ms
[2020-06-03 06:59:38] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 11005 ms
[2020-06-03 06:59:38] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 57 ms.
[2020-06-03 06:59:53] [INFO ] Added : 643 causal constraints over 129 iterations in 14712 ms. Result :sat
[2020-06-03 06:59:53] [INFO ] Deduced a trap composed of 19 places in 304 ms
[2020-06-03 06:59:54] [INFO ] Deduced a trap composed of 30 places in 303 ms
[2020-06-03 06:59:54] [INFO ] Deduced a trap composed of 48 places in 261 ms
[2020-06-03 06:59:54] [INFO ] Deduced a trap composed of 19 places in 268 ms
[2020-06-03 06:59:55] [INFO ] Deduced a trap composed of 34 places in 296 ms
[2020-06-03 06:59:55] [INFO ] Deduced a trap composed of 20 places in 259 ms
[2020-06-03 06:59:56] [INFO ] Deduced a trap composed of 49 places in 286 ms
[2020-06-03 06:59:56] [INFO ] Deduced a trap composed of 55 places in 264 ms
[2020-06-03 06:59:56] [INFO ] Deduced a trap composed of 38 places in 264 ms
[2020-06-03 06:59:57] [INFO ] Deduced a trap composed of 20 places in 251 ms
[2020-06-03 06:59:57] [INFO ] Deduced a trap composed of 51 places in 274 ms
[2020-06-03 06:59:57] [INFO ] Deduced a trap composed of 61 places in 287 ms
[2020-06-03 06:59:58] [INFO ] Deduced a trap composed of 48 places in 287 ms
[2020-06-03 06:59:58] [INFO ] Deduced a trap composed of 27 places in 262 ms
[2020-06-03 06:59:59] [INFO ] Deduced a trap composed of 40 places in 271 ms
[2020-06-03 06:59:59] [INFO ] Deduced a trap composed of 59 places in 257 ms
[2020-06-03 06:59:59] [INFO ] Deduced a trap composed of 31 places in 242 ms
[2020-06-03 07:00:00] [INFO ] Deduced a trap composed of 60 places in 260 ms
[2020-06-03 07:00:00] [INFO ] Deduced a trap composed of 23 places in 252 ms
[2020-06-03 07:00:01] [INFO ] Deduced a trap composed of 19 places in 285 ms
[2020-06-03 07:00:01] [INFO ] Deduced a trap composed of 49 places in 253 ms
[2020-06-03 07:00:02] [INFO ] Deduced a trap composed of 31 places in 220 ms
[2020-06-03 07:00:02] [INFO ] Deduced a trap composed of 39 places in 294 ms
[2020-06-03 07:00:02] [INFO ] Deduced a trap composed of 49 places in 259 ms
[2020-06-03 07:00:03] [INFO ] Deduced a trap composed of 71 places in 250 ms
[2020-06-03 07:00:03] [INFO ] Deduced a trap composed of 29 places in 233 ms
[2020-06-03 07:00:04] [INFO ] Deduced a trap composed of 29 places in 213 ms
[2020-06-03 07:00:04] [INFO ] Deduced a trap composed of 43 places in 214 ms
[2020-06-03 07:00:04] [INFO ] Deduced a trap composed of 29 places in 211 ms
[2020-06-03 07:00:05] [INFO ] Deduced a trap composed of 41 places in 206 ms
[2020-06-03 07:00:05] [INFO ] Deduced a trap composed of 38 places in 201 ms
[2020-06-03 07:00:06] [INFO ] Deduced a trap composed of 38 places in 210 ms
[2020-06-03 07:00:06] [INFO ] Deduced a trap composed of 61 places in 239 ms
[2020-06-03 07:00:07] [INFO ] Deduced a trap composed of 39 places in 227 ms
[2020-06-03 07:00:07] [INFO ] Deduced a trap composed of 54 places in 177 ms
[2020-06-03 07:00:07] [INFO ] Deduced a trap composed of 28 places in 196 ms
[2020-06-03 07:00:08] [INFO ] Deduced a trap composed of 55 places in 198 ms
[2020-06-03 07:00:08] [INFO ] Deduced a trap composed of 29 places in 200 ms
[2020-06-03 07:00:08] [INFO ] Deduced a trap composed of 22 places in 215 ms
[2020-06-03 07:00:09] [INFO ] Deduced a trap composed of 10 places in 235 ms
[2020-06-03 07:00:09] [INFO ] Deduced a trap composed of 26 places in 217 ms
[2020-06-03 07:00:09] [INFO ] Deduced a trap composed of 41 places in 195 ms
[2020-06-03 07:00:10] [INFO ] Deduced a trap composed of 13 places in 232 ms
[2020-06-03 07:00:10] [INFO ] Deduced a trap composed of 39 places in 189 ms
[2020-06-03 07:00:11] [INFO ] Deduced a trap composed of 32 places in 224 ms
[2020-06-03 07:00:11] [INFO ] Deduced a trap composed of 11 places in 276 ms
[2020-06-03 07:00:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 07:00:12] [INFO ] Deduced a trap composed of 2 places in 610 ms
[2020-06-03 07:00:12] [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 (> (+ s299 s427) 0)") while checking expression at index 2
[2020-06-03 07:00:12] [INFO ] [Real]Absence check using 20 positive place invariants in 32 ms returned sat
[2020-06-03 07:00:12] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-06-03 07:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:00:13] [INFO ] [Real]Absence check using state equation in 639 ms returned sat
[2020-06-03 07:00:13] [INFO ] [Real]Added 366 Read/Feed constraints in 66 ms returned sat
[2020-06-03 07:00:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:00:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2020-06-03 07:00:13] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 19 ms returned sat
[2020-06-03 07:00:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:00:14] [INFO ] [Nat]Absence check using state equation in 734 ms returned sat
[2020-06-03 07:00:14] [INFO ] [Nat]Added 366 Read/Feed constraints in 62 ms returned sat
[2020-06-03 07:00:14] [INFO ] Deduced a trap composed of 22 places in 273 ms
[2020-06-03 07:00:14] [INFO ] Deduced a trap composed of 10 places in 257 ms
[2020-06-03 07:00:15] [INFO ] Deduced a trap composed of 39 places in 308 ms
[2020-06-03 07:00:15] [INFO ] Deduced a trap composed of 40 places in 288 ms
[2020-06-03 07:00:15] [INFO ] Deduced a trap composed of 53 places in 287 ms
[2020-06-03 07:00:16] [INFO ] Deduced a trap composed of 14 places in 308 ms
[2020-06-03 07:00:16] [INFO ] Deduced a trap composed of 11 places in 273 ms
[2020-06-03 07:00:16] [INFO ] Deduced a trap composed of 19 places in 259 ms
[2020-06-03 07:00:17] [INFO ] Deduced a trap composed of 48 places in 263 ms
[2020-06-03 07:00:17] [INFO ] Deduced a trap composed of 18 places in 269 ms
[2020-06-03 07:00:17] [INFO ] Deduced a trap composed of 28 places in 260 ms
[2020-06-03 07:00:17] [INFO ] Deduced a trap composed of 68 places in 239 ms
[2020-06-03 07:00:18] [INFO ] Deduced a trap composed of 20 places in 235 ms
[2020-06-03 07:00:18] [INFO ] Deduced a trap composed of 20 places in 245 ms
[2020-06-03 07:00:18] [INFO ] Deduced a trap composed of 43 places in 183 ms
[2020-06-03 07:00:18] [INFO ] Deduced a trap composed of 10 places in 214 ms
[2020-06-03 07:00:19] [INFO ] Deduced a trap composed of 10 places in 252 ms
[2020-06-03 07:00:19] [INFO ] Deduced a trap composed of 78 places in 223 ms
[2020-06-03 07:00:19] [INFO ] Deduced a trap composed of 26 places in 210 ms
[2020-06-03 07:00:19] [INFO ] Deduced a trap composed of 10 places in 202 ms
[2020-06-03 07:00:20] [INFO ] Deduced a trap composed of 43 places in 207 ms
[2020-06-03 07:00:20] [INFO ] Deduced a trap composed of 45 places in 175 ms
[2020-06-03 07:00:20] [INFO ] Deduced a trap composed of 43 places in 220 ms
[2020-06-03 07:00:20] [INFO ] Deduced a trap composed of 51 places in 189 ms
[2020-06-03 07:00:21] [INFO ] Deduced a trap composed of 44 places in 147 ms
[2020-06-03 07:00:21] [INFO ] Deduced a trap composed of 50 places in 154 ms
[2020-06-03 07:00:21] [INFO ] Deduced a trap composed of 21 places in 165 ms
[2020-06-03 07:00:21] [INFO ] Deduced a trap composed of 29 places in 209 ms
[2020-06-03 07:00:21] [INFO ] Deduced a trap composed of 14 places in 198 ms
[2020-06-03 07:00:22] [INFO ] Deduced a trap composed of 57 places in 285 ms
[2020-06-03 07:00:22] [INFO ] Deduced a trap composed of 32 places in 234 ms
[2020-06-03 07:00:22] [INFO ] Deduced a trap composed of 25 places in 241 ms
[2020-06-03 07:00:23] [INFO ] Deduced a trap composed of 43 places in 303 ms
[2020-06-03 07:00:23] [INFO ] Deduced a trap composed of 19 places in 251 ms
[2020-06-03 07:00:23] [INFO ] Deduced a trap composed of 39 places in 146 ms
[2020-06-03 07:00:23] [INFO ] Deduced a trap composed of 51 places in 135 ms
[2020-06-03 07:00:24] [INFO ] Deduced a trap composed of 56 places in 145 ms
[2020-06-03 07:00:24] [INFO ] Deduced a trap composed of 54 places in 152 ms
[2020-06-03 07:00:24] [INFO ] Deduced a trap composed of 52 places in 262 ms
[2020-06-03 07:00:24] [INFO ] Deduced a trap composed of 48 places in 236 ms
[2020-06-03 07:00:25] [INFO ] Deduced a trap composed of 44 places in 235 ms
[2020-06-03 07:00:25] [INFO ] Deduced a trap composed of 36 places in 410 ms
[2020-06-03 07:00:25] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 11299 ms
[2020-06-03 07:00:25] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 58 ms.
[2020-06-03 07:00:45] [INFO ] Added : 860 causal constraints over 172 iterations in 20118 ms.(timeout) Result :sat
[2020-06-03 07:00:46] [INFO ] Deduced a trap composed of 20 places in 296 ms
[2020-06-03 07:00:46] [INFO ] Deduced a trap composed of 41 places in 261 ms
[2020-06-03 07:00:46] [INFO ] Deduced a trap composed of 53 places in 259 ms
[2020-06-03 07:00:47] [INFO ] Deduced a trap composed of 57 places in 250 ms
[2020-06-03 07:00:47] [INFO ] Deduced a trap composed of 49 places in 247 ms
[2020-06-03 07:00:47] [INFO ] Deduced a trap composed of 39 places in 208 ms
[2020-06-03 07:00:48] [INFO ] Deduced a trap composed of 38 places in 215 ms
[2020-06-03 07:00:48] [INFO ] Deduced a trap composed of 61 places in 265 ms
[2020-06-03 07:00:49] [INFO ] Deduced a trap composed of 50 places in 229 ms
[2020-06-03 07:00:49] [INFO ] Deduced a trap composed of 19 places in 216 ms
[2020-06-03 07:00:49] [INFO ] Deduced a trap composed of 12 places in 255 ms
[2020-06-03 07:00:50] [INFO ] Deduced a trap composed of 66 places in 296 ms
[2020-06-03 07:00:50] [INFO ] Deduced a trap composed of 11 places in 255 ms
[2020-06-03 07:00:51] [INFO ] Deduced a trap composed of 63 places in 308 ms
[2020-06-03 07:00:51] [INFO ] Deduced a trap composed of 11 places in 284 ms
[2020-06-03 07:00:51] [INFO ] Deduced a trap composed of 12 places in 260 ms
[2020-06-03 07:00:52] [INFO ] Deduced a trap composed of 51 places in 217 ms
[2020-06-03 07:00:52] [INFO ] Deduced a trap composed of 57 places in 206 ms
[2020-06-03 07:00:53] [INFO ] Deduced a trap composed of 48 places in 214 ms
[2020-06-03 07:00:53] [INFO ] Deduced a trap composed of 56 places in 226 ms
[2020-06-03 07:00:53] [INFO ] Deduced a trap composed of 40 places in 214 ms
[2020-06-03 07:00:54] [INFO ] Deduced a trap composed of 59 places in 241 ms
[2020-06-03 07:00:54] [INFO ] Deduced a trap composed of 57 places in 214 ms
[2020-06-03 07:00:54] [INFO ] Deduced a trap composed of 39 places in 208 ms
[2020-06-03 07:00:55] [INFO ] Deduced a trap composed of 13 places in 672 ms
[2020-06-03 07:00:56] [INFO ] Deduced a trap composed of 13 places in 251 ms
[2020-06-03 07:00:56] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 10839 ms
Attempting to minimize the solution found.
Minimization took 116 ms.
Incomplete Parikh walk after 230100 steps, including 1000 resets, run finished after 563 ms. (steps per millisecond=408 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 257400 steps, including 1000 resets, run finished after 546 ms. (steps per millisecond=471 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 127500 steps, including 1000 resets, run finished after 297 ms. (steps per millisecond=429 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 34 out of 435 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 435/435 places, 1135/1135 transitions.
Applied a total of 0 rules in 21 ms. Remains 435 /435 variables (removed 0) and now considering 1135/1135 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 435/435 places, 1135/1135 transitions.
Starting structural reductions, iteration 0 : 435/435 places, 1135/1135 transitions.
Applied a total of 0 rules in 20 ms. Remains 435 /435 variables (removed 0) and now considering 1135/1135 (removed 0) transitions.
[2020-06-03 07:00:58] [INFO ] Flow matrix only has 925 transitions (discarded 210 similar events)
// Phase 1: matrix 925 rows 435 cols
[2020-06-03 07:00:58] [INFO ] Computed 27 place invariants in 3 ms
[2020-06-03 07:00:58] [INFO ] Implicit Places using invariants in 577 ms returned [414, 415, 417, 427, 428, 429, 430]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 585 ms to find 7 implicit places.
[2020-06-03 07:00:58] [INFO ] Redundant transitions in 95 ms returned []
[2020-06-03 07:00:58] [INFO ] Flow matrix only has 925 transitions (discarded 210 similar events)
// Phase 1: matrix 925 rows 428 cols
[2020-06-03 07:00:58] [INFO ] Computed 20 place invariants in 23 ms
[2020-06-03 07:01:00] [INFO ] Dead Transitions using invariants and state equation in 1960 ms returned []
Starting structural reductions, iteration 1 : 428/435 places, 1135/1135 transitions.
Applied a total of 0 rules in 33 ms. Remains 428 /428 variables (removed 0) and now considering 1135/1135 (removed 0) transitions.
[2020-06-03 07:01:00] [INFO ] Redundant transitions in 17 ms returned []
[2020-06-03 07:01:00] [INFO ] Flow matrix only has 925 transitions (discarded 210 similar events)
// Phase 1: matrix 925 rows 428 cols
[2020-06-03 07:01:00] [INFO ] Computed 20 place invariants in 5 ms
[2020-06-03 07:01:02] [INFO ] Dead Transitions using invariants and state equation in 1731 ms returned []
Finished structural reductions, in 2 iterations. Remains : 428/435 places, 1135/1135 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2160 ms. (steps per millisecond=462 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 547 ms. (steps per millisecond=1828 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 750 ms. (steps per millisecond=1333 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 710 ms. (steps per millisecond=1408 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1004 ms. (steps per millisecond=996 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 10911240 steps, run timeout after 30001 ms. (steps per millisecond=363 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 10911240 steps, saw 1363906 distinct states, run finished after 30001 ms. (steps per millisecond=363 ) properties seen :[0, 0, 0, 0]
[2020-06-03 07:01:37] [INFO ] Flow matrix only has 925 transitions (discarded 210 similar events)
// Phase 1: matrix 925 rows 428 cols
[2020-06-03 07:01:37] [INFO ] Computed 20 place invariants in 5 ms
[2020-06-03 07:01:37] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2020-06-03 07:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:01:38] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2020-06-03 07:01:38] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 07:01:38] [INFO ] [Real]Added 366 Read/Feed constraints in 58 ms returned sat
[2020-06-03 07:01:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:01:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2020-06-03 07:01:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:01:39] [INFO ] [Nat]Absence check using state equation in 702 ms returned sat
[2020-06-03 07:01:39] [INFO ] [Nat]Added 366 Read/Feed constraints in 80 ms returned sat
[2020-06-03 07:01:39] [INFO ] Deduced a trap composed of 10 places in 303 ms
[2020-06-03 07:01:40] [INFO ] Deduced a trap composed of 11 places in 269 ms
[2020-06-03 07:01:40] [INFO ] Deduced a trap composed of 51 places in 184 ms
[2020-06-03 07:01:40] [INFO ] Deduced a trap composed of 20 places in 181 ms
[2020-06-03 07:01:40] [INFO ] Deduced a trap composed of 28 places in 189 ms
[2020-06-03 07:01:41] [INFO ] Deduced a trap composed of 28 places in 197 ms
[2020-06-03 07:01:41] [INFO ] Deduced a trap composed of 22 places in 181 ms
[2020-06-03 07:01:41] [INFO ] Deduced a trap composed of 51 places in 182 ms
[2020-06-03 07:01:41] [INFO ] Deduced a trap composed of 49 places in 176 ms
[2020-06-03 07:01:42] [INFO ] Deduced a trap composed of 20 places in 187 ms
[2020-06-03 07:01:42] [INFO ] Deduced a trap composed of 43 places in 178 ms
[2020-06-03 07:01:42] [INFO ] Deduced a trap composed of 34 places in 182 ms
[2020-06-03 07:01:42] [INFO ] Deduced a trap composed of 34 places in 180 ms
[2020-06-03 07:01:42] [INFO ] Deduced a trap composed of 46 places in 221 ms
[2020-06-03 07:01:43] [INFO ] Deduced a trap composed of 47 places in 238 ms
[2020-06-03 07:01:43] [INFO ] Deduced a trap composed of 46 places in 197 ms
[2020-06-03 07:01:43] [INFO ] Deduced a trap composed of 50 places in 217 ms
[2020-06-03 07:01:44] [INFO ] Deduced a trap composed of 11 places in 313 ms
[2020-06-03 07:01:44] [INFO ] Deduced a trap composed of 20 places in 243 ms
[2020-06-03 07:01:44] [INFO ] Deduced a trap composed of 32 places in 270 ms
[2020-06-03 07:01:44] [INFO ] Deduced a trap composed of 26 places in 240 ms
[2020-06-03 07:01:45] [INFO ] Deduced a trap composed of 26 places in 234 ms
[2020-06-03 07:01:45] [INFO ] Deduced a trap composed of 14 places in 218 ms
[2020-06-03 07:01:45] [INFO ] Deduced a trap composed of 61 places in 220 ms
[2020-06-03 07:01:45] [INFO ] Deduced a trap composed of 58 places in 250 ms
[2020-06-03 07:01:46] [INFO ] Deduced a trap composed of 59 places in 179 ms
[2020-06-03 07:01:46] [INFO ] Deduced a trap composed of 11 places in 219 ms
[2020-06-03 07:01:46] [INFO ] Deduced a trap composed of 12 places in 237 ms
[2020-06-03 07:01:47] [INFO ] Deduced a trap composed of 13 places in 251 ms
[2020-06-03 07:01:47] [INFO ] Deduced a trap composed of 39 places in 234 ms
[2020-06-03 07:01:47] [INFO ] Deduced a trap composed of 39 places in 200 ms
[2020-06-03 07:01:47] [INFO ] Deduced a trap composed of 26 places in 207 ms
[2020-06-03 07:01:47] [INFO ] Deduced a trap composed of 29 places in 186 ms
[2020-06-03 07:01:48] [INFO ] Deduced a trap composed of 29 places in 189 ms
[2020-06-03 07:01:48] [INFO ] Deduced a trap composed of 26 places in 189 ms
[2020-06-03 07:01:48] [INFO ] Deduced a trap composed of 35 places in 143 ms
[2020-06-03 07:01:48] [INFO ] Deduced a trap composed of 48 places in 177 ms
[2020-06-03 07:01:49] [INFO ] Deduced a trap composed of 40 places in 182 ms
[2020-06-03 07:01:49] [INFO ] Deduced a trap composed of 26 places in 227 ms
[2020-06-03 07:01:49] [INFO ] Deduced a trap composed of 18 places in 198 ms
[2020-06-03 07:01:49] [INFO ] Deduced a trap composed of 41 places in 142 ms
[2020-06-03 07:01:49] [INFO ] Deduced a trap composed of 35 places in 135 ms
[2020-06-03 07:01:50] [INFO ] Deduced a trap composed of 22 places in 140 ms
[2020-06-03 07:01:50] [INFO ] Deduced a trap composed of 21 places in 116 ms
[2020-06-03 07:01:50] [INFO ] Deduced a trap composed of 18 places in 153 ms
[2020-06-03 07:01:50] [INFO ] Deduced a trap composed of 21 places in 145 ms
[2020-06-03 07:01:50] [INFO ] Deduced a trap composed of 10 places in 194 ms
[2020-06-03 07:01:51] [INFO ] Deduced a trap composed of 19 places in 153 ms
[2020-06-03 07:01:51] [INFO ] Deduced a trap composed of 20 places in 266 ms
[2020-06-03 07:01:51] [INFO ] Deduced a trap composed of 51 places in 193 ms
[2020-06-03 07:01:51] [INFO ] Deduced a trap composed of 41 places in 152 ms
[2020-06-03 07:01:52] [INFO ] Deduced a trap composed of 33 places in 160 ms
[2020-06-03 07:01:52] [INFO ] Deduced a trap composed of 40 places in 177 ms
[2020-06-03 07:01:52] [INFO ] Deduced a trap composed of 49 places in 123 ms
[2020-06-03 07:01:52] [INFO ] Deduced a trap composed of 48 places in 143 ms
[2020-06-03 07:01:52] [INFO ] Deduced a trap composed of 40 places in 108 ms
[2020-06-03 07:01:52] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 13212 ms
[2020-06-03 07:01:52] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 69 ms.
[2020-06-03 07:02:07] [INFO ] Added : 669 causal constraints over 134 iterations in 15132 ms. Result :sat
[2020-06-03 07:02:08] [INFO ] Deduced a trap composed of 27 places in 222 ms
[2020-06-03 07:02:08] [INFO ] Deduced a trap composed of 35 places in 231 ms
[2020-06-03 07:02:09] [INFO ] Deduced a trap composed of 37 places in 381 ms
[2020-06-03 07:02:10] [INFO ] Deduced a trap composed of 31 places in 803 ms
[2020-06-03 07:02:10] [INFO ] Deduced a trap composed of 32 places in 284 ms
[2020-06-03 07:02:10] [INFO ] Deduced a trap composed of 41 places in 214 ms
[2020-06-03 07:02:11] [INFO ] Deduced a trap composed of 39 places in 294 ms
[2020-06-03 07:02:11] [INFO ] Deduced a trap composed of 19 places in 275 ms
[2020-06-03 07:02:12] [INFO ] Deduced a trap composed of 31 places in 254 ms
[2020-06-03 07:02:12] [INFO ] Deduced a trap composed of 13 places in 234 ms
[2020-06-03 07:02:13] [INFO ] Deduced a trap composed of 50 places in 214 ms
[2020-06-03 07:02:13] [INFO ] Deduced a trap composed of 47 places in 224 ms
[2020-06-03 07:02:13] [INFO ] Deduced a trap composed of 51 places in 191 ms
[2020-06-03 07:02:14] [INFO ] Deduced a trap composed of 58 places in 196 ms
[2020-06-03 07:02:14] [INFO ] Deduced a trap composed of 46 places in 187 ms
[2020-06-03 07:02:14] [INFO ] Deduced a trap composed of 46 places in 183 ms
[2020-06-03 07:02:15] [INFO ] Deduced a trap composed of 55 places in 189 ms
[2020-06-03 07:02:15] [INFO ] Deduced a trap composed of 56 places in 202 ms
[2020-06-03 07:02:15] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 7515 ms
Attempting to minimize the solution found.
Minimization took 97 ms.
[2020-06-03 07:02:15] [INFO ] [Real]Absence check using 20 positive place invariants in 85 ms returned sat
[2020-06-03 07:02:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:02:16] [INFO ] [Real]Absence check using state equation in 789 ms returned sat
[2020-06-03 07:02:16] [INFO ] [Real]Added 366 Read/Feed constraints in 59 ms returned sat
[2020-06-03 07:02:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:02:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2020-06-03 07:02:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:02:17] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2020-06-03 07:02:17] [INFO ] [Nat]Added 366 Read/Feed constraints in 57 ms returned sat
[2020-06-03 07:02:17] [INFO ] Deduced a trap composed of 22 places in 257 ms
[2020-06-03 07:02:18] [INFO ] Deduced a trap composed of 56 places in 260 ms
[2020-06-03 07:02:18] [INFO ] Deduced a trap composed of 11 places in 257 ms
[2020-06-03 07:02:18] [INFO ] Deduced a trap composed of 11 places in 227 ms
[2020-06-03 07:02:18] [INFO ] Deduced a trap composed of 11 places in 312 ms
[2020-06-03 07:02:19] [INFO ] Deduced a trap composed of 12 places in 354 ms
[2020-06-03 07:02:19] [INFO ] Deduced a trap composed of 62 places in 243 ms
[2020-06-03 07:02:19] [INFO ] Deduced a trap composed of 21 places in 209 ms
[2020-06-03 07:02:20] [INFO ] Deduced a trap composed of 83 places in 265 ms
[2020-06-03 07:02:20] [INFO ] Deduced a trap composed of 32 places in 217 ms
[2020-06-03 07:02:20] [INFO ] Deduced a trap composed of 25 places in 246 ms
[2020-06-03 07:02:20] [INFO ] Deduced a trap composed of 64 places in 223 ms
[2020-06-03 07:02:21] [INFO ] Deduced a trap composed of 42 places in 184 ms
[2020-06-03 07:02:21] [INFO ] Deduced a trap composed of 21 places in 248 ms
[2020-06-03 07:02:21] [INFO ] Deduced a trap composed of 75 places in 225 ms
[2020-06-03 07:02:21] [INFO ] Deduced a trap composed of 21 places in 215 ms
[2020-06-03 07:02:22] [INFO ] Deduced a trap composed of 22 places in 195 ms
[2020-06-03 07:02:22] [INFO ] Deduced a trap composed of 13 places in 236 ms
[2020-06-03 07:02:22] [INFO ] Deduced a trap composed of 11 places in 222 ms
[2020-06-03 07:02:22] [INFO ] Deduced a trap composed of 33 places in 179 ms
[2020-06-03 07:02:23] [INFO ] Deduced a trap composed of 29 places in 248 ms
[2020-06-03 07:02:23] [INFO ] Deduced a trap composed of 30 places in 324 ms
[2020-06-03 07:02:23] [INFO ] Deduced a trap composed of 30 places in 312 ms
[2020-06-03 07:02:24] [INFO ] Deduced a trap composed of 64 places in 226 ms
[2020-06-03 07:02:24] [INFO ] Deduced a trap composed of 48 places in 204 ms
[2020-06-03 07:02:24] [INFO ] Deduced a trap composed of 64 places in 295 ms
[2020-06-03 07:02:24] [INFO ] Deduced a trap composed of 85 places in 277 ms
[2020-06-03 07:02:25] [INFO ] Deduced a trap composed of 50 places in 246 ms
[2020-06-03 07:02:25] [INFO ] Deduced a trap composed of 63 places in 276 ms
[2020-06-03 07:02:25] [INFO ] Deduced a trap composed of 78 places in 222 ms
[2020-06-03 07:02:26] [INFO ] Deduced a trap composed of 64 places in 201 ms
[2020-06-03 07:02:26] [INFO ] Deduced a trap composed of 48 places in 227 ms
[2020-06-03 07:02:26] [INFO ] Deduced a trap composed of 57 places in 187 ms
[2020-06-03 07:02:26] [INFO ] Deduced a trap composed of 37 places in 198 ms
[2020-06-03 07:02:27] [INFO ] Deduced a trap composed of 73 places in 208 ms
[2020-06-03 07:02:27] [INFO ] Deduced a trap composed of 38 places in 164 ms
[2020-06-03 07:02:27] [INFO ] Deduced a trap composed of 47 places in 175 ms
[2020-06-03 07:02:27] [INFO ] Deduced a trap composed of 47 places in 183 ms
[2020-06-03 07:02:27] [INFO ] Deduced a trap composed of 56 places in 252 ms
[2020-06-03 07:02:28] [INFO ] Deduced a trap composed of 39 places in 194 ms
[2020-06-03 07:02:28] [INFO ] Deduced a trap composed of 41 places in 199 ms
[2020-06-03 07:02:28] [INFO ] Deduced a trap composed of 38 places in 146 ms
[2020-06-03 07:02:29] [INFO ] Deduced a trap composed of 55 places in 433 ms
[2020-06-03 07:02:29] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 11699 ms
[2020-06-03 07:02:29] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 48 ms.
[2020-06-03 07:02:49] [INFO ] Added : 800 causal constraints over 160 iterations in 20226 ms.(timeout) Result :sat
[2020-06-03 07:02:49] [INFO ] Deduced a trap composed of 19 places in 206 ms
[2020-06-03 07:02:50] [INFO ] Deduced a trap composed of 11 places in 256 ms
[2020-06-03 07:02:50] [INFO ] Deduced a trap composed of 29 places in 222 ms
[2020-06-03 07:02:50] [INFO ] Deduced a trap composed of 19 places in 228 ms
[2020-06-03 07:02:51] [INFO ] Deduced a trap composed of 55 places in 192 ms
[2020-06-03 07:02:51] [INFO ] Deduced a trap composed of 39 places in 141 ms
[2020-06-03 07:02:51] [INFO ] Deduced a trap composed of 37 places in 107 ms
[2020-06-03 07:02:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2337 ms
Attempting to minimize the solution found.
Minimization took 150 ms.
[2020-06-03 07:02:52] [INFO ] [Real]Absence check using 20 positive place invariants in 42 ms returned sat
[2020-06-03 07:02:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:02:52] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2020-06-03 07:02:52] [INFO ] [Real]Added 366 Read/Feed constraints in 69 ms returned sat
[2020-06-03 07:02:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:02:52] [INFO ] [Nat]Absence check using 20 positive place invariants in 20 ms returned sat
[2020-06-03 07:02:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:02:53] [INFO ] [Nat]Absence check using state equation in 678 ms returned sat
[2020-06-03 07:02:53] [INFO ] [Nat]Added 366 Read/Feed constraints in 56 ms returned sat
[2020-06-03 07:02:53] [INFO ] Deduced a trap composed of 11 places in 265 ms
[2020-06-03 07:02:54] [INFO ] Deduced a trap composed of 21 places in 295 ms
[2020-06-03 07:02:54] [INFO ] Deduced a trap composed of 21 places in 218 ms
[2020-06-03 07:02:54] [INFO ] Deduced a trap composed of 20 places in 205 ms
[2020-06-03 07:02:55] [INFO ] Deduced a trap composed of 32 places in 218 ms
[2020-06-03 07:02:55] [INFO ] Deduced a trap composed of 21 places in 225 ms
[2020-06-03 07:02:55] [INFO ] Deduced a trap composed of 28 places in 223 ms
[2020-06-03 07:02:55] [INFO ] Deduced a trap composed of 31 places in 243 ms
[2020-06-03 07:02:56] [INFO ] Deduced a trap composed of 32 places in 214 ms
[2020-06-03 07:02:56] [INFO ] Deduced a trap composed of 28 places in 253 ms
[2020-06-03 07:02:56] [INFO ] Deduced a trap composed of 21 places in 226 ms
[2020-06-03 07:02:56] [INFO ] Deduced a trap composed of 11 places in 245 ms
[2020-06-03 07:02:57] [INFO ] Deduced a trap composed of 47 places in 218 ms
[2020-06-03 07:02:57] [INFO ] Deduced a trap composed of 22 places in 251 ms
[2020-06-03 07:02:57] [INFO ] Deduced a trap composed of 25 places in 282 ms
[2020-06-03 07:02:58] [INFO ] Deduced a trap composed of 27 places in 299 ms
[2020-06-03 07:02:58] [INFO ] Deduced a trap composed of 41 places in 695 ms
[2020-06-03 07:02:59] [INFO ] Deduced a trap composed of 14 places in 299 ms
[2020-06-03 07:02:59] [INFO ] Deduced a trap composed of 14 places in 220 ms
[2020-06-03 07:02:59] [INFO ] Deduced a trap composed of 11 places in 208 ms
[2020-06-03 07:02:59] [INFO ] Deduced a trap composed of 14 places in 269 ms
[2020-06-03 07:03:00] [INFO ] Deduced a trap composed of 14 places in 222 ms
[2020-06-03 07:03:00] [INFO ] Deduced a trap composed of 62 places in 184 ms
[2020-06-03 07:03:00] [INFO ] Deduced a trap composed of 43 places in 226 ms
[2020-06-03 07:03:00] [INFO ] Deduced a trap composed of 48 places in 181 ms
[2020-06-03 07:03:01] [INFO ] Deduced a trap composed of 60 places in 192 ms
[2020-06-03 07:03:01] [INFO ] Deduced a trap composed of 41 places in 184 ms
[2020-06-03 07:03:01] [INFO ] Deduced a trap composed of 40 places in 201 ms
[2020-06-03 07:03:01] [INFO ] Deduced a trap composed of 39 places in 177 ms
[2020-06-03 07:03:01] [INFO ] Deduced a trap composed of 60 places in 174 ms
[2020-06-03 07:03:02] [INFO ] Deduced a trap composed of 39 places in 181 ms
[2020-06-03 07:03:02] [INFO ] Deduced a trap composed of 39 places in 178 ms
[2020-06-03 07:03:02] [INFO ] Deduced a trap composed of 39 places in 211 ms
[2020-06-03 07:03:02] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 9038 ms
[2020-06-03 07:03:02] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 45 ms.
[2020-06-03 07:03:21] [INFO ] Added : 794 causal constraints over 161 iterations in 18368 ms. Result :sat
[2020-06-03 07:03:21] [INFO ] Deduced a trap composed of 60 places in 857 ms
[2020-06-03 07:03:22] [INFO ] Deduced a trap composed of 50 places in 243 ms
[2020-06-03 07:03:22] [INFO ] Deduced a trap composed of 33 places in 269 ms
[2020-06-03 07:03:23] [INFO ] Deduced a trap composed of 12 places in 263 ms
[2020-06-03 07:03:23] [INFO ] Deduced a trap composed of 60 places in 223 ms
[2020-06-03 07:03:23] [INFO ] Deduced a trap composed of 29 places in 213 ms
[2020-06-03 07:03:24] [INFO ] Deduced a trap composed of 20 places in 322 ms
[2020-06-03 07:03:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3489 ms
Attempting to minimize the solution found.
Minimization took 106 ms.
[2020-06-03 07:03:24] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2020-06-03 07:03:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:03:25] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2020-06-03 07:03:25] [INFO ] [Real]Added 366 Read/Feed constraints in 45 ms returned sat
[2020-06-03 07:03:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:03:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 39 ms returned sat
[2020-06-03 07:03:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:03:26] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2020-06-03 07:03:26] [INFO ] [Nat]Added 366 Read/Feed constraints in 49 ms returned sat
[2020-06-03 07:03:26] [INFO ] Deduced a trap composed of 10 places in 275 ms
[2020-06-03 07:03:26] [INFO ] Deduced a trap composed of 10 places in 278 ms
[2020-06-03 07:03:27] [INFO ] Deduced a trap composed of 13 places in 250 ms
[2020-06-03 07:03:27] [INFO ] Deduced a trap composed of 10 places in 271 ms
[2020-06-03 07:03:27] [INFO ] Deduced a trap composed of 20 places in 286 ms
[2020-06-03 07:03:28] [INFO ] Deduced a trap composed of 26 places in 239 ms
[2020-06-03 07:03:28] [INFO ] Deduced a trap composed of 21 places in 282 ms
[2020-06-03 07:03:28] [INFO ] Deduced a trap composed of 20 places in 273 ms
[2020-06-03 07:03:29] [INFO ] Deduced a trap composed of 20 places in 266 ms
[2020-06-03 07:03:29] [INFO ] Deduced a trap composed of 22 places in 252 ms
[2020-06-03 07:03:29] [INFO ] Deduced a trap composed of 46 places in 230 ms
[2020-06-03 07:03:29] [INFO ] Deduced a trap composed of 22 places in 236 ms
[2020-06-03 07:03:30] [INFO ] Deduced a trap composed of 19 places in 309 ms
[2020-06-03 07:03:30] [INFO ] Deduced a trap composed of 10 places in 262 ms
[2020-06-03 07:03:30] [INFO ] Deduced a trap composed of 29 places in 253 ms
[2020-06-03 07:03:31] [INFO ] Deduced a trap composed of 11 places in 208 ms
[2020-06-03 07:03:31] [INFO ] Deduced a trap composed of 14 places in 220 ms
[2020-06-03 07:03:31] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4978 ms
[2020-06-03 07:03:31] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 44 ms.
[2020-06-03 07:03:49] [INFO ] Added : 786 causal constraints over 158 iterations in 18553 ms. Result :sat
[2020-06-03 07:03:50] [INFO ] Deduced a trap composed of 29 places in 235 ms
[2020-06-03 07:03:50] [INFO ] Deduced a trap composed of 19 places in 187 ms
[2020-06-03 07:03:50] [INFO ] Deduced a trap composed of 11 places in 249 ms
[2020-06-03 07:03:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1100 ms
Attempting to minimize the solution found.
Minimization took 73 ms.
Incomplete Parikh walk after 181400 steps, including 1000 resets, run finished after 392 ms. (steps per millisecond=462 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 179200 steps, including 1000 resets, run finished after 387 ms. (steps per millisecond=463 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 250900 steps, including 1000 resets, run finished after 514 ms. (steps per millisecond=488 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 130700 steps, including 1000 resets, run finished after 313 ms. (steps per millisecond=417 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 34 out of 428 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 428/428 places, 1135/1135 transitions.
Applied a total of 0 rules in 25 ms. Remains 428 /428 variables (removed 0) and now considering 1135/1135 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 428/428 places, 1135/1135 transitions.
Starting structural reductions, iteration 0 : 428/428 places, 1135/1135 transitions.
Applied a total of 0 rules in 20 ms. Remains 428 /428 variables (removed 0) and now considering 1135/1135 (removed 0) transitions.
[2020-06-03 07:03:52] [INFO ] Flow matrix only has 925 transitions (discarded 210 similar events)
// Phase 1: matrix 925 rows 428 cols
[2020-06-03 07:03:52] [INFO ] Computed 20 place invariants in 3 ms
[2020-06-03 07:03:53] [INFO ] Implicit Places using invariants in 595 ms returned []
[2020-06-03 07:03:53] [INFO ] Flow matrix only has 925 transitions (discarded 210 similar events)
// Phase 1: matrix 925 rows 428 cols
[2020-06-03 07:03:53] [INFO ] Computed 20 place invariants in 6 ms
[2020-06-03 07:03:54] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 07:03:58] [INFO ] Implicit Places using invariants and state equation in 4836 ms returned []
Implicit Place search using SMT with State Equation took 5434 ms to find 0 implicit places.
[2020-06-03 07:03:58] [INFO ] Redundant transitions in 20 ms returned []
[2020-06-03 07:03:58] [INFO ] Flow matrix only has 925 transitions (discarded 210 similar events)
// Phase 1: matrix 925 rows 428 cols
[2020-06-03 07:03:58] [INFO ] Computed 20 place invariants in 5 ms
[2020-06-03 07:03:59] [INFO ] Dead Transitions using invariants and state equation in 1307 ms returned []
Finished structural reductions, in 1 iterations. Remains : 428/428 places, 1135/1135 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 253 ms. (steps per millisecond=395 ) properties seen :[0, 0, 0, 0]
[2020-06-03 07:03:59] [INFO ] Flow matrix only has 925 transitions (discarded 210 similar events)
// Phase 1: matrix 925 rows 428 cols
[2020-06-03 07:03:59] [INFO ] Computed 20 place invariants in 4 ms
[2020-06-03 07:03:59] [INFO ] [Real]Absence check using 20 positive place invariants in 23 ms returned sat
[2020-06-03 07:03:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:04:00] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2020-06-03 07:04:00] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 07:04:00] [INFO ] [Real]Added 366 Read/Feed constraints in 70 ms returned sat
[2020-06-03 07:04:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:04:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2020-06-03 07:04:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:04:01] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2020-06-03 07:04:01] [INFO ] [Nat]Added 366 Read/Feed constraints in 54 ms returned sat
[2020-06-03 07:04:01] [INFO ] Deduced a trap composed of 10 places in 235 ms
[2020-06-03 07:04:01] [INFO ] Deduced a trap composed of 11 places in 221 ms
[2020-06-03 07:04:02] [INFO ] Deduced a trap composed of 51 places in 189 ms
[2020-06-03 07:04:02] [INFO ] Deduced a trap composed of 20 places in 211 ms
[2020-06-03 07:04:02] [INFO ] Deduced a trap composed of 28 places in 215 ms
[2020-06-03 07:04:02] [INFO ] Deduced a trap composed of 28 places in 218 ms
[2020-06-03 07:04:03] [INFO ] Deduced a trap composed of 22 places in 252 ms
[2020-06-03 07:04:03] [INFO ] Deduced a trap composed of 51 places in 194 ms
[2020-06-03 07:04:03] [INFO ] Deduced a trap composed of 49 places in 193 ms
[2020-06-03 07:04:03] [INFO ] Deduced a trap composed of 20 places in 187 ms
[2020-06-03 07:04:04] [INFO ] Deduced a trap composed of 43 places in 210 ms
[2020-06-03 07:04:04] [INFO ] Deduced a trap composed of 34 places in 198 ms
[2020-06-03 07:04:04] [INFO ] Deduced a trap composed of 34 places in 209 ms
[2020-06-03 07:04:04] [INFO ] Deduced a trap composed of 46 places in 219 ms
[2020-06-03 07:04:05] [INFO ] Deduced a trap composed of 47 places in 199 ms
[2020-06-03 07:04:05] [INFO ] Deduced a trap composed of 46 places in 220 ms
[2020-06-03 07:04:05] [INFO ] Deduced a trap composed of 50 places in 211 ms
[2020-06-03 07:04:05] [INFO ] Deduced a trap composed of 11 places in 224 ms
[2020-06-03 07:04:06] [INFO ] Deduced a trap composed of 20 places in 218 ms
[2020-06-03 07:04:06] [INFO ] Deduced a trap composed of 32 places in 250 ms
[2020-06-03 07:04:06] [INFO ] Deduced a trap composed of 26 places in 218 ms
[2020-06-03 07:04:06] [INFO ] Deduced a trap composed of 26 places in 250 ms
[2020-06-03 07:04:07] [INFO ] Deduced a trap composed of 14 places in 228 ms
[2020-06-03 07:04:07] [INFO ] Deduced a trap composed of 61 places in 210 ms
[2020-06-03 07:04:07] [INFO ] Deduced a trap composed of 58 places in 203 ms
[2020-06-03 07:04:07] [INFO ] Deduced a trap composed of 59 places in 173 ms
[2020-06-03 07:04:08] [INFO ] Deduced a trap composed of 11 places in 200 ms
[2020-06-03 07:04:08] [INFO ] Deduced a trap composed of 12 places in 209 ms
[2020-06-03 07:04:08] [INFO ] Deduced a trap composed of 13 places in 216 ms
[2020-06-03 07:04:08] [INFO ] Deduced a trap composed of 39 places in 165 ms
[2020-06-03 07:04:08] [INFO ] Deduced a trap composed of 39 places in 164 ms
[2020-06-03 07:04:09] [INFO ] Deduced a trap composed of 26 places in 171 ms
[2020-06-03 07:04:09] [INFO ] Deduced a trap composed of 29 places in 160 ms
[2020-06-03 07:04:09] [INFO ] Deduced a trap composed of 29 places in 169 ms
[2020-06-03 07:04:09] [INFO ] Deduced a trap composed of 26 places in 173 ms
[2020-06-03 07:04:09] [INFO ] Deduced a trap composed of 35 places in 162 ms
[2020-06-03 07:04:10] [INFO ] Deduced a trap composed of 48 places in 152 ms
[2020-06-03 07:04:10] [INFO ] Deduced a trap composed of 40 places in 153 ms
[2020-06-03 07:04:10] [INFO ] Deduced a trap composed of 26 places in 187 ms
[2020-06-03 07:04:10] [INFO ] Deduced a trap composed of 18 places in 167 ms
[2020-06-03 07:04:10] [INFO ] Deduced a trap composed of 41 places in 111 ms
[2020-06-03 07:04:10] [INFO ] Deduced a trap composed of 35 places in 115 ms
[2020-06-03 07:04:11] [INFO ] Deduced a trap composed of 22 places in 131 ms
[2020-06-03 07:04:11] [INFO ] Deduced a trap composed of 21 places in 98 ms
[2020-06-03 07:04:11] [INFO ] Deduced a trap composed of 18 places in 147 ms
[2020-06-03 07:04:11] [INFO ] Deduced a trap composed of 21 places in 148 ms
[2020-06-03 07:04:11] [INFO ] Deduced a trap composed of 10 places in 173 ms
[2020-06-03 07:04:11] [INFO ] Deduced a trap composed of 19 places in 118 ms
[2020-06-03 07:04:12] [INFO ] Deduced a trap composed of 20 places in 329 ms
[2020-06-03 07:04:12] [INFO ] Deduced a trap composed of 51 places in 209 ms
[2020-06-03 07:04:12] [INFO ] Deduced a trap composed of 41 places in 165 ms
[2020-06-03 07:04:13] [INFO ] Deduced a trap composed of 33 places in 122 ms
[2020-06-03 07:04:13] [INFO ] Deduced a trap composed of 40 places in 165 ms
[2020-06-03 07:04:13] [INFO ] Deduced a trap composed of 49 places in 109 ms
[2020-06-03 07:04:13] [INFO ] Deduced a trap composed of 48 places in 106 ms
[2020-06-03 07:04:13] [INFO ] Deduced a trap composed of 40 places in 123 ms
[2020-06-03 07:04:13] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 12289 ms
[2020-06-03 07:04:13] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 52 ms.
[2020-06-03 07:04:20] [INFO ] Added : 370 causal constraints over 74 iterations in 7012 ms. Result :(error "Failed to check-sat")
[2020-06-03 07:04:20] [INFO ] [Real]Absence check using 20 positive place invariants in 102 ms returned sat
[2020-06-03 07:04:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:04:21] [INFO ] [Real]Absence check using state equation in 1030 ms returned sat
[2020-06-03 07:04:21] [INFO ] [Real]Added 366 Read/Feed constraints in 60 ms returned sat
[2020-06-03 07:04:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:04:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 80 ms returned sat
[2020-06-03 07:04:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:04:22] [INFO ] [Nat]Absence check using state equation in 777 ms returned sat
[2020-06-03 07:04:22] [INFO ] [Nat]Added 366 Read/Feed constraints in 53 ms returned sat
[2020-06-03 07:04:23] [INFO ] Deduced a trap composed of 22 places in 251 ms
[2020-06-03 07:04:23] [INFO ] Deduced a trap composed of 56 places in 276 ms
[2020-06-03 07:04:23] [INFO ] Deduced a trap composed of 11 places in 251 ms
[2020-06-03 07:04:24] [INFO ] Deduced a trap composed of 11 places in 258 ms
[2020-06-03 07:04:24] [INFO ] Deduced a trap composed of 11 places in 241 ms
[2020-06-03 07:04:24] [INFO ] Deduced a trap composed of 12 places in 236 ms
[2020-06-03 07:04:24] [INFO ] Deduced a trap composed of 62 places in 255 ms
[2020-06-03 07:04:25] [INFO ] Deduced a trap composed of 21 places in 251 ms
[2020-06-03 07:04:25] [INFO ] Deduced a trap composed of 83 places in 244 ms
[2020-06-03 07:04:25] [INFO ] Deduced a trap composed of 32 places in 307 ms
[2020-06-03 07:04:26] [INFO ] Deduced a trap composed of 25 places in 261 ms
[2020-06-03 07:04:26] [INFO ] Deduced a trap composed of 64 places in 279 ms
[2020-06-03 07:04:26] [INFO ] Deduced a trap composed of 42 places in 233 ms
[2020-06-03 07:04:27] [INFO ] Deduced a trap composed of 21 places in 229 ms
[2020-06-03 07:04:27] [INFO ] Deduced a trap composed of 75 places in 272 ms
[2020-06-03 07:04:27] [INFO ] Deduced a trap composed of 21 places in 192 ms
[2020-06-03 07:04:27] [INFO ] Deduced a trap composed of 22 places in 208 ms
[2020-06-03 07:04:28] [INFO ] Deduced a trap composed of 13 places in 233 ms
[2020-06-03 07:04:28] [INFO ] Deduced a trap composed of 11 places in 211 ms
[2020-06-03 07:04:28] [INFO ] Deduced a trap composed of 33 places in 179 ms
[2020-06-03 07:04:28] [INFO ] Deduced a trap composed of 29 places in 291 ms
[2020-06-03 07:04:29] [INFO ] Deduced a trap composed of 30 places in 270 ms
[2020-06-03 07:04:29] [INFO ] Deduced a trap composed of 30 places in 250 ms
[2020-06-03 07:04:29] [INFO ] Deduced a trap composed of 64 places in 174 ms
[2020-06-03 07:04:29] [INFO ] Deduced a trap composed of 48 places in 178 ms
[2020-06-03 07:04:30] [INFO ] Deduced a trap composed of 64 places in 195 ms
[2020-06-03 07:04:30] [INFO ] Deduced a trap composed of 85 places in 199 ms
[2020-06-03 07:04:30] [INFO ] Deduced a trap composed of 50 places in 243 ms
[2020-06-03 07:04:30] [INFO ] Deduced a trap composed of 63 places in 209 ms
[2020-06-03 07:04:31] [INFO ] Deduced a trap composed of 78 places in 167 ms
[2020-06-03 07:04:31] [INFO ] Deduced a trap composed of 64 places in 177 ms
[2020-06-03 07:04:31] [INFO ] Deduced a trap composed of 48 places in 206 ms
[2020-06-03 07:04:31] [INFO ] Deduced a trap composed of 57 places in 229 ms
[2020-06-03 07:04:32] [INFO ] Deduced a trap composed of 37 places in 218 ms
[2020-06-03 07:04:32] [INFO ] Deduced a trap composed of 73 places in 202 ms
[2020-06-03 07:04:32] [INFO ] Deduced a trap composed of 38 places in 174 ms
[2020-06-03 07:04:32] [INFO ] Deduced a trap composed of 47 places in 189 ms
[2020-06-03 07:04:32] [INFO ] Deduced a trap composed of 47 places in 186 ms
[2020-06-03 07:04:33] [INFO ] Deduced a trap composed of 56 places in 187 ms
[2020-06-03 07:04:33] [INFO ] Deduced a trap composed of 39 places in 123 ms
[2020-06-03 07:04:33] [INFO ] Deduced a trap composed of 41 places in 134 ms
[2020-06-03 07:04:33] [INFO ] Deduced a trap composed of 38 places in 116 ms
[2020-06-03 07:04:33] [INFO ] Deduced a trap composed of 55 places in 137 ms
[2020-06-03 07:04:33] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 10866 ms
[2020-06-03 07:04:33] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 47 ms.
[2020-06-03 07:04:42] [INFO ] Added : 420 causal constraints over 84 iterations in 8186 ms. Result :(error "Failed to check-sat")
[2020-06-03 07:04:42] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2020-06-03 07:04:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:04:42] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2020-06-03 07:04:42] [INFO ] [Real]Added 366 Read/Feed constraints in 59 ms returned sat
[2020-06-03 07:04:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:04:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 20 ms returned sat
[2020-06-03 07:04:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:04:43] [INFO ] [Nat]Absence check using state equation in 654 ms returned sat
[2020-06-03 07:04:43] [INFO ] [Nat]Added 366 Read/Feed constraints in 64 ms returned sat
[2020-06-03 07:04:43] [INFO ] Deduced a trap composed of 11 places in 255 ms
[2020-06-03 07:04:44] [INFO ] Deduced a trap composed of 21 places in 217 ms
[2020-06-03 07:04:44] [INFO ] Deduced a trap composed of 21 places in 216 ms
[2020-06-03 07:04:44] [INFO ] Deduced a trap composed of 20 places in 256 ms
[2020-06-03 07:04:45] [INFO ] Deduced a trap composed of 32 places in 224 ms
[2020-06-03 07:04:45] [INFO ] Deduced a trap composed of 21 places in 223 ms
[2020-06-03 07:04:45] [INFO ] Deduced a trap composed of 28 places in 259 ms
[2020-06-03 07:04:45] [INFO ] Deduced a trap composed of 31 places in 254 ms
[2020-06-03 07:04:46] [INFO ] Deduced a trap composed of 32 places in 234 ms
[2020-06-03 07:04:46] [INFO ] Deduced a trap composed of 28 places in 237 ms
[2020-06-03 07:04:46] [INFO ] Deduced a trap composed of 21 places in 241 ms
[2020-06-03 07:04:46] [INFO ] Deduced a trap composed of 11 places in 237 ms
[2020-06-03 07:04:47] [INFO ] Deduced a trap composed of 47 places in 242 ms
[2020-06-03 07:04:47] [INFO ] Deduced a trap composed of 22 places in 233 ms
[2020-06-03 07:04:47] [INFO ] Deduced a trap composed of 25 places in 238 ms
[2020-06-03 07:04:48] [INFO ] Deduced a trap composed of 27 places in 247 ms
[2020-06-03 07:04:48] [INFO ] Deduced a trap composed of 41 places in 216 ms
[2020-06-03 07:04:48] [INFO ] Deduced a trap composed of 14 places in 230 ms
[2020-06-03 07:04:48] [INFO ] Deduced a trap composed of 14 places in 206 ms
[2020-06-03 07:04:49] [INFO ] Deduced a trap composed of 11 places in 233 ms
[2020-06-03 07:04:49] [INFO ] Deduced a trap composed of 14 places in 219 ms
[2020-06-03 07:04:49] [INFO ] Deduced a trap composed of 14 places in 225 ms
[2020-06-03 07:04:49] [INFO ] Deduced a trap composed of 62 places in 182 ms
[2020-06-03 07:04:50] [INFO ] Deduced a trap composed of 43 places in 210 ms
[2020-06-03 07:04:50] [INFO ] Deduced a trap composed of 48 places in 190 ms
[2020-06-03 07:04:50] [INFO ] Deduced a trap composed of 60 places in 202 ms
[2020-06-03 07:04:50] [INFO ] Deduced a trap composed of 41 places in 178 ms
[2020-06-03 07:04:50] [INFO ] Deduced a trap composed of 40 places in 203 ms
[2020-06-03 07:04:51] [INFO ] Deduced a trap composed of 39 places in 190 ms
[2020-06-03 07:04:51] [INFO ] Deduced a trap composed of 60 places in 180 ms
[2020-06-03 07:04:51] [INFO ] Deduced a trap composed of 39 places in 176 ms
[2020-06-03 07:04:51] [INFO ] Deduced a trap composed of 39 places in 180 ms
[2020-06-03 07:04:51] [INFO ] Deduced a trap composed of 39 places in 189 ms
[2020-06-03 07:04:52] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 8297 ms
[2020-06-03 07:04:52] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 47 ms.
[2020-06-03 07:05:02] [INFO ] Added : 520 causal constraints over 104 iterations in 10950 ms. Result :(error "Failed to check-sat")
[2020-06-03 07:05:03] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2020-06-03 07:05:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:05:03] [INFO ] [Real]Absence check using state equation in 709 ms returned sat
[2020-06-03 07:05:03] [INFO ] [Real]Added 366 Read/Feed constraints in 45 ms returned sat
[2020-06-03 07:05:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:05:03] [INFO ] [Nat]Absence check using 20 positive place invariants in 38 ms returned sat
[2020-06-03 07:05:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:05:04] [INFO ] [Nat]Absence check using state equation in 629 ms returned sat
[2020-06-03 07:05:04] [INFO ] [Nat]Added 366 Read/Feed constraints in 64 ms returned sat
[2020-06-03 07:05:05] [INFO ] Deduced a trap composed of 10 places in 314 ms
[2020-06-03 07:05:05] [INFO ] Deduced a trap composed of 10 places in 246 ms
[2020-06-03 07:05:05] [INFO ] Deduced a trap composed of 13 places in 244 ms
[2020-06-03 07:05:05] [INFO ] Deduced a trap composed of 10 places in 265 ms
[2020-06-03 07:05:06] [INFO ] Deduced a trap composed of 20 places in 252 ms
[2020-06-03 07:05:06] [INFO ] Deduced a trap composed of 26 places in 316 ms
[2020-06-03 07:05:06] [INFO ] Deduced a trap composed of 21 places in 247 ms
[2020-06-03 07:05:07] [INFO ] Deduced a trap composed of 20 places in 265 ms
[2020-06-03 07:05:07] [INFO ] Deduced a trap composed of 20 places in 265 ms
[2020-06-03 07:05:07] [INFO ] Deduced a trap composed of 22 places in 256 ms
[2020-06-03 07:05:07] [INFO ] Deduced a trap composed of 46 places in 237 ms
[2020-06-03 07:05:08] [INFO ] Deduced a trap composed of 22 places in 275 ms
[2020-06-03 07:05:08] [INFO ] Deduced a trap composed of 19 places in 279 ms
[2020-06-03 07:05:08] [INFO ] Deduced a trap composed of 10 places in 251 ms
[2020-06-03 07:05:09] [INFO ] Deduced a trap composed of 29 places in 264 ms
[2020-06-03 07:05:09] [INFO ] Deduced a trap composed of 11 places in 218 ms
[2020-06-03 07:05:09] [INFO ] Deduced a trap composed of 14 places in 223 ms
[2020-06-03 07:05:09] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5009 ms
[2020-06-03 07:05:09] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 50 ms.
[2020-06-03 07:05:23] [INFO ] Added : 670 causal constraints over 134 iterations in 14211 ms. Result :unknown
Graph (trivial) has 781 edges and 428 vertex of which 212 / 428 are part of one of the 36 SCC in 12 ms
Free SCC test removed 176 places
Drop transitions removed 352 transitions
Ensure Unique test removed 234 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 0 with 586 rules applied. Total rules applied 587 place count 252 transition count 549
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 24 Pre rules applied. Total rules applied 587 place count 252 transition count 525
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 1 with 48 rules applied. Total rules applied 635 place count 228 transition count 525
Performed 52 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 1 with 104 rules applied. Total rules applied 739 place count 176 transition count 443
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 751 place count 176 transition count 431
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -78
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 780 place count 161 transition count 509
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 68 edges and 161 vertex of which 7 / 161 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Iterating post reduction 2 with 14 rules applied. Total rules applied 794 place count 155 transition count 496
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 801 place count 155 transition count 489
Free-agglomeration rule applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 815 place count 155 transition count 475
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 842 place count 141 transition count 462
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 861 place count 141 transition count 462
Partial Post-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 869 place count 141 transition count 462
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 870 place count 141 transition count 461
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 879 place count 141 transition count 452
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 880 place count 141 transition count 452
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 882 place count 141 transition count 452
Applied a total of 882 rules in 147 ms. Remains 141 /428 variables (removed 287) and now considering 452/1135 (removed 683) transitions.
// Phase 1: matrix 452 rows 141 cols
[2020-06-03 07:05:24] [INFO ] Computed 19 place invariants in 1 ms
[2020-06-03 07:05:24] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2020-06-03 07:05:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:05:24] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2020-06-03 07:05:24] [INFO ] Computed and/alt/rep : 430/4272/430 causal constraints in 41 ms.
[2020-06-03 07:05:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:05:24] [INFO ] [Nat]Absence check using 19 positive place invariants in 62 ms returned sat
[2020-06-03 07:05:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:05:24] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2020-06-03 07:05:24] [INFO ] Computed and/alt/rep : 430/4272/430 causal constraints in 25 ms.
[2020-06-03 07:05:30] [INFO ] Added : 360 causal constraints over 74 iterations in 5596 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 78 ms.
[2020-06-03 07:05:30] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2020-06-03 07:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:05:30] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2020-06-03 07:05:30] [INFO ] Computed and/alt/rep : 430/4272/430 causal constraints in 39 ms.
[2020-06-03 07:05:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:05:30] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2020-06-03 07:05:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:05:31] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2020-06-03 07:05:31] [INFO ] Computed and/alt/rep : 430/4272/430 causal constraints in 35 ms.
[2020-06-03 07:05:35] [INFO ] Added : 339 causal constraints over 68 iterations in 4729 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 48 ms.
[2020-06-03 07:05:35] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2020-06-03 07:05:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:05:36] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2020-06-03 07:05:36] [INFO ] Computed and/alt/rep : 430/4272/430 causal constraints in 28 ms.
[2020-06-03 07:05:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:05:36] [INFO ] [Nat]Absence check using 19 positive place invariants in 19 ms returned sat
[2020-06-03 07:05:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:05:36] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2020-06-03 07:05:36] [INFO ] Computed and/alt/rep : 430/4272/430 causal constraints in 28 ms.
[2020-06-03 07:05:39] [INFO ] Added : 299 causal constraints over 60 iterations in 2816 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 46 ms.
[2020-06-03 07:05:39] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2020-06-03 07:05:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:05:39] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2020-06-03 07:05:39] [INFO ] Computed and/alt/rep : 430/4272/430 causal constraints in 37 ms.
[2020-06-03 07:05:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:05:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2020-06-03 07:05:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:05:39] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2020-06-03 07:05:39] [INFO ] Computed and/alt/rep : 430/4272/430 causal constraints in 44 ms.
[2020-06-03 07:05:45] [INFO ] Added : 360 causal constraints over 73 iterations in 5327 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 58 ms.
[2020-06-03 07:05:45] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2020-06-03 07:05:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 18 ms.
[2020-06-03 07:05:45] [INFO ] Flatten gal took : 219 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ Peterson-PT-6 @ 3570 seconds
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 9490288 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16135920 kB

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

Sequence of Actions to be Executed by the VM

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

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

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