About the Execution of ITS-LoLa for Peterson-PT-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15746.030 | 3600000.00 | 6715321.00 | 388.20 | FTTFTTFTTFT??FTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853600742.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853600742
=====================================================================
--------------------
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-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1591166652462
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:44:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 06:44:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:44:14] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2020-06-03 06:44:14] [INFO ] Transformed 1330 places.
[2020-06-03 06:44:14] [INFO ] Transformed 2030 transitions.
[2020-06-03 06:44:14] [INFO ] Parsed PT model containing 1330 places and 2030 transitions in 359 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 245 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-6-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 261 ms. (steps per millisecond=38 ) properties seen :[1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA Peterson-PT-6-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 167 ms. (steps per millisecond=59 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
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, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 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, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 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, 0, 0, 0, 0]
[2020-06-03 06:44:15] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2020-06-03 06:44:15] [INFO ] Computed 27 place invariants in 106 ms
[2020-06-03 06:44:16] [INFO ] [Real]Absence check using 20 positive place invariants in 75 ms returned unsat
[2020-06-03 06:44:16] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned unsat
[2020-06-03 06:44:17] [INFO ] [Real]Absence check using 20 positive place invariants in 48 ms returned sat
[2020-06-03 06:44:17] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2020-06-03 06:44:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:44:20] [INFO ] [Real]Absence check using state equation in 3947 ms returned sat
[2020-06-03 06:44:21] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 06:44:21] [INFO ] [Real]Added 366 Read/Feed constraints in 107 ms returned sat
[2020-06-03 06:44:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:44:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 50 ms returned sat
[2020-06-03 06:44:21] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2020-06-03 06:44:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:44:25] [INFO ] [Nat]Absence check using state equation in 4016 ms returned sat
[2020-06-03 06:44:25] [INFO ] [Nat]Added 366 Read/Feed constraints in 160 ms returned sat
[2020-06-03 06:44:27] [INFO ] Deduced a trap composed of 53 places in 1254 ms
[2020-06-03 06:44: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 (> (+ s287 s292 s296 s297 s313 s316 s318 s327 s331 s365 s368 s369 s378 s670 s671 s673 s682 s689 s690 s694 s699 s895 s899 s904 s905 s908 s932 s934 s935 s939 s943 s947 s950 s1013 s1015 s1167 s1172 s1176 s1178 s1186 s1190 s1193 s1196 s1199 s1204 s1209 s1280 s1281 s1284 s1287 s1291 s1297 s1307) 0)") while checking expression at index 2
[2020-06-03 06:44:27] [INFO ] [Real]Absence check using 20 positive place invariants in 57 ms returned unsat
[2020-06-03 06:44:27] [INFO ] [Real]Absence check using 20 positive place invariants in 40 ms returned unsat
[2020-06-03 06:44:27] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned unsat
[2020-06-03 06:44:27] [INFO ] [Real]Absence check using 20 positive place invariants in 45 ms returned sat
[2020-06-03 06:44:27] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 8 ms returned sat
[2020-06-03 06:44:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:44:31] [INFO ] [Real]Absence check using state equation in 3894 ms returned sat
[2020-06-03 06:44:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:44:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 54 ms returned sat
[2020-06-03 06:44:31] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2020-06-03 06:44:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:44:35] [INFO ] [Nat]Absence check using state equation in 4117 ms returned sat
[2020-06-03 06:44:36] [INFO ] [Nat]Added 366 Read/Feed constraints in 131 ms returned sat
[2020-06-03 06:44:37] [INFO ] Deduced a trap composed of 48 places in 1182 ms
[2020-06-03 06:44:37] [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 (> (+ s2 s26 s30 s37 s319 s324 s337 s348 s355 s359 s364 s373 s388 s393 s442 s640 s644 s650 s674 s678 s681 s685 s738 s742 s748 s911 s916 s923 s927 s951 s963 s965 s972 s992 s1003 s1011 s1018 s1172 s1178 s1183 s1193 s1198 s1204 s1295 s1308 s1312 s1317 s1326) 0)") while checking expression at index 6
[2020-06-03 06:44:37] [INFO ] [Real]Absence check using 20 positive place invariants in 41 ms returned sat
[2020-06-03 06:44:37] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2020-06-03 06:44:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:44:41] [INFO ] [Real]Absence check using state equation in 4190 ms returned sat
[2020-06-03 06:44:41] [INFO ] [Real]Added 366 Read/Feed constraints in 74 ms returned sat
[2020-06-03 06:44:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:44:42] [INFO ] [Nat]Absence check using 20 positive place invariants in 42 ms returned sat
[2020-06-03 06:44:42] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 9 ms returned sat
[2020-06-03 06:44:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:44:45] [INFO ] [Nat]Absence check using state equation in 3837 ms returned sat
[2020-06-03 06:44:46] [INFO ] [Nat]Added 366 Read/Feed constraints in 140 ms returned sat
[2020-06-03 06:44:47] [INFO ] Deduced a trap composed of 21 places in 1140 ms
[2020-06-03 06:44: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 (> (+ s1 s41 s320 s360 s430 s679 s684 s757 s912 s952 s991 s1095 s1172 s1176 s1183 s1193 s1198 s1204 s1208 s1305 s1307) 0)") while checking expression at index 7
[2020-06-03 06:44:47] [INFO ] [Real]Absence check using 20 positive place invariants in 42 ms returned sat
[2020-06-03 06:44:47] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2020-06-03 06:44:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:44:51] [INFO ] [Real]Absence check using state equation in 3857 ms returned sat
[2020-06-03 06:44:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:44:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 45 ms returned sat
[2020-06-03 06:44:51] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2020-06-03 06:44:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:44:55] [INFO ] [Nat]Absence check using state equation in 4050 ms returned sat
[2020-06-03 06:44:55] [INFO ] [Nat]Added 366 Read/Feed constraints in 141 ms returned sat
[2020-06-03 06:44:56] [INFO ] Deduced a trap composed of 133 places in 1079 ms
[2020-06-03 06:44: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 (> (+ s0 s7 s13 s22 s44 s52 s53 s67 s79 s88 s96 s103 s126 s131 s133 s155 s157 s176 s181 s202 s205 s214 s226 s233 s238 s260 s273 s284 s286 s291 s300 s310 s321 s330 s354 s357 s370 s377 s389 s397 s412 s417 s426 s436 s443 s446 s451 s460 s484 s504 s512 s519 s529 s538 s547 s554 s562 s579 s620 s628 s633 s641 s656 s662 s668 s682 s688 s711 s720 s722 s726 s739 s752 s762 s779 s788 s794 s797 s807 s816 s829 s850 s856 s873 s880 s882 s892 s900 s901 s909 s922 s931 s940 s946 s953 s978 s985 s993 s1002 s1006 s1014 s1033 s1038 s1045 s1057 s1066 s1069 s1085 s1092 s1094 s1116 s1118 s1135 s1142 s1168 s1185 s1189 s1195 s1200 s1208 s1210 s1220 s1225 s1233 s1255 s1263 s1266 s1273 s1279 s1286 s1294 s1307 s1322) 0)") while checking expression at index 8
[2020-06-03 06:44:57] [INFO ] [Real]Absence check using 20 positive place invariants in 39 ms returned unsat
[2020-06-03 06:44:57] [INFO ] [Real]Absence check using 20 positive place invariants in 41 ms returned sat
[2020-06-03 06:44:57] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2020-06-03 06:44:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:45:01] [INFO ] [Real]Absence check using state equation in 3891 ms returned sat
[2020-06-03 06:45:01] [INFO ] [Real]Added 366 Read/Feed constraints in 71 ms returned sat
[2020-06-03 06:45:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:45:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 48 ms returned sat
[2020-06-03 06:45:01] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 8 ms returned sat
[2020-06-03 06:45:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:45:05] [INFO ] [Nat]Absence check using state equation in 4020 ms returned sat
[2020-06-03 06:45:05] [INFO ] [Nat]Added 366 Read/Feed constraints in 186 ms returned sat
[2020-06-03 06:45:06] [INFO ] Deduced a trap composed of 12 places in 1113 ms
[2020-06-03 06:45:06] [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 (> (+ s317 s676 s682 s906 s949 s1172 s1176 s1178 s1183 s1198 s1204 s1307) 0)") while checking expression at index 10
FORMULA Peterson-PT-6-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-6-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-6-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-6-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-6-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-6-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 305 out of 1330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 493 Post agglomeration using F-continuation condition.Transition count delta: 493
Iterating post reduction 0 with 493 rules applied. Total rules applied 493 place count 1330 transition count 1537
Reduce places removed 493 places and 0 transitions.
Iterating post reduction 1 with 493 rules applied. Total rules applied 986 place count 837 transition count 1537
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 986 place count 837 transition count 1453
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 1154 place count 753 transition count 1453
Applied a total of 1154 rules in 364 ms. Remains 753 /1330 variables (removed 577) and now considering 1453/2030 (removed 577) transitions.
Finished structural reductions, in 1 iterations. Remains : 753/1330 places, 1453/2030 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2654 ms. (steps per millisecond=376 ) properties seen :[1, 0, 0, 0, 0]
FORMULA Peterson-PT-6-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 825 ms. (steps per millisecond=1212 ) properties seen :[0, 0, 0, 1]
FORMULA Peterson-PT-6-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 553 ms. (steps per millisecond=1808 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 582 ms. (steps per millisecond=1718 ) properties seen :[0, 0, 0]
[2020-06-03 06:45:11] [INFO ] Flow matrix only has 1243 transitions (discarded 210 similar events)
// Phase 1: matrix 1243 rows 753 cols
[2020-06-03 06:45:11] [INFO ] Computed 27 place invariants in 13 ms
[2020-06-03 06:45:11] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2020-06-03 06:45:11] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2020-06-03 06:45:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:45:13] [INFO ] [Real]Absence check using state equation in 1479 ms returned sat
[2020-06-03 06:45:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:45:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2020-06-03 06:45:13] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2020-06-03 06:45:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:45:14] [INFO ] [Nat]Absence check using state equation in 1397 ms returned sat
[2020-06-03 06:45:14] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 06:45:14] [INFO ] [Nat]Added 366 Read/Feed constraints in 90 ms returned sat
[2020-06-03 06:45:15] [INFO ] Deduced a trap composed of 25 places in 482 ms
[2020-06-03 06:45:16] [INFO ] Deduced a trap composed of 14 places in 490 ms
[2020-06-03 06:45:16] [INFO ] Deduced a trap composed of 14 places in 503 ms
[2020-06-03 06:45:17] [INFO ] Deduced a trap composed of 27 places in 461 ms
[2020-06-03 06:45:17] [INFO ] Deduced a trap composed of 10 places in 477 ms
[2020-06-03 06:45:18] [INFO ] Deduced a trap composed of 12 places in 465 ms
[2020-06-03 06:45:18] [INFO ] Deduced a trap composed of 25 places in 520 ms
[2020-06-03 06:45:19] [INFO ] Deduced a trap composed of 26 places in 481 ms
[2020-06-03 06:45:19] [INFO ] Deduced a trap composed of 66 places in 491 ms
[2020-06-03 06:45:20] [INFO ] Deduced a trap composed of 103 places in 451 ms
[2020-06-03 06:45:20] [INFO ] Deduced a trap composed of 103 places in 459 ms
[2020-06-03 06:45:21] [INFO ] Deduced a trap composed of 30 places in 501 ms
[2020-06-03 06:45:21] [INFO ] Deduced a trap composed of 123 places in 456 ms
[2020-06-03 06:45:22] [INFO ] Deduced a trap composed of 51 places in 472 ms
[2020-06-03 06:45:22] [INFO ] Deduced a trap composed of 44 places in 419 ms
[2020-06-03 06:45:23] [INFO ] Deduced a trap composed of 47 places in 463 ms
[2020-06-03 06:45:23] [INFO ] Deduced a trap composed of 32 places in 462 ms
[2020-06-03 06:45:24] [INFO ] Deduced a trap composed of 86 places in 464 ms
[2020-06-03 06:45:24] [INFO ] Deduced a trap composed of 44 places in 417 ms
[2020-06-03 06:45:25] [INFO ] Deduced a trap composed of 121 places in 407 ms
[2020-06-03 06:45:25] [INFO ] Deduced a trap composed of 71 places in 380 ms
[2020-06-03 06:45:26] [INFO ] Deduced a trap composed of 44 places in 427 ms
[2020-06-03 06:45:26] [INFO ] Deduced a trap composed of 87 places in 334 ms
[2020-06-03 06:45:27] [INFO ] Deduced a trap composed of 59 places in 441 ms
[2020-06-03 06:45:27] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 12139 ms
[2020-06-03 06:45:27] [INFO ] Computed and/alt/rep : 1446/8509/1236 causal constraints in 74 ms.
[2020-06-03 06:45:47] [INFO ] Added : 950 causal constraints over 190 iterations in 20203 ms.(timeout) Result :sat
[2020-06-03 06:45:47] [INFO ] Deduced a trap composed of 42 places in 466 ms
[2020-06-03 06:45:48] [INFO ] Deduced a trap composed of 30 places in 508 ms
[2020-06-03 06:45:49] [INFO ] Deduced a trap composed of 24 places in 475 ms
[2020-06-03 06:45:49] [INFO ] Deduced a trap composed of 29 places in 499 ms
[2020-06-03 06:45:50] [INFO ] Deduced a trap composed of 16 places in 492 ms
[2020-06-03 06:45:51] [INFO ] Deduced a trap composed of 10 places in 536 ms
[2020-06-03 06:45:51] [INFO ] Deduced a trap composed of 46 places in 511 ms
[2020-06-03 06:45:52] [INFO ] Deduced a trap composed of 74 places in 537 ms
[2020-06-03 06:45:53] [INFO ] Deduced a trap composed of 19 places in 543 ms
[2020-06-03 06:45:53] [INFO ] Deduced a trap composed of 41 places in 554 ms
[2020-06-03 06:45:54] [INFO ] Deduced a trap composed of 50 places in 536 ms
[2020-06-03 06:45:55] [INFO ] Deduced a trap composed of 55 places in 510 ms
[2020-06-03 06:45:55] [INFO ] Deduced a trap composed of 32 places in 513 ms
[2020-06-03 06:45:56] [INFO ] Deduced a trap composed of 49 places in 565 ms
[2020-06-03 06:45:57] [INFO ] Deduced a trap composed of 36 places in 563 ms
[2020-06-03 06:45:57] [INFO ] Deduced a trap composed of 60 places in 591 ms
[2020-06-03 06:45:58] [INFO ] Deduced a trap composed of 53 places in 594 ms
[2020-06-03 06:45:58] [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 (> (+ s7 s13 s285 s286 s290 s291 s294 s295 s311 s312 s314 s316 s317 s319 s320 s326 s329 s330 s331 s363 s367 s368 s375 s406 s412 s416 s417 s632 s636 s637 s640 s642 s645 s646 s647 s649 s651 s652 s687 s691 s701 s702 s705 s707 s709 s715 s718 s720 s723 s728 s730 s751 s752) 0)") while checking expression at index 0
[2020-06-03 06:45:58] [INFO ] [Real]Absence check using 20 positive place invariants in 24 ms returned sat
[2020-06-03 06:45:58] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-06-03 06:45:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:46:00] [INFO ] [Real]Absence check using state equation in 1407 ms returned sat
[2020-06-03 06:46:00] [INFO ] [Real]Added 366 Read/Feed constraints in 47 ms returned sat
[2020-06-03 06:46:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:46:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 31 ms returned sat
[2020-06-03 06:46:00] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2020-06-03 06:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:46:01] [INFO ] [Nat]Absence check using state equation in 1361 ms returned sat
[2020-06-03 06:46:01] [INFO ] [Nat]Added 366 Read/Feed constraints in 62 ms returned sat
[2020-06-03 06:46:02] [INFO ] Deduced a trap composed of 101 places in 493 ms
[2020-06-03 06:46:02] [INFO ] Deduced a trap composed of 75 places in 457 ms
[2020-06-03 06:46:03] [INFO ] Deduced a trap composed of 82 places in 457 ms
[2020-06-03 06:46:03] [INFO ] Deduced a trap composed of 81 places in 458 ms
[2020-06-03 06:46:04] [INFO ] Deduced a trap composed of 50 places in 458 ms
[2020-06-03 06:46:04] [INFO ] Deduced a trap composed of 89 places in 437 ms
[2020-06-03 06:46:05] [INFO ] Deduced a trap composed of 75 places in 464 ms
[2020-06-03 06:46:05] [INFO ] Deduced a trap composed of 34 places in 418 ms
[2020-06-03 06:46:06] [INFO ] Deduced a trap composed of 143 places in 410 ms
[2020-06-03 06:46:06] [INFO ] Deduced a trap composed of 50 places in 419 ms
[2020-06-03 06:46:07] [INFO ] Deduced a trap composed of 54 places in 425 ms
[2020-06-03 06:46:07] [INFO ] Deduced a trap composed of 137 places in 441 ms
[2020-06-03 06:46:08] [INFO ] Deduced a trap composed of 184 places in 438 ms
[2020-06-03 06:46:08] [INFO ] Deduced a trap composed of 66 places in 431 ms
[2020-06-03 06:46:09] [INFO ] Deduced a trap composed of 68 places in 431 ms
[2020-06-03 06:46:09] [INFO ] Deduced a trap composed of 98 places in 384 ms
[2020-06-03 06:46:10] [INFO ] Deduced a trap composed of 22 places in 468 ms
[2020-06-03 06:46:10] [INFO ] Deduced a trap composed of 82 places in 395 ms
[2020-06-03 06:46:10] [INFO ] Deduced a trap composed of 83 places in 401 ms
[2020-06-03 06:46:11] [INFO ] Deduced a trap composed of 137 places in 437 ms
[2020-06-03 06:46:11] [INFO ] Deduced a trap composed of 66 places in 452 ms
[2020-06-03 06:46:12] [INFO ] Deduced a trap composed of 147 places in 467 ms
[2020-06-03 06:46:12] [INFO ] Deduced a trap composed of 82 places in 362 ms
[2020-06-03 06:46:13] [INFO ] Deduced a trap composed of 54 places in 316 ms
[2020-06-03 06:46:13] [INFO ] Deduced a trap composed of 50 places in 323 ms
[2020-06-03 06:46:14] [INFO ] Deduced a trap composed of 98 places in 331 ms
[2020-06-03 06:46:14] [INFO ] Deduced a trap composed of 66 places in 341 ms
[2020-06-03 06:46:14] [INFO ] Deduced a trap composed of 66 places in 303 ms
[2020-06-03 06:46:15] [INFO ] Deduced a trap composed of 153 places in 340 ms
[2020-06-03 06:46:15] [INFO ] Deduced a trap composed of 50 places in 322 ms
[2020-06-03 06:46:15] [INFO ] Deduced a trap composed of 54 places in 340 ms
[2020-06-03 06:46:16] [INFO ] Deduced a trap composed of 78 places in 354 ms
[2020-06-03 06:46:16] [INFO ] Deduced a trap composed of 123 places in 350 ms
[2020-06-03 06:46:17] [INFO ] Deduced a trap composed of 76 places in 340 ms
[2020-06-03 06:46:17] [INFO ] Deduced a trap composed of 75 places in 314 ms
[2020-06-03 06:46:17] [INFO ] Deduced a trap composed of 12 places in 314 ms
[2020-06-03 06:46:18] [INFO ] Deduced a trap composed of 77 places in 332 ms
[2020-06-03 06:46:18] [INFO ] Deduced a trap composed of 16 places in 347 ms
[2020-06-03 06:46:18] [INFO ] Deduced a trap composed of 83 places in 195 ms
[2020-06-03 06:46:19] [INFO ] Deduced a trap composed of 18 places in 351 ms
[2020-06-03 06:46:19] [INFO ] Deduced a trap composed of 24 places in 343 ms
[2020-06-03 06:46:20] [INFO ] Deduced a trap composed of 16 places in 351 ms
[2020-06-03 06:46:20] [INFO ] Deduced a trap composed of 16 places in 386 ms
[2020-06-03 06:46:21] [INFO ] Deduced a trap composed of 45 places in 402 ms
[2020-06-03 06:46:21] [INFO ] Deduced a trap composed of 26 places in 367 ms
[2020-06-03 06:46:21] [INFO ] Deduced a trap composed of 26 places in 412 ms
[2020-06-03 06:46:22] [INFO ] Deduced a trap composed of 34 places in 384 ms
[2020-06-03 06:46:22] [INFO ] Deduced a trap composed of 38 places in 388 ms
[2020-06-03 06:46:23] [INFO ] Deduced a trap composed of 38 places in 342 ms
[2020-06-03 06:46:23] [INFO ] Deduced a trap composed of 44 places in 230 ms
[2020-06-03 06:46:24] [INFO ] Deduced a trap composed of 34 places in 188 ms
[2020-06-03 06:46:24] [INFO ] Deduced a trap composed of 34 places in 210 ms
[2020-06-03 06:46:24] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 22540 ms
[2020-06-03 06:46:24] [INFO ] Computed and/alt/rep : 1446/8509/1236 causal constraints in 73 ms.
[2020-06-03 06:46:44] [INFO ] Added : 930 causal constraints over 186 iterations in 20266 ms.(timeout) Result :sat
[2020-06-03 06:46:45] [INFO ] Deduced a trap composed of 86 places in 483 ms
[2020-06-03 06:46:45] [INFO ] Deduced a trap composed of 115 places in 496 ms
[2020-06-03 06:46:45] [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 (> (+ s4 s11 s17 s22 s23 s27 s29 s33 s47 s56 s57 s62 s67 s69 s74 s82 s91 s97 s102 s103 s108 s110 s113 s122 s130 s137 s142 s146 s152 s155 s161 s168 s172 s180 s185 s210 s229 s236 s255 s270 s277 s290 s295 s300 s314 s317 s326 s336 s340 s347 s352 s356 s363 s373 s374 s377 s393 s398 s400 s401 s407 s414 s422 s426 s428 s430 s432 s442 s448 s452 s462 s464 s468 s474 s478 s484 s491 s494 s508 s511 s513 s522 s535 s536 s545 s567 s573 s579 s603 s605 s620 s624 s626 s630 s631 s636 s642 s649 s663 s664 s665 s668 s669 s692 s694 s703 s705 s709 s713 s716 s718 s722 s726 s728 s743) 0)") while checking expression at index 1
[2020-06-03 06:46:45] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2020-06-03 06:46:45] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2020-06-03 06:46:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:46:47] [INFO ] [Real]Absence check using state equation in 1401 ms returned sat
[2020-06-03 06:46:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:46:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 31 ms returned sat
[2020-06-03 06:46:47] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2020-06-03 06:46:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:46:48] [INFO ] [Nat]Absence check using state equation in 1521 ms returned sat
[2020-06-03 06:46:49] [INFO ] [Nat]Added 366 Read/Feed constraints in 65 ms returned sat
[2020-06-03 06:46:49] [INFO ] Deduced a trap composed of 17 places in 428 ms
[2020-06-03 06:46:49] [INFO ] Deduced a trap composed of 17 places in 453 ms
[2020-06-03 06:46:50] [INFO ] Deduced a trap composed of 17 places in 433 ms
[2020-06-03 06:46:50] [INFO ] Deduced a trap composed of 17 places in 440 ms
[2020-06-03 06:46:51] [INFO ] Deduced a trap composed of 17 places in 431 ms
[2020-06-03 06:46:51] [INFO ] Deduced a trap composed of 34 places in 392 ms
[2020-06-03 06:46:52] [INFO ] Deduced a trap composed of 66 places in 541 ms
[2020-06-03 06:46:52] [INFO ] Deduced a trap composed of 30 places in 431 ms
[2020-06-03 06:46:53] [INFO ] Deduced a trap composed of 66 places in 381 ms
[2020-06-03 06:46:53] [INFO ] Deduced a trap composed of 83 places in 411 ms
[2020-06-03 06:46:54] [INFO ] Deduced a trap composed of 30 places in 400 ms
[2020-06-03 06:46:54] [INFO ] Deduced a trap composed of 30 places in 401 ms
[2020-06-03 06:46:55] [INFO ] Deduced a trap composed of 100 places in 387 ms
[2020-06-03 06:46:55] [INFO ] Deduced a trap composed of 34 places in 379 ms
[2020-06-03 06:46:56] [INFO ] Deduced a trap composed of 34 places in 372 ms
[2020-06-03 06:46:56] [INFO ] Deduced a trap composed of 14 places in 435 ms
[2020-06-03 06:46:56] [INFO ] Deduced a trap composed of 50 places in 320 ms
[2020-06-03 06:46:57] [INFO ] Deduced a trap composed of 62 places in 332 ms
[2020-06-03 06:46:57] [INFO ] Deduced a trap composed of 46 places in 331 ms
[2020-06-03 06:46:58] [INFO ] Deduced a trap composed of 46 places in 337 ms
[2020-06-03 06:46:58] [INFO ] Deduced a trap composed of 78 places in 315 ms
[2020-06-03 06:46:58] [INFO ] Deduced a trap composed of 78 places in 339 ms
[2020-06-03 06:46:59] [INFO ] Deduced a trap composed of 46 places in 302 ms
[2020-06-03 06:46:59] [INFO ] Deduced a trap composed of 50 places in 296 ms
[2020-06-03 06:46:59] [INFO ] Deduced a trap composed of 22 places in 404 ms
[2020-06-03 06:47:00] [INFO ] Deduced a trap composed of 82 places in 190 ms
[2020-06-03 06:47:00] [INFO ] Deduced a trap composed of 82 places in 226 ms
[2020-06-03 06:47:00] [INFO ] Deduced a trap composed of 81 places in 253 ms
[2020-06-03 06:47:00] [INFO ] Deduced a trap composed of 82 places in 151 ms
[2020-06-03 06:47:01] [INFO ] Deduced a trap composed of 69 places in 368 ms
[2020-06-03 06:47:01] [INFO ] Deduced a trap composed of 80 places in 373 ms
[2020-06-03 06:47:02] [INFO ] Deduced a trap composed of 103 places in 369 ms
[2020-06-03 06:47:02] [INFO ] Deduced a trap composed of 82 places in 380 ms
[2020-06-03 06:47:03] [INFO ] Deduced a trap composed of 103 places in 396 ms
[2020-06-03 06:47:03] [INFO ] Deduced a trap composed of 98 places in 318 ms
[2020-06-03 06:47:03] [INFO ] Deduced a trap composed of 78 places in 252 ms
[2020-06-03 06:47:04] [INFO ] Deduced a trap composed of 78 places in 220 ms
[2020-06-03 06:47:04] [INFO ] Deduced a trap composed of 84 places in 273 ms
[2020-06-03 06:47:04] [INFO ] Deduced a trap composed of 62 places in 364 ms
[2020-06-03 06:47:05] [INFO ] Deduced a trap composed of 78 places in 328 ms
[2020-06-03 06:47:05] [INFO ] Deduced a trap composed of 96 places in 372 ms
[2020-06-03 06:47:05] [INFO ] Deduced a trap composed of 70 places in 261 ms
[2020-06-03 06:47:06] [INFO ] Deduced a trap composed of 84 places in 177 ms
[2020-06-03 06:47:06] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 17166 ms
[2020-06-03 06:47:06] [INFO ] Computed and/alt/rep : 1446/8509/1236 causal constraints in 84 ms.
[2020-06-03 06:47:26] [INFO ] Added : 980 causal constraints over 196 iterations in 20166 ms.(timeout) Result :sat
[2020-06-03 06:47:26] [INFO ] Deduced a trap composed of 29 places in 559 ms
[2020-06-03 06:47:27] [INFO ] Deduced a trap composed of 32 places in 597 ms
[2020-06-03 06:47:28] [INFO ] Deduced a trap composed of 54 places in 460 ms
[2020-06-03 06:47:28] [INFO ] Deduced a trap composed of 46 places in 441 ms
[2020-06-03 06:47:29] [INFO ] Deduced a trap composed of 12 places in 584 ms
[2020-06-03 06:47:30] [INFO ] Deduced a trap composed of 26 places in 559 ms
[2020-06-03 06:47:31] [INFO ] Deduced a trap composed of 26 places in 587 ms
[2020-06-03 06:47:31] [INFO ] Deduced a trap composed of 18 places in 484 ms
[2020-06-03 06:47:32] [INFO ] Deduced a trap composed of 82 places in 346 ms
[2020-06-03 06:47:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 06:47:32] [INFO ] Deduced a trap composed of 2 places in 660 ms
[2020-06-03 06:47:32] [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 (> (+ s390 s747) 0)") while checking expression at index 2
Support contains 10 out of 753 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 753/753 places, 1453/1453 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 753 transition count 1374
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 674 transition count 1374
Performed 213 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 213 Pre rules applied. Total rules applied 158 place count 674 transition count 1161
Deduced a syphon composed of 213 places in 2 ms
Reduce places removed 213 places and 0 transitions.
Iterating global reduction 2 with 426 rules applied. Total rules applied 584 place count 461 transition count 1161
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 666 place count 420 transition count 1120
Applied a total of 666 rules in 127 ms. Remains 420 /753 variables (removed 333) and now considering 1120/1453 (removed 333) transitions.
Finished structural reductions, in 1 iterations. Remains : 420/753 places, 1120/1453 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2035 ms. (steps per millisecond=491 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 709 ms. (steps per millisecond=1410 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 492 ms. (steps per millisecond=2032 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 518 ms. (steps per millisecond=1930 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 12209200 steps, run timeout after 30001 ms. (steps per millisecond=406 ) properties seen :[0, 0, 0]
Probabilistic random walk after 12209200 steps, saw 1526151 distinct states, run finished after 30001 ms. (steps per millisecond=406 ) properties seen :[0, 0, 0]
[2020-06-03 06:48:06] [INFO ] Flow matrix only has 910 transitions (discarded 210 similar events)
// Phase 1: matrix 910 rows 420 cols
[2020-06-03 06:48:06] [INFO ] Computed 27 place invariants in 7 ms
[2020-06-03 06:48:06] [INFO ] [Real]Absence check using 20 positive place invariants in 18 ms returned sat
[2020-06-03 06:48:06] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-06-03 06:48:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:48:07] [INFO ] [Real]Absence check using state equation in 639 ms returned sat
[2020-06-03 06:48:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:48:07] [INFO ] [Nat]Absence check using 20 positive place invariants in 25 ms returned sat
[2020-06-03 06:48:07] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2020-06-03 06:48:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:48:08] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2020-06-03 06:48:08] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 06:48:08] [INFO ] [Nat]Added 366 Read/Feed constraints in 44 ms returned sat
[2020-06-03 06:48:08] [INFO ] Deduced a trap composed of 10 places in 221 ms
[2020-06-03 06:48:08] [INFO ] Deduced a trap composed of 10 places in 225 ms
[2020-06-03 06:48:09] [INFO ] Deduced a trap composed of 10 places in 253 ms
[2020-06-03 06:48:09] [INFO ] Deduced a trap composed of 33 places in 247 ms
[2020-06-03 06:48:09] [INFO ] Deduced a trap composed of 18 places in 248 ms
[2020-06-03 06:48:10] [INFO ] Deduced a trap composed of 56 places in 238 ms
[2020-06-03 06:48:10] [INFO ] Deduced a trap composed of 37 places in 261 ms
[2020-06-03 06:48:10] [INFO ] Deduced a trap composed of 18 places in 258 ms
[2020-06-03 06:48:10] [INFO ] Deduced a trap composed of 33 places in 216 ms
[2020-06-03 06:48:11] [INFO ] Deduced a trap composed of 24 places in 250 ms
[2020-06-03 06:48:11] [INFO ] Deduced a trap composed of 26 places in 227 ms
[2020-06-03 06:48:11] [INFO ] Deduced a trap composed of 34 places in 193 ms
[2020-06-03 06:48:11] [INFO ] Deduced a trap composed of 18 places in 228 ms
[2020-06-03 06:48:12] [INFO ] Deduced a trap composed of 18 places in 208 ms
[2020-06-03 06:48:12] [INFO ] Deduced a trap composed of 30 places in 228 ms
[2020-06-03 06:48:12] [INFO ] Deduced a trap composed of 74 places in 219 ms
[2020-06-03 06:48:12] [INFO ] Deduced a trap composed of 26 places in 207 ms
[2020-06-03 06:48:13] [INFO ] Deduced a trap composed of 18 places in 250 ms
[2020-06-03 06:48:13] [INFO ] Deduced a trap composed of 45 places in 218 ms
[2020-06-03 06:48:13] [INFO ] Deduced a trap composed of 34 places in 217 ms
[2020-06-03 06:48:13] [INFO ] Deduced a trap composed of 26 places in 219 ms
[2020-06-03 06:48:14] [INFO ] Deduced a trap composed of 26 places in 215 ms
[2020-06-03 06:48:14] [INFO ] Deduced a trap composed of 50 places in 202 ms
[2020-06-03 06:48:14] [INFO ] Deduced a trap composed of 26 places in 202 ms
[2020-06-03 06:48:14] [INFO ] Deduced a trap composed of 26 places in 208 ms
[2020-06-03 06:48:15] [INFO ] Deduced a trap composed of 51 places in 176 ms
[2020-06-03 06:48:15] [INFO ] Deduced a trap composed of 51 places in 164 ms
[2020-06-03 06:48:15] [INFO ] Deduced a trap composed of 42 places in 149 ms
[2020-06-03 06:48:15] [INFO ] Deduced a trap composed of 50 places in 178 ms
[2020-06-03 06:48:15] [INFO ] Deduced a trap composed of 34 places in 190 ms
[2020-06-03 06:48:16] [INFO ] Deduced a trap composed of 34 places in 186 ms
[2020-06-03 06:48:16] [INFO ] Deduced a trap composed of 34 places in 165 ms
[2020-06-03 06:48:16] [INFO ] Deduced a trap composed of 34 places in 188 ms
[2020-06-03 06:48:16] [INFO ] Deduced a trap composed of 22 places in 199 ms
[2020-06-03 06:48:17] [INFO ] Deduced a trap composed of 50 places in 134 ms
[2020-06-03 06:48:17] [INFO ] Deduced a trap composed of 62 places in 141 ms
[2020-06-03 06:48:17] [INFO ] Deduced a trap composed of 12 places in 125 ms
[2020-06-03 06:48:17] [INFO ] Deduced a trap composed of 13 places in 103 ms
[2020-06-03 06:48:17] [INFO ] Deduced a trap composed of 13 places in 107 ms
[2020-06-03 06:48:17] [INFO ] Deduced a trap composed of 38 places in 230 ms
[2020-06-03 06:48:18] [INFO ] Deduced a trap composed of 48 places in 201 ms
[2020-06-03 06:48:18] [INFO ] Deduced a trap composed of 29 places in 163 ms
[2020-06-03 06:48:18] [INFO ] Deduced a trap composed of 19 places in 155 ms
[2020-06-03 06:48:18] [INFO ] Deduced a trap composed of 29 places in 173 ms
[2020-06-03 06:48:18] [INFO ] Deduced a trap composed of 23 places in 167 ms
[2020-06-03 06:48:19] [INFO ] Deduced a trap composed of 37 places in 208 ms
[2020-06-03 06:48:19] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 10882 ms
[2020-06-03 06:48:19] [INFO ] Computed and/alt/rep : 1113/8176/903 causal constraints in 65 ms.
[2020-06-03 06:48:39] [INFO ] Added : 865 causal constraints over 173 iterations in 20346 ms.(timeout) Result :sat
[2020-06-03 06:48:40] [INFO ] Deduced a trap composed of 14 places in 303 ms
[2020-06-03 06:48:40] [INFO ] Deduced a trap composed of 30 places in 276 ms
[2020-06-03 06:48:40] [INFO ] Deduced a trap composed of 50 places in 282 ms
[2020-06-03 06:48:41] [INFO ] Deduced a trap composed of 49 places in 261 ms
[2020-06-03 06:48:41] [INFO ] Deduced a trap composed of 59 places in 263 ms
[2020-06-03 06:48:42] [INFO ] Deduced a trap composed of 30 places in 245 ms
[2020-06-03 06:48:42] [INFO ] Deduced a trap composed of 47 places in 220 ms
[2020-06-03 06:48:42] [INFO ] Deduced a trap composed of 41 places in 181 ms
[2020-06-03 06:48:43] [INFO ] Deduced a trap composed of 37 places in 251 ms
[2020-06-03 06:48:43] [INFO ] Deduced a trap composed of 37 places in 212 ms
[2020-06-03 06:48:44] [INFO ] Deduced a trap composed of 37 places in 245 ms
[2020-06-03 06:48:44] [INFO ] Deduced a trap composed of 67 places in 238 ms
[2020-06-03 06:48:45] [INFO ] Deduced a trap composed of 30 places in 210 ms
[2020-06-03 06:48:45] [INFO ] Deduced a trap composed of 36 places in 218 ms
[2020-06-03 06:48:45] [INFO ] Deduced a trap composed of 37 places in 254 ms
[2020-06-03 06:48:46] [INFO ] Deduced a trap composed of 30 places in 230 ms
[2020-06-03 06:48:46] [INFO ] Deduced a trap composed of 30 places in 236 ms
[2020-06-03 06:48:46] [INFO ] Deduced a trap composed of 10 places in 225 ms
[2020-06-03 06:48:47] [INFO ] Deduced a trap composed of 30 places in 227 ms
[2020-06-03 06:48:47] [INFO ] Deduced a trap composed of 13 places in 220 ms
[2020-06-03 06:48:47] [INFO ] Deduced a trap composed of 12 places in 268 ms
[2020-06-03 06:48:48] [INFO ] Deduced a trap composed of 12 places in 264 ms
[2020-06-03 06:48:48] [INFO ] Deduced a trap composed of 31 places in 187 ms
[2020-06-03 06:48:49] [INFO ] Deduced a trap composed of 39 places in 234 ms
[2020-06-03 06:48:49] [INFO ] Deduced a trap composed of 24 places in 202 ms
[2020-06-03 06:48:49] [INFO ] Deduced a trap composed of 27 places in 213 ms
[2020-06-03 06:48:50] [INFO ] Deduced a trap composed of 31 places in 236 ms
[2020-06-03 06:48:50] [INFO ] Deduced a trap composed of 39 places in 198 ms
[2020-06-03 06:48:50] [INFO ] Deduced a trap composed of 57 places in 183 ms
[2020-06-03 06:48:51] [INFO ] Deduced a trap composed of 39 places in 173 ms
[2020-06-03 06:48:51] [INFO ] Deduced a trap composed of 38 places in 158 ms
[2020-06-03 06:48:51] [INFO ] Deduced a trap composed of 41 places in 154 ms
[2020-06-03 06:48:51] [INFO ] Deduced a trap composed of 30 places in 179 ms
[2020-06-03 06:48:52] [INFO ] Deduced a trap composed of 24 places in 198 ms
[2020-06-03 06:48:52] [INFO ] Deduced a trap composed of 31 places in 218 ms
[2020-06-03 06:48:52] [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 (> (+ s5 s11 s17 s38 s46 s56 s73 s81 s89 s113 s119 s131 s150 s152 s158 s218 s233 s248 s281 s283 s309 s341 s347 s355 s365 s376 s377 s383 s387 s408 s409) 0)") while checking expression at index 0
[2020-06-03 06:48:52] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned sat
[2020-06-03 06:48:52] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-06-03 06:48:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:48:53] [INFO ] [Real]Absence check using state equation in 634 ms returned sat
[2020-06-03 06:48:53] [INFO ] [Real]Added 366 Read/Feed constraints in 43 ms returned sat
[2020-06-03 06:48:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:48:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 20 ms returned sat
[2020-06-03 06:48:53] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-06-03 06:48:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:48:54] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2020-06-03 06:48:54] [INFO ] [Nat]Added 366 Read/Feed constraints in 71 ms returned sat
[2020-06-03 06:48:54] [INFO ] Deduced a trap composed of 56 places in 258 ms
[2020-06-03 06:48:54] [INFO ] Deduced a trap composed of 46 places in 213 ms
[2020-06-03 06:48:55] [INFO ] Deduced a trap composed of 15 places in 233 ms
[2020-06-03 06:48:55] [INFO ] Deduced a trap composed of 31 places in 193 ms
[2020-06-03 06:48:55] [INFO ] Deduced a trap composed of 31 places in 180 ms
[2020-06-03 06:48:55] [INFO ] Deduced a trap composed of 31 places in 194 ms
[2020-06-03 06:48:55] [INFO ] Deduced a trap composed of 31 places in 213 ms
[2020-06-03 06:48:56] [INFO ] Deduced a trap composed of 29 places in 237 ms
[2020-06-03 06:48:56] [INFO ] Deduced a trap composed of 40 places in 201 ms
[2020-06-03 06:48:56] [INFO ] Deduced a trap composed of 29 places in 208 ms
[2020-06-03 06:48:56] [INFO ] Deduced a trap composed of 57 places in 150 ms
[2020-06-03 06:48:57] [INFO ] Deduced a trap composed of 58 places in 155 ms
[2020-06-03 06:48:57] [INFO ] Deduced a trap composed of 57 places in 160 ms
[2020-06-03 06:48:57] [INFO ] Deduced a trap composed of 37 places in 118 ms
[2020-06-03 06:48:57] [INFO ] Deduced a trap composed of 37 places in 145 ms
[2020-06-03 06:48:57] [INFO ] Deduced a trap composed of 57 places in 128 ms
[2020-06-03 06:48:57] [INFO ] Deduced a trap composed of 36 places in 137 ms
[2020-06-03 06:48:58] [INFO ] Deduced a trap composed of 28 places in 139 ms
[2020-06-03 06:48:58] [INFO ] Deduced a trap composed of 37 places in 131 ms
[2020-06-03 06:48:58] [INFO ] Deduced a trap composed of 36 places in 136 ms
[2020-06-03 06:48:58] [INFO ] Deduced a trap composed of 74 places in 167 ms
[2020-06-03 06:48:58] [INFO ] Deduced a trap composed of 33 places in 141 ms
[2020-06-03 06:48:58] [INFO ] Deduced a trap composed of 45 places in 166 ms
[2020-06-03 06:48:59] [INFO ] Deduced a trap composed of 19 places in 149 ms
[2020-06-03 06:48:59] [INFO ] Deduced a trap composed of 24 places in 187 ms
[2020-06-03 06:48:59] [INFO ] Deduced a trap composed of 41 places in 141 ms
[2020-06-03 06:48:59] [INFO ] Deduced a trap composed of 19 places in 148 ms
[2020-06-03 06:48:59] [INFO ] Deduced a trap composed of 19 places in 157 ms
[2020-06-03 06:49:00] [INFO ] Deduced a trap composed of 18 places in 175 ms
[2020-06-03 06:49:00] [INFO ] Deduced a trap composed of 23 places in 184 ms
[2020-06-03 06:49:00] [INFO ] Deduced a trap composed of 44 places in 185 ms
[2020-06-03 06:49:00] [INFO ] Deduced a trap composed of 45 places in 190 ms
[2020-06-03 06:49:00] [INFO ] Deduced a trap composed of 11 places in 192 ms
[2020-06-03 06:49:01] [INFO ] Deduced a trap composed of 11 places in 191 ms
[2020-06-03 06:49:01] [INFO ] Deduced a trap composed of 45 places in 160 ms
[2020-06-03 06:49:01] [INFO ] Deduced a trap composed of 45 places in 171 ms
[2020-06-03 06:49:01] [INFO ] Deduced a trap composed of 11 places in 158 ms
[2020-06-03 06:49:01] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 7602 ms
[2020-06-03 06:49:01] [INFO ] Computed and/alt/rep : 1113/8176/903 causal constraints in 59 ms.
[2020-06-03 06:49:16] [INFO ] Added : 746 causal constraints over 150 iterations in 15137 ms. Result :sat
[2020-06-03 06:49:17] [INFO ] Deduced a trap composed of 31 places in 218 ms
[2020-06-03 06:49:17] [INFO ] Deduced a trap composed of 26 places in 244 ms
[2020-06-03 06:49:17] [INFO ] Deduced a trap composed of 11 places in 234 ms
[2020-06-03 06:49:18] [INFO ] Deduced a trap composed of 19 places in 186 ms
[2020-06-03 06:49:18] [INFO ] Deduced a trap composed of 43 places in 151 ms
[2020-06-03 06:49:18] [INFO ] Deduced a trap composed of 42 places in 152 ms
[2020-06-03 06:49:18] [INFO ] Deduced a trap composed of 35 places in 163 ms
[2020-06-03 06:49:19] [INFO ] Deduced a trap composed of 35 places in 168 ms
[2020-06-03 06:49:19] [INFO ] Deduced a trap composed of 43 places in 161 ms
[2020-06-03 06:49:19] [INFO ] Deduced a trap composed of 35 places in 171 ms
[2020-06-03 06:49:20] [INFO ] Deduced a trap composed of 43 places in 183 ms
[2020-06-03 06:49:20] [INFO ] Deduced a trap composed of 36 places in 161 ms
[2020-06-03 06:49:20] [INFO ] Deduced a trap composed of 33 places in 168 ms
[2020-06-03 06:49:20] [INFO ] Deduced a trap composed of 43 places in 154 ms
[2020-06-03 06:49:21] [INFO ] Deduced a trap composed of 20 places in 170 ms
[2020-06-03 06:49:21] [INFO ] Deduced a trap composed of 19 places in 231 ms
[2020-06-03 06:49:21] [INFO ] Deduced a trap composed of 40 places in 191 ms
[2020-06-03 06:49:22] [INFO ] Deduced a trap composed of 13 places in 237 ms
[2020-06-03 06:49:22] [INFO ] Deduced a trap composed of 11 places in 236 ms
[2020-06-03 06:49:23] [INFO ] Deduced a trap composed of 28 places in 213 ms
[2020-06-03 06:49:23] [INFO ] Deduced a trap composed of 35 places in 193 ms
[2020-06-03 06:49:23] [INFO ] Deduced a trap composed of 34 places in 198 ms
[2020-06-03 06:49:24] [INFO ] Deduced a trap composed of 31 places in 193 ms
[2020-06-03 06:49:24] [INFO ] Deduced a trap composed of 22 places in 187 ms
[2020-06-03 06:49:25] [INFO ] Deduced a trap composed of 12 places in 170 ms
[2020-06-03 06:49:25] [INFO ] Deduced a trap composed of 23 places in 156 ms
[2020-06-03 06:49:25] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 8756 ms
Attempting to minimize the solution found.
Minimization took 72 ms.
[2020-06-03 06:49:25] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned sat
[2020-06-03 06:49:25] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-06-03 06:49:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:49:26] [INFO ] [Real]Absence check using state equation in 677 ms returned sat
[2020-06-03 06:49:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:49:26] [INFO ] [Nat]Absence check using 20 positive place invariants in 18 ms returned sat
[2020-06-03 06:49:26] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2020-06-03 06:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:49:27] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2020-06-03 06:49:27] [INFO ] [Nat]Added 366 Read/Feed constraints in 46 ms returned sat
[2020-06-03 06:49:27] [INFO ] Deduced a trap composed of 18 places in 239 ms
[2020-06-03 06:49:27] [INFO ] Deduced a trap composed of 32 places in 222 ms
[2020-06-03 06:49:28] [INFO ] Deduced a trap composed of 20 places in 218 ms
[2020-06-03 06:49:28] [INFO ] Deduced a trap composed of 44 places in 235 ms
[2020-06-03 06:49:28] [INFO ] Deduced a trap composed of 50 places in 245 ms
[2020-06-03 06:49:28] [INFO ] Deduced a trap composed of 12 places in 240 ms
[2020-06-03 06:49:29] [INFO ] Deduced a trap composed of 13 places in 225 ms
[2020-06-03 06:49:29] [INFO ] Deduced a trap composed of 10 places in 240 ms
[2020-06-03 06:49:29] [INFO ] Deduced a trap composed of 15 places in 232 ms
[2020-06-03 06:49:29] [INFO ] Deduced a trap composed of 18 places in 212 ms
[2020-06-03 06:49:30] [INFO ] Deduced a trap composed of 18 places in 196 ms
[2020-06-03 06:49:30] [INFO ] Deduced a trap composed of 23 places in 225 ms
[2020-06-03 06:49:30] [INFO ] Deduced a trap composed of 23 places in 196 ms
[2020-06-03 06:49:30] [INFO ] Deduced a trap composed of 29 places in 174 ms
[2020-06-03 06:49:31] [INFO ] Deduced a trap composed of 50 places in 183 ms
[2020-06-03 06:49:31] [INFO ] Deduced a trap composed of 34 places in 214 ms
[2020-06-03 06:49:31] [INFO ] Deduced a trap composed of 35 places in 183 ms
[2020-06-03 06:49:31] [INFO ] Deduced a trap composed of 49 places in 180 ms
[2020-06-03 06:49:31] [INFO ] Deduced a trap composed of 29 places in 154 ms
[2020-06-03 06:49:32] [INFO ] Deduced a trap composed of 26 places in 232 ms
[2020-06-03 06:49:32] [INFO ] Deduced a trap composed of 26 places in 226 ms
[2020-06-03 06:49:32] [INFO ] Deduced a trap composed of 38 places in 192 ms
[2020-06-03 06:49:32] [INFO ] Deduced a trap composed of 48 places in 167 ms
[2020-06-03 06:49:33] [INFO ] Deduced a trap composed of 46 places in 175 ms
[2020-06-03 06:49:33] [INFO ] Deduced a trap composed of 55 places in 168 ms
[2020-06-03 06:49:33] [INFO ] Deduced a trap composed of 47 places in 151 ms
[2020-06-03 06:49:33] [INFO ] Deduced a trap composed of 43 places in 136 ms
[2020-06-03 06:49:33] [INFO ] Deduced a trap composed of 43 places in 134 ms
[2020-06-03 06:49:33] [INFO ] Deduced a trap composed of 36 places in 125 ms
[2020-06-03 06:49:34] [INFO ] Deduced a trap composed of 43 places in 123 ms
[2020-06-03 06:49:34] [INFO ] Deduced a trap composed of 34 places in 169 ms
[2020-06-03 06:49:34] [INFO ] Deduced a trap composed of 51 places in 168 ms
[2020-06-03 06:49:34] [INFO ] Deduced a trap composed of 51 places in 167 ms
[2020-06-03 06:49:34] [INFO ] Deduced a trap composed of 51 places in 162 ms
[2020-06-03 06:49:35] [INFO ] Deduced a trap composed of 51 places in 150 ms
[2020-06-03 06:49:35] [INFO ] Deduced a trap composed of 12 places in 180 ms
[2020-06-03 06:49:35] [INFO ] Deduced a trap composed of 12 places in 180 ms
[2020-06-03 06:49:35] [INFO ] Deduced a trap composed of 31 places in 121 ms
[2020-06-03 06:49:35] [INFO ] Deduced a trap composed of 27 places in 137 ms
[2020-06-03 06:49:36] [INFO ] Deduced a trap composed of 27 places in 132 ms
[2020-06-03 06:49:36] [INFO ] Deduced a trap composed of 33 places in 144 ms
[2020-06-03 06:49:36] [INFO ] Deduced a trap composed of 31 places in 140 ms
[2020-06-03 06:49:36] [INFO ] Deduced a trap composed of 31 places in 118 ms
[2020-06-03 06:49:36] [INFO ] Deduced a trap composed of 39 places in 134 ms
[2020-06-03 06:49:36] [INFO ] Deduced a trap composed of 45 places in 143 ms
[2020-06-03 06:49:37] [INFO ] Deduced a trap composed of 34 places in 144 ms
[2020-06-03 06:49:37] [INFO ] Deduced a trap composed of 35 places in 143 ms
[2020-06-03 06:49:37] [INFO ] Deduced a trap composed of 10 places in 207 ms
[2020-06-03 06:49:37] [INFO ] Deduced a trap composed of 42 places in 111 ms
[2020-06-03 06:49:38] [INFO ] Deduced a trap composed of 40 places in 112 ms
[2020-06-03 06:49:38] [INFO ] Deduced a trap composed of 42 places in 130 ms
[2020-06-03 06:49:38] [INFO ] Deduced a trap composed of 42 places in 98 ms
[2020-06-03 06:49:38] [INFO ] Deduced a trap composed of 34 places in 129 ms
[2020-06-03 06:49:38] [INFO ] Deduced a trap composed of 35 places in 131 ms
[2020-06-03 06:49:38] [INFO ] Deduced a trap composed of 10 places in 128 ms
[2020-06-03 06:49:39] [INFO ] Deduced a trap composed of 21 places in 115 ms
[2020-06-03 06:49:39] [INFO ] Deduced a trap composed of 23 places in 184 ms
[2020-06-03 06:49:39] [INFO ] Deduced a trap composed of 27 places in 146 ms
[2020-06-03 06:49:39] [INFO ] Deduced a trap composed of 30 places in 121 ms
[2020-06-03 06:49:39] [INFO ] Deduced a trap composed of 57 places in 117 ms
[2020-06-03 06:49:39] [INFO ] Deduced a trap composed of 18 places in 132 ms
[2020-06-03 06:49:40] [INFO ] Trap strengthening (SAT) tested/added 62/61 trap constraints in 12910 ms
[2020-06-03 06:49:40] [INFO ] Computed and/alt/rep : 1113/8176/903 causal constraints in 79 ms.
[2020-06-03 06:50:00] [INFO ] Added : 805 causal constraints over 161 iterations in 20150 ms.(timeout) Result :sat
[2020-06-03 06:50:00] [INFO ] Deduced a trap composed of 22 places in 199 ms
[2020-06-03 06:50:00] [INFO ] Deduced a trap composed of 30 places in 188 ms
[2020-06-03 06:50:01] [INFO ] Deduced a trap composed of 71 places in 167 ms
[2020-06-03 06:50:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 981 ms
Attempting to minimize the solution found.
Minimization took 85 ms.
Incomplete Parikh walk after 211400 steps, including 1000 resets, run finished after 509 ms. (steps per millisecond=415 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 174900 steps, including 1000 resets, run finished after 393 ms. (steps per millisecond=445 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 10 out of 420 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 420/420 places, 1120/1120 transitions.
Applied a total of 0 rules in 21 ms. Remains 420 /420 variables (removed 0) and now considering 1120/1120 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 420/420 places, 1120/1120 transitions.
Starting structural reductions, iteration 0 : 420/420 places, 1120/1120 transitions.
Applied a total of 0 rules in 23 ms. Remains 420 /420 variables (removed 0) and now considering 1120/1120 (removed 0) transitions.
[2020-06-03 06:50:02] [INFO ] Flow matrix only has 910 transitions (discarded 210 similar events)
// Phase 1: matrix 910 rows 420 cols
[2020-06-03 06:50:02] [INFO ] Computed 27 place invariants in 4 ms
[2020-06-03 06:50:03] [INFO ] Implicit Places using invariants in 791 ms returned [401, 402, 404, 412, 413, 414, 415]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 794 ms to find 7 implicit places.
[2020-06-03 06:50:03] [INFO ] Redundant transitions in 96 ms returned []
[2020-06-03 06:50:03] [INFO ] Flow matrix only has 910 transitions (discarded 210 similar events)
// Phase 1: matrix 910 rows 413 cols
[2020-06-03 06:50:03] [INFO ] Computed 20 place invariants in 6 ms
[2020-06-03 06:50:04] [INFO ] Dead Transitions using invariants and state equation in 1413 ms returned []
Starting structural reductions, iteration 1 : 413/420 places, 1120/1120 transitions.
Applied a total of 0 rules in 31 ms. Remains 413 /413 variables (removed 0) and now considering 1120/1120 (removed 0) transitions.
[2020-06-03 06:50:05] [INFO ] Redundant transitions in 214 ms returned []
[2020-06-03 06:50:05] [INFO ] Flow matrix only has 910 transitions (discarded 210 similar events)
// Phase 1: matrix 910 rows 413 cols
[2020-06-03 06:50:05] [INFO ] Computed 20 place invariants in 3 ms
[2020-06-03 06:50:06] [INFO ] Dead Transitions using invariants and state equation in 1291 ms returned []
Finished structural reductions, in 2 iterations. Remains : 413/420 places, 1120/1120 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2101 ms. (steps per millisecond=475 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 742 ms. (steps per millisecond=1347 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 539 ms. (steps per millisecond=1855 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 552 ms. (steps per millisecond=1811 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 11817992 steps, run timeout after 30001 ms. (steps per millisecond=393 ) properties seen :[0, 0, 0]
Probabilistic random walk after 11817992 steps, saw 1477250 distinct states, run finished after 30002 ms. (steps per millisecond=393 ) properties seen :[0, 0, 0]
[2020-06-03 06:50:40] [INFO ] Flow matrix only has 910 transitions (discarded 210 similar events)
// Phase 1: matrix 910 rows 413 cols
[2020-06-03 06:50:40] [INFO ] Computed 20 place invariants in 3 ms
[2020-06-03 06:50:40] [INFO ] [Real]Absence check using 20 positive place invariants in 24 ms returned sat
[2020-06-03 06:50:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:50:40] [INFO ] [Real]Absence check using state equation in 612 ms returned sat
[2020-06-03 06:50:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:50:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2020-06-03 06:50:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:50:41] [INFO ] [Nat]Absence check using state equation in 609 ms returned sat
[2020-06-03 06:50:41] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 06:50:41] [INFO ] [Nat]Added 366 Read/Feed constraints in 52 ms returned sat
[2020-06-03 06:50:42] [INFO ] Deduced a trap composed of 13 places in 246 ms
[2020-06-03 06:50:42] [INFO ] Deduced a trap composed of 31 places in 193 ms
[2020-06-03 06:50:42] [INFO ] Deduced a trap composed of 26 places in 203 ms
[2020-06-03 06:50:42] [INFO ] Deduced a trap composed of 18 places in 182 ms
[2020-06-03 06:50:42] [INFO ] Deduced a trap composed of 18 places in 209 ms
[2020-06-03 06:50:43] [INFO ] Deduced a trap composed of 26 places in 167 ms
[2020-06-03 06:50:43] [INFO ] Deduced a trap composed of 23 places in 197 ms
[2020-06-03 06:50:43] [INFO ] Deduced a trap composed of 45 places in 159 ms
[2020-06-03 06:50:43] [INFO ] Deduced a trap composed of 23 places in 187 ms
[2020-06-03 06:50:43] [INFO ] Deduced a trap composed of 23 places in 219 ms
[2020-06-03 06:50:44] [INFO ] Deduced a trap composed of 18 places in 221 ms
[2020-06-03 06:50:44] [INFO ] Deduced a trap composed of 14 places in 258 ms
[2020-06-03 06:50:44] [INFO ] Deduced a trap composed of 50 places in 211 ms
[2020-06-03 06:50:45] [INFO ] Deduced a trap composed of 50 places in 200 ms
[2020-06-03 06:50:45] [INFO ] Deduced a trap composed of 10 places in 207 ms
[2020-06-03 06:50:45] [INFO ] Deduced a trap composed of 11 places in 231 ms
[2020-06-03 06:50:45] [INFO ] Deduced a trap composed of 10 places in 211 ms
[2020-06-03 06:50:46] [INFO ] Deduced a trap composed of 10 places in 214 ms
[2020-06-03 06:50:46] [INFO ] Deduced a trap composed of 52 places in 188 ms
[2020-06-03 06:50:46] [INFO ] Deduced a trap composed of 41 places in 205 ms
[2020-06-03 06:50:46] [INFO ] Deduced a trap composed of 26 places in 170 ms
[2020-06-03 06:50:46] [INFO ] Deduced a trap composed of 26 places in 187 ms
[2020-06-03 06:50:47] [INFO ] Deduced a trap composed of 26 places in 195 ms
[2020-06-03 06:50:47] [INFO ] Deduced a trap composed of 13 places in 183 ms
[2020-06-03 06:50:47] [INFO ] Deduced a trap composed of 34 places in 147 ms
[2020-06-03 06:50:47] [INFO ] Deduced a trap composed of 38 places in 143 ms
[2020-06-03 06:50:47] [INFO ] Deduced a trap composed of 34 places in 115 ms
[2020-06-03 06:50:48] [INFO ] Deduced a trap composed of 58 places in 127 ms
[2020-06-03 06:50:48] [INFO ] Deduced a trap composed of 34 places in 136 ms
[2020-06-03 06:50:48] [INFO ] Deduced a trap composed of 39 places in 133 ms
[2020-06-03 06:50:48] [INFO ] Deduced a trap composed of 26 places in 132 ms
[2020-06-03 06:50:48] [INFO ] Deduced a trap composed of 30 places in 241 ms
[2020-06-03 06:50:49] [INFO ] Deduced a trap composed of 19 places in 218 ms
[2020-06-03 06:50:49] [INFO ] Deduced a trap composed of 29 places in 224 ms
[2020-06-03 06:50:49] [INFO ] Deduced a trap composed of 11 places in 181 ms
[2020-06-03 06:50:49] [INFO ] Deduced a trap composed of 20 places in 196 ms
[2020-06-03 06:50:50] [INFO ] Deduced a trap composed of 19 places in 168 ms
[2020-06-03 06:50:50] [INFO ] Deduced a trap composed of 20 places in 172 ms
[2020-06-03 06:50:50] [INFO ] Deduced a trap composed of 12 places in 168 ms
[2020-06-03 06:50:50] [INFO ] Deduced a trap composed of 11 places in 222 ms
[2020-06-03 06:50:51] [INFO ] Deduced a trap composed of 35 places in 196 ms
[2020-06-03 06:50:51] [INFO ] Deduced a trap composed of 10 places in 222 ms
[2020-06-03 06:50:51] [INFO ] Deduced a trap composed of 29 places in 200 ms
[2020-06-03 06:50:51] [INFO ] Deduced a trap composed of 34 places in 167 ms
[2020-06-03 06:50:52] [INFO ] Deduced a trap composed of 42 places in 184 ms
[2020-06-03 06:50:52] [INFO ] Deduced a trap composed of 42 places in 188 ms
[2020-06-03 06:50:52] [INFO ] Deduced a trap composed of 18 places in 179 ms
[2020-06-03 06:50:52] [INFO ] Deduced a trap composed of 37 places in 211 ms
[2020-06-03 06:50:52] [INFO ] Deduced a trap composed of 47 places in 226 ms
[2020-06-03 06:50:53] [INFO ] Deduced a trap composed of 39 places in 152 ms
[2020-06-03 06:50:53] [INFO ] Deduced a trap composed of 23 places in 168 ms
[2020-06-03 06:50:53] [INFO ] Deduced a trap composed of 18 places in 178 ms
[2020-06-03 06:50:53] [INFO ] Deduced a trap composed of 64 places in 107 ms
[2020-06-03 06:50:53] [INFO ] Deduced a trap composed of 50 places in 103 ms
[2020-06-03 06:50:53] [INFO ] Deduced a trap composed of 50 places in 105 ms
[2020-06-03 06:50:54] [INFO ] Deduced a trap composed of 50 places in 110 ms
[2020-06-03 06:50:54] [INFO ] Deduced a trap composed of 50 places in 91 ms
[2020-06-03 06:50:54] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 12550 ms
[2020-06-03 06:50:54] [INFO ] Computed and/alt/rep : 1113/8176/903 causal constraints in 44 ms.
[2020-06-03 06:51:10] [INFO ] Added : 707 causal constraints over 142 iterations in 16267 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 101 ms.
[2020-06-03 06:51:10] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2020-06-03 06:51:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:51:11] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2020-06-03 06:51:11] [INFO ] [Real]Added 366 Read/Feed constraints in 44 ms returned sat
[2020-06-03 06:51:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:51:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 18 ms returned sat
[2020-06-03 06:51:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:51:12] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2020-06-03 06:51:12] [INFO ] [Nat]Added 366 Read/Feed constraints in 51 ms returned sat
[2020-06-03 06:51:12] [INFO ] Deduced a trap composed of 11 places in 272 ms
[2020-06-03 06:51:12] [INFO ] Deduced a trap composed of 11 places in 263 ms
[2020-06-03 06:51:13] [INFO ] Deduced a trap composed of 11 places in 213 ms
[2020-06-03 06:51:13] [INFO ] Deduced a trap composed of 11 places in 235 ms
[2020-06-03 06:51:13] [INFO ] Deduced a trap composed of 54 places in 247 ms
[2020-06-03 06:51:13] [INFO ] Deduced a trap composed of 29 places in 244 ms
[2020-06-03 06:51:14] [INFO ] Deduced a trap composed of 61 places in 234 ms
[2020-06-03 06:51:14] [INFO ] Deduced a trap composed of 23 places in 221 ms
[2020-06-03 06:51:14] [INFO ] Deduced a trap composed of 23 places in 250 ms
[2020-06-03 06:51:14] [INFO ] Deduced a trap composed of 23 places in 219 ms
[2020-06-03 06:51:15] [INFO ] Deduced a trap composed of 31 places in 218 ms
[2020-06-03 06:51:15] [INFO ] Deduced a trap composed of 31 places in 242 ms
[2020-06-03 06:51:15] [INFO ] Deduced a trap composed of 47 places in 238 ms
[2020-06-03 06:51:15] [INFO ] Deduced a trap composed of 15 places in 273 ms
[2020-06-03 06:51:16] [INFO ] Deduced a trap composed of 11 places in 245 ms
[2020-06-03 06:51:16] [INFO ] Deduced a trap composed of 27 places in 214 ms
[2020-06-03 06:51:16] [INFO ] Deduced a trap composed of 19 places in 202 ms
[2020-06-03 06:51:16] [INFO ] Deduced a trap composed of 53 places in 201 ms
[2020-06-03 06:51:17] [INFO ] Deduced a trap composed of 20 places in 195 ms
[2020-06-03 06:51:17] [INFO ] Deduced a trap composed of 18 places in 197 ms
[2020-06-03 06:51:17] [INFO ] Deduced a trap composed of 10 places in 182 ms
[2020-06-03 06:51:17] [INFO ] Deduced a trap composed of 57 places in 156 ms
[2020-06-03 06:51:18] [INFO ] Deduced a trap composed of 37 places in 144 ms
[2020-06-03 06:51:18] [INFO ] Deduced a trap composed of 30 places in 144 ms
[2020-06-03 06:51:18] [INFO ] Deduced a trap composed of 28 places in 178 ms
[2020-06-03 06:51:18] [INFO ] Deduced a trap composed of 29 places in 146 ms
[2020-06-03 06:51:18] [INFO ] Deduced a trap composed of 36 places in 139 ms
[2020-06-03 06:51:18] [INFO ] Deduced a trap composed of 31 places in 158 ms
[2020-06-03 06:51:19] [INFO ] Deduced a trap composed of 37 places in 120 ms
[2020-06-03 06:51:19] [INFO ] Deduced a trap composed of 39 places in 114 ms
[2020-06-03 06:51:19] [INFO ] Deduced a trap composed of 74 places in 161 ms
[2020-06-03 06:51:19] [INFO ] Deduced a trap composed of 45 places in 115 ms
[2020-06-03 06:51:19] [INFO ] Deduced a trap composed of 57 places in 122 ms
[2020-06-03 06:51:19] [INFO ] Deduced a trap composed of 44 places in 147 ms
[2020-06-03 06:51:20] [INFO ] Deduced a trap composed of 45 places in 150 ms
[2020-06-03 06:51:20] [INFO ] Deduced a trap composed of 45 places in 125 ms
[2020-06-03 06:51:20] [INFO ] Deduced a trap composed of 37 places in 147 ms
[2020-06-03 06:51:20] [INFO ] Deduced a trap composed of 45 places in 141 ms
[2020-06-03 06:51:20] [INFO ] Deduced a trap composed of 22 places in 178 ms
[2020-06-03 06:51:20] [INFO ] Deduced a trap composed of 20 places in 166 ms
[2020-06-03 06:51:21] [INFO ] Deduced a trap composed of 18 places in 172 ms
[2020-06-03 06:51:21] [INFO ] Deduced a trap composed of 23 places in 152 ms
[2020-06-03 06:51:21] [INFO ] Deduced a trap composed of 57 places in 158 ms
[2020-06-03 06:51:21] [INFO ] Deduced a trap composed of 19 places in 169 ms
[2020-06-03 06:51:21] [INFO ] Deduced a trap composed of 31 places in 122 ms
[2020-06-03 06:51:22] [INFO ] Deduced a trap composed of 39 places in 94 ms
[2020-06-03 06:51:22] [INFO ] Deduced a trap composed of 19 places in 107 ms
[2020-06-03 06:51:22] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 10070 ms
[2020-06-03 06:51:22] [INFO ] Computed and/alt/rep : 1113/8176/903 causal constraints in 43 ms.
[2020-06-03 06:51:39] [INFO ] Added : 788 causal constraints over 158 iterations in 16957 ms. Result :sat
[2020-06-03 06:51:39] [INFO ] Deduced a trap composed of 29 places in 205 ms
[2020-06-03 06:51:39] [INFO ] Deduced a trap composed of 37 places in 205 ms
[2020-06-03 06:51:40] [INFO ] Deduced a trap composed of 35 places in 197 ms
[2020-06-03 06:51:40] [INFO ] Deduced a trap composed of 43 places in 131 ms
[2020-06-03 06:51:40] [INFO ] Deduced a trap composed of 42 places in 172 ms
[2020-06-03 06:51:41] [INFO ] Deduced a trap composed of 34 places in 162 ms
[2020-06-03 06:51:41] [INFO ] Deduced a trap composed of 31 places in 164 ms
[2020-06-03 06:51:42] [INFO ] Deduced a trap composed of 27 places in 219 ms
[2020-06-03 06:51:42] [INFO ] Deduced a trap composed of 43 places in 148 ms
[2020-06-03 06:51:42] [INFO ] Deduced a trap composed of 37 places in 152 ms
[2020-06-03 06:51:42] [INFO ] Deduced a trap composed of 43 places in 148 ms
[2020-06-03 06:51:43] [INFO ] Deduced a trap composed of 55 places in 152 ms
[2020-06-03 06:51:43] [INFO ] Deduced a trap composed of 43 places in 123 ms
[2020-06-03 06:51:43] [INFO ] Deduced a trap composed of 52 places in 149 ms
[2020-06-03 06:51:43] [INFO ] Deduced a trap composed of 34 places in 145 ms
[2020-06-03 06:51:44] [INFO ] Deduced a trap composed of 34 places in 153 ms
[2020-06-03 06:51:44] [INFO ] Deduced a trap composed of 56 places in 139 ms
[2020-06-03 06:51:44] [INFO ] Deduced a trap composed of 35 places in 135 ms
[2020-06-03 06:51:44] [INFO ] Deduced a trap composed of 56 places in 135 ms
[2020-06-03 06:51:45] [INFO ] Deduced a trap composed of 35 places in 135 ms
[2020-06-03 06:51:45] [INFO ] Deduced a trap composed of 43 places in 161 ms
[2020-06-03 06:51:45] [INFO ] Deduced a trap composed of 38 places in 168 ms
[2020-06-03 06:51:46] [INFO ] Deduced a trap composed of 35 places in 170 ms
[2020-06-03 06:51:46] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6975 ms
Attempting to minimize the solution found.
Minimization took 83 ms.
[2020-06-03 06:51:46] [INFO ] [Real]Absence check using 20 positive place invariants in 20 ms returned sat
[2020-06-03 06:51:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:51:47] [INFO ] [Real]Absence check using state equation in 612 ms returned sat
[2020-06-03 06:51:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:51:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 17 ms returned sat
[2020-06-03 06:51:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:51:47] [INFO ] [Nat]Absence check using state equation in 619 ms returned sat
[2020-06-03 06:51:47] [INFO ] [Nat]Added 366 Read/Feed constraints in 49 ms returned sat
[2020-06-03 06:51:48] [INFO ] Deduced a trap composed of 34 places in 241 ms
[2020-06-03 06:51:48] [INFO ] Deduced a trap composed of 34 places in 202 ms
[2020-06-03 06:51:48] [INFO ] Deduced a trap composed of 34 places in 244 ms
[2020-06-03 06:51:48] [INFO ] Deduced a trap composed of 34 places in 246 ms
[2020-06-03 06:51:49] [INFO ] Deduced a trap composed of 20 places in 229 ms
[2020-06-03 06:51:49] [INFO ] Deduced a trap composed of 23 places in 245 ms
[2020-06-03 06:51:49] [INFO ] Deduced a trap composed of 20 places in 222 ms
[2020-06-03 06:51:49] [INFO ] Deduced a trap composed of 18 places in 195 ms
[2020-06-03 06:51:50] [INFO ] Deduced a trap composed of 26 places in 191 ms
[2020-06-03 06:51:50] [INFO ] Deduced a trap composed of 26 places in 210 ms
[2020-06-03 06:51:50] [INFO ] Deduced a trap composed of 18 places in 190 ms
[2020-06-03 06:51:50] [INFO ] Deduced a trap composed of 26 places in 200 ms
[2020-06-03 06:51:51] [INFO ] Deduced a trap composed of 50 places in 235 ms
[2020-06-03 06:51:51] [INFO ] Deduced a trap composed of 29 places in 212 ms
[2020-06-03 06:51:51] [INFO ] Deduced a trap composed of 33 places in 237 ms
[2020-06-03 06:51:51] [INFO ] Deduced a trap composed of 29 places in 179 ms
[2020-06-03 06:51:51] [INFO ] Deduced a trap composed of 26 places in 216 ms
[2020-06-03 06:51:52] [INFO ] Deduced a trap composed of 41 places in 174 ms
[2020-06-03 06:51:52] [INFO ] Deduced a trap composed of 44 places in 206 ms
[2020-06-03 06:51:52] [INFO ] Deduced a trap composed of 20 places in 156 ms
[2020-06-03 06:51:52] [INFO ] Deduced a trap composed of 40 places in 233 ms
[2020-06-03 06:51:53] [INFO ] Deduced a trap composed of 42 places in 237 ms
[2020-06-03 06:51:53] [INFO ] Deduced a trap composed of 42 places in 222 ms
[2020-06-03 06:51:53] [INFO ] Deduced a trap composed of 45 places in 213 ms
[2020-06-03 06:51:53] [INFO ] Deduced a trap composed of 45 places in 211 ms
[2020-06-03 06:51:54] [INFO ] Deduced a trap composed of 42 places in 237 ms
[2020-06-03 06:51:54] [INFO ] Deduced a trap composed of 18 places in 217 ms
[2020-06-03 06:51:54] [INFO ] Deduced a trap composed of 42 places in 177 ms
[2020-06-03 06:51:54] [INFO ] Deduced a trap composed of 26 places in 194 ms
[2020-06-03 06:51:55] [INFO ] Deduced a trap composed of 42 places in 216 ms
[2020-06-03 06:51:55] [INFO ] Deduced a trap composed of 15 places in 199 ms
[2020-06-03 06:51:55] [INFO ] Deduced a trap composed of 13 places in 227 ms
[2020-06-03 06:51:55] [INFO ] Deduced a trap composed of 11 places in 181 ms
[2020-06-03 06:51:56] [INFO ] Deduced a trap composed of 31 places in 237 ms
[2020-06-03 06:51:56] [INFO ] Deduced a trap composed of 10 places in 192 ms
[2020-06-03 06:51:56] [INFO ] Deduced a trap composed of 10 places in 183 ms
[2020-06-03 06:51:56] [INFO ] Deduced a trap composed of 13 places in 190 ms
[2020-06-03 06:51:56] [INFO ] Deduced a trap composed of 40 places in 174 ms
[2020-06-03 06:51:57] [INFO ] Deduced a trap composed of 19 places in 182 ms
[2020-06-03 06:51:57] [INFO ] Deduced a trap composed of 31 places in 199 ms
[2020-06-03 06:51:57] [INFO ] Deduced a trap composed of 18 places in 192 ms
[2020-06-03 06:51:57] [INFO ] Deduced a trap composed of 18 places in 188 ms
[2020-06-03 06:51:58] [INFO ] Deduced a trap composed of 50 places in 154 ms
[2020-06-03 06:51:58] [INFO ] Deduced a trap composed of 15 places in 121 ms
[2020-06-03 06:51:58] [INFO ] Deduced a trap composed of 24 places in 201 ms
[2020-06-03 06:51:58] [INFO ] Deduced a trap composed of 18 places in 183 ms
[2020-06-03 06:51:58] [INFO ] Deduced a trap composed of 39 places in 174 ms
[2020-06-03 06:51:59] [INFO ] Deduced a trap composed of 50 places in 141 ms
[2020-06-03 06:51:59] [INFO ] Deduced a trap composed of 22 places in 173 ms
[2020-06-03 06:51:59] [INFO ] Deduced a trap composed of 23 places in 291 ms
[2020-06-03 06:51:59] [INFO ] Deduced a trap composed of 10 places in 223 ms
[2020-06-03 06:52:00] [INFO ] Deduced a trap composed of 20 places in 195 ms
[2020-06-03 06:52:00] [INFO ] Deduced a trap composed of 40 places in 161 ms
[2020-06-03 06:52:00] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 12610 ms
[2020-06-03 06:52:00] [INFO ] Computed and/alt/rep : 1113/8176/903 causal constraints in 61 ms.
[2020-06-03 06:52:20] [INFO ] Added : 860 causal constraints over 172 iterations in 20125 ms.(timeout) Result :sat
[2020-06-03 06:52:20] [INFO ] Deduced a trap composed of 11 places in 175 ms
[2020-06-03 06:52:21] [INFO ] Deduced a trap composed of 10 places in 178 ms
[2020-06-03 06:52:21] [INFO ] Deduced a trap composed of 50 places in 162 ms
[2020-06-03 06:52:21] [INFO ] Deduced a trap composed of 56 places in 92 ms
[2020-06-03 06:52:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1290 ms
Attempting to minimize the solution found.
Minimization took 117 ms.
Incomplete Parikh walk after 189100 steps, including 1000 resets, run finished after 394 ms. (steps per millisecond=479 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 173200 steps, including 1000 resets, run finished after 365 ms. (steps per millisecond=474 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 139200 steps, including 1000 resets, run finished after 297 ms. (steps per millisecond=468 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 10 out of 413 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 413/413 places, 1120/1120 transitions.
Applied a total of 0 rules in 15 ms. Remains 413 /413 variables (removed 0) and now considering 1120/1120 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 1120/1120 transitions.
Starting structural reductions, iteration 0 : 413/413 places, 1120/1120 transitions.
Applied a total of 0 rules in 13 ms. Remains 413 /413 variables (removed 0) and now considering 1120/1120 (removed 0) transitions.
[2020-06-03 06:52:23] [INFO ] Flow matrix only has 910 transitions (discarded 210 similar events)
// Phase 1: matrix 910 rows 413 cols
[2020-06-03 06:52:23] [INFO ] Computed 20 place invariants in 3 ms
[2020-06-03 06:52:23] [INFO ] Implicit Places using invariants in 575 ms returned []
[2020-06-03 06:52:23] [INFO ] Flow matrix only has 910 transitions (discarded 210 similar events)
// Phase 1: matrix 910 rows 413 cols
[2020-06-03 06:52:23] [INFO ] Computed 20 place invariants in 5 ms
[2020-06-03 06:52:24] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 06:52:28] [INFO ] Implicit Places using invariants and state equation in 4867 ms returned []
Implicit Place search using SMT with State Equation took 5444 ms to find 0 implicit places.
[2020-06-03 06:52:28] [INFO ] Redundant transitions in 21 ms returned []
[2020-06-03 06:52:28] [INFO ] Flow matrix only has 910 transitions (discarded 210 similar events)
// Phase 1: matrix 910 rows 413 cols
[2020-06-03 06:52:28] [INFO ] Computed 20 place invariants in 5 ms
[2020-06-03 06:52:30] [INFO ] Dead Transitions using invariants and state equation in 1469 ms returned []
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 1120/1120 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 251 ms. (steps per millisecond=398 ) properties seen :[0, 0, 0]
[2020-06-03 06:52:30] [INFO ] Flow matrix only has 910 transitions (discarded 210 similar events)
// Phase 1: matrix 910 rows 413 cols
[2020-06-03 06:52:30] [INFO ] Computed 20 place invariants in 2 ms
[2020-06-03 06:52:30] [INFO ] [Real]Absence check using 20 positive place invariants in 23 ms returned sat
[2020-06-03 06:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:52:31] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
[2020-06-03 06:52:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:52:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 18 ms returned sat
[2020-06-03 06:52:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:52:31] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2020-06-03 06:52:31] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 06:52:31] [INFO ] [Nat]Added 366 Read/Feed constraints in 52 ms returned sat
[2020-06-03 06:52:32] [INFO ] Deduced a trap composed of 13 places in 224 ms
[2020-06-03 06:52:32] [INFO ] Deduced a trap composed of 31 places in 238 ms
[2020-06-03 06:52:32] [INFO ] Deduced a trap composed of 26 places in 195 ms
[2020-06-03 06:52:32] [INFO ] Deduced a trap composed of 18 places in 169 ms
[2020-06-03 06:52:32] [INFO ] Deduced a trap composed of 18 places in 164 ms
[2020-06-03 06:52:33] [INFO ] Deduced a trap composed of 26 places in 172 ms
[2020-06-03 06:52:33] [INFO ] Deduced a trap composed of 23 places in 157 ms
[2020-06-03 06:52:33] [INFO ] Deduced a trap composed of 45 places in 164 ms
[2020-06-03 06:52:33] [INFO ] Deduced a trap composed of 23 places in 210 ms
[2020-06-03 06:52:33] [INFO ] Deduced a trap composed of 23 places in 208 ms
[2020-06-03 06:52:34] [INFO ] Deduced a trap composed of 18 places in 205 ms
[2020-06-03 06:52:34] [INFO ] Deduced a trap composed of 14 places in 200 ms
[2020-06-03 06:52:34] [INFO ] Deduced a trap composed of 50 places in 192 ms
[2020-06-03 06:52:34] [INFO ] Deduced a trap composed of 50 places in 208 ms
[2020-06-03 06:52:35] [INFO ] Deduced a trap composed of 10 places in 199 ms
[2020-06-03 06:52:35] [INFO ] Deduced a trap composed of 11 places in 190 ms
[2020-06-03 06:52:35] [INFO ] Deduced a trap composed of 10 places in 224 ms
[2020-06-03 06:52:35] [INFO ] Deduced a trap composed of 10 places in 185 ms
[2020-06-03 06:52:36] [INFO ] Deduced a trap composed of 52 places in 178 ms
[2020-06-03 06:52:36] [INFO ] Deduced a trap composed of 41 places in 165 ms
[2020-06-03 06:52:36] [INFO ] Deduced a trap composed of 26 places in 147 ms
[2020-06-03 06:52:36] [INFO ] Deduced a trap composed of 26 places in 142 ms
[2020-06-03 06:52:36] [INFO ] Deduced a trap composed of 26 places in 173 ms
[2020-06-03 06:52:36] [INFO ] Deduced a trap composed of 13 places in 175 ms
[2020-06-03 06:52:37] [INFO ] Deduced a trap composed of 34 places in 119 ms
[2020-06-03 06:52:37] [INFO ] Deduced a trap composed of 38 places in 109 ms
[2020-06-03 06:52:37] [INFO ] Deduced a trap composed of 34 places in 142 ms
[2020-06-03 06:52:37] [INFO ] Deduced a trap composed of 58 places in 97 ms
[2020-06-03 06:52:37] [INFO ] Deduced a trap composed of 34 places in 132 ms
[2020-06-03 06:52:37] [INFO ] Deduced a trap composed of 39 places in 112 ms
[2020-06-03 06:52:38] [INFO ] Deduced a trap composed of 26 places in 106 ms
[2020-06-03 06:52:38] [INFO ] Deduced a trap composed of 30 places in 224 ms
[2020-06-03 06:52:38] [INFO ] Deduced a trap composed of 19 places in 204 ms
[2020-06-03 06:52:38] [INFO ] Deduced a trap composed of 29 places in 199 ms
[2020-06-03 06:52:39] [INFO ] Deduced a trap composed of 11 places in 152 ms
[2020-06-03 06:52:39] [INFO ] Deduced a trap composed of 20 places in 182 ms
[2020-06-03 06:52:39] [INFO ] Deduced a trap composed of 19 places in 193 ms
[2020-06-03 06:52:39] [INFO ] Deduced a trap composed of 20 places in 143 ms
[2020-06-03 06:52:39] [INFO ] Deduced a trap composed of 12 places in 152 ms
[2020-06-03 06:52:40] [INFO ] Deduced a trap composed of 11 places in 216 ms
[2020-06-03 06:52:40] [INFO ] Deduced a trap composed of 35 places in 220 ms
[2020-06-03 06:52:40] [INFO ] Deduced a trap composed of 10 places in 251 ms
[2020-06-03 06:52:40] [INFO ] Deduced a trap composed of 29 places in 190 ms
[2020-06-03 06:52:41] [INFO ] Deduced a trap composed of 34 places in 174 ms
[2020-06-03 06:52:41] [INFO ] Deduced a trap composed of 42 places in 208 ms
[2020-06-03 06:52:41] [INFO ] Deduced a trap composed of 42 places in 245 ms
[2020-06-03 06:52:41] [INFO ] Deduced a trap composed of 18 places in 211 ms
[2020-06-03 06:52:42] [INFO ] Deduced a trap composed of 37 places in 214 ms
[2020-06-03 06:52:42] [INFO ] Deduced a trap composed of 47 places in 204 ms
[2020-06-03 06:52:42] [INFO ] Deduced a trap composed of 39 places in 188 ms
[2020-06-03 06:52:42] [INFO ] Deduced a trap composed of 23 places in 197 ms
[2020-06-03 06:52:43] [INFO ] Deduced a trap composed of 18 places in 186 ms
[2020-06-03 06:52:43] [INFO ] Deduced a trap composed of 64 places in 113 ms
[2020-06-03 06:52:43] [INFO ] Deduced a trap composed of 50 places in 136 ms
[2020-06-03 06:52:43] [INFO ] Deduced a trap composed of 50 places in 115 ms
[2020-06-03 06:52:43] [INFO ] Deduced a trap composed of 50 places in 138 ms
[2020-06-03 06:52:43] [INFO ] Deduced a trap composed of 50 places in 150 ms
[2020-06-03 06:52:44] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 12254 ms
[2020-06-03 06:52:44] [INFO ] Computed and/alt/rep : 1113/8176/903 causal constraints in 54 ms.
[2020-06-03 06:52:51] [INFO ] Added : 350 causal constraints over 70 iterations in 7044 ms. Result :(error "Failed to check-sat")
[2020-06-03 06:52:51] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2020-06-03 06:52:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:52:51] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2020-06-03 06:52:51] [INFO ] [Real]Added 366 Read/Feed constraints in 56 ms returned sat
[2020-06-03 06:52:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:52:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 17 ms returned sat
[2020-06-03 06:52:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:52:52] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2020-06-03 06:52:52] [INFO ] [Nat]Added 366 Read/Feed constraints in 50 ms returned sat
[2020-06-03 06:52:52] [INFO ] Deduced a trap composed of 11 places in 256 ms
[2020-06-03 06:52:53] [INFO ] Deduced a trap composed of 11 places in 220 ms
[2020-06-03 06:52:53] [INFO ] Deduced a trap composed of 11 places in 246 ms
[2020-06-03 06:52:53] [INFO ] Deduced a trap composed of 11 places in 278 ms
[2020-06-03 06:52:53] [INFO ] Deduced a trap composed of 54 places in 224 ms
[2020-06-03 06:52:54] [INFO ] Deduced a trap composed of 29 places in 203 ms
[2020-06-03 06:52:54] [INFO ] Deduced a trap composed of 61 places in 243 ms
[2020-06-03 06:52:54] [INFO ] Deduced a trap composed of 23 places in 267 ms
[2020-06-03 06:52:54] [INFO ] Deduced a trap composed of 23 places in 224 ms
[2020-06-03 06:52:55] [INFO ] Deduced a trap composed of 23 places in 214 ms
[2020-06-03 06:52:55] [INFO ] Deduced a trap composed of 31 places in 247 ms
[2020-06-03 06:52:55] [INFO ] Deduced a trap composed of 31 places in 241 ms
[2020-06-03 06:52:55] [INFO ] Deduced a trap composed of 47 places in 208 ms
[2020-06-03 06:52:56] [INFO ] Deduced a trap composed of 15 places in 271 ms
[2020-06-03 06:52:56] [INFO ] Deduced a trap composed of 11 places in 246 ms
[2020-06-03 06:52:56] [INFO ] Deduced a trap composed of 27 places in 252 ms
[2020-06-03 06:52:57] [INFO ] Deduced a trap composed of 19 places in 202 ms
[2020-06-03 06:52:57] [INFO ] Deduced a trap composed of 53 places in 179 ms
[2020-06-03 06:52:57] [INFO ] Deduced a trap composed of 20 places in 183 ms
[2020-06-03 06:52:57] [INFO ] Deduced a trap composed of 18 places in 186 ms
[2020-06-03 06:52:57] [INFO ] Deduced a trap composed of 10 places in 189 ms
[2020-06-03 06:52:58] [INFO ] Deduced a trap composed of 57 places in 142 ms
[2020-06-03 06:52:58] [INFO ] Deduced a trap composed of 37 places in 102 ms
[2020-06-03 06:52:58] [INFO ] Deduced a trap composed of 30 places in 161 ms
[2020-06-03 06:52:58] [INFO ] Deduced a trap composed of 28 places in 148 ms
[2020-06-03 06:52:58] [INFO ] Deduced a trap composed of 29 places in 145 ms
[2020-06-03 06:52:58] [INFO ] Deduced a trap composed of 36 places in 171 ms
[2020-06-03 06:52:59] [INFO ] Deduced a trap composed of 31 places in 134 ms
[2020-06-03 06:52:59] [INFO ] Deduced a trap composed of 37 places in 111 ms
[2020-06-03 06:52:59] [INFO ] Deduced a trap composed of 39 places in 120 ms
[2020-06-03 06:52:59] [INFO ] Deduced a trap composed of 74 places in 106 ms
[2020-06-03 06:52:59] [INFO ] Deduced a trap composed of 45 places in 130 ms
[2020-06-03 06:52:59] [INFO ] Deduced a trap composed of 57 places in 107 ms
[2020-06-03 06:53:00] [INFO ] Deduced a trap composed of 44 places in 127 ms
[2020-06-03 06:53:00] [INFO ] Deduced a trap composed of 45 places in 116 ms
[2020-06-03 06:53:00] [INFO ] Deduced a trap composed of 45 places in 112 ms
[2020-06-03 06:53:00] [INFO ] Deduced a trap composed of 37 places in 128 ms
[2020-06-03 06:53:00] [INFO ] Deduced a trap composed of 45 places in 135 ms
[2020-06-03 06:53:00] [INFO ] Deduced a trap composed of 22 places in 164 ms
[2020-06-03 06:53:01] [INFO ] Deduced a trap composed of 20 places in 145 ms
[2020-06-03 06:53:01] [INFO ] Deduced a trap composed of 18 places in 168 ms
[2020-06-03 06:53:01] [INFO ] Deduced a trap composed of 23 places in 197 ms
[2020-06-03 06:53:01] [INFO ] Deduced a trap composed of 57 places in 152 ms
[2020-06-03 06:53:01] [INFO ] Deduced a trap composed of 19 places in 102 ms
[2020-06-03 06:53:01] [INFO ] Deduced a trap composed of 31 places in 120 ms
[2020-06-03 06:53:02] [INFO ] Deduced a trap composed of 39 places in 101 ms
[2020-06-03 06:53:02] [INFO ] Deduced a trap composed of 19 places in 112 ms
[2020-06-03 06:53:02] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 9841 ms
[2020-06-03 06:53:02] [INFO ] Computed and/alt/rep : 1113/8176/903 causal constraints in 44 ms.
[2020-06-03 06:53:11] [INFO ] Added : 535 causal constraints over 107 iterations in 9485 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 06:53:11] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2020-06-03 06:53:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:53:12] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2020-06-03 06:53:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:53:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2020-06-03 06:53:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:53:13] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2020-06-03 06:53:13] [INFO ] [Nat]Added 366 Read/Feed constraints in 45 ms returned sat
[2020-06-03 06:53:13] [INFO ] Deduced a trap composed of 34 places in 221 ms
[2020-06-03 06:53:13] [INFO ] Deduced a trap composed of 34 places in 209 ms
[2020-06-03 06:53:13] [INFO ] Deduced a trap composed of 34 places in 234 ms
[2020-06-03 06:53:14] [INFO ] Deduced a trap composed of 34 places in 197 ms
[2020-06-03 06:53:14] [INFO ] Deduced a trap composed of 20 places in 211 ms
[2020-06-03 06:53:14] [INFO ] Deduced a trap composed of 23 places in 213 ms
[2020-06-03 06:53:14] [INFO ] Deduced a trap composed of 20 places in 194 ms
[2020-06-03 06:53:15] [INFO ] Deduced a trap composed of 18 places in 198 ms
[2020-06-03 06:53:15] [INFO ] Deduced a trap composed of 26 places in 201 ms
[2020-06-03 06:53:15] [INFO ] Deduced a trap composed of 26 places in 188 ms
[2020-06-03 06:53:15] [INFO ] Deduced a trap composed of 18 places in 188 ms
[2020-06-03 06:53:16] [INFO ] Deduced a trap composed of 26 places in 185 ms
[2020-06-03 06:53:16] [INFO ] Deduced a trap composed of 50 places in 196 ms
[2020-06-03 06:53:16] [INFO ] Deduced a trap composed of 29 places in 179 ms
[2020-06-03 06:53:16] [INFO ] Deduced a trap composed of 33 places in 153 ms
[2020-06-03 06:53:16] [INFO ] Deduced a trap composed of 29 places in 156 ms
[2020-06-03 06:53:17] [INFO ] Deduced a trap composed of 26 places in 212 ms
[2020-06-03 06:53:17] [INFO ] Deduced a trap composed of 41 places in 149 ms
[2020-06-03 06:53:17] [INFO ] Deduced a trap composed of 44 places in 175 ms
[2020-06-03 06:53:17] [INFO ] Deduced a trap composed of 20 places in 162 ms
[2020-06-03 06:53:17] [INFO ] Deduced a trap composed of 40 places in 233 ms
[2020-06-03 06:53:18] [INFO ] Deduced a trap composed of 42 places in 247 ms
[2020-06-03 06:53:18] [INFO ] Deduced a trap composed of 42 places in 240 ms
[2020-06-03 06:53:18] [INFO ] Deduced a trap composed of 45 places in 188 ms
[2020-06-03 06:53:18] [INFO ] Deduced a trap composed of 45 places in 213 ms
[2020-06-03 06:53:19] [INFO ] Deduced a trap composed of 42 places in 222 ms
[2020-06-03 06:53:19] [INFO ] Deduced a trap composed of 18 places in 172 ms
[2020-06-03 06:53:19] [INFO ] Deduced a trap composed of 42 places in 192 ms
[2020-06-03 06:53:19] [INFO ] Deduced a trap composed of 26 places in 185 ms
[2020-06-03 06:53:20] [INFO ] Deduced a trap composed of 42 places in 188 ms
[2020-06-03 06:53:20] [INFO ] Deduced a trap composed of 15 places in 196 ms
[2020-06-03 06:53:20] [INFO ] Deduced a trap composed of 13 places in 208 ms
[2020-06-03 06:53:20] [INFO ] Deduced a trap composed of 11 places in 192 ms
[2020-06-03 06:53:20] [INFO ] Deduced a trap composed of 31 places in 181 ms
[2020-06-03 06:53:21] [INFO ] Deduced a trap composed of 10 places in 148 ms
[2020-06-03 06:53:21] [INFO ] Deduced a trap composed of 10 places in 130 ms
[2020-06-03 06:53:21] [INFO ] Deduced a trap composed of 13 places in 131 ms
[2020-06-03 06:53:21] [INFO ] Deduced a trap composed of 40 places in 142 ms
[2020-06-03 06:53:21] [INFO ] Deduced a trap composed of 19 places in 143 ms
[2020-06-03 06:53:22] [INFO ] Deduced a trap composed of 31 places in 157 ms
[2020-06-03 06:53:22] [INFO ] Deduced a trap composed of 18 places in 174 ms
[2020-06-03 06:53:22] [INFO ] Deduced a trap composed of 18 places in 159 ms
[2020-06-03 06:53:22] [INFO ] Deduced a trap composed of 50 places in 135 ms
[2020-06-03 06:53:22] [INFO ] Deduced a trap composed of 15 places in 124 ms
[2020-06-03 06:53:23] [INFO ] Deduced a trap composed of 24 places in 199 ms
[2020-06-03 06:53:23] [INFO ] Deduced a trap composed of 18 places in 195 ms
[2020-06-03 06:53:23] [INFO ] Deduced a trap composed of 39 places in 174 ms
[2020-06-03 06:53:23] [INFO ] Deduced a trap composed of 50 places in 123 ms
[2020-06-03 06:53:23] [INFO ] Deduced a trap composed of 22 places in 171 ms
[2020-06-03 06:53:24] [INFO ] Deduced a trap composed of 23 places in 233 ms
[2020-06-03 06:53:24] [INFO ] Deduced a trap composed of 10 places in 183 ms
[2020-06-03 06:53:24] [INFO ] Deduced a trap composed of 20 places in 156 ms
[2020-06-03 06:53:24] [INFO ] Deduced a trap composed of 40 places in 115 ms
[2020-06-03 06:53:24] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 11568 ms
[2020-06-03 06:53:24] [INFO ] Computed and/alt/rep : 1113/8176/903 causal constraints in 48 ms.
[2020-06-03 06:53:32] [INFO ] Added : 465 causal constraints over 93 iterations in 7756 ms. Result :unknown
Graph (trivial) has 823 edges and 413 vertex of which 268 / 413 are part of one of the 41 SCC in 5 ms
Free SCC test removed 227 places
Drop transitions removed 454 transitions
Ensure Unique test removed 244 transitions
Reduce isomorphic transitions removed 698 transitions.
Iterating post reduction 0 with 698 rules applied. Total rules applied 699 place count 186 transition count 422
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 34 Pre rules applied. Total rules applied 699 place count 186 transition count 388
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 1 with 68 rules applied. Total rules applied 767 place count 152 transition count 388
Performed 18 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 803 place count 134 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 804 place count 134 transition count 358
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 837 place count 114 transition count 387
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 61 edges and 114 vertex of which 43 / 114 are part of one of the 6 SCC in 0 ms
Free SCC test removed 37 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 843 place count 77 transition count 382
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (trivial) has 83 edges and 75 vertex of which 10 / 75 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 3 with 47 rules applied. Total rules applied 890 place count 70 transition count 338
Drop transitions removed 10 transitions
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 4 with 65 rules applied. Total rules applied 955 place count 70 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 957 place count 69 transition count 272
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 962 place count 69 transition count 267
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 972 place count 64 transition count 262
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 978 place count 64 transition count 262
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 979 place count 64 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 980 place count 64 transition count 261
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 981 place count 64 transition count 261
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 987 place count 64 transition count 255
Applied a total of 987 rules in 55 ms. Remains 64 /413 variables (removed 349) and now considering 255/1120 (removed 865) transitions.
// Phase 1: matrix 255 rows 64 cols
[2020-06-03 06:53:32] [INFO ] Computed 11 place invariants in 1 ms
[2020-06-03 06:53:32] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 06:53:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:53:32] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2020-06-03 06:53:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:53:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-03 06:53:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:53:32] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2020-06-03 06:53:32] [INFO ] Computed and/alt/rep : 217/1354/217 causal constraints in 11 ms.
[2020-06-03 06:53:33] [INFO ] Added : 191 causal constraints over 39 iterations in 744 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2020-06-03 06:53:33] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-03 06:53:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:53:33] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2020-06-03 06:53:33] [INFO ] Computed and/alt/rep : 217/1354/217 causal constraints in 13 ms.
[2020-06-03 06:53:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:53:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-03 06:53:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:53:33] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2020-06-03 06:53:33] [INFO ] Computed and/alt/rep : 217/1354/217 causal constraints in 17 ms.
[2020-06-03 06:53:34] [INFO ] Added : 193 causal constraints over 39 iterations in 723 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2020-06-03 06:53:34] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-03 06:53:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:53:34] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2020-06-03 06:53:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:53:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-03 06:53:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:53:34] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2020-06-03 06:53:34] [INFO ] Computed and/alt/rep : 217/1354/217 causal constraints in 16 ms.
[2020-06-03 06:53:35] [INFO ] Added : 193 causal constraints over 39 iterations in 714 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-06-03 06:53:35] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2020-06-03 06:53:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 13 ms.
[2020-06-03 06:53:35] [INFO ] Flatten gal took : 190 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ Peterson-PT-6 @ 3570 seconds
FORMULA Peterson-PT-6-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 4785280 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16136404 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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-158987853600742"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;