MCC'2020 - Execution of r111-csrt-158961258100750

About the Execution of ITS-Tools for Peterson-PT-7

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15745.240	3600000.00	8807106.00	534.20	FTTTFTTTF?FFTFF?	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.r111-csrt-158961258100750.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 itstools
Input is Peterson-PT-7, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258100750
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 115K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 313K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 107K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 339K 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 136K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 403K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 81K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 272K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 134K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 354K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 98K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 322K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 45K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 93K 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 2.3M 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-7-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1590028272607

[2020-05-21 02:31: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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-21 02:31:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 02:31:14] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2020-05-21 02:31:14] [INFO ] Transformed 1992 places.
[2020-05-21 02:31:15] [INFO ] Transformed 3096 transitions.
[2020-05-21 02:31:15] [INFO ] Parsed PT model containing 1992 places and 3096 transitions in 288 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 130 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 301 ms. (steps per millisecond=33 ) properties seen :[1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA Peterson-PT-7-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA Peterson-PT-7-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=113 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 161 ms. (steps per millisecond=62 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-05-21 02:31:16] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2020-05-21 02:31:16] [INFO ] Computed 31 place invariants in 114 ms
[2020-05-21 02:31:16] [INFO ] [Real]Absence check using 23 positive place invariants in 88 ms returned sat
[2020-05-21 02:31:16] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2020-05-21 02:31:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:31:21] [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: Broken pipe (= s1224 (- t2366 (+ t637 t1242)))") while checking expression at index 0
[2020-05-21 02:31:21] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned unsat
[2020-05-21 02:31:21] [INFO ] [Real]Absence check using 23 positive place invariants in 43 ms returned unsat
[2020-05-21 02:31:21] [INFO ] [Real]Absence check using 23 positive place invariants in 70 ms returned sat
[2020-05-21 02:31:21] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2020-05-21 02:31:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:31:26] [INFO ] [Real]Absence check using state equation in 4749 ms returned (error "Solver has unexpectedly terminated")
[2020-05-21 02:31:26] [INFO ] [Real]Absence check using 23 positive place invariants in 63 ms returned sat
[2020-05-21 02:31:26] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 14 ms returned sat
[2020-05-21 02:31:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:31:31] [INFO ] [Real]Absence check using state equation in 4750 ms returned (error "Solver has unexpectedly terminated")
[2020-05-21 02:31:31] [INFO ] [Real]Absence check using 23 positive place invariants in 65 ms returned sat
[2020-05-21 02:31:31] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2020-05-21 02:31:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:31:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 02:31:36] [INFO ] [Real]Absence check using state equation in 4762 ms returned unknown
[2020-05-21 02:31:36] [INFO ] [Real]Absence check using 23 positive place invariants in 63 ms returned sat
[2020-05-21 02:31:36] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2020-05-21 02:31:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:31:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 02:31:41] [INFO ] [Real]Absence check using state equation in 4754 ms returned (error "Failed to check-sat")
[2020-05-21 02:31:41] [INFO ] [Real]Absence check using 23 positive place invariants in 66 ms returned sat
[2020-05-21 02:31:41] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2020-05-21 02:31:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:31:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 02:31:46] [INFO ] [Real]Absence check using state equation in 4734 ms returned (error "Failed to check-sat")
[2020-05-21 02:31:46] [INFO ] [Real]Absence check using 23 positive place invariants in 64 ms returned sat
[2020-05-21 02:31:46] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2020-05-21 02:31:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:31:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 02:31:51] [INFO ] [Real]Absence check using state equation in 4782 ms returned (error "Failed to check-sat")
FORMULA Peterson-PT-7-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-7-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 466 out of 1992 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 762 Post agglomeration using F-continuation condition.Transition count delta: 762
Iterating post reduction 0 with 762 rules applied. Total rules applied 762 place count 1992 transition count 2334
Reduce places removed 762 places and 0 transitions.
Iterating post reduction 1 with 762 rules applied. Total rules applied 1524 place count 1230 transition count 2334
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 1524 place count 1230 transition count 2225
Deduced a syphon composed of 109 places in 6 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 1742 place count 1121 transition count 2225
Applied a total of 1742 rules in 399 ms. Remains 1121 /1992 variables (removed 871) and now considering 2225/3096 (removed 871) transitions.
Finished structural reductions, in 1 iterations. Remains : 1121/1992 places, 2225/3096 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 8985 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 785070 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=156 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1396 ms. (steps per millisecond=716 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1291 ms. (steps per millisecond=774 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1409 ms. (steps per millisecond=709 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1398 ms. (steps per millisecond=715 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1333 ms. (steps per millisecond=750 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1454 ms. (steps per millisecond=687 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 4693248 steps, run timeout after 30001 ms. (steps per millisecond=156 ) properties seen :[1, 0, 0, 0, 0, 1, 0]
Probabilistic random walk after 4693248 steps, saw 521473 distinct states, run finished after 30002 ms. (steps per millisecond=156 ) properties seen :[1, 0, 0, 0, 0, 1, 0]
FORMULA Peterson-PT-7-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-7-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2020-05-21 02:32:44] [INFO ] Flow matrix only has 1889 transitions (discarded 336 similar events)
// Phase 1: matrix 1889 rows 1121 cols
[2020-05-21 02:32:44] [INFO ] Computed 31 place invariants in 33 ms
[2020-05-21 02:32:44] [INFO ] [Real]Absence check using 23 positive place invariants in 49 ms returned sat
[2020-05-21 02:32:44] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2020-05-21 02:32:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:32:47] [INFO ] [Real]Absence check using state equation in 3120 ms returned sat
[2020-05-21 02:32:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:32:48] [INFO ] [Nat]Absence check using 23 positive place invariants in 45 ms returned sat
[2020-05-21 02:32:48] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 02:32:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:32:51] [INFO ] [Nat]Absence check using state equation in 3186 ms returned sat
[2020-05-21 02:32:51] [INFO ] State equation strengthened by 546 read => feed constraints.
[2020-05-21 02:32:51] [INFO ] [Nat]Added 546 Read/Feed constraints in 151 ms returned sat
[2020-05-21 02:32:52] [INFO ] Deduced a trap composed of 40 places in 901 ms
[2020-05-21 02:32:53] [INFO ] Deduced a trap composed of 17 places in 994 ms
[2020-05-21 02:32:54] [INFO ] Deduced a trap composed of 11 places in 842 ms
[2020-05-21 02:32:55] [INFO ] Deduced a trap composed of 59 places in 936 ms
[2020-05-21 02:32:56] [INFO ] Deduced a trap composed of 25 places in 961 ms
[2020-05-21 02:32:57] [INFO ] Deduced a trap composed of 23 places in 990 ms
[2020-05-21 02:32:58] [INFO ] Deduced a trap composed of 25 places in 955 ms
[2020-05-21 02:32:59] [INFO ] Deduced a trap composed of 11 places in 945 ms
[2020-05-21 02:33:00] [INFO ] Deduced a trap composed of 76 places in 993 ms
[2020-05-21 02:33:01] [INFO ] Deduced a trap composed of 11 places in 965 ms
[2020-05-21 02:33:02] [INFO ] Deduced a trap composed of 11 places in 944 ms
[2020-05-21 02:33:03] [INFO ] Deduced a trap composed of 11 places in 982 ms
[2020-05-21 02:33:05] [INFO ] Deduced a trap composed of 49 places in 943 ms
[2020-05-21 02:33:05] [INFO ] Deduced a trap composed of 55 places in 784 ms
[2020-05-21 02:33:06] [INFO ] Deduced a trap composed of 37 places in 928 ms
[2020-05-21 02:33:08] [INFO ] Deduced a trap composed of 49 places in 941 ms
[2020-05-21 02:33:09] [INFO ] Deduced a trap composed of 33 places in 930 ms
[2020-05-21 02:33:10] [INFO ] Deduced a trap composed of 33 places in 951 ms
[2020-05-21 02:33:11] [INFO ] Deduced a trap composed of 49 places in 967 ms
[2020-05-21 02:33:12] [INFO ] Deduced a trap composed of 15 places in 870 ms
[2020-05-21 02:33:13] [INFO ] Deduced a trap composed of 11 places in 904 ms
[2020-05-21 02:33:14] [INFO ] Deduced a trap composed of 27 places in 786 ms
[2020-05-21 02:33:14] [INFO ] Deduced a trap composed of 23 places in 888 ms
[2020-05-21 02:33:15] [INFO ] Deduced a trap composed of 47 places in 780 ms
[2020-05-21 02:33:16] [INFO ] Deduced a trap composed of 35 places in 853 ms
[2020-05-21 02:33:17] [INFO ] Deduced a trap composed of 33 places in 886 ms
[2020-05-21 02:33:18] [INFO ] Deduced a trap composed of 23 places in 889 ms
[2020-05-21 02:33:19] [INFO ] Deduced a trap composed of 83 places in 801 ms
[2020-05-21 02:33:20] [INFO ] Deduced a trap composed of 33 places in 794 ms
[2020-05-21 02:33:21] [INFO ] Deduced a trap composed of 39 places in 788 ms
[2020-05-21 02:33:22] [INFO ] Deduced a trap composed of 79 places in 786 ms
[2020-05-21 02:33:23] [INFO ] Deduced a trap composed of 76 places in 805 ms
[2020-05-21 02:33:24] [INFO ] Deduced a trap composed of 55 places in 705 ms
[2020-05-21 02:33:25] [INFO ] Deduced a trap composed of 23 places in 826 ms
[2020-05-21 02:33:26] [INFO ] Deduced a trap composed of 55 places in 821 ms
[2020-05-21 02:33:26] [INFO ] Deduced a trap composed of 80 places in 810 ms
[2020-05-21 02:33:27] [INFO ] Deduced a trap composed of 47 places in 775 ms
[2020-05-21 02:33:28] [INFO ] Deduced a trap composed of 47 places in 735 ms
[2020-05-21 02:33:29] [INFO ] Deduced a trap composed of 163 places in 787 ms
[2020-05-21 02:33:30] [INFO ] Deduced a trap composed of 222 places in 769 ms
[2020-05-21 02:33:31] [INFO ] Deduced a trap composed of 57 places in 789 ms
[2020-05-21 02:33:32] [INFO ] Deduced a trap composed of 82 places in 697 ms
[2020-05-21 02:33:32] [INFO ] Deduced a trap composed of 80 places in 657 ms
[2020-05-21 02:33:34] [INFO ] Deduced a trap composed of 2 places in 1157 ms
[2020-05-21 02:33:34] [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 (> (+ s587 s1119) 0)") while checking expression at index 0
[2020-05-21 02:33:34] [INFO ] [Real]Absence check using 23 positive place invariants in 37 ms returned sat
[2020-05-21 02:33:34] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2020-05-21 02:33:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:33:37] [INFO ] [Real]Absence check using state equation in 3086 ms returned sat
[2020-05-21 02:33:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:33:37] [INFO ] [Nat]Absence check using 23 positive place invariants in 40 ms returned sat
[2020-05-21 02:33:37] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2020-05-21 02:33:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:33:40] [INFO ] [Nat]Absence check using state equation in 2943 ms returned sat
[2020-05-21 02:33:40] [INFO ] [Nat]Added 546 Read/Feed constraints in 117 ms returned sat
[2020-05-21 02:33:41] [INFO ] Deduced a trap composed of 35 places in 1035 ms
[2020-05-21 02:33:42] [INFO ] Deduced a trap composed of 21 places in 978 ms
[2020-05-21 02:33:43] [INFO ] Deduced a trap composed of 29 places in 989 ms
[2020-05-21 02:33:44] [INFO ] Deduced a trap composed of 11 places in 978 ms
[2020-05-21 02:33:45] [INFO ] Deduced a trap composed of 11 places in 1024 ms
[2020-05-21 02:33:47] [INFO ] Deduced a trap composed of 15 places in 1012 ms
[2020-05-21 02:33:48] [INFO ] Deduced a trap composed of 11 places in 911 ms
[2020-05-21 02:33:49] [INFO ] Deduced a trap composed of 17 places in 916 ms
[2020-05-21 02:33:50] [INFO ] Deduced a trap composed of 29 places in 928 ms
[2020-05-21 02:33:51] [INFO ] Deduced a trap composed of 31 places in 912 ms
[2020-05-21 02:33:52] [INFO ] Deduced a trap composed of 31 places in 874 ms
[2020-05-21 02:33:53] [INFO ] Deduced a trap composed of 29 places in 875 ms
[2020-05-21 02:33:54] [INFO ] Deduced a trap composed of 29 places in 896 ms
[2020-05-21 02:33:54] [INFO ] Deduced a trap composed of 31 places in 874 ms
[2020-05-21 02:33:55] [INFO ] Deduced a trap composed of 65 places in 936 ms
[2020-05-21 02:33:56] [INFO ] Deduced a trap composed of 66 places in 906 ms
[2020-05-21 02:33:57] [INFO ] Deduced a trap composed of 49 places in 935 ms
[2020-05-21 02:33:59] [INFO ] Deduced a trap composed of 31 places in 981 ms
[2020-05-21 02:34:00] [INFO ] Deduced a trap composed of 64 places in 927 ms
[2020-05-21 02:34:00] [INFO ] Deduced a trap composed of 29 places in 792 ms
[2020-05-21 02:34:01] [INFO ] Deduced a trap composed of 29 places in 872 ms
[2020-05-21 02:34:02] [INFO ] Deduced a trap composed of 29 places in 927 ms
[2020-05-21 02:34:03] [INFO ] Deduced a trap composed of 43 places in 935 ms
[2020-05-21 02:34:05] [INFO ] Deduced a trap composed of 215 places in 951 ms
[2020-05-21 02:34:06] [INFO ] Deduced a trap composed of 53 places in 937 ms
[2020-05-21 02:34:07] [INFO ] Deduced a trap composed of 31 places in 916 ms
[2020-05-21 02:34:08] [INFO ] Deduced a trap composed of 21 places in 960 ms
[2020-05-21 02:34:09] [INFO ] Deduced a trap composed of 95 places in 924 ms
[2020-05-21 02:34:10] [INFO ] Deduced a trap composed of 47 places in 899 ms
[2020-05-21 02:34:11] [INFO ] Deduced a trap composed of 61 places in 957 ms
[2020-05-21 02:34:12] [INFO ] Deduced a trap composed of 29 places in 872 ms
[2020-05-21 02:34:13] [INFO ] Deduced a trap composed of 31 places in 901 ms
[2020-05-21 02:34:13] [INFO ] Deduced a trap composed of 11 places in 792 ms
[2020-05-21 02:34:14] [INFO ] Deduced a trap composed of 15 places in 889 ms
[2020-05-21 02:34:15] [INFO ] Deduced a trap composed of 11 places in 905 ms
[2020-05-21 02:34:16] [INFO ] Deduced a trap composed of 37 places in 853 ms
[2020-05-21 02:34:17] [INFO ] Deduced a trap composed of 117 places in 645 ms
[2020-05-21 02:34:18] [INFO ] Deduced a trap composed of 90 places in 663 ms
[2020-05-21 02:34:19] [INFO ] Deduced a trap composed of 97 places in 661 ms
[2020-05-21 02:34:19] [INFO ] Deduced a trap composed of 99 places in 661 ms
[2020-05-21 02:34:20] [INFO ] Deduced a trap composed of 99 places in 606 ms
[2020-05-21 02:34:21] [INFO ] Deduced a trap composed of 100 places in 683 ms
[2020-05-21 02:34:22] [INFO ] Deduced a trap composed of 99 places in 609 ms
[2020-05-21 02:34:22] [INFO ] Deduced a trap composed of 99 places in 612 ms
[2020-05-21 02:34:22] [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 s16 s24 s29 s36 s67 s75 s84 s85 s92 s122 s128 s136 s151 s154 s173 s181 s189 s196 s204 s226 s241 s249 s269 s276 s288 s296 s297 s303 s311 s330 s349 s356 s371 s379 s381 s389 s432 s440 s449 s457 s466 s508 s535 s543 s552 s553 s560 s562 s581 s597 s606 s630 s635 s644 s647 s654 s658 s667 s673 s682 s687 s706 s713 s724 s729 s737 s747 s752 s770 s777 s806 s813 s817 s826 s831 s854 s879 s889 s896 s903 s911 s934 s935 s944 s984 s1015 s1035 s1046 s1054 s1063 s1080 s1086 s1091 s1092 s1095 s1096 s1102 s1112) 0)") while checking expression at index 1
[2020-05-21 02:34:22] [INFO ] [Real]Absence check using 23 positive place invariants in 47 ms returned sat
[2020-05-21 02:34:22] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 9 ms returned sat
[2020-05-21 02:34:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:34:26] [INFO ] [Real]Absence check using state equation in 3089 ms returned sat
[2020-05-21 02:34:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:34:26] [INFO ] [Nat]Absence check using 23 positive place invariants in 39 ms returned sat
[2020-05-21 02:34:26] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 02:34:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:34:29] [INFO ] [Nat]Absence check using state equation in 3069 ms returned sat
[2020-05-21 02:34:29] [INFO ] [Nat]Added 546 Read/Feed constraints in 118 ms returned sat
[2020-05-21 02:34:30] [INFO ] Deduced a trap composed of 27 places in 1121 ms
[2020-05-21 02:34:31] [INFO ] Deduced a trap composed of 11 places in 1033 ms
[2020-05-21 02:34:32] [INFO ] Deduced a trap composed of 11 places in 1007 ms
[2020-05-21 02:34:33] [INFO ] Deduced a trap composed of 13 places in 929 ms
[2020-05-21 02:34:34] [INFO ] Deduced a trap composed of 77 places in 912 ms
[2020-05-21 02:34:35] [INFO ] Deduced a trap composed of 39 places in 958 ms
[2020-05-21 02:34:36] [INFO ] Deduced a trap composed of 15 places in 925 ms
[2020-05-21 02:34:37] [INFO ] Deduced a trap composed of 11 places in 980 ms
[2020-05-21 02:34:38] [INFO ] Deduced a trap composed of 37 places in 927 ms
[2020-05-21 02:34:40] [INFO ] Deduced a trap composed of 37 places in 987 ms
[2020-05-21 02:34:41] [INFO ] Deduced a trap composed of 19 places in 995 ms
[2020-05-21 02:34:42] [INFO ] Deduced a trap composed of 62 places in 927 ms
[2020-05-21 02:34:43] [INFO ] Deduced a trap composed of 60 places in 943 ms
[2020-05-21 02:34:44] [INFO ] Deduced a trap composed of 62 places in 936 ms
[2020-05-21 02:34:45] [INFO ] Deduced a trap composed of 64 places in 952 ms
[2020-05-21 02:34:46] [INFO ] Deduced a trap composed of 80 places in 942 ms
[2020-05-21 02:34:47] [INFO ] Deduced a trap composed of 55 places in 790 ms
[2020-05-21 02:34:48] [INFO ] Deduced a trap composed of 43 places in 827 ms
[2020-05-21 02:34:49] [INFO ] Deduced a trap composed of 88 places in 880 ms
[2020-05-21 02:34:49] [INFO ] Deduced a trap composed of 174 places in 802 ms
[2020-05-21 02:34:50] [INFO ] Deduced a trap composed of 133 places in 787 ms
[2020-05-21 02:34:51] [INFO ] Deduced a trap composed of 107 places in 787 ms
[2020-05-21 02:34:52] [INFO ] Deduced a trap composed of 114 places in 778 ms
[2020-05-21 02:34:53] [INFO ] Deduced a trap composed of 135 places in 801 ms
[2020-05-21 02:34:54] [INFO ] Deduced a trap composed of 102 places in 789 ms
[2020-05-21 02:34:55] [INFO ] Deduced a trap composed of 114 places in 764 ms
[2020-05-21 02:34:56] [INFO ] Deduced a trap composed of 69 places in 741 ms
[2020-05-21 02:34:56] [INFO ] Deduced a trap composed of 114 places in 713 ms
[2020-05-21 02:34:57] [INFO ] Deduced a trap composed of 175 places in 764 ms
[2020-05-21 02:34:58] [INFO ] Deduced a trap composed of 122 places in 752 ms
[2020-05-21 02:34:59] [INFO ] Deduced a trap composed of 101 places in 724 ms
[2020-05-21 02:35:00] [INFO ] Deduced a trap composed of 49 places in 774 ms
[2020-05-21 02:35:01] [INFO ] Deduced a trap composed of 29 places in 912 ms
[2020-05-21 02:35:02] [INFO ] Deduced a trap composed of 79 places in 936 ms
[2020-05-21 02:35:03] [INFO ] Deduced a trap composed of 79 places in 968 ms
[2020-05-21 02:35:04] [INFO ] Deduced a trap composed of 102 places in 923 ms
[2020-05-21 02:35:05] [INFO ] Deduced a trap composed of 29 places in 950 ms
[2020-05-21 02:35:06] [INFO ] Deduced a trap composed of 47 places in 916 ms
[2020-05-21 02:35:07] [INFO ] Deduced a trap composed of 65 places in 826 ms
[2020-05-21 02:35:08] [INFO ] Deduced a trap composed of 61 places in 884 ms
[2020-05-21 02:35:09] [INFO ] Deduced a trap composed of 55 places in 904 ms
[2020-05-21 02:35:10] [INFO ] Deduced a trap composed of 135 places in 882 ms
[2020-05-21 02:35:11] [INFO ] Deduced a trap composed of 133 places in 876 ms
[2020-05-21 02:35:11] [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 s14 s22 s31 s39 s48 s50 s65 s73 s82 s90 s99 s101 s107 s124 s126 s134 s141 s149 s168 s170 s175 s183 s194 s202 s207 s209 s217 s228 s243 s251 s256 s258 s271 s279 s286 s294 s301 s309 s332 s339 s347 s354 s362 s369 s377 s383 s391 s408 s413 s421 s430 s438 s451 s459 s468 s489 s498 s506 s515 s517 s523 s533 s541 s550 s558 s567 s583 s584 s594 s603 s613 s618 s632 s637 s642 s649 s656 s663 s665 s672 s678 s685 s691 s698 s708 s709 s715 s763 s769 s780 s789 s804 s811 s819 s828 s829 s837 s847 s856 s869 s878 s886 s894 s901 s909 s915 s922 s930 s943 s950 s957 s967 s976 s986 s991 s993 s1000 s1019 s1023 s1024 s1025 s1027 s1028 s1029 s1037 s1048 s1056 s1070 s1071 s1077 s1103 s1110) 0)") while checking expression at index 2
[2020-05-21 02:35:11] [INFO ] [Real]Absence check using 23 positive place invariants in 34 ms returned sat
[2020-05-21 02:35:11] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2020-05-21 02:35:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:35:14] [INFO ] [Real]Absence check using state equation in 2964 ms returned sat
[2020-05-21 02:35:14] [INFO ] [Real]Added 546 Read/Feed constraints in 109 ms returned sat
[2020-05-21 02:35:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:35:14] [INFO ] [Nat]Absence check using 23 positive place invariants in 50 ms returned sat
[2020-05-21 02:35:14] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2020-05-21 02:35:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:35:17] [INFO ] [Nat]Absence check using state equation in 2935 ms returned sat
[2020-05-21 02:35:17] [INFO ] [Nat]Added 546 Read/Feed constraints in 127 ms returned sat
[2020-05-21 02:35:18] [INFO ] Deduced a trap composed of 57 places in 853 ms
[2020-05-21 02:35:19] [INFO ] Deduced a trap composed of 27 places in 918 ms
[2020-05-21 02:35:20] [INFO ] Deduced a trap composed of 80 places in 930 ms
[2020-05-21 02:35:21] [INFO ] Deduced a trap composed of 59 places in 897 ms
[2020-05-21 02:35:22] [INFO ] Deduced a trap composed of 59 places in 933 ms
[2020-05-21 02:35:23] [INFO ] Deduced a trap composed of 29 places in 996 ms
[2020-05-21 02:35:24] [INFO ] Deduced a trap composed of 27 places in 991 ms
[2020-05-21 02:35:25] [INFO ] Deduced a trap composed of 27 places in 911 ms
[2020-05-21 02:35:26] [INFO ] Deduced a trap composed of 51 places in 969 ms
[2020-05-21 02:35:27] [INFO ] Deduced a trap composed of 41 places in 931 ms
[2020-05-21 02:35:29] [INFO ] Deduced a trap composed of 35 places in 946 ms
[2020-05-21 02:35:30] [INFO ] Deduced a trap composed of 11 places in 974 ms
[2020-05-21 02:35:31] [INFO ] Deduced a trap composed of 41 places in 1068 ms
[2020-05-21 02:35:32] [INFO ] Deduced a trap composed of 11 places in 997 ms
[2020-05-21 02:35:33] [INFO ] Deduced a trap composed of 17 places in 986 ms
[2020-05-21 02:35:34] [INFO ] Deduced a trap composed of 19 places in 972 ms
[2020-05-21 02:35:35] [INFO ] Deduced a trap composed of 11 places in 964 ms
[2020-05-21 02:35:36] [INFO ] Deduced a trap composed of 11 places in 892 ms
[2020-05-21 02:35:37] [INFO ] Deduced a trap composed of 17 places in 983 ms
[2020-05-21 02:35:38] [INFO ] Deduced a trap composed of 37 places in 1023 ms
[2020-05-21 02:35:39] [INFO ] Deduced a trap composed of 11 places in 1012 ms
[2020-05-21 02:35:40] [INFO ] Deduced a trap composed of 80 places in 927 ms
[2020-05-21 02:35:41] [INFO ] Deduced a trap composed of 65 places in 843 ms
[2020-05-21 02:35:42] [INFO ] Deduced a trap composed of 47 places in 909 ms
[2020-05-21 02:35:43] [INFO ] Deduced a trap composed of 73 places in 1023 ms
[2020-05-21 02:35:44] [INFO ] Deduced a trap composed of 29 places in 1052 ms
[2020-05-21 02:35:45] [INFO ] Deduced a trap composed of 80 places in 852 ms
[2020-05-21 02:35:46] [INFO ] Deduced a trap composed of 63 places in 898 ms
[2020-05-21 02:35:47] [INFO ] Deduced a trap composed of 57 places in 821 ms
[2020-05-21 02:35:48] [INFO ] Deduced a trap composed of 47 places in 889 ms
[2020-05-21 02:35:49] [INFO ] Deduced a trap composed of 64 places in 938 ms
[2020-05-21 02:35:50] [INFO ] Deduced a trap composed of 47 places in 907 ms
[2020-05-21 02:35:51] [INFO ] Deduced a trap composed of 47 places in 906 ms
[2020-05-21 02:35:52] [INFO ] Deduced a trap composed of 119 places in 803 ms
[2020-05-21 02:35:53] [INFO ] Deduced a trap composed of 119 places in 825 ms
[2020-05-21 02:35:54] [INFO ] Deduced a trap composed of 117 places in 769 ms
[2020-05-21 02:35:55] [INFO ] Deduced a trap composed of 117 places in 799 ms
[2020-05-21 02:35:56] [INFO ] Deduced a trap composed of 65 places in 743 ms
[2020-05-21 02:35:56] [INFO ] Deduced a trap composed of 117 places in 786 ms
[2020-05-21 02:35:57] [INFO ] Deduced a trap composed of 118 places in 777 ms
[2020-05-21 02:35:58] [INFO ] Deduced a trap composed of 39 places in 881 ms
[2020-05-21 02:35:59] [INFO ] Deduced a trap composed of 65 places in 814 ms
[2020-05-21 02:35:59] [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 s8 s15 s53 s68 s76 s113 s121 s135 s445 s453 s458 s462 s465 s470 s473 s479 s484 s505 s506 s508 s513 s531 s536 s539 s544 s548 s557 s558 s560 s576 s585 s590 s612 s627 s636 s659 s668 s696 s705 s720 s850 s853 s858 s861 s888 s893 s894 s896 s899 s907 s912 s1035 s1046 s1053 s1054 s1063 s1073 s1074 s1080 s1081 s1085 s1086 s1114 s1117) 0)") while checking expression at index 3
[2020-05-21 02:35:59] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2020-05-21 02:35:59] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 02:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:36:02] [INFO ] [Real]Absence check using state equation in 2916 ms returned sat
[2020-05-21 02:36:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:36:03] [INFO ] [Nat]Absence check using 23 positive place invariants in 42 ms returned sat
[2020-05-21 02:36:03] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2020-05-21 02:36:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:36:06] [INFO ] [Nat]Absence check using state equation in 3083 ms returned sat
[2020-05-21 02:36:06] [INFO ] [Nat]Added 546 Read/Feed constraints in 114 ms returned sat
[2020-05-21 02:36:07] [INFO ] Deduced a trap composed of 13 places in 845 ms
[2020-05-21 02:36:07] [INFO ] Deduced a trap composed of 61 places in 780 ms
[2020-05-21 02:36:08] [INFO ] Deduced a trap composed of 47 places in 836 ms
[2020-05-21 02:36:09] [INFO ] Deduced a trap composed of 61 places in 861 ms
[2020-05-21 02:36:10] [INFO ] Deduced a trap composed of 25 places in 862 ms
[2020-05-21 02:36:11] [INFO ] Deduced a trap composed of 11 places in 869 ms
[2020-05-21 02:36:12] [INFO ] Deduced a trap composed of 11 places in 890 ms
[2020-05-21 02:36:13] [INFO ] Deduced a trap composed of 17 places in 809 ms
[2020-05-21 02:36:14] [INFO ] Deduced a trap composed of 25 places in 791 ms
[2020-05-21 02:36:15] [INFO ] Deduced a trap composed of 23 places in 797 ms
[2020-05-21 02:36:16] [INFO ] Deduced a trap composed of 11 places in 826 ms
[2020-05-21 02:36:17] [INFO ] Deduced a trap composed of 25 places in 808 ms
[2020-05-21 02:36:18] [INFO ] Deduced a trap composed of 55 places in 765 ms
[2020-05-21 02:36:18] [INFO ] Deduced a trap composed of 11 places in 867 ms
[2020-05-21 02:36:19] [INFO ] Deduced a trap composed of 62 places in 857 ms
[2020-05-21 02:36:20] [INFO ] Deduced a trap composed of 15 places in 896 ms
[2020-05-21 02:36:21] [INFO ] Deduced a trap composed of 23 places in 792 ms
[2020-05-21 02:36:22] [INFO ] Deduced a trap composed of 11 places in 877 ms
[2020-05-21 02:36:23] [INFO ] Deduced a trap composed of 42 places in 733 ms
[2020-05-21 02:36:24] [INFO ] Deduced a trap composed of 55 places in 735 ms
[2020-05-21 02:36:25] [INFO ] Deduced a trap composed of 41 places in 697 ms
[2020-05-21 02:36:25] [INFO ] Deduced a trap composed of 35 places in 676 ms
[2020-05-21 02:36:26] [INFO ] Deduced a trap composed of 78 places in 829 ms
[2020-05-21 02:36:27] [INFO ] Deduced a trap composed of 33 places in 800 ms
[2020-05-21 02:36:28] [INFO ] Deduced a trap composed of 23 places in 789 ms
[2020-05-21 02:36:29] [INFO ] Deduced a trap composed of 44 places in 768 ms
[2020-05-21 02:36:30] [INFO ] Deduced a trap composed of 35 places in 767 ms
[2020-05-21 02:36:31] [INFO ] Deduced a trap composed of 52 places in 874 ms
[2020-05-21 02:36:32] [INFO ] Deduced a trap composed of 48 places in 805 ms
[2020-05-21 02:36:33] [INFO ] Deduced a trap composed of 60 places in 805 ms
[2020-05-21 02:36:34] [INFO ] Deduced a trap composed of 25 places in 913 ms
[2020-05-21 02:36:34] [INFO ] Deduced a trap composed of 47 places in 814 ms
[2020-05-21 02:36:35] [INFO ] Deduced a trap composed of 33 places in 809 ms
[2020-05-21 02:36:36] [INFO ] Deduced a trap composed of 29 places in 866 ms
[2020-05-21 02:36:37] [INFO ] Deduced a trap composed of 23 places in 813 ms
[2020-05-21 02:36:38] [INFO ] Deduced a trap composed of 95 places in 793 ms
[2020-05-21 02:36:39] [INFO ] Deduced a trap composed of 51 places in 815 ms
[2020-05-21 02:36:40] [INFO ] Deduced a trap composed of 102 places in 818 ms
[2020-05-21 02:36:41] [INFO ] Deduced a trap composed of 51 places in 782 ms
[2020-05-21 02:36:42] [INFO ] Deduced a trap composed of 195 places in 781 ms
[2020-05-21 02:36:42] [INFO ] Deduced a trap composed of 195 places in 765 ms
[2020-05-21 02:36:43] [INFO ] Deduced a trap composed of 33 places in 816 ms
[2020-05-21 02:36:44] [INFO ] Deduced a trap composed of 155 places in 684 ms
[2020-05-21 02:36:45] [INFO ] Deduced a trap composed of 45 places in 583 ms
[2020-05-21 02:36:46] [INFO ] Deduced a trap composed of 45 places in 614 ms
[2020-05-21 02:36:46] [INFO ] Deduced a trap composed of 124 places in 565 ms
[2020-05-21 02:36:47] [INFO ] Deduced a trap composed of 45 places in 652 ms
[2020-05-21 02:36:48] [INFO ] Deduced a trap composed of 45 places in 590 ms
[2020-05-21 02:36:48] [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 s8 s15 s53 s68 s76 s456 s458 s463 s465 s471 s473 s478 s484 s530 s536 s538 s544 s546 s576 s580 s585 s591 s659 s668 s696 s705 s720 s851 s853 s859 s861 s897 s906 s912 s987 s1036 s1041 s1043 s1053 s1062 s1074 s1085 s1115 s1117) 0)") while checking expression at index 4
Support contains 22 out of 1121 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1121/1121 places, 2225/2225 transitions.
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 1121 transition count 2117
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 216 place count 1013 transition count 2117
Performed 334 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 334 Pre rules applied. Total rules applied 216 place count 1013 transition count 1783
Deduced a syphon composed of 334 places in 2 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 2 with 668 rules applied. Total rules applied 884 place count 679 transition count 1783
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 992 place count 625 transition count 1729
Applied a total of 992 rules in 236 ms. Remains 625 /1121 variables (removed 496) and now considering 1729/2225 (removed 496) transitions.
Finished structural reductions, in 1 iterations. Remains : 625/1121 places, 1729/2225 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2686 ms. (steps per millisecond=372 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 688 ms. (steps per millisecond=1453 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 593 ms. (steps per millisecond=1686 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 700 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 701 ms. (steps per millisecond=1426 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 9017622 steps, run timeout after 30001 ms. (steps per millisecond=300 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 9017622 steps, saw 1001959 distinct states, run finished after 30001 ms. (steps per millisecond=300 ) properties seen :[0, 0, 0, 0, 0]
[2020-05-21 02:37:24] [INFO ] Flow matrix only has 1393 transitions (discarded 336 similar events)
// Phase 1: matrix 1393 rows 625 cols
[2020-05-21 02:37:24] [INFO ] Computed 31 place invariants in 11 ms
[2020-05-21 02:37:24] [INFO ] [Real]Absence check using 23 positive place invariants in 34 ms returned sat
[2020-05-21 02:37:24] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 02:37:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:37:25] [INFO ] [Real]Absence check using state equation in 1269 ms returned sat
[2020-05-21 02:37:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:37:25] [INFO ] [Nat]Absence check using 23 positive place invariants in 33 ms returned sat
[2020-05-21 02:37:25] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 02:37:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:37:27] [INFO ] [Nat]Absence check using state equation in 1289 ms returned sat
[2020-05-21 02:37:27] [INFO ] State equation strengthened by 546 read => feed constraints.
[2020-05-21 02:37:27] [INFO ] [Nat]Added 546 Read/Feed constraints in 80 ms returned sat
[2020-05-21 02:37:27] [INFO ] Deduced a trap composed of 26 places in 402 ms
[2020-05-21 02:37:28] [INFO ] Deduced a trap composed of 12 places in 408 ms
[2020-05-21 02:37:28] [INFO ] Deduced a trap composed of 12 places in 359 ms
[2020-05-21 02:37:29] [INFO ] Deduced a trap composed of 12 places in 328 ms
[2020-05-21 02:37:29] [INFO ] Deduced a trap composed of 22 places in 363 ms
[2020-05-21 02:37:29] [INFO ] Deduced a trap composed of 39 places in 379 ms
[2020-05-21 02:37:30] [INFO ] Deduced a trap composed of 44 places in 397 ms
[2020-05-21 02:37:30] [INFO ] Deduced a trap composed of 21 places in 400 ms
[2020-05-21 02:37:31] [INFO ] Deduced a trap composed of 21 places in 381 ms
[2020-05-21 02:37:31] [INFO ] Deduced a trap composed of 44 places in 388 ms
[2020-05-21 02:37:32] [INFO ] Deduced a trap composed of 41 places in 371 ms
[2020-05-21 02:37:32] [INFO ] Deduced a trap composed of 33 places in 384 ms
[2020-05-21 02:37:33] [INFO ] Deduced a trap composed of 21 places in 384 ms
[2020-05-21 02:37:33] [INFO ] Deduced a trap composed of 12 places in 421 ms
[2020-05-21 02:37:33] [INFO ] Deduced a trap composed of 21 places in 406 ms
[2020-05-21 02:37:34] [INFO ] Deduced a trap composed of 48 places in 365 ms
[2020-05-21 02:37:34] [INFO ] Deduced a trap composed of 11 places in 358 ms
[2020-05-21 02:37:35] [INFO ] Deduced a trap composed of 12 places in 428 ms
[2020-05-21 02:37:35] [INFO ] Deduced a trap composed of 11 places in 417 ms
[2020-05-21 02:37:36] [INFO ] Deduced a trap composed of 15 places in 408 ms
[2020-05-21 02:37:36] [INFO ] Deduced a trap composed of 69 places in 361 ms
[2020-05-21 02:37:37] [INFO ] Deduced a trap composed of 35 places in 281 ms
[2020-05-21 02:37:37] [INFO ] Deduced a trap composed of 34 places in 286 ms
[2020-05-21 02:37:37] [INFO ] Deduced a trap composed of 70 places in 302 ms
[2020-05-21 02:37:38] [INFO ] Deduced a trap composed of 34 places in 332 ms
[2020-05-21 02:37:38] [INFO ] Deduced a trap composed of 95 places in 381 ms
[2020-05-21 02:37:38] [INFO ] Deduced a trap composed of 35 places in 381 ms
[2020-05-21 02:37:39] [INFO ] Deduced a trap composed of 97 places in 355 ms
[2020-05-21 02:37:39] [INFO ] Deduced a trap composed of 30 places in 394 ms
[2020-05-21 02:37:40] [INFO ] Deduced a trap composed of 60 places in 355 ms
[2020-05-21 02:37:40] [INFO ] Deduced a trap composed of 30 places in 349 ms
[2020-05-21 02:37:41] [INFO ] Deduced a trap composed of 52 places in 300 ms
[2020-05-21 02:37:41] [INFO ] Deduced a trap composed of 42 places in 260 ms
[2020-05-21 02:37:41] [INFO ] Deduced a trap composed of 51 places in 321 ms
[2020-05-21 02:37:42] [INFO ] Deduced a trap composed of 51 places in 218 ms
[2020-05-21 02:37:42] [INFO ] Deduced a trap composed of 48 places in 284 ms
[2020-05-21 02:37:42] [INFO ] Deduced a trap composed of 57 places in 316 ms
[2020-05-21 02:37:43] [INFO ] Deduced a trap composed of 40 places in 326 ms
[2020-05-21 02:37:43] [INFO ] Deduced a trap composed of 42 places in 324 ms
[2020-05-21 02:37:43] [INFO ] Deduced a trap composed of 42 places in 311 ms
[2020-05-21 02:37:44] [INFO ] Deduced a trap composed of 42 places in 312 ms
[2020-05-21 02:37:44] [INFO ] Deduced a trap composed of 42 places in 296 ms
[2020-05-21 02:37:44] [INFO ] Deduced a trap composed of 51 places in 256 ms
[2020-05-21 02:37:45] [INFO ] Deduced a trap composed of 51 places in 258 ms
[2020-05-21 02:37:45] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 17973 ms
[2020-05-21 02:37:45] [INFO ] Computed and/alt/rep : 1721/14266/1385 causal constraints in 93 ms.
[2020-05-21 02:38:05] [INFO ] Added : 600 causal constraints over 120 iterations in 20256 ms.(timeout) Result :sat
[2020-05-21 02:38:06] [INFO ] Deduced a trap composed of 27 places in 413 ms
[2020-05-21 02:38:06] [INFO ] Deduced a trap composed of 33 places in 338 ms
[2020-05-21 02:38:07] [INFO ] Deduced a trap composed of 29 places in 384 ms
[2020-05-21 02:38:07] [INFO ] Deduced a trap composed of 33 places in 345 ms
[2020-05-21 02:38:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2487 ms
Attempting to minimize the solution found.
Minimization took 168 ms.
[2020-05-21 02:38:08] [INFO ] [Real]Absence check using 23 positive place invariants in 24 ms returned sat
[2020-05-21 02:38:08] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2020-05-21 02:38:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:38:09] [INFO ] [Real]Absence check using state equation in 1279 ms returned sat
[2020-05-21 02:38:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:38:09] [INFO ] [Nat]Absence check using 23 positive place invariants in 39 ms returned sat
[2020-05-21 02:38:09] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2020-05-21 02:38:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:38:11] [INFO ] [Nat]Absence check using state equation in 1261 ms returned sat
[2020-05-21 02:38:11] [INFO ] [Nat]Added 546 Read/Feed constraints in 102 ms returned sat
[2020-05-21 02:38:11] [INFO ] Deduced a trap composed of 47 places in 501 ms
[2020-05-21 02:38:12] [INFO ] Deduced a trap composed of 57 places in 473 ms
[2020-05-21 02:38:12] [INFO ] Deduced a trap composed of 12 places in 466 ms
[2020-05-21 02:38:13] [INFO ] Deduced a trap composed of 12 places in 512 ms
[2020-05-21 02:38:13] [INFO ] Deduced a trap composed of 12 places in 465 ms
[2020-05-21 02:38:14] [INFO ] Deduced a trap composed of 12 places in 429 ms
[2020-05-21 02:38:14] [INFO ] Deduced a trap composed of 12 places in 475 ms
[2020-05-21 02:38:15] [INFO ] Deduced a trap composed of 12 places in 472 ms
[2020-05-21 02:38:16] [INFO ] Deduced a trap composed of 12 places in 449 ms
[2020-05-21 02:38:16] [INFO ] Deduced a trap composed of 39 places in 412 ms
[2020-05-21 02:38:16] [INFO ] Deduced a trap composed of 35 places in 388 ms
[2020-05-21 02:38:17] [INFO ] Deduced a trap composed of 21 places in 381 ms
[2020-05-21 02:38:17] [INFO ] Deduced a trap composed of 25 places in 436 ms
[2020-05-21 02:38:18] [INFO ] Deduced a trap composed of 74 places in 416 ms
[2020-05-21 02:38:18] [INFO ] Deduced a trap composed of 21 places in 309 ms
[2020-05-21 02:38:19] [INFO ] Deduced a trap composed of 54 places in 339 ms
[2020-05-21 02:38:19] [INFO ] Deduced a trap composed of 37 places in 343 ms
[2020-05-21 02:38:19] [INFO ] Deduced a trap composed of 38 places in 311 ms
[2020-05-21 02:38:20] [INFO ] Deduced a trap composed of 45 places in 304 ms
[2020-05-21 02:38:20] [INFO ] Deduced a trap composed of 47 places in 319 ms
[2020-05-21 02:38:20] [INFO ] Deduced a trap composed of 29 places in 321 ms
[2020-05-21 02:38:21] [INFO ] Deduced a trap composed of 48 places in 321 ms
[2020-05-21 02:38:21] [INFO ] Deduced a trap composed of 56 places in 306 ms
[2020-05-21 02:38:22] [INFO ] Deduced a trap composed of 57 places in 338 ms
[2020-05-21 02:38:22] [INFO ] Deduced a trap composed of 57 places in 334 ms
[2020-05-21 02:38:22] [INFO ] Deduced a trap composed of 80 places in 347 ms
[2020-05-21 02:38:23] [INFO ] Deduced a trap composed of 84 places in 352 ms
[2020-05-21 02:38:23] [INFO ] Deduced a trap composed of 33 places in 376 ms
[2020-05-21 02:38:24] [INFO ] Deduced a trap composed of 41 places in 355 ms
[2020-05-21 02:38:24] [INFO ] Deduced a trap composed of 65 places in 355 ms
[2020-05-21 02:38:25] [INFO ] Deduced a trap composed of 30 places in 423 ms
[2020-05-21 02:38:25] [INFO ] Deduced a trap composed of 51 places in 466 ms
[2020-05-21 02:38:26] [INFO ] Deduced a trap composed of 45 places in 481 ms
[2020-05-21 02:38:26] [INFO ] Deduced a trap composed of 60 places in 409 ms
[2020-05-21 02:38:26] [INFO ] Deduced a trap composed of 31 places in 345 ms
[2020-05-21 02:38:27] [INFO ] Deduced a trap composed of 41 places in 387 ms
[2020-05-21 02:38:27] [INFO ] Deduced a trap composed of 25 places in 393 ms
[2020-05-21 02:38:28] [INFO ] Deduced a trap composed of 36 places in 395 ms
[2020-05-21 02:38:28] [INFO ] Deduced a trap composed of 20 places in 365 ms
[2020-05-21 02:38:29] [INFO ] Deduced a trap composed of 47 places in 331 ms
[2020-05-21 02:38:29] [INFO ] Deduced a trap composed of 49 places in 310 ms
[2020-05-21 02:38:30] [INFO ] Deduced a trap composed of 41 places in 369 ms
[2020-05-21 02:38:30] [INFO ] Deduced a trap composed of 53 places in 349 ms
[2020-05-21 02:38:30] [INFO ] Deduced a trap composed of 38 places in 364 ms
[2020-05-21 02:38:31] [INFO ] Deduced a trap composed of 100 places in 409 ms
[2020-05-21 02:38:31] [INFO ] Deduced a trap composed of 21 places in 383 ms
[2020-05-21 02:38:32] [INFO ] Deduced a trap composed of 22 places in 378 ms
[2020-05-21 02:38:32] [INFO ] Deduced a trap composed of 21 places in 375 ms
[2020-05-21 02:38:33] [INFO ] Deduced a trap composed of 33 places in 329 ms
[2020-05-21 02:38:33] [INFO ] Deduced a trap composed of 75 places in 376 ms
[2020-05-21 02:38:33] [INFO ] Deduced a trap composed of 50 places in 352 ms
[2020-05-21 02:38:34] [INFO ] Deduced a trap composed of 41 places in 315 ms
[2020-05-21 02:38:34] [INFO ] Deduced a trap composed of 33 places in 316 ms
[2020-05-21 02:38:34] [INFO ] Deduced a trap composed of 43 places in 292 ms
[2020-05-21 02:38:35] [INFO ] Deduced a trap composed of 11 places in 369 ms
[2020-05-21 02:38:35] [INFO ] Deduced a trap composed of 31 places in 335 ms
[2020-05-21 02:38:36] [INFO ] Deduced a trap composed of 43 places in 358 ms
[2020-05-21 02:38:36] [INFO ] Deduced a trap composed of 44 places in 368 ms
[2020-05-21 02:38:37] [INFO ] Deduced a trap composed of 33 places in 363 ms
[2020-05-21 02:38:37] [INFO ] Deduced a trap composed of 32 places in 332 ms
[2020-05-21 02:38:37] [INFO ] Deduced a trap composed of 75 places in 374 ms
[2020-05-21 02:38:38] [INFO ] Deduced a trap composed of 40 places in 373 ms
[2020-05-21 02:38:38] [INFO ] Deduced a trap composed of 33 places in 336 ms
[2020-05-21 02:38:39] [INFO ] Deduced a trap composed of 30 places in 355 ms
[2020-05-21 02:38:39] [INFO ] Trap strengthening (SAT) tested/added 65/64 trap constraints in 28063 ms
[2020-05-21 02:38:39] [INFO ] Computed and/alt/rep : 1721/14266/1385 causal constraints in 115 ms.
[2020-05-21 02:38:54] [INFO ] Added : 490 causal constraints over 98 iterations in 15461 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-21 02:38:54] [INFO ] [Real]Absence check using 23 positive place invariants in 31 ms returned sat
[2020-05-21 02:38:54] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 02:38:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:38:56] [INFO ] [Real]Absence check using state equation in 1259 ms returned sat
[2020-05-21 02:38:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:38:56] [INFO ] [Nat]Absence check using 23 positive place invariants in 33 ms returned sat
[2020-05-21 02:38:56] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2020-05-21 02:38:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:38:57] [INFO ] [Nat]Absence check using state equation in 1333 ms returned sat
[2020-05-21 02:38:57] [INFO ] [Nat]Added 546 Read/Feed constraints in 105 ms returned sat
[2020-05-21 02:38:58] [INFO ] Deduced a trap composed of 57 places in 495 ms
[2020-05-21 02:38:58] [INFO ] Deduced a trap composed of 22 places in 436 ms
[2020-05-21 02:38:59] [INFO ] Deduced a trap composed of 60 places in 427 ms
[2020-05-21 02:38:59] [INFO ] Deduced a trap composed of 38 places in 443 ms
[2020-05-21 02:39:00] [INFO ] Deduced a trap composed of 33 places in 420 ms
[2020-05-21 02:39:00] [INFO ] Deduced a trap composed of 49 places in 410 ms
[2020-05-21 02:39:01] [INFO ] Deduced a trap composed of 26 places in 425 ms
[2020-05-21 02:39:01] [INFO ] Deduced a trap composed of 21 places in 451 ms
[2020-05-21 02:39:02] [INFO ] Deduced a trap composed of 12 places in 485 ms
[2020-05-21 02:39:02] [INFO ] Deduced a trap composed of 13 places in 488 ms
[2020-05-21 02:39:03] [INFO ] Deduced a trap composed of 13 places in 472 ms
[2020-05-21 02:39:03] [INFO ] Deduced a trap composed of 12 places in 491 ms
[2020-05-21 02:39:04] [INFO ] Deduced a trap composed of 15 places in 476 ms
[2020-05-21 02:39:05] [INFO ] Deduced a trap composed of 11 places in 485 ms
[2020-05-21 02:39:05] [INFO ] Deduced a trap composed of 38 places in 431 ms
[2020-05-21 02:39:06] [INFO ] Deduced a trap composed of 52 places in 429 ms
[2020-05-21 02:39:06] [INFO ] Deduced a trap composed of 31 places in 439 ms
[2020-05-21 02:39:06] [INFO ] Deduced a trap composed of 34 places in 385 ms
[2020-05-21 02:39:07] [INFO ] Deduced a trap composed of 20 places in 389 ms
[2020-05-21 02:39:07] [INFO ] Deduced a trap composed of 88 places in 410 ms
[2020-05-21 02:39:08] [INFO ] Deduced a trap composed of 38 places in 436 ms
[2020-05-21 02:39:08] [INFO ] Deduced a trap composed of 31 places in 424 ms
[2020-05-21 02:39:09] [INFO ] Deduced a trap composed of 49 places in 338 ms
[2020-05-21 02:39:09] [INFO ] Deduced a trap composed of 15 places in 427 ms
[2020-05-21 02:39:10] [INFO ] Deduced a trap composed of 43 places in 380 ms
[2020-05-21 02:39:10] [INFO ] Deduced a trap composed of 54 places in 390 ms
[2020-05-21 02:39:11] [INFO ] Deduced a trap composed of 43 places in 378 ms
[2020-05-21 02:39:11] [INFO ] Deduced a trap composed of 43 places in 385 ms
[2020-05-21 02:39:12] [INFO ] Deduced a trap composed of 43 places in 394 ms
[2020-05-21 02:39:12] [INFO ] Deduced a trap composed of 43 places in 372 ms
[2020-05-21 02:39:13] [INFO ] Deduced a trap composed of 38 places in 396 ms
[2020-05-21 02:39:13] [INFO ] Deduced a trap composed of 56 places in 390 ms
[2020-05-21 02:39:13] [INFO ] Deduced a trap composed of 72 places in 397 ms
[2020-05-21 02:39:14] [INFO ] Deduced a trap composed of 61 places in 389 ms
[2020-05-21 02:39:14] [INFO ] Deduced a trap composed of 56 places in 385 ms
[2020-05-21 02:39:15] [INFO ] Deduced a trap composed of 40 places in 382 ms
[2020-05-21 02:39:15] [INFO ] Deduced a trap composed of 45 places in 381 ms
[2020-05-21 02:39:16] [INFO ] Deduced a trap composed of 47 places in 391 ms
[2020-05-21 02:39:16] [INFO ] Deduced a trap composed of 44 places in 318 ms
[2020-05-21 02:39:16] [INFO ] Deduced a trap composed of 40 places in 331 ms
[2020-05-21 02:39:17] [INFO ] Deduced a trap composed of 24 places in 420 ms
[2020-05-21 02:39:17] [INFO ] Deduced a trap composed of 47 places in 323 ms
[2020-05-21 02:39:18] [INFO ] Deduced a trap composed of 26 places in 292 ms
[2020-05-21 02:39:18] [INFO ] Deduced a trap composed of 22 places in 357 ms
[2020-05-21 02:39:18] [INFO ] Deduced a trap composed of 22 places in 314 ms
[2020-05-21 02:39:19] [INFO ] Deduced a trap composed of 29 places in 353 ms
[2020-05-21 02:39:19] [INFO ] Deduced a trap composed of 56 places in 355 ms
[2020-05-21 02:39:20] [INFO ] Deduced a trap composed of 56 places in 354 ms
[2020-05-21 02:39:20] [INFO ] Deduced a trap composed of 56 places in 336 ms
[2020-05-21 02:39:21] [INFO ] Deduced a trap composed of 77 places in 345 ms
[2020-05-21 02:39:21] [INFO ] Deduced a trap composed of 56 places in 375 ms
[2020-05-21 02:39:21] [INFO ] Deduced a trap composed of 32 places in 383 ms
[2020-05-21 02:39:22] [INFO ] Deduced a trap composed of 33 places in 375 ms
[2020-05-21 02:39:22] [INFO ] Deduced a trap composed of 65 places in 340 ms
[2020-05-21 02:39:23] [INFO ] Deduced a trap composed of 58 places in 353 ms
[2020-05-21 02:39:23] [INFO ] Deduced a trap composed of 39 places in 370 ms
[2020-05-21 02:39:24] [INFO ] Deduced a trap composed of 29 places in 331 ms
[2020-05-21 02:39:24] [INFO ] Deduced a trap composed of 20 places in 337 ms
[2020-05-21 02:39:24] [INFO ] Deduced a trap composed of 13 places in 320 ms
[2020-05-21 02:39:25] [INFO ] Deduced a trap composed of 87 places in 324 ms
[2020-05-21 02:39:25] [INFO ] Deduced a trap composed of 57 places in 345 ms
[2020-05-21 02:39:25] [INFO ] Deduced a trap composed of 78 places in 293 ms
[2020-05-21 02:39:26] [INFO ] Deduced a trap composed of 95 places in 289 ms
[2020-05-21 02:39:26] [INFO ] Deduced a trap composed of 80 places in 322 ms
[2020-05-21 02:39:27] [INFO ] Deduced a trap composed of 78 places in 345 ms
[2020-05-21 02:39:27] [INFO ] Deduced a trap composed of 79 places in 326 ms
[2020-05-21 02:39:27] [INFO ] Deduced a trap composed of 36 places in 302 ms
[2020-05-21 02:39:28] [INFO ] Deduced a trap composed of 33 places in 285 ms
[2020-05-21 02:39:28] [INFO ] Deduced a trap composed of 11 places in 238 ms
[2020-05-21 02:39:29] [INFO ] Deduced a trap composed of 21 places in 303 ms
[2020-05-21 02:39:29] [INFO ] Deduced a trap composed of 23 places in 279 ms
[2020-05-21 02:39:29] [INFO ] Deduced a trap composed of 24 places in 302 ms
[2020-05-21 02:39:30] [INFO ] Deduced a trap composed of 29 places in 323 ms
[2020-05-21 02:39:30] [INFO ] Deduced a trap composed of 24 places in 318 ms
[2020-05-21 02:39:31] [INFO ] Deduced a trap composed of 29 places in 357 ms
[2020-05-21 02:39:31] [INFO ] Deduced a trap composed of 81 places in 378 ms
[2020-05-21 02:39:32] [INFO ] Deduced a trap composed of 44 places in 360 ms
[2020-05-21 02:39:32] [INFO ] Deduced a trap composed of 42 places in 337 ms
[2020-05-21 02:39:32] [INFO ] Deduced a trap composed of 60 places in 326 ms
[2020-05-21 02:39:33] [INFO ] Deduced a trap composed of 66 places in 344 ms
[2020-05-21 02:39:33] [INFO ] Deduced a trap composed of 36 places in 272 ms
[2020-05-21 02:39:34] [INFO ] Deduced a trap composed of 23 places in 417 ms
[2020-05-21 02:39:34] [INFO ] Deduced a trap composed of 65 places in 222 ms
[2020-05-21 02:39:34] [INFO ] Deduced a trap composed of 65 places in 175 ms
[2020-05-21 02:39:34] [INFO ] Deduced a trap composed of 67 places in 178 ms
[2020-05-21 02:39:35] [INFO ] Deduced a trap composed of 67 places in 194 ms
[2020-05-21 02:39:35] [INFO ] Deduced a trap composed of 65 places in 174 ms
[2020-05-21 02:39:35] [INFO ] Deduced a trap composed of 40 places in 196 ms
[2020-05-21 02:39:36] [INFO ] Deduced a trap composed of 38 places in 182 ms
[2020-05-21 02:39:36] [INFO ] Deduced a trap composed of 21 places in 412 ms
[2020-05-21 02:39:37] [INFO ] Deduced a trap composed of 11 places in 420 ms
[2020-05-21 02:39:37] [INFO ] Deduced a trap composed of 20 places in 376 ms
[2020-05-21 02:39:37] [INFO ] Deduced a trap composed of 44 places in 333 ms
[2020-05-21 02:39:38] [INFO ] Deduced a trap composed of 21 places in 272 ms
[2020-05-21 02:39:38] [INFO ] Deduced a trap composed of 23 places in 279 ms
[2020-05-21 02:39:39] [INFO ] Deduced a trap composed of 21 places in 389 ms
[2020-05-21 02:39:39] [INFO ] Deduced a trap composed of 11 places in 379 ms
[2020-05-21 02:39:39] [INFO ] Deduced a trap composed of 20 places in 348 ms
[2020-05-21 02:39:40] [INFO ] Deduced a trap composed of 36 places in 356 ms
[2020-05-21 02:39:40] [INFO ] Deduced a trap composed of 20 places in 345 ms
[2020-05-21 02:39:41] [INFO ] Deduced a trap composed of 53 places in 343 ms
[2020-05-21 02:39:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s1 s8 s14 s21 s52 s53 s60 s67 s79 s142 s157 s164 s172 s194 s201 s209 s216 s234 s253 s268 s275 s280 s287 s318 s324 s341 s349 s356 s364 s368 s419 s427 s434 s448 s452 s461 s471 s478 s484 s492 s511 s514 s522 s529 s536 s552 s563 s571 s580 s590 s597 s616 s619) 0)") while checking expression at index 2
[2020-05-21 02:39:41] [INFO ] [Real]Absence check using 23 positive place invariants in 25 ms returned sat
[2020-05-21 02:39:41] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 02:39:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:39:42] [INFO ] [Real]Absence check using state equation in 1312 ms returned sat
[2020-05-21 02:39:42] [INFO ] [Real]Added 546 Read/Feed constraints in 80 ms returned sat
[2020-05-21 02:39:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:39:42] [INFO ] [Nat]Absence check using 23 positive place invariants in 34 ms returned sat
[2020-05-21 02:39:42] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 02:39:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:39:44] [INFO ] [Nat]Absence check using state equation in 1247 ms returned sat
[2020-05-21 02:39:44] [INFO ] [Nat]Added 546 Read/Feed constraints in 88 ms returned sat
[2020-05-21 02:39:44] [INFO ] Deduced a trap composed of 38 places in 405 ms
[2020-05-21 02:39:45] [INFO ] Deduced a trap composed of 12 places in 390 ms
[2020-05-21 02:39:45] [INFO ] Deduced a trap composed of 58 places in 393 ms
[2020-05-21 02:39:46] [INFO ] Deduced a trap composed of 33 places in 379 ms
[2020-05-21 02:39:46] [INFO ] Deduced a trap composed of 51 places in 395 ms
[2020-05-21 02:39:46] [INFO ] Deduced a trap composed of 22 places in 418 ms
[2020-05-21 02:39:47] [INFO ] Deduced a trap composed of 25 places in 421 ms
[2020-05-21 02:39:47] [INFO ] Deduced a trap composed of 49 places in 453 ms
[2020-05-21 02:39:48] [INFO ] Deduced a trap composed of 21 places in 401 ms
[2020-05-21 02:39:48] [INFO ] Deduced a trap composed of 20 places in 411 ms
[2020-05-21 02:39:49] [INFO ] Deduced a trap composed of 15 places in 443 ms
[2020-05-21 02:39:49] [INFO ] Deduced a trap composed of 15 places in 447 ms
[2020-05-21 02:39:50] [INFO ] Deduced a trap composed of 21 places in 437 ms
[2020-05-21 02:39:50] [INFO ] Deduced a trap composed of 21 places in 449 ms
[2020-05-21 02:39:51] [INFO ] Deduced a trap composed of 11 places in 423 ms
[2020-05-21 02:39:51] [INFO ] Deduced a trap composed of 15 places in 493 ms
[2020-05-21 02:39:52] [INFO ] Deduced a trap composed of 47 places in 373 ms
[2020-05-21 02:39:52] [INFO ] Deduced a trap composed of 12 places in 343 ms
[2020-05-21 02:39:53] [INFO ] Deduced a trap composed of 85 places in 371 ms
[2020-05-21 02:39:53] [INFO ] Deduced a trap composed of 43 places in 393 ms
[2020-05-21 02:39:54] [INFO ] Deduced a trap composed of 22 places in 399 ms
[2020-05-21 02:39:54] [INFO ] Deduced a trap composed of 45 places in 413 ms
[2020-05-21 02:39:55] [INFO ] Deduced a trap composed of 20 places in 414 ms
[2020-05-21 02:39:55] [INFO ] Deduced a trap composed of 13 places in 452 ms
[2020-05-21 02:39:56] [INFO ] Deduced a trap composed of 13 places in 436 ms
[2020-05-21 02:39:56] [INFO ] Deduced a trap composed of 13 places in 474 ms
[2020-05-21 02:39:57] [INFO ] Deduced a trap composed of 62 places in 458 ms
[2020-05-21 02:39:57] [INFO ] Deduced a trap composed of 42 places in 455 ms
[2020-05-21 02:39:58] [INFO ] Deduced a trap composed of 13 places in 508 ms
[2020-05-21 02:39:58] [INFO ] Deduced a trap composed of 35 places in 438 ms
[2020-05-21 02:39:59] [INFO ] Deduced a trap composed of 44 places in 386 ms
[2020-05-21 02:39:59] [INFO ] Deduced a trap composed of 74 places in 322 ms
[2020-05-21 02:39:59] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 15436 ms
[2020-05-21 02:39:59] [INFO ] Computed and/alt/rep : 1721/14266/1385 causal constraints in 94 ms.
[2020-05-21 02:40:19] [INFO ] Added : 580 causal constraints over 116 iterations in 20228 ms.(timeout) Result :sat
[2020-05-21 02:40:20] [INFO ] Deduced a trap composed of 35 places in 435 ms
[2020-05-21 02:40:21] [INFO ] Deduced a trap composed of 33 places in 388 ms
[2020-05-21 02:40:21] [INFO ] Deduced a trap composed of 33 places in 383 ms
[2020-05-21 02:40:22] [INFO ] Deduced a trap composed of 65 places in 283 ms
[2020-05-21 02:40:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2467 ms
Attempting to minimize the solution found.
Minimization took 176 ms.
[2020-05-21 02:40:22] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2020-05-21 02:40:22] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 02:40:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:40:23] [INFO ] [Real]Absence check using state equation in 1171 ms returned sat
[2020-05-21 02:40:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:40:23] [INFO ] [Nat]Absence check using 23 positive place invariants in 33 ms returned sat
[2020-05-21 02:40:24] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2020-05-21 02:40:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:40:25] [INFO ] [Nat]Absence check using state equation in 1229 ms returned sat
[2020-05-21 02:40:25] [INFO ] [Nat]Added 546 Read/Feed constraints in 83 ms returned sat
[2020-05-21 02:40:25] [INFO ] Deduced a trap composed of 42 places in 470 ms
[2020-05-21 02:40:26] [INFO ] Deduced a trap composed of 20 places in 473 ms
[2020-05-21 02:40:26] [INFO ] Deduced a trap composed of 22 places in 438 ms
[2020-05-21 02:40:27] [INFO ] Deduced a trap composed of 35 places in 425 ms
[2020-05-21 02:40:27] [INFO ] Deduced a trap composed of 32 places in 451 ms
[2020-05-21 02:40:28] [INFO ] Deduced a trap composed of 33 places in 433 ms
[2020-05-21 02:40:28] [INFO ] Deduced a trap composed of 33 places in 463 ms
[2020-05-21 02:40:29] [INFO ] Deduced a trap composed of 34 places in 455 ms
[2020-05-21 02:40:29] [INFO ] Deduced a trap composed of 11 places in 496 ms
[2020-05-21 02:40:30] [INFO ] Deduced a trap composed of 22 places in 441 ms
[2020-05-21 02:40:30] [INFO ] Deduced a trap composed of 56 places in 477 ms
[2020-05-21 02:40:31] [INFO ] Deduced a trap composed of 64 places in 441 ms
[2020-05-21 02:40:31] [INFO ] Deduced a trap composed of 33 places in 458 ms
[2020-05-21 02:40:32] [INFO ] Deduced a trap composed of 20 places in 452 ms
[2020-05-21 02:40:32] [INFO ] Deduced a trap composed of 20 places in 397 ms
[2020-05-21 02:40:33] [INFO ] Deduced a trap composed of 20 places in 474 ms
[2020-05-21 02:40:33] [INFO ] Deduced a trap composed of 27 places in 451 ms
[2020-05-21 02:40:34] [INFO ] Deduced a trap composed of 33 places in 405 ms
[2020-05-21 02:40:34] [INFO ] Deduced a trap composed of 11 places in 424 ms
[2020-05-21 02:40:35] [INFO ] Deduced a trap composed of 11 places in 450 ms
[2020-05-21 02:40:35] [INFO ] Deduced a trap composed of 11 places in 426 ms
[2020-05-21 02:40:36] [INFO ] Deduced a trap composed of 11 places in 440 ms
[2020-05-21 02:40:36] [INFO ] Deduced a trap composed of 11 places in 431 ms
[2020-05-21 02:40:37] [INFO ] Deduced a trap composed of 11 places in 411 ms
[2020-05-21 02:40:37] [INFO ] Deduced a trap composed of 31 places in 344 ms
[2020-05-21 02:40:38] [INFO ] Deduced a trap composed of 43 places in 338 ms
[2020-05-21 02:40:38] [INFO ] Deduced a trap composed of 50 places in 369 ms
[2020-05-21 02:40:39] [INFO ] Deduced a trap composed of 36 places in 390 ms
[2020-05-21 02:40:39] [INFO ] Deduced a trap composed of 42 places in 339 ms
[2020-05-21 02:40:39] [INFO ] Deduced a trap composed of 59 places in 399 ms
[2020-05-21 02:40:40] [INFO ] Deduced a trap composed of 53 places in 356 ms
[2020-05-21 02:40:40] [INFO ] Deduced a trap composed of 62 places in 345 ms
[2020-05-21 02:40:41] [INFO ] Deduced a trap composed of 63 places in 368 ms
[2020-05-21 02:40:41] [INFO ] Deduced a trap composed of 44 places in 333 ms
[2020-05-21 02:40:41] [INFO ] Deduced a trap composed of 31 places in 331 ms
[2020-05-21 02:40:42] [INFO ] Deduced a trap composed of 43 places in 358 ms
[2020-05-21 02:40:42] [INFO ] Deduced a trap composed of 43 places in 335 ms
[2020-05-21 02:40:43] [INFO ] Deduced a trap composed of 54 places in 356 ms
[2020-05-21 02:40:43] [INFO ] Deduced a trap composed of 51 places in 317 ms
[2020-05-21 02:40:43] [INFO ] Deduced a trap composed of 42 places in 358 ms
[2020-05-21 02:40:44] [INFO ] Deduced a trap composed of 49 places in 311 ms
[2020-05-21 02:40:44] [INFO ] Deduced a trap composed of 37 places in 315 ms
[2020-05-21 02:40:45] [INFO ] Deduced a trap composed of 43 places in 305 ms
[2020-05-21 02:40:45] [INFO ] Deduced a trap composed of 37 places in 286 ms
[2020-05-21 02:40:45] [INFO ] Deduced a trap composed of 37 places in 293 ms
[2020-05-21 02:40:46] [INFO ] Deduced a trap composed of 37 places in 325 ms
[2020-05-21 02:40:46] [INFO ] Deduced a trap composed of 37 places in 272 ms
[2020-05-21 02:40:46] [INFO ] Deduced a trap composed of 37 places in 254 ms
[2020-05-21 02:40:47] [INFO ] Deduced a trap composed of 37 places in 296 ms
[2020-05-21 02:40:47] [INFO ] Deduced a trap composed of 68 places in 264 ms
[2020-05-21 02:40:47] [INFO ] Deduced a trap composed of 68 places in 261 ms
[2020-05-21 02:40:48] [INFO ] Deduced a trap composed of 68 places in 274 ms
[2020-05-21 02:40:48] [INFO ] Deduced a trap composed of 68 places in 226 ms
[2020-05-21 02:40:48] [INFO ] Deduced a trap composed of 68 places in 269 ms
[2020-05-21 02:40:49] [INFO ] Deduced a trap composed of 56 places in 237 ms
[2020-05-21 02:40:49] [INFO ] Deduced a trap composed of 33 places in 314 ms
[2020-05-21 02:40:49] [INFO ] Deduced a trap composed of 33 places in 367 ms
[2020-05-21 02:40:50] [INFO ] Deduced a trap composed of 92 places in 306 ms
[2020-05-21 02:40:50] [INFO ] Deduced a trap composed of 80 places in 349 ms
[2020-05-21 02:40:51] [INFO ] Deduced a trap composed of 98 places in 344 ms
[2020-05-21 02:40:51] [INFO ] Deduced a trap composed of 92 places in 356 ms
[2020-05-21 02:40:51] [INFO ] Deduced a trap composed of 80 places in 347 ms
[2020-05-21 02:40:52] [INFO ] Deduced a trap composed of 47 places in 326 ms
[2020-05-21 02:40:52] [INFO ] Deduced a trap composed of 80 places in 316 ms
[2020-05-21 02:40:53] [INFO ] Deduced a trap composed of 92 places in 274 ms
[2020-05-21 02:40:53] [INFO ] Deduced a trap composed of 63 places in 322 ms
[2020-05-21 02:40:53] [INFO ] Deduced a trap composed of 40 places in 334 ms
[2020-05-21 02:40:54] [INFO ] Deduced a trap composed of 43 places in 350 ms
[2020-05-21 02:40:54] [INFO ] Deduced a trap composed of 37 places in 322 ms
[2020-05-21 02:40:55] [INFO ] Deduced a trap composed of 46 places in 353 ms
[2020-05-21 02:40:55] [INFO ] Deduced a trap composed of 27 places in 329 ms
[2020-05-21 02:40:56] [INFO ] Deduced a trap composed of 38 places in 420 ms
[2020-05-21 02:40:56] [INFO ] Deduced a trap composed of 25 places in 374 ms
[2020-05-21 02:40:57] [INFO ] Deduced a trap composed of 93 places in 413 ms
[2020-05-21 02:40:57] [INFO ] Deduced a trap composed of 105 places in 360 ms
[2020-05-21 02:40:58] [INFO ] Deduced a trap composed of 111 places in 367 ms
[2020-05-21 02:40:58] [INFO ] Deduced a trap composed of 73 places in 369 ms
[2020-05-21 02:40:59] [INFO ] Deduced a trap composed of 130 places in 386 ms
[2020-05-21 02:40:59] [INFO ] Deduced a trap composed of 47 places in 356 ms
[2020-05-21 02:41:00] [INFO ] Deduced a trap composed of 40 places in 294 ms
[2020-05-21 02:41:00] [INFO ] Deduced a trap composed of 58 places in 335 ms
[2020-05-21 02:41:00] [INFO ] Deduced a trap composed of 79 places in 355 ms
[2020-05-21 02:41:01] [INFO ] Deduced a trap composed of 47 places in 341 ms
[2020-05-21 02:41:01] [INFO ] Deduced a trap composed of 38 places in 360 ms
[2020-05-21 02:41:02] [INFO ] Deduced a trap composed of 66 places in 419 ms
[2020-05-21 02:41:02] [INFO ] Deduced a trap composed of 37 places in 401 ms
[2020-05-21 02:41:03] [INFO ] Deduced a trap composed of 46 places in 343 ms
[2020-05-21 02:41:03] [INFO ] Deduced a trap composed of 19 places in 436 ms
[2020-05-21 02:41:04] [INFO ] Deduced a trap composed of 32 places in 396 ms
[2020-05-21 02:41:04] [INFO ] Deduced a trap composed of 14 places in 364 ms
[2020-05-21 02:41:04] [INFO ] Deduced a trap composed of 32 places in 399 ms
[2020-05-21 02:41:05] [INFO ] Deduced a trap composed of 53 places in 428 ms
[2020-05-21 02:41:05] [INFO ] Deduced a trap composed of 46 places in 446 ms
[2020-05-21 02:41:06] [INFO ] Deduced a trap composed of 56 places in 317 ms
[2020-05-21 02:41:06] [INFO ] Deduced a trap composed of 55 places in 256 ms
[2020-05-21 02:41:07] [INFO ] Deduced a trap composed of 65 places in 277 ms
[2020-05-21 02:41:07] [INFO ] Deduced a trap composed of 67 places in 281 ms
[2020-05-21 02:41:07] [INFO ] Deduced a trap composed of 65 places in 272 ms
[2020-05-21 02:41:07] [INFO ] Deduced a trap composed of 65 places in 242 ms
[2020-05-21 02:41:08] [INFO ] Deduced a trap composed of 54 places in 262 ms
[2020-05-21 02:41:08] [INFO ] Deduced a trap composed of 54 places in 230 ms
[2020-05-21 02:41:08] [INFO ] Deduced a trap composed of 54 places in 225 ms
[2020-05-21 02:41:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 02:41:09] [INFO ] Deduced a trap composed of 2 places in 535 ms
[2020-05-21 02:41:09] [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 (> (+ s466 s622) 0)") while checking expression at index 4
Incomplete Parikh walk after 335400 steps, including 1000 resets, run finished after 996 ms. (steps per millisecond=336 ) properties seen :[0, 0, 1, 1, 0] could not realise parikh vector
FORMULA Peterson-PT-7-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-7-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 276500 steps, including 1000 resets, run finished after 769 ms. (steps per millisecond=359 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 13 out of 625 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 625/625 places, 1729/1729 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 625 transition count 1725
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 621 transition count 1725
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 8 place count 621 transition count 1717
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 24 place count 613 transition count 1717
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 611 transition count 1715
Applied a total of 28 rules in 79 ms. Remains 611 /625 variables (removed 14) and now considering 1715/1729 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 611/625 places, 1715/1729 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2662 ms. (steps per millisecond=375 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 806 ms. (steps per millisecond=1240 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 649 ms. (steps per millisecond=1540 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 751 ms. (steps per millisecond=1331 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 8632260 steps, run timeout after 30001 ms. (steps per millisecond=287 ) properties seen :[0, 0, 0]
Probabilistic random walk after 8632260 steps, saw 959141 distinct states, run finished after 30001 ms. (steps per millisecond=287 ) properties seen :[0, 0, 0]
[2020-05-21 02:41:46] [INFO ] Flow matrix only has 1379 transitions (discarded 336 similar events)
// Phase 1: matrix 1379 rows 611 cols
[2020-05-21 02:41:46] [INFO ] Computed 31 place invariants in 6 ms
[2020-05-21 02:41:46] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2020-05-21 02:41:46] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2020-05-21 02:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:41:47] [INFO ] [Real]Absence check using state equation in 1316 ms returned sat
[2020-05-21 02:41:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:41:47] [INFO ] [Nat]Absence check using 23 positive place invariants in 29 ms returned sat
[2020-05-21 02:41:47] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 02:41:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:41:48] [INFO ] [Nat]Absence check using state equation in 1237 ms returned sat
[2020-05-21 02:41:48] [INFO ] State equation strengthened by 546 read => feed constraints.
[2020-05-21 02:41:49] [INFO ] [Nat]Added 546 Read/Feed constraints in 123 ms returned sat
[2020-05-21 02:41:49] [INFO ] Deduced a trap composed of 47 places in 434 ms
[2020-05-21 02:41:50] [INFO ] Deduced a trap composed of 34 places in 447 ms
[2020-05-21 02:41:50] [INFO ] Deduced a trap composed of 57 places in 431 ms
[2020-05-21 02:41:51] [INFO ] Deduced a trap composed of 56 places in 451 ms
[2020-05-21 02:41:51] [INFO ] Deduced a trap composed of 43 places in 426 ms
[2020-05-21 02:41:52] [INFO ] Deduced a trap composed of 60 places in 436 ms
[2020-05-21 02:41:52] [INFO ] Deduced a trap composed of 35 places in 436 ms
[2020-05-21 02:41:52] [INFO ] Deduced a trap composed of 40 places in 451 ms
[2020-05-21 02:41:53] [INFO ] Deduced a trap composed of 95 places in 463 ms
[2020-05-21 02:41:53] [INFO ] Deduced a trap composed of 94 places in 427 ms
[2020-05-21 02:41:54] [INFO ] Deduced a trap composed of 34 places in 425 ms
[2020-05-21 02:41:54] [INFO ] Deduced a trap composed of 27 places in 375 ms
[2020-05-21 02:41:55] [INFO ] Deduced a trap composed of 11 places in 391 ms
[2020-05-21 02:41:55] [INFO ] Deduced a trap composed of 11 places in 376 ms
[2020-05-21 02:41:56] [INFO ] Deduced a trap composed of 11 places in 385 ms
[2020-05-21 02:41:56] [INFO ] Deduced a trap composed of 11 places in 395 ms
[2020-05-21 02:41:57] [INFO ] Deduced a trap composed of 14 places in 462 ms
[2020-05-21 02:41:57] [INFO ] Deduced a trap composed of 20 places in 428 ms
[2020-05-21 02:41:58] [INFO ] Deduced a trap composed of 12 places in 413 ms
[2020-05-21 02:41:58] [INFO ] Deduced a trap composed of 24 places in 430 ms
[2020-05-21 02:41:59] [INFO ] Deduced a trap composed of 12 places in 389 ms
[2020-05-21 02:41:59] [INFO ] Deduced a trap composed of 13 places in 390 ms
[2020-05-21 02:42:00] [INFO ] Deduced a trap composed of 28 places in 420 ms
[2020-05-21 02:42:00] [INFO ] Deduced a trap composed of 48 places in 464 ms
[2020-05-21 02:42:01] [INFO ] Deduced a trap composed of 28 places in 436 ms
[2020-05-21 02:42:01] [INFO ] Deduced a trap composed of 28 places in 471 ms
[2020-05-21 02:42:02] [INFO ] Deduced a trap composed of 20 places in 433 ms
[2020-05-21 02:42:02] [INFO ] Deduced a trap composed of 21 places in 457 ms
[2020-05-21 02:42:03] [INFO ] Deduced a trap composed of 40 places in 400 ms
[2020-05-21 02:42:03] [INFO ] Deduced a trap composed of 33 places in 395 ms
[2020-05-21 02:42:03] [INFO ] Deduced a trap composed of 33 places in 404 ms
[2020-05-21 02:42:04] [INFO ] Deduced a trap composed of 52 places in 435 ms
[2020-05-21 02:42:04] [INFO ] Deduced a trap composed of 47 places in 443 ms
[2020-05-21 02:42:05] [INFO ] Deduced a trap composed of 52 places in 413 ms
[2020-05-21 02:42:05] [INFO ] Deduced a trap composed of 53 places in 474 ms
[2020-05-21 02:42:06] [INFO ] Deduced a trap composed of 57 places in 421 ms
[2020-05-21 02:42:06] [INFO ] Deduced a trap composed of 52 places in 405 ms
[2020-05-21 02:42:07] [INFO ] Deduced a trap composed of 33 places in 440 ms
[2020-05-21 02:42:07] [INFO ] Deduced a trap composed of 62 places in 371 ms
[2020-05-21 02:42:08] [INFO ] Deduced a trap composed of 56 places in 376 ms
[2020-05-21 02:42:08] [INFO ] Deduced a trap composed of 32 places in 421 ms
[2020-05-21 02:42:09] [INFO ] Deduced a trap composed of 103 places in 381 ms
[2020-05-21 02:42:09] [INFO ] Deduced a trap composed of 92 places in 358 ms
[2020-05-21 02:42:10] [INFO ] Deduced a trap composed of 51 places in 355 ms
[2020-05-21 02:42:10] [INFO ] Deduced a trap composed of 67 places in 382 ms
[2020-05-21 02:42:10] [INFO ] Deduced a trap composed of 103 places in 335 ms
[2020-05-21 02:42:11] [INFO ] Deduced a trap composed of 48 places in 307 ms
[2020-05-21 02:42:11] [INFO ] Deduced a trap composed of 32 places in 356 ms
[2020-05-21 02:42:12] [INFO ] Deduced a trap composed of 33 places in 389 ms
[2020-05-21 02:42:12] [INFO ] Deduced a trap composed of 60 places in 315 ms
[2020-05-21 02:42:12] [INFO ] Deduced a trap composed of 40 places in 359 ms
[2020-05-21 02:42:13] [INFO ] Deduced a trap composed of 64 places in 332 ms
[2020-05-21 02:42:13] [INFO ] Deduced a trap composed of 42 places in 336 ms
[2020-05-21 02:42:14] [INFO ] Deduced a trap composed of 43 places in 346 ms
[2020-05-21 02:42:14] [INFO ] Deduced a trap composed of 39 places in 389 ms
[2020-05-21 02:42:14] [INFO ] Deduced a trap composed of 42 places in 366 ms
[2020-05-21 02:42:15] [INFO ] Deduced a trap composed of 40 places in 407 ms
[2020-05-21 02:42:15] [INFO ] Deduced a trap composed of 61 places in 359 ms
[2020-05-21 02:42:16] [INFO ] Deduced a trap composed of 69 places in 355 ms
[2020-05-21 02:42:16] [INFO ] Deduced a trap composed of 51 places in 321 ms
[2020-05-21 02:42:17] [INFO ] Deduced a trap composed of 52 places in 285 ms
[2020-05-21 02:42:17] [INFO ] Deduced a trap composed of 51 places in 306 ms
[2020-05-21 02:42:17] [INFO ] Deduced a trap composed of 60 places in 257 ms
[2020-05-21 02:42:18] [INFO ] Deduced a trap composed of 56 places in 253 ms
[2020-05-21 02:42:18] [INFO ] Deduced a trap composed of 48 places in 256 ms
[2020-05-21 02:42:18] [INFO ] Deduced a trap composed of 50 places in 262 ms
[2020-05-21 02:42:18] [INFO ] Trap strengthening (SAT) tested/added 67/66 trap constraints in 29681 ms
[2020-05-21 02:42:18] [INFO ] Computed and/alt/rep : 1707/14259/1371 causal constraints in 78 ms.
[2020-05-21 02:42:32] [INFO ] Added : 435 causal constraints over 87 iterations in 13860 ms. Result :(error "Failed to check-sat")
[2020-05-21 02:42:32] [INFO ] [Real]Absence check using 23 positive place invariants in 27 ms returned sat
[2020-05-21 02:42:32] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 02:42:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:42:33] [INFO ] [Real]Absence check using state equation in 1173 ms returned sat
[2020-05-21 02:42:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:42:34] [INFO ] [Nat]Absence check using 23 positive place invariants in 29 ms returned sat
[2020-05-21 02:42:34] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 02:42:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:42:35] [INFO ] [Nat]Absence check using state equation in 1176 ms returned sat
[2020-05-21 02:42:35] [INFO ] [Nat]Added 546 Read/Feed constraints in 85 ms returned sat
[2020-05-21 02:42:35] [INFO ] Deduced a trap composed of 21 places in 491 ms
[2020-05-21 02:42:36] [INFO ] Deduced a trap composed of 44 places in 478 ms
[2020-05-21 02:42:36] [INFO ] Deduced a trap composed of 14 places in 432 ms
[2020-05-21 02:42:37] [INFO ] Deduced a trap composed of 15 places in 483 ms
[2020-05-21 02:42:37] [INFO ] Deduced a trap composed of 15 places in 480 ms
[2020-05-21 02:42:38] [INFO ] Deduced a trap composed of 64 places in 476 ms
[2020-05-21 02:42:39] [INFO ] Deduced a trap composed of 15 places in 478 ms
[2020-05-21 02:42:39] [INFO ] Deduced a trap composed of 32 places in 490 ms
[2020-05-21 02:42:40] [INFO ] Deduced a trap composed of 11 places in 420 ms
[2020-05-21 02:42:40] [INFO ] Deduced a trap composed of 11 places in 424 ms
[2020-05-21 02:42:41] [INFO ] Deduced a trap composed of 12 places in 463 ms
[2020-05-21 02:42:41] [INFO ] Deduced a trap composed of 12 places in 467 ms
[2020-05-21 02:42:42] [INFO ] Deduced a trap composed of 44 places in 438 ms
[2020-05-21 02:42:42] [INFO ] Deduced a trap composed of 20 places in 445 ms
[2020-05-21 02:42:43] [INFO ] Deduced a trap composed of 44 places in 438 ms
[2020-05-21 02:42:43] [INFO ] Deduced a trap composed of 20 places in 437 ms
[2020-05-21 02:42:44] [INFO ] Deduced a trap composed of 42 places in 392 ms
[2020-05-21 02:42:44] [INFO ] Deduced a trap composed of 39 places in 393 ms
[2020-05-21 02:42:45] [INFO ] Deduced a trap composed of 19 places in 402 ms
[2020-05-21 02:42:45] [INFO ] Deduced a trap composed of 20 places in 381 ms
[2020-05-21 02:42:46] [INFO ] Deduced a trap composed of 21 places in 396 ms
[2020-05-21 02:42:46] [INFO ] Deduced a trap composed of 47 places in 384 ms
[2020-05-21 02:42:46] [INFO ] Deduced a trap composed of 20 places in 376 ms
[2020-05-21 02:42:47] [INFO ] Deduced a trap composed of 41 places in 272 ms
[2020-05-21 02:42:47] [INFO ] Deduced a trap composed of 71 places in 248 ms
[2020-05-21 02:42:47] [INFO ] Deduced a trap composed of 40 places in 294 ms
[2020-05-21 02:42:48] [INFO ] Deduced a trap composed of 41 places in 302 ms
[2020-05-21 02:42:48] [INFO ] Deduced a trap composed of 41 places in 313 ms
[2020-05-21 02:42:49] [INFO ] Deduced a trap composed of 50 places in 324 ms
[2020-05-21 02:42:49] [INFO ] Deduced a trap composed of 26 places in 363 ms
[2020-05-21 02:42:49] [INFO ] Deduced a trap composed of 23 places in 405 ms
[2020-05-21 02:42:50] [INFO ] Deduced a trap composed of 58 places in 280 ms
[2020-05-21 02:42:50] [INFO ] Deduced a trap composed of 59 places in 303 ms
[2020-05-21 02:42:51] [INFO ] Deduced a trap composed of 50 places in 328 ms
[2020-05-21 02:42:51] [INFO ] Deduced a trap composed of 50 places in 284 ms
[2020-05-21 02:42:51] [INFO ] Deduced a trap composed of 40 places in 299 ms
[2020-05-21 02:42:52] [INFO ] Deduced a trap composed of 59 places in 295 ms
[2020-05-21 02:42:52] [INFO ] Deduced a trap composed of 42 places in 324 ms
[2020-05-21 02:42:52] [INFO ] Deduced a trap composed of 69 places in 324 ms
[2020-05-21 02:42:53] [INFO ] Deduced a trap composed of 68 places in 307 ms
[2020-05-21 02:42:53] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 17975 ms
[2020-05-21 02:42:53] [INFO ] Computed and/alt/rep : 1707/14259/1371 causal constraints in 90 ms.
[2020-05-21 02:43:13] [INFO ] Added : 590 causal constraints over 118 iterations in 20373 ms.(timeout) Result :sat
[2020-05-21 02:43:14] [INFO ] Deduced a trap composed of 33 places in 333 ms
[2020-05-21 02:43:14] [INFO ] Deduced a trap composed of 44 places in 313 ms
[2020-05-21 02:43:15] [INFO ] Deduced a trap composed of 99 places in 302 ms
[2020-05-21 02:43:15] [INFO ] Deduced a trap composed of 46 places in 342 ms
[2020-05-21 02:43:16] [INFO ] Deduced a trap composed of 50 places in 337 ms
[2020-05-21 02:43:16] [INFO ] Deduced a trap composed of 43 places in 318 ms
[2020-05-21 02:43:17] [INFO ] Deduced a trap composed of 33 places in 333 ms
[2020-05-21 02:43:17] [INFO ] Deduced a trap composed of 32 places in 379 ms
[2020-05-21 02:43:18] [INFO ] Deduced a trap composed of 57 places in 338 ms
[2020-05-21 02:43:18] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 5114 ms
Attempting to minimize the solution found.
Minimization took 173 ms.
[2020-05-21 02:43:19] [INFO ] [Real]Absence check using 23 positive place invariants in 33 ms returned sat
[2020-05-21 02:43:19] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2020-05-21 02:43:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:43:20] [INFO ] [Real]Absence check using state equation in 1232 ms returned sat
[2020-05-21 02:43:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:43:20] [INFO ] [Nat]Absence check using 23 positive place invariants in 25 ms returned sat
[2020-05-21 02:43:20] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 02:43:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:43:21] [INFO ] [Nat]Absence check using state equation in 1174 ms returned sat
[2020-05-21 02:43:21] [INFO ] [Nat]Added 546 Read/Feed constraints in 83 ms returned sat
[2020-05-21 02:43:22] [INFO ] Deduced a trap composed of 22 places in 417 ms
[2020-05-21 02:43:22] [INFO ] Deduced a trap composed of 13 places in 397 ms
[2020-05-21 02:43:23] [INFO ] Deduced a trap composed of 13 places in 412 ms
[2020-05-21 02:43:23] [INFO ] Deduced a trap composed of 12 places in 409 ms
[2020-05-21 02:43:23] [INFO ] Deduced a trap composed of 32 places in 410 ms
[2020-05-21 02:43:24] [INFO ] Deduced a trap composed of 16 places in 453 ms
[2020-05-21 02:43:25] [INFO ] Deduced a trap composed of 13 places in 464 ms
[2020-05-21 02:43:25] [INFO ] Deduced a trap composed of 22 places in 450 ms
[2020-05-21 02:43:25] [INFO ] Deduced a trap composed of 11 places in 420 ms
[2020-05-21 02:43:26] [INFO ] Deduced a trap composed of 32 places in 368 ms
[2020-05-21 02:43:26] [INFO ] Deduced a trap composed of 45 places in 411 ms
[2020-05-21 02:43:27] [INFO ] Deduced a trap composed of 11 places in 415 ms
[2020-05-21 02:43:27] [INFO ] Deduced a trap composed of 12 places in 459 ms
[2020-05-21 02:43:28] [INFO ] Deduced a trap composed of 22 places in 420 ms
[2020-05-21 02:43:28] [INFO ] Deduced a trap composed of 53 places in 434 ms
[2020-05-21 02:43:29] [INFO ] Deduced a trap composed of 32 places in 397 ms
[2020-05-21 02:43:29] [INFO ] Deduced a trap composed of 47 places in 402 ms
[2020-05-21 02:43:30] [INFO ] Deduced a trap composed of 45 places in 393 ms
[2020-05-21 02:43:30] [INFO ] Deduced a trap composed of 64 places in 373 ms
[2020-05-21 02:43:31] [INFO ] Deduced a trap composed of 54 places in 373 ms
[2020-05-21 02:43:31] [INFO ] Deduced a trap composed of 86 places in 341 ms
[2020-05-21 02:43:31] [INFO ] Deduced a trap composed of 43 places in 310 ms
[2020-05-21 02:43:32] [INFO ] Deduced a trap composed of 42 places in 391 ms
[2020-05-21 02:43:32] [INFO ] Deduced a trap composed of 41 places in 357 ms
[2020-05-21 02:43:33] [INFO ] Deduced a trap composed of 29 places in 349 ms
[2020-05-21 02:43:33] [INFO ] Deduced a trap composed of 33 places in 345 ms
[2020-05-21 02:43:34] [INFO ] Deduced a trap composed of 32 places in 362 ms
[2020-05-21 02:43:34] [INFO ] Deduced a trap composed of 33 places in 360 ms
[2020-05-21 02:43:34] [INFO ] Deduced a trap composed of 31 places in 369 ms
[2020-05-21 02:43:35] [INFO ] Deduced a trap composed of 22 places in 377 ms
[2020-05-21 02:43:35] [INFO ] Deduced a trap composed of 23 places in 357 ms
[2020-05-21 02:43:36] [INFO ] Deduced a trap composed of 59 places in 375 ms
[2020-05-21 02:43:36] [INFO ] Deduced a trap composed of 56 places in 366 ms
[2020-05-21 02:43:36] [INFO ] Deduced a trap composed of 57 places in 340 ms
[2020-05-21 02:43:37] [INFO ] Deduced a trap composed of 27 places in 298 ms
[2020-05-21 02:43:37] [INFO ] Deduced a trap composed of 46 places in 313 ms
[2020-05-21 02:43:38] [INFO ] Deduced a trap composed of 49 places in 344 ms
[2020-05-21 02:43:38] [INFO ] Deduced a trap composed of 20 places in 329 ms
[2020-05-21 02:43:38] [INFO ] Deduced a trap composed of 57 places in 408 ms
[2020-05-21 02:43:39] [INFO ] Deduced a trap composed of 20 places in 375 ms
[2020-05-21 02:43:39] [INFO ] Deduced a trap composed of 34 places in 328 ms
[2020-05-21 02:43:40] [INFO ] Deduced a trap composed of 32 places in 320 ms
[2020-05-21 02:43:40] [INFO ] Deduced a trap composed of 97 places in 287 ms
[2020-05-21 02:43:40] [INFO ] Deduced a trap composed of 74 places in 272 ms
[2020-05-21 02:43:41] [INFO ] Deduced a trap composed of 63 places in 332 ms
[2020-05-21 02:43:41] [INFO ] Deduced a trap composed of 53 places in 301 ms
[2020-05-21 02:43:41] [INFO ] Deduced a trap composed of 42 places in 267 ms
[2020-05-21 02:43:42] [INFO ] Deduced a trap composed of 42 places in 317 ms
[2020-05-21 02:43:42] [INFO ] Deduced a trap composed of 67 places in 293 ms
[2020-05-21 02:43:43] [INFO ] Deduced a trap composed of 54 places in 293 ms
[2020-05-21 02:43:43] [INFO ] Deduced a trap composed of 44 places in 357 ms
[2020-05-21 02:43:43] [INFO ] Deduced a trap composed of 11 places in 330 ms
[2020-05-21 02:43:44] [INFO ] Deduced a trap composed of 21 places in 350 ms
[2020-05-21 02:43:44] [INFO ] Deduced a trap composed of 71 places in 307 ms
[2020-05-21 02:43:44] [INFO ] Deduced a trap composed of 74 places in 220 ms
[2020-05-21 02:43:45] [INFO ] Deduced a trap composed of 57 places in 261 ms
[2020-05-21 02:43:45] [INFO ] Deduced a trap composed of 75 places in 200 ms
[2020-05-21 02:43:45] [INFO ] Deduced a trap composed of 59 places in 236 ms
[2020-05-21 02:43:46] [INFO ] Deduced a trap composed of 60 places in 253 ms
[2020-05-21 02:43:46] [INFO ] Deduced a trap composed of 67 places in 249 ms
[2020-05-21 02:43:46] [INFO ] Deduced a trap composed of 57 places in 237 ms
[2020-05-21 02:43:47] [INFO ] Deduced a trap composed of 54 places in 289 ms
[2020-05-21 02:43:47] [INFO ] Deduced a trap composed of 62 places in 297 ms
[2020-05-21 02:43:47] [INFO ] Deduced a trap composed of 62 places in 330 ms
[2020-05-21 02:43:48] [INFO ] Deduced a trap composed of 74 places in 235 ms
[2020-05-21 02:43:48] [INFO ] Deduced a trap composed of 62 places in 228 ms
[2020-05-21 02:43:48] [INFO ] Deduced a trap composed of 62 places in 187 ms
[2020-05-21 02:43:48] [INFO ] Deduced a trap composed of 74 places in 191 ms
[2020-05-21 02:43:49] [INFO ] Deduced a trap composed of 62 places in 184 ms
[2020-05-21 02:43:49] [INFO ] Deduced a trap composed of 60 places in 252 ms
[2020-05-21 02:43:50] [INFO ] Deduced a trap composed of 71 places in 240 ms
[2020-05-21 02:43:50] [INFO ] Deduced a trap composed of 33 places in 210 ms
[2020-05-21 02:43:50] [INFO ] Deduced a trap composed of 52 places in 203 ms
[2020-05-21 02:43:50] [INFO ] Deduced a trap composed of 53 places in 198 ms
[2020-05-21 02:43:51] [INFO ] Deduced a trap composed of 52 places in 210 ms
[2020-05-21 02:43:51] [INFO ] Deduced a trap composed of 45 places in 246 ms
[2020-05-21 02:43:51] [INFO ] Deduced a trap composed of 44 places in 253 ms
[2020-05-21 02:43:52] [INFO ] Deduced a trap composed of 22 places in 304 ms
[2020-05-21 02:43:52] [INFO ] Deduced a trap composed of 51 places in 337 ms
[2020-05-21 02:43:52] [INFO ] Deduced a trap composed of 76 places in 276 ms
[2020-05-21 02:43:53] [INFO ] Deduced a trap composed of 51 places in 247 ms
[2020-05-21 02:43:53] [INFO ] Deduced a trap composed of 32 places in 326 ms
[2020-05-21 02:43:53] [INFO ] Deduced a trap composed of 13 places in 244 ms
[2020-05-21 02:43:54] [INFO ] Deduced a trap composed of 22 places in 227 ms
[2020-05-21 02:43:54] [INFO ] Deduced a trap composed of 25 places in 257 ms
[2020-05-21 02:43:55] [INFO ] Deduced a trap composed of 25 places in 235 ms
[2020-05-21 02:43:55] [INFO ] Deduced a trap composed of 21 places in 259 ms
[2020-05-21 02:43:55] [INFO ] Deduced a trap composed of 21 places in 264 ms
[2020-05-21 02:43:56] [INFO ] Deduced a trap composed of 33 places in 239 ms
[2020-05-21 02:43:56] [INFO ] Deduced a trap composed of 12 places in 375 ms
[2020-05-21 02:43:56] [INFO ] Deduced a trap composed of 54 places in 183 ms
[2020-05-21 02:43:57] [INFO ] Deduced a trap composed of 47 places in 210 ms
[2020-05-21 02:43:57] [INFO ] Deduced a trap composed of 47 places in 178 ms
[2020-05-21 02:43:57] [INFO ] Deduced a trap composed of 53 places in 195 ms
[2020-05-21 02:43:57] [INFO ] Deduced a trap composed of 53 places in 224 ms
[2020-05-21 02:43:58] [INFO ] Deduced a trap composed of 62 places in 176 ms
[2020-05-21 02:43:58] [INFO ] Trap strengthening (SAT) tested/added 97/96 trap constraints in 36519 ms
[2020-05-21 02:43:58] [INFO ] Computed and/alt/rep : 1707/14259/1371 causal constraints in 103 ms.
[2020-05-21 02:44:05] [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 (=> (> t285 0) (and (> t73 0) (< o73 o285)))") while checking expression at index 2
Support contains 13 out of 611 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 611/611 places, 1715/1715 transitions.
Applied a total of 0 rules in 24 ms. Remains 611 /611 variables (removed 0) and now considering 1715/1715 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 611/611 places, 1715/1715 transitions.
Starting structural reductions, iteration 0 : 611/611 places, 1715/1715 transitions.
Applied a total of 0 rules in 21 ms. Remains 611 /611 variables (removed 0) and now considering 1715/1715 (removed 0) transitions.
[2020-05-21 02:44:05] [INFO ] Flow matrix only has 1379 transitions (discarded 336 similar events)
// Phase 1: matrix 1379 rows 611 cols
[2020-05-21 02:44:05] [INFO ] Computed 31 place invariants in 4 ms
[2020-05-21 02:44:06] [INFO ] Implicit Places using invariants in 1040 ms returned [595, 596, 597, 598, 599, 608, 609, 610]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1046 ms to find 8 implicit places.
[2020-05-21 02:44:06] [INFO ] Redundant transitions in 194 ms returned []
[2020-05-21 02:44:06] [INFO ] Flow matrix only has 1379 transitions (discarded 336 similar events)
// Phase 1: matrix 1379 rows 603 cols
[2020-05-21 02:44:06] [INFO ] Computed 23 place invariants in 9 ms
[2020-05-21 02:44:09] [INFO ] Dead Transitions using invariants and state equation in 2587 ms returned []
Starting structural reductions, iteration 1 : 603/611 places, 1715/1715 transitions.
Applied a total of 0 rules in 38 ms. Remains 603 /603 variables (removed 0) and now considering 1715/1715 (removed 0) transitions.
[2020-05-21 02:44:09] [INFO ] Redundant transitions in 65 ms returned []
[2020-05-21 02:44:09] [INFO ] Flow matrix only has 1379 transitions (discarded 336 similar events)
// Phase 1: matrix 1379 rows 603 cols
[2020-05-21 02:44:09] [INFO ] Computed 23 place invariants in 5 ms
[2020-05-21 02:44:11] [INFO ] Dead Transitions using invariants and state equation in 2550 ms returned []
Finished structural reductions, in 2 iterations. Remains : 603/611 places, 1715/1715 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2653 ms. (steps per millisecond=376 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 725 ms. (steps per millisecond=1379 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 622 ms. (steps per millisecond=1607 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 719 ms. (steps per millisecond=1390 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 8851491 steps, run timeout after 30001 ms. (steps per millisecond=295 ) properties seen :[0, 0, 0]
Probabilistic random walk after 8851491 steps, saw 983500 distinct states, run finished after 30001 ms. (steps per millisecond=295 ) properties seen :[0, 0, 0]
[2020-05-21 02:44:46] [INFO ] Flow matrix only has 1379 transitions (discarded 336 similar events)
// Phase 1: matrix 1379 rows 603 cols
[2020-05-21 02:44:46] [INFO ] Computed 23 place invariants in 4 ms
[2020-05-21 02:44:46] [INFO ] [Real]Absence check using 23 positive place invariants in 32 ms returned sat
[2020-05-21 02:44:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:44:47] [INFO ] [Real]Absence check using state equation in 1146 ms returned sat
[2020-05-21 02:44:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:44:48] [INFO ] [Nat]Absence check using 23 positive place invariants in 26 ms returned sat
[2020-05-21 02:44:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:44:49] [INFO ] [Nat]Absence check using state equation in 1221 ms returned sat
[2020-05-21 02:44:49] [INFO ] State equation strengthened by 546 read => feed constraints.
[2020-05-21 02:44:49] [INFO ] [Nat]Added 546 Read/Feed constraints in 87 ms returned sat
[2020-05-21 02:44:49] [INFO ] Deduced a trap composed of 12 places in 423 ms
[2020-05-21 02:44:50] [INFO ] Deduced a trap composed of 25 places in 363 ms
[2020-05-21 02:44:50] [INFO ] Deduced a trap composed of 32 places in 393 ms
[2020-05-21 02:44:51] [INFO ] Deduced a trap composed of 42 places in 446 ms
[2020-05-21 02:44:51] [INFO ] Deduced a trap composed of 22 places in 461 ms
[2020-05-21 02:44:52] [INFO ] Deduced a trap composed of 24 places in 464 ms
[2020-05-21 02:44:52] [INFO ] Deduced a trap composed of 32 places in 417 ms
[2020-05-21 02:44:53] [INFO ] Deduced a trap composed of 27 places in 446 ms
[2020-05-21 02:44:53] [INFO ] Deduced a trap composed of 22 places in 477 ms
[2020-05-21 02:44:54] [INFO ] Deduced a trap composed of 25 places in 469 ms
[2020-05-21 02:44:54] [INFO ] Deduced a trap composed of 12 places in 428 ms
[2020-05-21 02:44:55] [INFO ] Deduced a trap composed of 57 places in 402 ms
[2020-05-21 02:44:55] [INFO ] Deduced a trap composed of 57 places in 375 ms
[2020-05-21 02:44:56] [INFO ] Deduced a trap composed of 12 places in 401 ms
[2020-05-21 02:44:56] [INFO ] Deduced a trap composed of 70 places in 356 ms
[2020-05-21 02:44:56] [INFO ] Deduced a trap composed of 61 places in 365 ms
[2020-05-21 02:44:57] [INFO ] Deduced a trap composed of 33 places in 374 ms
[2020-05-21 02:44:57] [INFO ] Deduced a trap composed of 61 places in 389 ms
[2020-05-21 02:44:58] [INFO ] Deduced a trap composed of 62 places in 350 ms
[2020-05-21 02:44:58] [INFO ] Deduced a trap composed of 44 places in 386 ms
[2020-05-21 02:44:59] [INFO ] Deduced a trap composed of 60 places in 346 ms
[2020-05-21 02:44:59] [INFO ] Deduced a trap composed of 75 places in 383 ms
[2020-05-21 02:44:59] [INFO ] Deduced a trap composed of 55 places in 395 ms
[2020-05-21 02:45:00] [INFO ] Deduced a trap composed of 57 places in 405 ms
[2020-05-21 02:45:00] [INFO ] Deduced a trap composed of 60 places in 453 ms
[2020-05-21 02:45:01] [INFO ] Deduced a trap composed of 60 places in 415 ms
[2020-05-21 02:45:01] [INFO ] Deduced a trap composed of 60 places in 387 ms
[2020-05-21 02:45:02] [INFO ] Deduced a trap composed of 60 places in 376 ms
[2020-05-21 02:45:02] [INFO ] Deduced a trap composed of 61 places in 353 ms
[2020-05-21 02:45:03] [INFO ] Deduced a trap composed of 76 places in 389 ms
[2020-05-21 02:45:03] [INFO ] Deduced a trap composed of 51 places in 344 ms
[2020-05-21 02:45:03] [INFO ] Deduced a trap composed of 47 places in 348 ms
[2020-05-21 02:45:04] [INFO ] Deduced a trap composed of 42 places in 372 ms
[2020-05-21 02:45:04] [INFO ] Deduced a trap composed of 21 places in 396 ms
[2020-05-21 02:45:05] [INFO ] Deduced a trap composed of 73 places in 385 ms
[2020-05-21 02:45:05] [INFO ] Deduced a trap composed of 74 places in 377 ms
[2020-05-21 02:45:06] [INFO ] Deduced a trap composed of 59 places in 320 ms
[2020-05-21 02:45:06] [INFO ] Deduced a trap composed of 16 places in 387 ms
[2020-05-21 02:45:06] [INFO ] Deduced a trap composed of 14 places in 356 ms
[2020-05-21 02:45:07] [INFO ] Deduced a trap composed of 15 places in 403 ms
[2020-05-21 02:45:07] [INFO ] Deduced a trap composed of 12 places in 338 ms
[2020-05-21 02:45:08] [INFO ] Deduced a trap composed of 30 places in 393 ms
[2020-05-21 02:45:08] [INFO ] Deduced a trap composed of 33 places in 386 ms
[2020-05-21 02:45:09] [INFO ] Deduced a trap composed of 12 places in 401 ms
[2020-05-21 02:45:09] [INFO ] Deduced a trap composed of 12 places in 366 ms
[2020-05-21 02:45:09] [INFO ] Deduced a trap composed of 77 places in 343 ms
[2020-05-21 02:45:10] [INFO ] Deduced a trap composed of 59 places in 374 ms
[2020-05-21 02:45:10] [INFO ] Deduced a trap composed of 34 places in 401 ms
[2020-05-21 02:45:11] [INFO ] Deduced a trap composed of 33 places in 316 ms
[2020-05-21 02:45:11] [INFO ] Deduced a trap composed of 67 places in 293 ms
[2020-05-21 02:45:11] [INFO ] Deduced a trap composed of 59 places in 238 ms
[2020-05-21 02:45:12] [INFO ] Deduced a trap composed of 64 places in 346 ms
[2020-05-21 02:45:12] [INFO ] Deduced a trap composed of 14 places in 330 ms
[2020-05-21 02:45:13] [INFO ] Deduced a trap composed of 49 places in 331 ms
[2020-05-21 02:45:13] [INFO ] Deduced a trap composed of 28 places in 337 ms
[2020-05-21 02:45:13] [INFO ] Deduced a trap composed of 56 places in 290 ms
[2020-05-21 02:45:14] [INFO ] Deduced a trap composed of 26 places in 356 ms
[2020-05-21 02:45:14] [INFO ] Deduced a trap composed of 11 places in 347 ms
[2020-05-21 02:45:14] [INFO ] Deduced a trap composed of 50 places in 234 ms
[2020-05-21 02:45:15] [INFO ] Deduced a trap composed of 76 places in 209 ms
[2020-05-21 02:45:15] [INFO ] Deduced a trap composed of 59 places in 229 ms
[2020-05-21 02:45:15] [INFO ] Deduced a trap composed of 58 places in 219 ms
[2020-05-21 02:45:16] [INFO ] Deduced a trap composed of 75 places in 194 ms
[2020-05-21 02:45:16] [INFO ] Deduced a trap composed of 76 places in 195 ms
[2020-05-21 02:45:16] [INFO ] Deduced a trap composed of 32 places in 230 ms
[2020-05-21 02:45:16] [INFO ] Deduced a trap composed of 33 places in 224 ms
[2020-05-21 02:45:17] [INFO ] Deduced a trap composed of 26 places in 284 ms
[2020-05-21 02:45:17] [INFO ] Deduced a trap composed of 32 places in 173 ms
[2020-05-21 02:45:18] [INFO ] Deduced a trap composed of 26 places in 302 ms
[2020-05-21 02:45:18] [INFO ] Deduced a trap composed of 16 places in 267 ms
[2020-05-21 02:45:18] [INFO ] Deduced a trap composed of 37 places in 230 ms
[2020-05-21 02:45:19] [INFO ] Deduced a trap composed of 14 places in 296 ms
[2020-05-21 02:45:19] [INFO ] Deduced a trap composed of 13 places in 291 ms
[2020-05-21 02:45:19] [INFO ] Deduced a trap composed of 13 places in 287 ms
[2020-05-21 02:45:20] [INFO ] Deduced a trap composed of 51 places in 317 ms
[2020-05-21 02:45:20] [INFO ] Deduced a trap composed of 22 places in 236 ms
[2020-05-21 02:45:20] [INFO ] Deduced a trap composed of 63 places in 183 ms
[2020-05-21 02:45:20] [INFO ] Trap strengthening (SAT) tested/added 78/77 trap constraints in 31395 ms
[2020-05-21 02:45:20] [INFO ] Computed and/alt/rep : 1707/14259/1371 causal constraints in 105 ms.
[2020-05-21 02:45: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 (=> (> t444 0) (and (or (and (> t102 0) (< o102 o444)) (and (> t1359 0) (< o1359 o444))) (or (and (> t345 0) (< o345 o444)) (and (> t346 0) (< o346 o444)) (and (> t347 0) (< o347 o444)) (and (> t348 0) (< o348 o444)) (and (> t349 0) (< o349 o444)) (and (> t350 0) (< o350 o444)) (and (> t352 0) (< o352 o444)))))") while checking expression at index 0
[2020-05-21 02:45:33] [INFO ] [Real]Absence check using 23 positive place invariants in 30 ms returned sat
[2020-05-21 02:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:45:34] [INFO ] [Real]Absence check using state equation in 1167 ms returned sat
[2020-05-21 02:45:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:45:34] [INFO ] [Nat]Absence check using 23 positive place invariants in 35 ms returned sat
[2020-05-21 02:45:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:45:35] [INFO ] [Nat]Absence check using state equation in 1180 ms returned sat
[2020-05-21 02:45:35] [INFO ] [Nat]Added 546 Read/Feed constraints in 93 ms returned sat
[2020-05-21 02:45:36] [INFO ] Deduced a trap composed of 12 places in 418 ms
[2020-05-21 02:45:36] [INFO ] Deduced a trap composed of 12 places in 370 ms
[2020-05-21 02:45:36] [INFO ] Deduced a trap composed of 12 places in 423 ms
[2020-05-21 02:45:37] [INFO ] Deduced a trap composed of 12 places in 447 ms
[2020-05-21 02:45:38] [INFO ] Deduced a trap composed of 12 places in 524 ms
[2020-05-21 02:45:38] [INFO ] Deduced a trap composed of 12 places in 411 ms
[2020-05-21 02:45:39] [INFO ] Deduced a trap composed of 33 places in 450 ms
[2020-05-21 02:45:39] [INFO ] Deduced a trap composed of 27 places in 450 ms
[2020-05-21 02:45:40] [INFO ] Deduced a trap composed of 27 places in 464 ms
[2020-05-21 02:45:40] [INFO ] Deduced a trap composed of 27 places in 368 ms
[2020-05-21 02:45:40] [INFO ] Deduced a trap composed of 73 places in 337 ms
[2020-05-21 02:45:41] [INFO ] Deduced a trap composed of 40 places in 360 ms
[2020-05-21 02:45:41] [INFO ] Deduced a trap composed of 12 places in 337 ms
[2020-05-21 02:45:42] [INFO ] Deduced a trap composed of 36 places in 361 ms
[2020-05-21 02:45:42] [INFO ] Deduced a trap composed of 11 places in 325 ms
[2020-05-21 02:45:42] [INFO ] Deduced a trap composed of 33 places in 325 ms
[2020-05-21 02:45:43] [INFO ] Deduced a trap composed of 76 places in 306 ms
[2020-05-21 02:45:43] [INFO ] Deduced a trap composed of 30 places in 339 ms
[2020-05-21 02:45:44] [INFO ] Deduced a trap composed of 32 places in 370 ms
[2020-05-21 02:45:44] [INFO ] Deduced a trap composed of 79 places in 349 ms
[2020-05-21 02:45:44] [INFO ] Deduced a trap composed of 21 places in 317 ms
[2020-05-21 02:45:45] [INFO ] Deduced a trap composed of 31 places in 329 ms
[2020-05-21 02:45:45] [INFO ] Deduced a trap composed of 37 places in 301 ms
[2020-05-21 02:45:46] [INFO ] Deduced a trap composed of 23 places in 378 ms
[2020-05-21 02:45:46] [INFO ] Deduced a trap composed of 50 places in 312 ms
[2020-05-21 02:45:46] [INFO ] Deduced a trap composed of 50 places in 276 ms
[2020-05-21 02:45:47] [INFO ] Deduced a trap composed of 49 places in 314 ms
[2020-05-21 02:45:47] [INFO ] Deduced a trap composed of 50 places in 387 ms
[2020-05-21 02:45:47] [INFO ] Deduced a trap composed of 59 places in 293 ms
[2020-05-21 02:45:48] [INFO ] Deduced a trap composed of 62 places in 305 ms
[2020-05-21 02:45:48] [INFO ] Deduced a trap composed of 56 places in 304 ms
[2020-05-21 02:45:49] [INFO ] Deduced a trap composed of 63 places in 365 ms
[2020-05-21 02:45:49] [INFO ] Deduced a trap composed of 66 places in 343 ms
[2020-05-21 02:45:49] [INFO ] Deduced a trap composed of 22 places in 354 ms
[2020-05-21 02:45:50] [INFO ] Deduced a trap composed of 48 places in 305 ms
[2020-05-21 02:45:50] [INFO ] Deduced a trap composed of 21 places in 352 ms
[2020-05-21 02:45:51] [INFO ] Deduced a trap composed of 22 places in 368 ms
[2020-05-21 02:45:51] [INFO ] Deduced a trap composed of 24 places in 341 ms
[2020-05-21 02:45:51] [INFO ] Deduced a trap composed of 21 places in 316 ms
[2020-05-21 02:45:52] [INFO ] Deduced a trap composed of 54 places in 283 ms
[2020-05-21 02:45:52] [INFO ] Deduced a trap composed of 76 places in 309 ms
[2020-05-21 02:45:52] [INFO ] Deduced a trap composed of 59 places in 297 ms
[2020-05-21 02:45:53] [INFO ] Deduced a trap composed of 59 places in 296 ms
[2020-05-21 02:45:53] [INFO ] Deduced a trap composed of 57 places in 267 ms
[2020-05-21 02:45:53] [INFO ] Deduced a trap composed of 45 places in 264 ms
[2020-05-21 02:45:54] [INFO ] Deduced a trap composed of 65 places in 275 ms
[2020-05-21 02:45:54] [INFO ] Deduced a trap composed of 74 places in 303 ms
[2020-05-21 02:45:55] [INFO ] Deduced a trap composed of 40 places in 327 ms
[2020-05-21 02:45:55] [INFO ] Deduced a trap composed of 40 places in 351 ms
[2020-05-21 02:45:55] [INFO ] Deduced a trap composed of 47 places in 345 ms
[2020-05-21 02:45:56] [INFO ] Deduced a trap composed of 40 places in 306 ms
[2020-05-21 02:45:56] [INFO ] Deduced a trap composed of 40 places in 314 ms
[2020-05-21 02:45:57] [INFO ] Deduced a trap composed of 47 places in 365 ms
[2020-05-21 02:45:57] [INFO ] Deduced a trap composed of 58 places in 321 ms
[2020-05-21 02:45:57] [INFO ] Deduced a trap composed of 67 places in 308 ms
[2020-05-21 02:45:58] [INFO ] Deduced a trap composed of 65 places in 260 ms
[2020-05-21 02:45:58] [INFO ] Deduced a trap composed of 56 places in 231 ms
[2020-05-21 02:45:58] [INFO ] Deduced a trap composed of 67 places in 250 ms
[2020-05-21 02:45:59] [INFO ] Deduced a trap composed of 56 places in 308 ms
[2020-05-21 02:45:59] [INFO ] Deduced a trap composed of 56 places in 277 ms
[2020-05-21 02:45:59] [INFO ] Deduced a trap composed of 49 places in 243 ms
[2020-05-21 02:46:00] [INFO ] Deduced a trap composed of 75 places in 264 ms
[2020-05-21 02:46:00] [INFO ] Deduced a trap composed of 74 places in 238 ms
[2020-05-21 02:46:00] [INFO ] Deduced a trap composed of 74 places in 224 ms
[2020-05-21 02:46:00] [INFO ] Deduced a trap composed of 65 places in 204 ms
[2020-05-21 02:46:01] [INFO ] Deduced a trap composed of 74 places in 239 ms
[2020-05-21 02:46:01] [INFO ] Trap strengthening (SAT) tested/added 67/66 trap constraints in 25686 ms
[2020-05-21 02:46:01] [INFO ] Computed and/alt/rep : 1707/14259/1371 causal constraints in 105 ms.
[2020-05-21 02:46:19] [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: Broken pipe (=> (> t747 0) (and (> t906 0) (< o906 o747)))") while checking expression at index 1
[2020-05-21 02:46:19] [INFO ] [Real]Absence check using 23 positive place invariants in 23 ms returned sat
[2020-05-21 02:46:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:46:20] [INFO ] [Real]Absence check using state equation in 1210 ms returned sat
[2020-05-21 02:46:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:46:20] [INFO ] [Nat]Absence check using 23 positive place invariants in 37 ms returned sat
[2020-05-21 02:46:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:46:21] [INFO ] [Nat]Absence check using state equation in 1181 ms returned sat
[2020-05-21 02:46:21] [INFO ] [Nat]Added 546 Read/Feed constraints in 83 ms returned sat
[2020-05-21 02:46:22] [INFO ] Deduced a trap composed of 32 places in 398 ms
[2020-05-21 02:46:22] [INFO ] Deduced a trap composed of 44 places in 353 ms
[2020-05-21 02:46:23] [INFO ] Deduced a trap composed of 46 places in 413 ms
[2020-05-21 02:46:23] [INFO ] Deduced a trap composed of 69 places in 393 ms
[2020-05-21 02:46:24] [INFO ] Deduced a trap composed of 12 places in 421 ms
[2020-05-21 02:46:24] [INFO ] Deduced a trap composed of 11 places in 435 ms
[2020-05-21 02:46:25] [INFO ] Deduced a trap composed of 11 places in 344 ms
[2020-05-21 02:46:25] [INFO ] Deduced a trap composed of 11 places in 336 ms
[2020-05-21 02:46:25] [INFO ] Deduced a trap composed of 11 places in 352 ms
[2020-05-21 02:46:26] [INFO ] Deduced a trap composed of 11 places in 323 ms
[2020-05-21 02:46:26] [INFO ] Deduced a trap composed of 25 places in 369 ms
[2020-05-21 02:46:27] [INFO ] Deduced a trap composed of 63 places in 415 ms
[2020-05-21 02:46:27] [INFO ] Deduced a trap composed of 43 places in 394 ms
[2020-05-21 02:46:28] [INFO ] Deduced a trap composed of 45 places in 394 ms
[2020-05-21 02:46:28] [INFO ] Deduced a trap composed of 63 places in 354 ms
[2020-05-21 02:46:28] [INFO ] Deduced a trap composed of 22 places in 354 ms
[2020-05-21 02:46:29] [INFO ] Deduced a trap composed of 37 places in 407 ms
[2020-05-21 02:46:29] [INFO ] Deduced a trap composed of 33 places in 365 ms
[2020-05-21 02:46:30] [INFO ] Deduced a trap composed of 29 places in 397 ms
[2020-05-21 02:46:30] [INFO ] Deduced a trap composed of 67 places in 405 ms
[2020-05-21 02:46:31] [INFO ] Deduced a trap composed of 20 places in 371 ms
[2020-05-21 02:46:31] [INFO ] Deduced a trap composed of 25 places in 408 ms
[2020-05-21 02:46:32] [INFO ] Deduced a trap composed of 30 places in 393 ms
[2020-05-21 02:46:32] [INFO ] Deduced a trap composed of 29 places in 368 ms
[2020-05-21 02:46:32] [INFO ] Deduced a trap composed of 29 places in 376 ms
[2020-05-21 02:46:33] [INFO ] Deduced a trap composed of 33 places in 379 ms
[2020-05-21 02:46:33] [INFO ] Deduced a trap composed of 20 places in 347 ms
[2020-05-21 02:46:34] [INFO ] Deduced a trap composed of 22 places in 357 ms
[2020-05-21 02:46:34] [INFO ] Deduced a trap composed of 35 places in 288 ms
[2020-05-21 02:46:34] [INFO ] Deduced a trap composed of 33 places in 308 ms
[2020-05-21 02:46:35] [INFO ] Deduced a trap composed of 11 places in 345 ms
[2020-05-21 02:46:35] [INFO ] Deduced a trap composed of 43 places in 346 ms
[2020-05-21 02:46:36] [INFO ] Deduced a trap composed of 59 places in 388 ms
[2020-05-21 02:46:36] [INFO ] Deduced a trap composed of 11 places in 401 ms
[2020-05-21 02:46:37] [INFO ] Deduced a trap composed of 40 places in 337 ms
[2020-05-21 02:46:37] [INFO ] Deduced a trap composed of 71 places in 360 ms
[2020-05-21 02:46:37] [INFO ] Deduced a trap composed of 20 places in 305 ms
[2020-05-21 02:46:38] [INFO ] Deduced a trap composed of 20 places in 333 ms
[2020-05-21 02:46:38] [INFO ] Deduced a trap composed of 60 places in 277 ms
[2020-05-21 02:46:38] [INFO ] Deduced a trap composed of 57 places in 236 ms
[2020-05-21 02:46:39] [INFO ] Deduced a trap composed of 51 places in 172 ms
[2020-05-21 02:46:39] [INFO ] Deduced a trap composed of 54 places in 253 ms
[2020-05-21 02:46:39] [INFO ] Deduced a trap composed of 56 places in 309 ms
[2020-05-21 02:46:40] [INFO ] Deduced a trap composed of 62 places in 337 ms
[2020-05-21 02:46:40] [INFO ] Deduced a trap composed of 62 places in 335 ms
[2020-05-21 02:46:41] [INFO ] Deduced a trap composed of 62 places in 312 ms
[2020-05-21 02:46:41] [INFO ] Deduced a trap composed of 62 places in 342 ms
[2020-05-21 02:46:41] [INFO ] Deduced a trap composed of 86 places in 303 ms
[2020-05-21 02:46:42] [INFO ] Deduced a trap composed of 62 places in 290 ms
[2020-05-21 02:46:42] [INFO ] Deduced a trap composed of 55 places in 380 ms
[2020-05-21 02:46:42] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 20642 ms
[2020-05-21 02:46:42] [INFO ] Computed and/alt/rep : 1707/14259/1371 causal constraints in 66 ms.
[2020-05-21 02:47:02] [INFO ] Added : 615 causal constraints over 123 iterations in 20267 ms.(timeout) Result :sat
[2020-05-21 02:47:03] [INFO ] Deduced a trap composed of 20 places in 400 ms
[2020-05-21 02:47:03] [INFO ] Deduced a trap composed of 32 places in 322 ms
[2020-05-21 02:47:04] [INFO ] Deduced a trap composed of 38 places in 343 ms
[2020-05-21 02:47:05] [INFO ] Deduced a trap composed of 31 places in 352 ms
[2020-05-21 02:47:05] [INFO ] Deduced a trap composed of 43 places in 360 ms
[2020-05-21 02:47:05] [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 (> (+ s46 s59 s66 s72 s339 s341 s347 s349 s354 s356 s362 s364 s366 s372 s401 s417 s423 s425 s431 s432 s438 s457 s461 s467 s478 s480 s486 s488 s497 s507 s513 s515 s521 s525 s539 s550 s558 s567 s577 s584 s589 s600 s602) 0)") while checking expression at index 2
Support contains 13 out of 603 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 603/603 places, 1715/1715 transitions.
Applied a total of 0 rules in 41 ms. Remains 603 /603 variables (removed 0) and now considering 1715/1715 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 603/603 places, 1715/1715 transitions.
Starting structural reductions, iteration 0 : 603/603 places, 1715/1715 transitions.
Applied a total of 0 rules in 32 ms. Remains 603 /603 variables (removed 0) and now considering 1715/1715 (removed 0) transitions.
[2020-05-21 02:47:05] [INFO ] Flow matrix only has 1379 transitions (discarded 336 similar events)
// Phase 1: matrix 1379 rows 603 cols
[2020-05-21 02:47:05] [INFO ] Computed 23 place invariants in 5 ms
[2020-05-21 02:47:06] [INFO ] Implicit Places using invariants in 1023 ms returned []
[2020-05-21 02:47:06] [INFO ] Flow matrix only has 1379 transitions (discarded 336 similar events)
// Phase 1: matrix 1379 rows 603 cols
[2020-05-21 02:47:06] [INFO ] Computed 23 place invariants in 9 ms
[2020-05-21 02:47:08] [INFO ] State equation strengthened by 546 read => feed constraints.
[2020-05-21 02:47:17] [INFO ] Implicit Places using invariants and state equation in 10677 ms returned []
Implicit Place search using SMT with State Equation took 11701 ms to find 0 implicit places.
[2020-05-21 02:47:17] [INFO ] Redundant transitions in 30 ms returned []
[2020-05-21 02:47:17] [INFO ] Flow matrix only has 1379 transitions (discarded 336 similar events)
// Phase 1: matrix 1379 rows 603 cols
[2020-05-21 02:47:17] [INFO ] Computed 23 place invariants in 4 ms
[2020-05-21 02:47:20] [INFO ] Dead Transitions using invariants and state equation in 2696 ms returned []
Finished structural reductions, in 1 iterations. Remains : 603/603 places, 1715/1715 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 261 ms. (steps per millisecond=383 ) properties seen :[0, 0, 0]
[2020-05-21 02:47:20] [INFO ] Flow matrix only has 1379 transitions (discarded 336 similar events)
// Phase 1: matrix 1379 rows 603 cols
[2020-05-21 02:47:20] [INFO ] Computed 23 place invariants in 4 ms
[2020-05-21 02:47:20] [INFO ] [Real]Absence check using 23 positive place invariants in 31 ms returned sat
[2020-05-21 02:47:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:47:21] [INFO ] [Real]Absence check using state equation in 1173 ms returned sat
[2020-05-21 02:47:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:47:21] [INFO ] [Nat]Absence check using 23 positive place invariants in 27 ms returned sat
[2020-05-21 02:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:47:22] [INFO ] [Nat]Absence check using state equation in 1109 ms returned sat
[2020-05-21 02:47:22] [INFO ] State equation strengthened by 546 read => feed constraints.
[2020-05-21 02:47:23] [INFO ] [Nat]Added 546 Read/Feed constraints in 105 ms returned sat
[2020-05-21 02:47:23] [INFO ] Deduced a trap composed of 12 places in 430 ms
[2020-05-21 02:47:24] [INFO ] Deduced a trap composed of 25 places in 432 ms
[2020-05-21 02:47:24] [INFO ] Deduced a trap composed of 32 places in 428 ms
[2020-05-21 02:47:25] [INFO ] Deduced a trap composed of 42 places in 470 ms
[2020-05-21 02:47:25] [INFO ] Deduced a trap composed of 22 places in 374 ms
[2020-05-21 02:47:25] [INFO ] Deduced a trap composed of 24 places in 458 ms
[2020-05-21 02:47:26] [INFO ] Deduced a trap composed of 32 places in 336 ms
[2020-05-21 02:47:26] [INFO ] Deduced a trap composed of 27 places in 371 ms
[2020-05-21 02:47:27] [INFO ] Deduced a trap composed of 22 places in 406 ms
[2020-05-21 02:47:27] [INFO ] Deduced a trap composed of 25 places in 440 ms
[2020-05-21 02:47:28] [INFO ] Deduced a trap composed of 12 places in 439 ms
[2020-05-21 02:47:28] [INFO ] Deduced a trap composed of 57 places in 452 ms
[2020-05-21 02:47:29] [INFO ] Deduced a trap composed of 57 places in 394 ms
[2020-05-21 02:47:29] [INFO ] Deduced a trap composed of 12 places in 407 ms
[2020-05-21 02:47:30] [INFO ] Deduced a trap composed of 70 places in 391 ms
[2020-05-21 02:47:30] [INFO ] Deduced a trap composed of 61 places in 338 ms
[2020-05-21 02:47:30] [INFO ] Deduced a trap composed of 33 places in 394 ms
[2020-05-21 02:47:31] [INFO ] Deduced a trap composed of 61 places in 441 ms
[2020-05-21 02:47:31] [INFO ] Deduced a trap composed of 62 places in 419 ms
[2020-05-21 02:47:32] [INFO ] Deduced a trap composed of 44 places in 382 ms
[2020-05-21 02:47:32] [INFO ] Deduced a trap composed of 60 places in 401 ms
[2020-05-21 02:47:33] [INFO ] Deduced a trap composed of 75 places in 357 ms
[2020-05-21 02:47:33] [INFO ] Deduced a trap composed of 55 places in 366 ms
[2020-05-21 02:47:34] [INFO ] Deduced a trap composed of 57 places in 387 ms
[2020-05-21 02:47:34] [INFO ] Deduced a trap composed of 60 places in 373 ms
[2020-05-21 02:47:35] [INFO ] Deduced a trap composed of 60 places in 387 ms
[2020-05-21 02:47:35] [INFO ] Deduced a trap composed of 60 places in 452 ms
[2020-05-21 02:47:36] [INFO ] Deduced a trap composed of 60 places in 402 ms
[2020-05-21 02:47:36] [INFO ] Deduced a trap composed of 61 places in 362 ms
[2020-05-21 02:47:36] [INFO ] Deduced a trap composed of 76 places in 446 ms
[2020-05-21 02:47:37] [INFO ] Deduced a trap composed of 51 places in 413 ms
[2020-05-21 02:47:37] [INFO ] Deduced a trap composed of 47 places in 396 ms
[2020-05-21 02:47:38] [INFO ] Deduced a trap composed of 42 places in 396 ms
[2020-05-21 02:47:38] [INFO ] Deduced a trap composed of 21 places in 430 ms
[2020-05-21 02:47:39] [INFO ] Deduced a trap composed of 73 places in 442 ms
[2020-05-21 02:47:39] [INFO ] Deduced a trap composed of 74 places in 422 ms
[2020-05-21 02:47:40] [INFO ] Deduced a trap composed of 59 places in 371 ms
[2020-05-21 02:47:40] [INFO ] Deduced a trap composed of 16 places in 423 ms
[2020-05-21 02:47:41] [INFO ] Deduced a trap composed of 14 places in 388 ms
[2020-05-21 02:47:41] [INFO ] Deduced a trap composed of 15 places in 401 ms
[2020-05-21 02:47:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 02:47:42] [INFO ] Deduced a trap composed of 2 places in 567 ms
[2020-05-21 02:47:42] [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 (> (+ s455 s465) 0)") while checking expression at index 0
[2020-05-21 02:47:42] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2020-05-21 02:47:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:47:43] [INFO ] [Real]Absence check using state equation in 1264 ms returned sat
[2020-05-21 02:47:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:47:43] [INFO ] [Nat]Absence check using 23 positive place invariants in 31 ms returned sat
[2020-05-21 02:47:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:47:44] [INFO ] [Nat]Absence check using state equation in 1119 ms returned sat
[2020-05-21 02:47:45] [INFO ] [Nat]Added 546 Read/Feed constraints in 92 ms returned sat
[2020-05-21 02:47:45] [INFO ] Deduced a trap composed of 12 places in 423 ms
[2020-05-21 02:47:45] [INFO ] Deduced a trap composed of 12 places in 399 ms
[2020-05-21 02:47:46] [INFO ] Deduced a trap composed of 12 places in 429 ms
[2020-05-21 02:47:46] [INFO ] Deduced a trap composed of 12 places in 478 ms
[2020-05-21 02:47:47] [INFO ] Deduced a trap composed of 12 places in 450 ms
[2020-05-21 02:47:47] [INFO ] Deduced a trap composed of 12 places in 397 ms
[2020-05-21 02:47:48] [INFO ] Deduced a trap composed of 33 places in 421 ms
[2020-05-21 02:47:48] [INFO ] Deduced a trap composed of 27 places in 460 ms
[2020-05-21 02:47:49] [INFO ] Deduced a trap composed of 27 places in 466 ms
[2020-05-21 02:47:49] [INFO ] Deduced a trap composed of 27 places in 430 ms
[2020-05-21 02:47:50] [INFO ] Deduced a trap composed of 73 places in 351 ms
[2020-05-21 02:47:50] [INFO ] Deduced a trap composed of 40 places in 353 ms
[2020-05-21 02:47:51] [INFO ] Deduced a trap composed of 12 places in 302 ms
[2020-05-21 02:47:51] [INFO ] Deduced a trap composed of 36 places in 336 ms
[2020-05-21 02:47:51] [INFO ] Deduced a trap composed of 11 places in 370 ms
[2020-05-21 02:47:52] [INFO ] Deduced a trap composed of 33 places in 338 ms
[2020-05-21 02:47:52] [INFO ] Deduced a trap composed of 76 places in 361 ms
[2020-05-21 02:47:53] [INFO ] Deduced a trap composed of 30 places in 345 ms
[2020-05-21 02:47:53] [INFO ] Deduced a trap composed of 32 places in 348 ms
[2020-05-21 02:47:54] [INFO ] Deduced a trap composed of 79 places in 376 ms
[2020-05-21 02:47:54] [INFO ] Deduced a trap composed of 21 places in 366 ms
[2020-05-21 02:47:54] [INFO ] Deduced a trap composed of 31 places in 327 ms
[2020-05-21 02:47:55] [INFO ] Deduced a trap composed of 37 places in 287 ms
[2020-05-21 02:47:55] [INFO ] Deduced a trap composed of 23 places in 323 ms
[2020-05-21 02:47:55] [INFO ] Deduced a trap composed of 50 places in 295 ms
[2020-05-21 02:47:56] [INFO ] Deduced a trap composed of 50 places in 322 ms
[2020-05-21 02:47:56] [INFO ] Deduced a trap composed of 49 places in 334 ms
[2020-05-21 02:47:57] [INFO ] Deduced a trap composed of 50 places in 299 ms
[2020-05-21 02:47:57] [INFO ] Deduced a trap composed of 59 places in 332 ms
[2020-05-21 02:47:57] [INFO ] Deduced a trap composed of 62 places in 315 ms
[2020-05-21 02:47:58] [INFO ] Deduced a trap composed of 56 places in 302 ms
[2020-05-21 02:47:58] [INFO ] Deduced a trap composed of 63 places in 273 ms
[2020-05-21 02:47:58] [INFO ] Deduced a trap composed of 66 places in 337 ms
[2020-05-21 02:47:59] [INFO ] Deduced a trap composed of 22 places in 296 ms
[2020-05-21 02:47:59] [INFO ] Deduced a trap composed of 48 places in 352 ms
[2020-05-21 02:48:00] [INFO ] Deduced a trap composed of 21 places in 358 ms
[2020-05-21 02:48:00] [INFO ] Deduced a trap composed of 22 places in 315 ms
[2020-05-21 02:48:00] [INFO ] Deduced a trap composed of 24 places in 349 ms
[2020-05-21 02:48:01] [INFO ] Deduced a trap composed of 21 places in 370 ms
[2020-05-21 02:48:01] [INFO ] Deduced a trap composed of 54 places in 292 ms
[2020-05-21 02:48:01] [INFO ] Deduced a trap composed of 76 places in 271 ms
[2020-05-21 02:48:02] [INFO ] Deduced a trap composed of 59 places in 283 ms
[2020-05-21 02:48:02] [INFO ] Deduced a trap composed of 59 places in 265 ms
[2020-05-21 02:48:02] [INFO ] Deduced a trap composed of 57 places in 231 ms
[2020-05-21 02:48:03] [INFO ] Deduced a trap composed of 45 places in 271 ms
[2020-05-21 02:48:03] [INFO ] Deduced a trap composed of 65 places in 253 ms
[2020-05-21 02:48:03] [INFO ] Deduced a trap composed of 74 places in 372 ms
[2020-05-21 02:48:03] [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 (> (+ s6 s13 s20 s25 s32 s39 s49 s58 s65 s73 s80 s84 s91 s101 s106 s112 s119 s125 s132 s140 s145 s151 s158 s171 s178 s184 s191 s197 s206 s210 s217 s222 s231 s236 s243 s252 s259 s265 s272 s295 s302 s329 s340 s348 s357 s379 s388 s396 s401 s409 s415 s422 s430 s439 s447 s449 s458 s470 s474 s481 s497 s505 s512 s520 s527 s536 s541 s560 s569 s574 s575 s581 s592 s595) 0)") while checking expression at index 1
[2020-05-21 02:48:04] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2020-05-21 02:48:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:48:05] [INFO ] [Real]Absence check using state equation in 1159 ms returned sat
[2020-05-21 02:48:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:48:05] [INFO ] [Nat]Absence check using 23 positive place invariants in 37 ms returned sat
[2020-05-21 02:48:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:48:06] [INFO ] [Nat]Absence check using state equation in 1194 ms returned sat
[2020-05-21 02:48:06] [INFO ] [Nat]Added 546 Read/Feed constraints in 92 ms returned sat
[2020-05-21 02:48:07] [INFO ] Deduced a trap composed of 32 places in 394 ms
[2020-05-21 02:48:07] [INFO ] Deduced a trap composed of 44 places in 370 ms
[2020-05-21 02:48:07] [INFO ] Deduced a trap composed of 46 places in 387 ms
[2020-05-21 02:48:08] [INFO ] Deduced a trap composed of 69 places in 327 ms
[2020-05-21 02:48:08] [INFO ] Deduced a trap composed of 12 places in 421 ms
[2020-05-21 02:48:09] [INFO ] Deduced a trap composed of 11 places in 395 ms
[2020-05-21 02:48:09] [INFO ] Deduced a trap composed of 11 places in 380 ms
[2020-05-21 02:48:10] [INFO ] Deduced a trap composed of 11 places in 403 ms
[2020-05-21 02:48:10] [INFO ] Deduced a trap composed of 11 places in 413 ms
[2020-05-21 02:48:11] [INFO ] Deduced a trap composed of 11 places in 370 ms
[2020-05-21 02:48:11] [INFO ] Deduced a trap composed of 25 places in 374 ms
[2020-05-21 02:48:11] [INFO ] Deduced a trap composed of 63 places in 404 ms
[2020-05-21 02:48:12] [INFO ] Deduced a trap composed of 43 places in 399 ms
[2020-05-21 02:48:12] [INFO ] Deduced a trap composed of 45 places in 426 ms
[2020-05-21 02:48:13] [INFO ] Deduced a trap composed of 63 places in 401 ms
[2020-05-21 02:48:13] [INFO ] Deduced a trap composed of 22 places in 403 ms
[2020-05-21 02:48:14] [INFO ] Deduced a trap composed of 37 places in 358 ms
[2020-05-21 02:48:14] [INFO ] Deduced a trap composed of 33 places in 342 ms
[2020-05-21 02:48:15] [INFO ] Deduced a trap composed of 29 places in 357 ms
[2020-05-21 02:48:15] [INFO ] Deduced a trap composed of 67 places in 356 ms
[2020-05-21 02:48:15] [INFO ] Deduced a trap composed of 20 places in 395 ms
[2020-05-21 02:48:16] [INFO ] Deduced a trap composed of 25 places in 401 ms
[2020-05-21 02:48:16] [INFO ] Deduced a trap composed of 30 places in 374 ms
[2020-05-21 02:48:17] [INFO ] Deduced a trap composed of 29 places in 407 ms
[2020-05-21 02:48:17] [INFO ] Deduced a trap composed of 29 places in 369 ms
[2020-05-21 02:48:18] [INFO ] Deduced a trap composed of 33 places in 402 ms
[2020-05-21 02:48:18] [INFO ] Deduced a trap composed of 20 places in 385 ms
[2020-05-21 02:48:19] [INFO ] Deduced a trap composed of 22 places in 377 ms
[2020-05-21 02:48:19] [INFO ] Deduced a trap composed of 35 places in 329 ms
[2020-05-21 02:48:19] [INFO ] Deduced a trap composed of 33 places in 330 ms
[2020-05-21 02:48:20] [INFO ] Deduced a trap composed of 11 places in 384 ms
[2020-05-21 02:48:20] [INFO ] Deduced a trap composed of 43 places in 374 ms
[2020-05-21 02:48:21] [INFO ] Deduced a trap composed of 59 places in 372 ms
[2020-05-21 02:48:21] [INFO ] Deduced a trap composed of 11 places in 341 ms
[2020-05-21 02:48:21] [INFO ] Deduced a trap composed of 40 places in 249 ms
[2020-05-21 02:48:22] [INFO ] Deduced a trap composed of 71 places in 270 ms
[2020-05-21 02:48:22] [INFO ] Deduced a trap composed of 20 places in 273 ms
[2020-05-21 02:48:22] [INFO ] Deduced a trap composed of 20 places in 307 ms
[2020-05-21 02:48:23] [INFO ] Deduced a trap composed of 60 places in 201 ms
[2020-05-21 02:48:23] [INFO ] Deduced a trap composed of 57 places in 204 ms
[2020-05-21 02:48:23] [INFO ] Deduced a trap composed of 51 places in 206 ms
[2020-05-21 02:48:23] [INFO ] Deduced a trap composed of 54 places in 266 ms
[2020-05-21 02:48:24] [INFO ] Deduced a trap composed of 56 places in 254 ms
[2020-05-21 02:48:24] [INFO ] Deduced a trap composed of 62 places in 257 ms
[2020-05-21 02:48:24] [INFO ] Deduced a trap composed of 62 places in 270 ms
[2020-05-21 02:48:25] [INFO ] Deduced a trap composed of 62 places in 263 ms
[2020-05-21 02:48:25] [INFO ] Deduced a trap composed of 62 places in 252 ms
[2020-05-21 02:48:25] [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 s18 s27 s34 s41 s57 s64 s70 s77 s87 s93 s107 s109 s116 s124 s131 s147 s154 s161 s168 s175 s182 s190 s198 s213 s220 s224 s239 s246 s250 s257 s264 s271 s297 s343 s351 s358 s385 s393 s404 s411 s421 s429 s436 s444 s459 s482 s494 s502 s511 s519 s524 s529 s542 s559 s568 s576 s582 s583 s594 s596) 0)") while checking expression at index 2
Graph (trivial) has 1279 edges and 603 vertex of which 408 / 603 are part of one of the 55 SCC in 5 ms
Free SCC test removed 353 places
Drop transitions removed 706 transitions
Ensure Unique test removed 381 transitions
Reduce isomorphic transitions removed 1087 transitions.
Iterating post reduction 0 with 1087 rules applied. Total rules applied 1088 place count 250 transition count 628
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 45 Pre rules applied. Total rules applied 1088 place count 250 transition count 583
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 1 with 90 rules applied. Total rules applied 1178 place count 205 transition count 583
Performed 37 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 1 with 74 rules applied. Total rules applied 1252 place count 168 transition count 524
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 1257 place count 168 transition count 519
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 1293 place count 146 transition count 554
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 75 edges and 146 vertex of which 69 / 146 are part of one of the 8 SCC in 0 ms
Free SCC test removed 61 places
Iterating post reduction 2 with 7 rules applied. Total rules applied 1300 place count 85 transition count 548
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 69 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 74 transitions.
Discarding 24 places :
Also discarding 63 output transitions
Drop transitions removed 63 transitions
Graph (complete) has 509 edges and 82 vertex of which 58 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.6 ms
Graph (trivial) has 195 edges and 58 vertex of which 12 / 58 are part of one of the 4 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 3 with 79 rules applied. Total rules applied 1379 place count 50 transition count 411
Drop transitions removed 129 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 221 transitions.
Iterating post reduction 4 with 221 rules applied. Total rules applied 1600 place count 50 transition count 190
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 1606 place count 50 transition count 190
Applied a total of 1606 rules in 53 ms. Remains 50 /603 variables (removed 553) and now considering 190/1715 (removed 1525) transitions.
// Phase 1: matrix 190 rows 50 cols
[2020-05-21 02:48:25] [INFO ] Computed 9 place invariants in 1 ms
[2020-05-21 02:48:25] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2020-05-21 02:48:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:48:25] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-05-21 02:48:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:48:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2020-05-21 02:48:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:48:25] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2020-05-21 02:48:25] [INFO ] Computed and/alt/rep : 153/863/153 causal constraints in 8 ms.
[2020-05-21 02:48:25] [INFO ] Added : 104 causal constraints over 21 iterations in 246 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2020-05-21 02:48:25] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2020-05-21 02:48:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:48:25] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2020-05-21 02:48:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:48:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2020-05-21 02:48:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:48:26] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2020-05-21 02:48:26] [INFO ] Computed and/alt/rep : 153/863/153 causal constraints in 12 ms.
[2020-05-21 02:48:26] [INFO ] Added : 133 causal constraints over 28 iterations in 457 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2020-05-21 02:48:26] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2020-05-21 02:48:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:48:26] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-05-21 02:48:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:48:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2020-05-21 02:48:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:48:26] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2020-05-21 02:48:26] [INFO ] Computed and/alt/rep : 153/863/153 causal constraints in 13 ms.
[2020-05-21 02:48:26] [INFO ] Added : 64 causal constraints over 13 iterations in 175 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2020-05-21 02:48:27] [INFO ] Flatten gal took : 176 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 02:48:27] [INFO ] Applying decomposition
[2020-05-21 02:48:27] [INFO ] Flatten gal took : 222 ms
[2020-05-21 02:48:27] [INFO ] Flatten gal took : 145 ms
[2020-05-21 02:48:27] [INFO ] Input system was already deterministic with 1715 transitions.
[2020-05-21 02:48:27] [INFO ] Too many transitions (1715) to apply POR reductions. Disabling POR matrices.
[2020-05-21 02:48:27] [INFO ] Input system was already deterministic with 1715 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph3746507587147731495.txt, -o, /tmp/graph3746507587147731495.bin, -w, /tmp/graph3746507587147731495.weights], workingDir=null]
[2020-05-21 02:48:27] [INFO ] Built C files in 409ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph3746507587147731495.bin, -l, -1, -v, -w, /tmp/graph3746507587147731495.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 02:48:27] [INFO ] Decomposing Gal with order
[2020-05-21 02:48:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 02:48:28] [INFO ] Ran tautology test, simplified 0 / 3 in 673 ms.
[2020-05-21 02:48:28] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-09(UNSAT) depth K=0 took 21 ms
[2020-05-21 02:48:28] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-10(UNSAT) depth K=0 took 15 ms
[2020-05-21 02:48:28] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-15(UNSAT) depth K=0 took 12 ms
[2020-05-21 02:48:28] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-09(UNSAT) depth K=1 took 8 ms
[2020-05-21 02:48:28] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-10(UNSAT) depth K=1 took 12 ms
[2020-05-21 02:48:28] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-15(UNSAT) depth K=1 took 8 ms
[2020-05-21 02:48:28] [INFO ] Removed a total of 2508 redundant transitions.
[2020-05-21 02:48:28] [INFO ] Flatten gal took : 355 ms
[2020-05-21 02:48:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 41 ms.
[2020-05-21 02:48:28] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 67 ms
[2020-05-21 02:48:28] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness --gen-order FOLLOW
[2020-05-21 02:48:29] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-09(UNSAT) depth K=2 took 584 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 1379 out of 1715 initially.
// Phase 1: matrix 1379 rows 603 cols
[2020-05-21 02:48:29] [INFO ] Computed 23 place invariants in 3 ms
inv : IsEndLoop_7_0_0 + IsEndLoop_7_1_0 + IsEndLoop_7_2_0 + IsEndLoop_7_3_0 + IsEndLoop_7_4_0 + IsEndLoop_7_5_0 + IsEndLoop_7_6_0 + IsEndLoop_7_0_1 + IsEndLoop_7_1_1 + IsEndLoop_7_2_1 + IsEndLoop_7_3_1 + IsEndLoop_7_4_1 + IsEndLoop_7_5_1 + IsEndLoop_7_6_1 + IsEndLoop_7_0_2 + IsEndLoop_7_2_2 + IsEndLoop_7_1_2 + IsEndLoop_7_4_2 + IsEndLoop_7_3_2 + IsEndLoop_7_6_2 + IsEndLoop_7_5_2 + IsEndLoop_7_1_3 + IsEndLoop_7_0_3 + IsEndLoop_7_3_3 + IsEndLoop_7_2_3 + IsEndLoop_7_5_3 + IsEndLoop_7_4_3 + IsEndLoop_7_0_4 + IsEndLoop_7_6_3 + IsEndLoop_7_2_4 + IsEndLoop_7_1_4 + IsEndLoop_7_5_4 + IsEndLoop_7_6_4 + IsEndLoop_7_3_4 + IsEndLoop_7_4_4 + IsEndLoop_7_2_5 + IsEndLoop_7_3_5 + IsEndLoop_7_0_5 + IsEndLoop_7_1_5 + IsEndLoop_7_6_5 + IsEndLoop_7_4_5 + IsEndLoop_7_5_5 + EndTurn_7_2 + EndTurn_7_1 + EndTurn_7_0 + EndTurn_7_6 + EndTurn_7_5 + EndTurn_7_4 + EndTurn_7_3 + BeginLoop_7_4_0 + BeginLoop_7_5_0 + BeginLoop_7_6_0 + BeginLoop_7_0_0 + BeginLoop_7_1_0 + BeginLoop_7_2_0 + BeginLoop_7_3_0 + BeginLoop_7_1_4 + WantSection_7_F + TestAlone_7_3_1 + TestAlone_7_1_4 + TestTurn_7_0 + TestTurn_7_4 + TestTurn_7_3 + TestTurn_7_2 + TestTurn_7_1 + TestTurn_7_5 + TestTurn_7_6 + AskForSection_7_0 = 1
inv : Turn_0_7 + Turn_0_6 + Turn_0_5 + Turn_0_3 + Turn_0_4 + Turn_0_2 + Turn_0_1 + Turn_0_0 = 1
inv : Turn_6_6 + Turn_6_5 + Turn_6_4 + Turn_6_3 + Turn_6_1 + Turn_6_2 + Turn_6_0 + Turn_6_7 = 1
inv : IsEndLoop_5_0_0 + IsEndLoop_5_1_0 + IsEndLoop_5_2_0 + IsEndLoop_5_3_0 + IsEndLoop_5_4_0 + IsEndLoop_5_5_0 + IsEndLoop_5_6_0 + IsEndLoop_5_0_1 + IsEndLoop_5_1_1 + IsEndLoop_5_2_1 + IsEndLoop_5_3_1 + IsEndLoop_5_4_1 + IsEndLoop_5_5_1 + IsEndLoop_5_6_1 + IsEndLoop_5_0_2 + IsEndLoop_5_2_2 + IsEndLoop_5_1_2 + IsEndLoop_5_4_2 + IsEndLoop_5_3_2 + IsEndLoop_5_6_2 + IsEndLoop_5_5_2 + IsEndLoop_5_1_3 + IsEndLoop_5_0_3 + IsEndLoop_5_3_3 + IsEndLoop_5_2_3 + IsEndLoop_5_5_3 + IsEndLoop_5_4_3 + IsEndLoop_5_0_4 + IsEndLoop_5_6_3 + IsEndLoop_5_2_4 + IsEndLoop_5_1_4 + IsEndLoop_5_5_4 + IsEndLoop_5_6_4 + IsEndLoop_5_3_4 + IsEndLoop_5_4_4 + IsEndLoop_5_0_6 + IsEndLoop_5_3_6 + IsEndLoop_5_4_6 + IsEndLoop_5_1_6 + IsEndLoop_5_2_6 + IsEndLoop_5_6_6 + IsEndLoop_5_5_6 + EndTurn_5_2 + EndTurn_5_1 + EndTurn_5_0 + EndTurn_5_6 + EndTurn_5_5 + EndTurn_5_4 + EndTurn_5_3 + BeginLoop_5_4_0 + BeginLoop_5_5_0 + BeginLoop_5_6_0 + BeginLoop_5_0_0 + BeginLoop_5_1_0 + BeginLoop_5_2_0 + BeginLoop_5_3_0 + WantSection_5_F + TestTurn_5_0 + TestTurn_5_4 + TestTurn_5_3 + TestTurn_5_2 + TestTurn_5_1 + TestTurn_5_5 + TestTurn_5_6 + AskForSection_5_0 = 1
inv : WantSection_7_F + WantSection_7_T = 1
inv : WantSection_5_F + WantSection_5_T = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_4_0 + IsEndLoop_1_5_0 + IsEndLoop_1_6_0 + IsEndLoop_1_0_2 + IsEndLoop_1_1_2 + IsEndLoop_1_3_2 + IsEndLoop_1_2_2 + IsEndLoop_1_5_2 + IsEndLoop_1_4_2 + IsEndLoop_1_0_3 + IsEndLoop_1_6_2 + IsEndLoop_1_2_3 + IsEndLoop_1_1_3 + IsEndLoop_1_4_3 + IsEndLoop_1_3_3 + IsEndLoop_1_6_3 + IsEndLoop_1_5_3 + IsEndLoop_1_1_4 + IsEndLoop_1_0_4 + IsEndLoop_1_3_4 + IsEndLoop_1_2_4 + IsEndLoop_1_6_4 + IsEndLoop_1_0_5 + IsEndLoop_1_4_4 + IsEndLoop_1_5_4 + IsEndLoop_1_3_5 + IsEndLoop_1_4_5 + IsEndLoop_1_1_5 + IsEndLoop_1_2_5 + IsEndLoop_1_0_6 + IsEndLoop_1_1_6 + IsEndLoop_1_5_5 + IsEndLoop_1_6_5 + IsEndLoop_1_4_6 + IsEndLoop_1_5_6 + IsEndLoop_1_2_6 + IsEndLoop_1_3_6 + IsEndLoop_1_6_6 + EndTurn_1_3 + EndTurn_1_2 + EndTurn_1_1 + EndTurn_1_0 + BeginLoop_1_0_0 + EndTurn_1_6 + EndTurn_1_5 + EndTurn_1_4 + BeginLoop_1_5_0 + BeginLoop_1_6_0 + BeginLoop_1_1_0 + BeginLoop_1_2_0 + BeginLoop_1_3_0 + BeginLoop_1_4_0 + BeginLoop_1_1_3 + WantSection_1_F + TestAlone_1_1_3 + TestTurn_1_1 + TestTurn_1_0 + TestTurn_1_5 + TestTurn_1_4 + TestTurn_1_3 + TestTurn_1_2 + TestTurn_1_6 + TestIdentity_1_1_3 + AskForSection_1_0 = 1
inv : Turn_2_7 + Turn_2_5 + Turn_2_6 + Turn_2_4 + Turn_2_3 + Turn_2_2 + Turn_2_1 + Turn_2_0 = 1
inv : WantSection_4_T + WantSection_4_F = 1
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_4_0 + IsEndLoop_2_5_0 + IsEndLoop_2_6_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_4_1 + IsEndLoop_2_5_1 + IsEndLoop_2_6_1 + IsEndLoop_2_0_3 + IsEndLoop_2_2_3 + IsEndLoop_2_1_3 + IsEndLoop_2_4_3 + IsEndLoop_2_3_3 + IsEndLoop_2_6_3 + IsEndLoop_2_5_3 + IsEndLoop_2_1_4 + IsEndLoop_2_0_4 + IsEndLoop_2_3_4 + IsEndLoop_2_2_4 + IsEndLoop_2_6_4 + IsEndLoop_2_0_5 + IsEndLoop_2_4_4 + IsEndLoop_2_5_4 + IsEndLoop_2_3_5 + IsEndLoop_2_4_5 + IsEndLoop_2_1_5 + IsEndLoop_2_2_5 + IsEndLoop_2_0_6 + IsEndLoop_2_1_6 + IsEndLoop_2_5_5 + IsEndLoop_2_6_5 + IsEndLoop_2_4_6 + IsEndLoop_2_5_6 + IsEndLoop_2_2_6 + IsEndLoop_2_3_6 + IsEndLoop_2_6_6 + EndTurn_2_3 + EndTurn_2_2 + EndTurn_2_1 + EndTurn_2_0 + BeginLoop_2_0_0 + EndTurn_2_6 + EndTurn_2_5 + EndTurn_2_4 + BeginLoop_2_5_0 + BeginLoop_2_6_0 + BeginLoop_2_1_0 + BeginLoop_2_2_0 + BeginLoop_2_3_0 + BeginLoop_2_4_0 + BeginLoop_2_1_4 + TestAlone_2_2_0 + WantSection_2_F + TestAlone_2_1_4 + TestTurn_2_1 + TestTurn_2_0 + TestAlone_2_5_7 + TestTurn_2_5 + TestTurn_2_4 + TestTurn_2_3 + TestTurn_2_2 + TestAlone_2_3_6 + TestIdentity_2_2_0 + TestTurn_2_6 + AskForSection_2_0 = 1
inv : WantSection_2_T + WantSection_2_F = 1
inv : WantSection_0_T + WantSection_0_F = 1
inv : WantSection_6_F + WantSection_6_T = 1
inv : IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_2_1 + IsEndLoop_0_3_1 + IsEndLoop_0_4_1 + IsEndLoop_0_5_1 + IsEndLoop_0_6_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_2 + IsEndLoop_0_3_2 + IsEndLoop_0_2_2 + IsEndLoop_0_5_2 + IsEndLoop_0_4_2 + IsEndLoop_0_0_3 + IsEndLoop_0_6_2 + IsEndLoop_0_2_3 + IsEndLoop_0_1_3 + IsEndLoop_0_4_3 + IsEndLoop_0_3_3 + IsEndLoop_0_6_3 + IsEndLoop_0_5_3 + IsEndLoop_0_1_4 + IsEndLoop_0_0_4 + IsEndLoop_0_3_4 + IsEndLoop_0_2_4 + IsEndLoop_0_6_4 + IsEndLoop_0_0_5 + IsEndLoop_0_4_4 + IsEndLoop_0_5_4 + IsEndLoop_0_3_5 + IsEndLoop_0_4_5 + IsEndLoop_0_1_5 + IsEndLoop_0_2_5 + IsEndLoop_0_0_6 + IsEndLoop_0_1_6 + IsEndLoop_0_5_5 + IsEndLoop_0_6_5 + IsEndLoop_0_4_6 + IsEndLoop_0_5_6 + IsEndLoop_0_2_6 + IsEndLoop_0_3_6 + IsEndLoop_0_6_6 + EndTurn_0_3 + EndTurn_0_2 + EndTurn_0_1 + EndTurn_0_0 + BeginLoop_0_0_0 + EndTurn_0_6 + EndTurn_0_5 + EndTurn_0_4 + BeginLoop_0_5_0 + BeginLoop_0_6_0 + BeginLoop_0_1_0 + BeginLoop_0_2_0 + BeginLoop_0_3_0 + BeginLoop_0_4_0 + WantSection_0_F + TestTurn_0_1 + TestTurn_0_0 + TestTurn_0_5 + TestTurn_0_4 + TestTurn_0_3 + TestTurn_0_2 + TestTurn_0_6 + AskForSection_0_0 = 1
inv : Turn_5_6 + Turn_5_5 + Turn_5_4 + Turn_5_3 + Turn_5_2 + Turn_5_0 + Turn_5_1 + Turn_5_7 = 1
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_4_0 + IsEndLoop_4_5_0 + IsEndLoop_4_6_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_4_1 + IsEndLoop_4_5_1 + IsEndLoop_4_6_1 + IsEndLoop_4_0_2 + IsEndLoop_4_1_2 + IsEndLoop_4_3_2 + IsEndLoop_4_2_2 + IsEndLoop_4_5_2 + IsEndLoop_4_4_2 + IsEndLoop_4_0_3 + IsEndLoop_4_6_2 + IsEndLoop_4_2_3 + IsEndLoop_4_1_3 + IsEndLoop_4_4_3 + IsEndLoop_4_3_3 + IsEndLoop_4_6_3 + IsEndLoop_4_5_3 + IsEndLoop_4_0_5 + IsEndLoop_4_3_5 + IsEndLoop_4_4_5 + IsEndLoop_4_1_5 + IsEndLoop_4_2_5 + IsEndLoop_4_0_6 + IsEndLoop_4_1_6 + IsEndLoop_4_5_5 + IsEndLoop_4_6_5 + IsEndLoop_4_4_6 + IsEndLoop_4_5_6 + IsEndLoop_4_2_6 + IsEndLoop_4_3_6 + IsEndLoop_4_6_6 + EndTurn_4_3 + EndTurn_4_2 + EndTurn_4_1 + EndTurn_4_0 + BeginLoop_4_0_0 + EndTurn_4_6 + EndTurn_4_5 + EndTurn_4_4 + BeginLoop_4_5_0 + BeginLoop_4_6_0 + BeginLoop_4_1_0 + BeginLoop_4_2_0 + BeginLoop_4_3_0 + BeginLoop_4_4_0 + BeginLoop_4_2_5 + WantSection_4_F + TestAlone_4_2_5 + TestTurn_4_1 + TestTurn_4_0 + TestTurn_4_5 + TestTurn_4_4 + TestTurn_4_3 + TestTurn_4_2 + TestAlone_4_2_7 + TestTurn_4_6 + AskForSection_4_0 = 1
inv : Turn_1_7 + Turn_1_6 + Turn_1_4 + Turn_1_5 + Turn_1_3 + Turn_1_2 + Turn_1_1 + Turn_1_0 = 1
inv : Turn_4_6 + Turn_4_5 + Turn_4_4 + Turn_4_3 + Turn_4_2 + Turn_4_1 + Turn_4_0 + Turn_4_7 = 1
inv : WantSection_3_T + WantSection_3_F = 1
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_4_0 + IsEndLoop_3_5_0 + IsEndLoop_3_6_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_4_1 + IsEndLoop_3_5_1 + IsEndLoop_3_6_1 + IsEndLoop_3_0_2 + IsEndLoop_3_1_2 + IsEndLoop_3_3_2 + IsEndLoop_3_2_2 + IsEndLoop_3_5_2 + IsEndLoop_3_4_2 + IsEndLoop_3_6_2 + IsEndLoop_3_1_4 + IsEndLoop_3_0_4 + IsEndLoop_3_3_4 + IsEndLoop_3_2_4 + IsEndLoop_3_6_4 + IsEndLoop_3_0_5 + IsEndLoop_3_4_4 + IsEndLoop_3_5_4 + IsEndLoop_3_3_5 + IsEndLoop_3_4_5 + IsEndLoop_3_1_5 + IsEndLoop_3_2_5 + IsEndLoop_3_0_6 + IsEndLoop_3_1_6 + IsEndLoop_3_5_5 + IsEndLoop_3_6_5 + IsEndLoop_3_4_6 + IsEndLoop_3_5_6 + IsEndLoop_3_2_6 + IsEndLoop_3_3_6 + IsEndLoop_3_6_6 + EndTurn_3_3 + EndTurn_3_2 + EndTurn_3_1 + EndTurn_3_0 + BeginLoop_3_0_0 + EndTurn_3_6 + EndTurn_3_5 + EndTurn_3_4 + BeginLoop_3_5_0 + BeginLoop_3_6_0 + BeginLoop_3_1_0 + BeginLoop_3_2_0 + BeginLoop_3_3_0 + BeginLoop_3_4_0 + WantSection_3_F + TestTurn_3_1 + TestTurn_3_0 + TestTurn_3_5 + TestTurn_3_4 + TestTurn_3_3 + TestTurn_3_2 + TestTurn_3_6 + AskForSection_3_0 = 1
inv : IsEndLoop_6_0_0 + IsEndLoop_6_1_0 + IsEndLoop_6_2_0 + IsEndLoop_6_3_0 + IsEndLoop_6_4_0 + IsEndLoop_6_5_0 + IsEndLoop_6_6_0 + IsEndLoop_6_0_1 + IsEndLoop_6_1_1 + IsEndLoop_6_2_1 + IsEndLoop_6_3_1 + IsEndLoop_6_4_1 + IsEndLoop_6_5_1 + IsEndLoop_6_6_1 + IsEndLoop_6_0_2 + IsEndLoop_6_2_2 + IsEndLoop_6_1_2 + IsEndLoop_6_4_2 + IsEndLoop_6_3_2 + IsEndLoop_6_6_2 + IsEndLoop_6_5_2 + IsEndLoop_6_1_3 + IsEndLoop_6_0_3 + IsEndLoop_6_3_3 + IsEndLoop_6_2_3 + IsEndLoop_6_5_3 + IsEndLoop_6_4_3 + IsEndLoop_6_0_4 + IsEndLoop_6_6_3 + IsEndLoop_6_2_4 + IsEndLoop_6_1_4 + IsEndLoop_6_5_4 + IsEndLoop_6_6_4 + IsEndLoop_6_3_4 + IsEndLoop_6_4_4 + IsEndLoop_6_2_5 + IsEndLoop_6_3_5 + IsEndLoop_6_0_5 + IsEndLoop_6_1_5 + IsEndLoop_6_6_5 + IsEndLoop_6_4_5 + IsEndLoop_6_5_5 + EndTurn_6_2 + EndTurn_6_1 + EndTurn_6_0 + EndTurn_6_6 + EndTurn_6_5 + EndTurn_6_4 + EndTurn_6_3 + BeginLoop_6_4_0 + BeginLoop_6_5_0 + BeginLoop_6_6_0 + BeginLoop_6_0_0 + BeginLoop_6_1_0 + BeginLoop_6_2_0 + BeginLoop_6_3_0 + WantSection_6_F + TestAlone_6_6_3 + TestAlone_6_5_4 + TestTurn_6_0 + TestTurn_6_4 + TestTurn_6_3 + TestTurn_6_2 + TestTurn_6_1 + TestAlone_6_0_7 + TestTurn_6_5 + TestTurn_6_6 + TestIdentity_6_5_4 + AskForSection_6_0 = 1
inv : Turn_3_6 + Turn_3_7 + Turn_3_5 + Turn_3_4 + Turn_3_3 + Turn_3_2 + Turn_3_1 + Turn_3_0 = 1
inv : WantSection_1_T + WantSection_1_F = 1
Total of 23 invariants.
[2020-05-21 02:48:29] [INFO ] Computed 23 place invariants in 5 ms
Loading property file ReachabilityCardinality.prop.
Read [invariant] property : Peterson-PT-7-ReachabilityCardinality-09 with value :((gu40.BeginLoop_2_1_4<=gu40.BeginLoop_7_1_4)||((gu1.TestAlone_4_2_7<=gu1.IsEndLoop_1_1_2)&&(gi2.gu0.TestAlone_7_3_1<2)))
Read [invariant] property : Peterson-PT-7-ReachabilityCardinality-10 with value :(gu2.TestIdentity_1_1_3<=gu2.IsEndLoop_6_6_2)
Read [reachable] property : Peterson-PT-7-ReachabilityCardinality-15 with value :(((gi2.gu4.IsEndLoop_6_0_5<2)&&(gu66.IsEndLoop_2_3_5>gu66.TestIdentity_2_2_0))||((gi2.gu5.IsEndLoop_2_5_6>=2)&&(gu41.TestIdentity_6_5_4>gu41.BeginLoop_4_2_5)))
[2020-05-21 02:48:29] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-10(UNSAT) depth K=2 took 642 ms
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
[2020-05-21 02:48:30] [INFO ] Proved 603 variables to be positive in 1189 ms
SDD proceeding with computation, new max is 256
[2020-05-21 02:48:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-09
[2020-05-21 02:48:30] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-09(SAT) depth K=0 took 43 ms
[2020-05-21 02:48:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-10
[2020-05-21 02:48:30] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-10(SAT) depth K=0 took 37 ms
[2020-05-21 02:48:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-15
[2020-05-21 02:48:30] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-15(SAT) depth K=0 took 35 ms
SDD proceeding with computation, new max is 512
[2020-05-21 02:48:30] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-15(UNSAT) depth K=2 took 807 ms
SDD proceeding with computation, new max is 1024
[2020-05-21 02:48:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-09
[2020-05-21 02:48:30] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-09(SAT) depth K=1 took 362 ms
[2020-05-21 02:48:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-10
[2020-05-21 02:48:31] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-10(SAT) depth K=1 took 313 ms
[2020-05-21 02:48:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-15
[2020-05-21 02:48:31] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-15(SAT) depth K=1 took 319 ms
Invariant property Peterson-PT-7-ReachabilityCardinality-10 does not hold.
FORMULA Peterson-PT-7-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
Compilation finished in 19263 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 60 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT7ReachabilityCardinality09==true], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT7ReachabilityCardinality09==true], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT7ReachabilityCardinality09==true], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
SDD proceeding with computation, new max is 32768
[2020-05-21 02:49:27] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-09(UNSAT) depth K=3 took 57424 ms
SDD proceeding with computation, new max is 65536
[2020-05-21 02:49:45] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-15(UNSAT) depth K=3 took 17771 ms
SDD proceeding with computation, new max is 131072
SDD proceeding with computation, new max is 262144
[2020-05-21 02:53:37] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-09(UNSAT) depth K=4 took 231855 ms
[2020-05-21 02:56:49] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-15(UNSAT) depth K=4 took 191576 ms
[2020-05-21 02:57:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-09
[2020-05-21 02:57:25] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-09(SAT) depth K=2 took 534341 ms
SDD proceeding with computation, new max is 524288
[2020-05-21 02:59:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-15
[2020-05-21 02:59:28] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-15(SAT) depth K=2 took 122250 ms
[2020-05-21 03:06:32] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-09(UNSAT) depth K=5 took 583150 ms
SDD proceeding with computation, new max is 1048576
[2020-05-21 03:12:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-09
[2020-05-21 03:12:33] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-09(SAT) depth K=3 took 785567 ms
Detected timeout of ITS tools.
[2020-05-21 03:14:13] [INFO ] Flatten gal took : 120 ms
[2020-05-21 03:14:13] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 26 ms
[2020-05-21 03:14:13] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness --gen-order FOLLOW
Loading property file ReachabilityCardinality.prop.
Read [invariant] property : Peterson-PT-7-ReachabilityCardinality-09 with value :((BeginLoop_2_1_4<=BeginLoop_7_1_4)||((TestAlone_4_2_7<=IsEndLoop_1_1_2)&&(TestAlone_7_3_1<2)))
Read [reachable] property : Peterson-PT-7-ReachabilityCardinality-15 with value :(((IsEndLoop_6_0_5<2)&&(IsEndLoop_2_3_5>TestIdentity_2_2_0))||((IsEndLoop_2_5_6>=2)&&(TestIdentity_6_5_4>BeginLoop_4_2_5)))
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
[2020-05-21 03:14:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-15
[2020-05-21 03:14:46] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-15(SAT) depth K=3 took 132566 ms
SDD proceeding with computation, new max is 32768
SDD proceeding with computation, new max is 65536
SDD proceeding with computation, new max is 131072
[2020-05-21 03:18:20] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-15(UNSAT) depth K=5 took 708494 ms
SDD proceeding with computation, new max is 262144
SDD proceeding with computation, new max is 524288

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-7"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Peterson-PT-7, 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 r111-csrt-158961258100750"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-7.tgz
mv Peterson-PT-7 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;