Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814200342.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Dekker-PT-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814200342
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.1M
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 5.9M Apr 27 14:36 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 Dekker-PT-100-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1590111355267

[2020-05-22 01:35:57] [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-22 01:35:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 01:35:57] [INFO ] Load time of PNML (sax parser for PT used): 415 ms
[2020-05-22 01:35:57] [INFO ] Transformed 500 places.
[2020-05-22 01:35:57] [INFO ] Transformed 10200 transitions.
[2020-05-22 01:35:57] [INFO ] Found NUPN structural information;
[2020-05-22 01:35:57] [INFO ] Parsed PT model containing 500 places and 10200 transitions in 539 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 82 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-100-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 270 ms. (steps per millisecond=37 ) properties seen :[1, 1, 0, 1, 0, 0, 0, 0]
FORMULA Dekker-PT-100-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 73 ms. (steps per millisecond=137 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 79 ms. (steps per millisecond=126 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0]
[2020-05-22 01:35:58] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2020-05-22 01:35:58] [INFO ] Computed 300 place invariants in 24 ms
[2020-05-22 01:35:58] [INFO ] [Real]Absence check using 200 positive place invariants in 114 ms returned sat
[2020-05-22 01:35:58] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 55 ms returned sat
[2020-05-22 01:35:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:35:59] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2020-05-22 01:35:59] [INFO ] State equation strengthened by 100 read => feed constraints.
[2020-05-22 01:35:59] [INFO ] [Real]Added 100 Read/Feed constraints in 58 ms returned sat
[2020-05-22 01:36:00] [INFO ] Deduced a trap composed of 4 places in 199 ms
[2020-05-22 01:36:00] [INFO ] Deduced a trap composed of 4 places in 143 ms
[2020-05-22 01:36:00] [INFO ] Deduced a trap composed of 4 places in 109 ms
[2020-05-22 01:36:00] [INFO ] Deduced a trap composed of 6 places in 97 ms
[2020-05-22 01:36:00] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2020-05-22 01:36:00] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-05-22 01:36:00] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-05-22 01:36:00] [INFO ] Deduced a trap composed of 6 places in 74 ms
[2020-05-22 01:36:01] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-05-22 01:36:01] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:36:01] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:36:01] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-05-22 01:36:01] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-05-22 01:36:01] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-05-22 01:36:01] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-22 01:36:01] [INFO ] Deduced a trap composed of 5 places in 46 ms
[2020-05-22 01:36:01] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2020-05-22 01:36:01] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2020-05-22 01:36:01] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1878 ms
[2020-05-22 01:36:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:36:01] [INFO ] [Nat]Absence check using 200 positive place invariants in 77 ms returned sat
[2020-05-22 01:36:01] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 41 ms returned sat
[2020-05-22 01:36:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:36:02] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2020-05-22 01:36:02] [INFO ] [Nat]Added 100 Read/Feed constraints in 40 ms returned sat
[2020-05-22 01:36:02] [INFO ] Deduced a trap composed of 4 places in 167 ms
[2020-05-22 01:36:02] [INFO ] Deduced a trap composed of 4 places in 137 ms
[2020-05-22 01:36:03] [INFO ] Deduced a trap composed of 4 places in 126 ms
[2020-05-22 01:36:03] [INFO ] Deduced a trap composed of 6 places in 124 ms
[2020-05-22 01:36:03] [INFO ] Deduced a trap composed of 4 places in 133 ms
[2020-05-22 01:36:03] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2020-05-22 01:36:03] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-05-22 01:36:03] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-05-22 01:36:03] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-05-22 01:36:03] [INFO ] Deduced a trap composed of 4 places in 109 ms
[2020-05-22 01:36:04] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-05-22 01:36:04] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:36:04] [INFO ] Deduced a trap composed of 6 places in 71 ms
[2020-05-22 01:36:04] [INFO ] Deduced a trap composed of 5 places in 81 ms
[2020-05-22 01:36:04] [INFO ] Deduced a trap composed of 5 places in 85 ms
[2020-05-22 01:36:04] [INFO ] Deduced a trap composed of 6 places in 131 ms
[2020-05-22 01:36:04] [INFO ] Deduced a trap composed of 5 places in 79 ms
[2020-05-22 01:36:04] [INFO ] Deduced a trap composed of 6 places in 115 ms
[2020-05-22 01:36:05] [INFO ] Deduced a trap composed of 5 places in 109 ms
[2020-05-22 01:36:05] [INFO ] Deduced a trap composed of 5 places in 75 ms
[2020-05-22 01:36:05] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-05-22 01:36:05] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-05-22 01:36:05] [INFO ] Deduced a trap composed of 6 places in 107 ms
[2020-05-22 01:36:05] [INFO ] Deduced a trap composed of 5 places in 82 ms
[2020-05-22 01:36:05] [INFO ] Deduced a trap composed of 5 places in 79 ms
[2020-05-22 01:36:05] [INFO ] Deduced a trap composed of 5 places in 74 ms
[2020-05-22 01:36:05] [INFO ] Deduced a trap composed of 6 places in 86 ms
[2020-05-22 01:36:06] [INFO ] Deduced a trap composed of 5 places in 75 ms
[2020-05-22 01:36:06] [INFO ] Deduced a trap composed of 5 places in 90 ms
[2020-05-22 01:36:06] [INFO ] Deduced a trap composed of 5 places in 111 ms
[2020-05-22 01:36:06] [INFO ] Deduced a trap composed of 5 places in 78 ms
[2020-05-22 01:36:06] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-05-22 01:36:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 01:36:08] [INFO ] Deduced a trap composed of 2 places in 1657 ms
[2020-05-22 01:36:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s145 s416) 0)") while checking expression at index 0
[2020-05-22 01:36:08] [INFO ] [Real]Absence check using 200 positive place invariants in 100 ms returned sat
[2020-05-22 01:36:08] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 62 ms returned sat
[2020-05-22 01:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:36:09] [INFO ] [Real]Absence check using state equation in 558 ms returned sat
[2020-05-22 01:36:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:36:09] [INFO ] [Nat]Absence check using 200 positive place invariants in 86 ms returned sat
[2020-05-22 01:36:09] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 50 ms returned sat
[2020-05-22 01:36:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:36:09] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2020-05-22 01:36:10] [INFO ] [Nat]Added 100 Read/Feed constraints in 46 ms returned sat
[2020-05-22 01:36:10] [INFO ] Deduced a trap composed of 6 places in 144 ms
[2020-05-22 01:36:10] [INFO ] Deduced a trap composed of 6 places in 119 ms
[2020-05-22 01:36:10] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2020-05-22 01:36:10] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2020-05-22 01:36:10] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-05-22 01:36:10] [INFO ] Deduced a trap composed of 4 places in 115 ms
[2020-05-22 01:36:10] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-05-22 01:36:11] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-05-22 01:36:11] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-05-22 01:36:11] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:36:11] [INFO ] Deduced a trap composed of 5 places in 91 ms
[2020-05-22 01:36:11] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:36:11] [INFO ] Deduced a trap composed of 5 places in 67 ms
[2020-05-22 01:36:11] [INFO ] Deduced a trap composed of 5 places in 67 ms
[2020-05-22 01:36:11] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-05-22 01:36:11] [INFO ] Deduced a trap composed of 5 places in 64 ms
[2020-05-22 01:36:11] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-05-22 01:36:11] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:36:12] [INFO ] Deduced a trap composed of 5 places in 74 ms
[2020-05-22 01:36:12] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:36:12] [INFO ] Deduced a trap composed of 5 places in 65 ms
[2020-05-22 01:36:12] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-05-22 01:36:12] [INFO ] Deduced a trap composed of 5 places in 63 ms
[2020-05-22 01:36:12] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:36:12] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-22 01:36:12] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-05-22 01:36:12] [INFO ] Deduced a trap composed of 4 places in 37 ms
[2020-05-22 01:36:12] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 2729 ms
[2020-05-22 01:36:12] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 206 ms.
[2020-05-22 01:36:14] [INFO ] Added : 75 causal constraints over 15 iterations in 1490 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-22 01:36:14] [INFO ] [Real]Absence check using 200 positive place invariants in 74 ms returned sat
[2020-05-22 01:36:14] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 42 ms returned sat
[2020-05-22 01:36:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:36:15] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2020-05-22 01:36:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:36:15] [INFO ] [Nat]Absence check using 200 positive place invariants in 93 ms returned sat
[2020-05-22 01:36:15] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 49 ms returned sat
[2020-05-22 01:36:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:36:15] [INFO ] [Nat]Absence check using state equation in 657 ms returned sat
[2020-05-22 01:36:15] [INFO ] [Nat]Added 100 Read/Feed constraints in 32 ms returned sat
[2020-05-22 01:36:16] [INFO ] Deduced a trap composed of 4 places in 142 ms
[2020-05-22 01:36:16] [INFO ] Deduced a trap composed of 4 places in 144 ms
[2020-05-22 01:36:16] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-05-22 01:36:16] [INFO ] Deduced a trap composed of 4 places in 129 ms
[2020-05-22 01:36:16] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2020-05-22 01:36:16] [INFO ] Deduced a trap composed of 6 places in 88 ms
[2020-05-22 01:36:16] [INFO ] Deduced a trap composed of 6 places in 83 ms
[2020-05-22 01:36:17] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-05-22 01:36:17] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 01:36:17] [INFO ] Deduced a trap composed of 6 places in 68 ms
[2020-05-22 01:36:17] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-05-22 01:36:17] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:36:17] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:36:17] [INFO ] Deduced a trap composed of 6 places in 96 ms
[2020-05-22 01:36:17] [INFO ] Deduced a trap composed of 4 places in 105 ms
[2020-05-22 01:36:17] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:36:17] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 01:36:18] [INFO ] Deduced a trap composed of 5 places in 60 ms
[2020-05-22 01:36:18] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:36:18] [INFO ] Deduced a trap composed of 6 places in 66 ms
[2020-05-22 01:36:18] [INFO ] Deduced a trap composed of 6 places in 102 ms
[2020-05-22 01:36:18] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-05-22 01:36:18] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:36:18] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:36:18] [INFO ] Deduced a trap composed of 6 places in 83 ms
[2020-05-22 01:36:18] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:36:18] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-05-22 01:36:19] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:36:19] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-05-22 01:36:19] [INFO ] Deduced a trap composed of 5 places in 56 ms
[2020-05-22 01:36:19] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-05-22 01:36:19] [INFO ] Deduced a trap composed of 6 places in 97 ms
[2020-05-22 01:36:19] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-05-22 01:36:19] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-05-22 01:36:19] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-05-22 01:36:19] [INFO ] Deduced a trap composed of 6 places in 97 ms
[2020-05-22 01:36:20] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-05-22 01:36:20] [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 (> (+ s60 s94 s291 s342) 0)") while checking expression at index 2
[2020-05-22 01:36:20] [INFO ] [Real]Absence check using 200 positive place invariants in 105 ms returned sat
[2020-05-22 01:36:20] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 54 ms returned sat
[2020-05-22 01:36:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:36:21] [INFO ] [Real]Absence check using state equation in 694 ms returned sat
[2020-05-22 01:36:21] [INFO ] [Real]Added 100 Read/Feed constraints in 36 ms returned sat
[2020-05-22 01:36:21] [INFO ] Deduced a trap composed of 4 places in 145 ms
[2020-05-22 01:36:21] [INFO ] Deduced a trap composed of 4 places in 129 ms
[2020-05-22 01:36:21] [INFO ] Deduced a trap composed of 4 places in 118 ms
[2020-05-22 01:36:21] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2020-05-22 01:36:21] [INFO ] Deduced a trap composed of 6 places in 85 ms
[2020-05-22 01:36:21] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-05-22 01:36:22] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-05-22 01:36:22] [INFO ] Deduced a trap composed of 6 places in 82 ms
[2020-05-22 01:36:22] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-05-22 01:36:22] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:36:22] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 01:36:22] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-05-22 01:36:22] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:36:22] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-05-22 01:36:22] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:36:22] [INFO ] Deduced a trap composed of 5 places in 56 ms
[2020-05-22 01:36:22] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-05-22 01:36:23] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-05-22 01:36:23] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2050 ms
[2020-05-22 01:36:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:36:23] [INFO ] [Nat]Absence check using 200 positive place invariants in 79 ms returned sat
[2020-05-22 01:36:23] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 44 ms returned sat
[2020-05-22 01:36:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:36:23] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2020-05-22 01:36:23] [INFO ] [Nat]Added 100 Read/Feed constraints in 33 ms returned sat
[2020-05-22 01:36:24] [INFO ] Deduced a trap composed of 6 places in 169 ms
[2020-05-22 01:36:24] [INFO ] Deduced a trap composed of 4 places in 158 ms
[2020-05-22 01:36:24] [INFO ] Deduced a trap composed of 6 places in 136 ms
[2020-05-22 01:36:24] [INFO ] Deduced a trap composed of 4 places in 105 ms
[2020-05-22 01:36:24] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2020-05-22 01:36:24] [INFO ] Deduced a trap composed of 4 places in 123 ms
[2020-05-22 01:36:25] [INFO ] Deduced a trap composed of 4 places in 171 ms
[2020-05-22 01:36:25] [INFO ] Deduced a trap composed of 4 places in 150 ms
[2020-05-22 01:36:25] [INFO ] Deduced a trap composed of 4 places in 144 ms
[2020-05-22 01:36:25] [INFO ] Deduced a trap composed of 4 places in 109 ms
[2020-05-22 01:36:25] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2020-05-22 01:36:25] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2020-05-22 01:36:25] [INFO ] Deduced a trap composed of 6 places in 92 ms
[2020-05-22 01:36:26] [INFO ] Deduced a trap composed of 6 places in 111 ms
[2020-05-22 01:36:26] [INFO ] Deduced a trap composed of 6 places in 76 ms
[2020-05-22 01:36:26] [INFO ] Deduced a trap composed of 6 places in 75 ms
[2020-05-22 01:36:26] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-05-22 01:36:26] [INFO ] Deduced a trap composed of 6 places in 84 ms
[2020-05-22 01:36:26] [INFO ] Deduced a trap composed of 6 places in 77 ms
[2020-05-22 01:36:26] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-05-22 01:36:26] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:36:26] [INFO ] Deduced a trap composed of 6 places in 90 ms
[2020-05-22 01:36:27] [INFO ] Deduced a trap composed of 6 places in 83 ms
[2020-05-22 01:36:27] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:36:27] [INFO ] Deduced a trap composed of 6 places in 60 ms
[2020-05-22 01:36:27] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:36:27] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:36:27] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-05-22 01:36:27] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:36:27] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-05-22 01:36:27] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-05-22 01:36:27] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:36:27] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 3997 ms
[2020-05-22 01:36:28] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 249 ms.
[2020-05-22 01:36:28] [INFO ] Added : 0 causal constraints over 0 iterations in 254 ms. Result :(error "Failed to check-sat")
[2020-05-22 01:36:28] [INFO ] [Real]Absence check using 200 positive place invariants in 94 ms returned sat
[2020-05-22 01:36:28] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 53 ms returned sat
[2020-05-22 01:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:36:29] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2020-05-22 01:36:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:36:29] [INFO ] [Nat]Absence check using 200 positive place invariants in 91 ms returned sat
[2020-05-22 01:36:29] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 50 ms returned sat
[2020-05-22 01:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:36:29] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2020-05-22 01:36:30] [INFO ] [Nat]Added 100 Read/Feed constraints in 35 ms returned sat
[2020-05-22 01:36:30] [INFO ] Deduced a trap composed of 4 places in 190 ms
[2020-05-22 01:36:30] [INFO ] Deduced a trap composed of 4 places in 157 ms
[2020-05-22 01:36:30] [INFO ] Deduced a trap composed of 4 places in 128 ms
[2020-05-22 01:36:30] [INFO ] Deduced a trap composed of 4 places in 160 ms
[2020-05-22 01:36:30] [INFO ] Deduced a trap composed of 4 places in 135 ms
[2020-05-22 01:36:31] [INFO ] Deduced a trap composed of 4 places in 169 ms
[2020-05-22 01:36:31] [INFO ] Deduced a trap composed of 6 places in 130 ms
[2020-05-22 01:36:31] [INFO ] Deduced a trap composed of 4 places in 117 ms
[2020-05-22 01:36:31] [INFO ] Deduced a trap composed of 6 places in 122 ms
[2020-05-22 01:36:31] [INFO ] Deduced a trap composed of 6 places in 116 ms
[2020-05-22 01:36:31] [INFO ] Deduced a trap composed of 4 places in 135 ms
[2020-05-22 01:36:32] [INFO ] Deduced a trap composed of 5 places in 114 ms
[2020-05-22 01:36:32] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2020-05-22 01:36:32] [INFO ] Deduced a trap composed of 4 places in 119 ms
[2020-05-22 01:36:32] [INFO ] Deduced a trap composed of 5 places in 92 ms
[2020-05-22 01:36:32] [INFO ] Deduced a trap composed of 5 places in 114 ms
[2020-05-22 01:36:32] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-05-22 01:36:32] [INFO ] Deduced a trap composed of 5 places in 85 ms
[2020-05-22 01:36:32] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2020-05-22 01:36:33] [INFO ] Deduced a trap composed of 5 places in 127 ms
[2020-05-22 01:36:33] [INFO ] Deduced a trap composed of 4 places in 111 ms
[2020-05-22 01:36:33] [INFO ] Deduced a trap composed of 5 places in 84 ms
[2020-05-22 01:36:33] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-05-22 01:36:33] [INFO ] Deduced a trap composed of 5 places in 77 ms
[2020-05-22 01:36:33] [INFO ] Deduced a trap composed of 4 places in 127 ms
[2020-05-22 01:36:33] [INFO ] Deduced a trap composed of 5 places in 124 ms
[2020-05-22 01:36:34] [INFO ] Deduced a trap composed of 4 places in 177 ms
[2020-05-22 01:36:35] [INFO ] Deduced a trap composed of 2 places in 1561 ms
[2020-05-22 01:36:35] [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 (> (+ s145 s416) 0)") while checking expression at index 4
Support contains 16 out of 500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 983 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 10200/10200 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 17207 ms. (steps per millisecond=58 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2816 ms. (steps per millisecond=355 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2759 ms. (steps per millisecond=362 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3008 ms. (steps per millisecond=332 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2748 ms. (steps per millisecond=363 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2801 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 4828200 steps, run timeout after 30001 ms. (steps per millisecond=160 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 4828200 steps, saw 27023 distinct states, run finished after 30003 ms. (steps per millisecond=160 ) properties seen :[0, 0, 0, 0, 0]
[2020-05-22 01:37:38] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2020-05-22 01:37:38] [INFO ] Computed 300 place invariants in 9 ms
[2020-05-22 01:37:38] [INFO ] [Real]Absence check using 200 positive place invariants in 116 ms returned sat
[2020-05-22 01:37:38] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 70 ms returned sat
[2020-05-22 01:37:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:37:39] [INFO ] [Real]Absence check using state equation in 1339 ms returned sat
[2020-05-22 01:37:39] [INFO ] State equation strengthened by 100 read => feed constraints.
[2020-05-22 01:37:39] [INFO ] [Real]Added 100 Read/Feed constraints in 90 ms returned sat
[2020-05-22 01:37:40] [INFO ] Deduced a trap composed of 4 places in 136 ms
[2020-05-22 01:37:40] [INFO ] Deduced a trap composed of 4 places in 135 ms
[2020-05-22 01:37:40] [INFO ] Deduced a trap composed of 4 places in 129 ms
[2020-05-22 01:37:40] [INFO ] Deduced a trap composed of 6 places in 140 ms
[2020-05-22 01:37:40] [INFO ] Deduced a trap composed of 6 places in 108 ms
[2020-05-22 01:37:40] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-05-22 01:37:40] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-05-22 01:37:41] [INFO ] Deduced a trap composed of 6 places in 102 ms
[2020-05-22 01:37:41] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-05-22 01:37:41] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2020-05-22 01:37:41] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-05-22 01:37:41] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-22 01:37:41] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-05-22 01:37:41] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-05-22 01:37:41] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-05-22 01:37:41] [INFO ] Deduced a trap composed of 5 places in 71 ms
[2020-05-22 01:37:42] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-05-22 01:37:42] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-22 01:37:42] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2256 ms
[2020-05-22 01:37:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:37:42] [INFO ] [Nat]Absence check using 200 positive place invariants in 94 ms returned sat
[2020-05-22 01:37:42] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 51 ms returned sat
[2020-05-22 01:37:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:37:43] [INFO ] [Nat]Absence check using state equation in 697 ms returned sat
[2020-05-22 01:37:43] [INFO ] [Nat]Added 100 Read/Feed constraints in 49 ms returned sat
[2020-05-22 01:37:43] [INFO ] Deduced a trap composed of 4 places in 155 ms
[2020-05-22 01:37:43] [INFO ] Deduced a trap composed of 4 places in 160 ms
[2020-05-22 01:37:43] [INFO ] Deduced a trap composed of 4 places in 140 ms
[2020-05-22 01:37:43] [INFO ] Deduced a trap composed of 6 places in 134 ms
[2020-05-22 01:37:44] [INFO ] Deduced a trap composed of 4 places in 128 ms
[2020-05-22 01:37:44] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2020-05-22 01:37:44] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2020-05-22 01:37:44] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2020-05-22 01:37:44] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2020-05-22 01:37:44] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-05-22 01:37:44] [INFO ] Deduced a trap composed of 4 places in 111 ms
[2020-05-22 01:37:45] [INFO ] Deduced a trap composed of 4 places in 111 ms
[2020-05-22 01:37:45] [INFO ] Deduced a trap composed of 6 places in 76 ms
[2020-05-22 01:37:45] [INFO ] Deduced a trap composed of 5 places in 235 ms
[2020-05-22 01:37:45] [INFO ] Deduced a trap composed of 5 places in 56 ms
[2020-05-22 01:37:45] [INFO ] Deduced a trap composed of 6 places in 73 ms
[2020-05-22 01:37:45] [INFO ] Deduced a trap composed of 5 places in 76 ms
[2020-05-22 01:37:45] [INFO ] Deduced a trap composed of 6 places in 68 ms
[2020-05-22 01:37:45] [INFO ] Deduced a trap composed of 5 places in 55 ms
[2020-05-22 01:37:45] [INFO ] Deduced a trap composed of 5 places in 56 ms
[2020-05-22 01:37:46] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:37:46] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:37:46] [INFO ] Deduced a trap composed of 6 places in 61 ms
[2020-05-22 01:37:46] [INFO ] Deduced a trap composed of 5 places in 53 ms
[2020-05-22 01:37:46] [INFO ] Deduced a trap composed of 5 places in 44 ms
[2020-05-22 01:37:46] [INFO ] Deduced a trap composed of 5 places in 48 ms
[2020-05-22 01:37:46] [INFO ] Deduced a trap composed of 6 places in 58 ms
[2020-05-22 01:37:46] [INFO ] Deduced a trap composed of 5 places in 53 ms
[2020-05-22 01:37:46] [INFO ] Deduced a trap composed of 5 places in 58 ms
[2020-05-22 01:37:46] [INFO ] Deduced a trap composed of 5 places in 63 ms
[2020-05-22 01:37:46] [INFO ] Deduced a trap composed of 5 places in 62 ms
[2020-05-22 01:37:46] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-05-22 01:37:46] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-05-22 01:37:47] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-05-22 01:37:47] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:37:47] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2020-05-22 01:37:47] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 4022 ms
[2020-05-22 01:37:47] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 146 ms.
[2020-05-22 01:37:49] [INFO ] Added : 101 causal constraints over 21 iterations in 2168 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 96 ms.
[2020-05-22 01:37:49] [INFO ] [Real]Absence check using 200 positive place invariants in 94 ms returned sat
[2020-05-22 01:37:49] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 54 ms returned sat
[2020-05-22 01:37:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:37:50] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2020-05-22 01:37:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:37:50] [INFO ] [Nat]Absence check using 200 positive place invariants in 106 ms returned sat
[2020-05-22 01:37:50] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 52 ms returned sat
[2020-05-22 01:37:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:37:51] [INFO ] [Nat]Absence check using state equation in 901 ms returned sat
[2020-05-22 01:37:51] [INFO ] [Nat]Added 100 Read/Feed constraints in 69 ms returned sat
[2020-05-22 01:37:52] [INFO ] Deduced a trap composed of 6 places in 168 ms
[2020-05-22 01:37:52] [INFO ] Deduced a trap composed of 6 places in 142 ms
[2020-05-22 01:37:52] [INFO ] Deduced a trap composed of 4 places in 131 ms
[2020-05-22 01:37:52] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2020-05-22 01:37:52] [INFO ] Deduced a trap composed of 4 places in 117 ms
[2020-05-22 01:37:52] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2020-05-22 01:37:52] [INFO ] Deduced a trap composed of 4 places in 110 ms
[2020-05-22 01:37:53] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-05-22 01:37:53] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-05-22 01:37:53] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-05-22 01:37:53] [INFO ] Deduced a trap composed of 5 places in 79 ms
[2020-05-22 01:37:53] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:37:53] [INFO ] Deduced a trap composed of 5 places in 62 ms
[2020-05-22 01:37:53] [INFO ] Deduced a trap composed of 5 places in 66 ms
[2020-05-22 01:37:53] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:37:53] [INFO ] Deduced a trap composed of 5 places in 62 ms
[2020-05-22 01:37:53] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-05-22 01:37:54] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-05-22 01:37:54] [INFO ] Deduced a trap composed of 5 places in 80 ms
[2020-05-22 01:37:54] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:37:54] [INFO ] Deduced a trap composed of 5 places in 54 ms
[2020-05-22 01:37:54] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-05-22 01:37:54] [INFO ] Deduced a trap composed of 5 places in 73 ms
[2020-05-22 01:37:54] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-05-22 01:37:54] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-05-22 01:37:54] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-05-22 01:37:54] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-05-22 01:37:55] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3153 ms
[2020-05-22 01:37:55] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 221 ms.
[2020-05-22 01:37:57] [INFO ] Added : 101 causal constraints over 21 iterations in 2366 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 108 ms.
[2020-05-22 01:37:57] [INFO ] [Real]Absence check using 200 positive place invariants in 120 ms returned sat
[2020-05-22 01:37:57] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 60 ms returned sat
[2020-05-22 01:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:37:58] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2020-05-22 01:37:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:37:58] [INFO ] [Nat]Absence check using 200 positive place invariants in 91 ms returned sat
[2020-05-22 01:37:58] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 52 ms returned sat
[2020-05-22 01:37:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:37:59] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2020-05-22 01:37:59] [INFO ] [Nat]Added 100 Read/Feed constraints in 30 ms returned sat
[2020-05-22 01:37:59] [INFO ] Deduced a trap composed of 4 places in 133 ms
[2020-05-22 01:37:59] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-05-22 01:37:59] [INFO ] Deduced a trap composed of 4 places in 123 ms
[2020-05-22 01:38:00] [INFO ] Deduced a trap composed of 4 places in 119 ms
[2020-05-22 01:38:00] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-05-22 01:38:00] [INFO ] Deduced a trap composed of 6 places in 90 ms
[2020-05-22 01:38:00] [INFO ] Deduced a trap composed of 6 places in 77 ms
[2020-05-22 01:38:00] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-05-22 01:38:00] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-05-22 01:38:00] [INFO ] Deduced a trap composed of 6 places in 81 ms
[2020-05-22 01:38:00] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-05-22 01:38:00] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:38:01] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:38:01] [INFO ] Deduced a trap composed of 6 places in 81 ms
[2020-05-22 01:38:01] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:38:01] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-05-22 01:38:01] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:38:01] [INFO ] Deduced a trap composed of 5 places in 57 ms
[2020-05-22 01:38:01] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-05-22 01:38:01] [INFO ] Deduced a trap composed of 6 places in 77 ms
[2020-05-22 01:38:01] [INFO ] Deduced a trap composed of 6 places in 72 ms
[2020-05-22 01:38:01] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-05-22 01:38:02] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-05-22 01:38:02] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-05-22 01:38:02] [INFO ] Deduced a trap composed of 6 places in 83 ms
[2020-05-22 01:38:02] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-05-22 01:38:02] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:38:02] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:38:02] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 01:38:02] [INFO ] Deduced a trap composed of 5 places in 51 ms
[2020-05-22 01:38:02] [INFO ] Deduced a trap composed of 4 places in 127 ms
[2020-05-22 01:38:02] [INFO ] Deduced a trap composed of 6 places in 90 ms
[2020-05-22 01:38:03] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-05-22 01:38:03] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-05-22 01:38:03] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-05-22 01:38:03] [INFO ] Deduced a trap composed of 6 places in 105 ms
[2020-05-22 01:38:03] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-05-22 01:38:04] [INFO ] Deduced a trap composed of 4 places in 474 ms
[2020-05-22 01:38:04] [INFO ] Deduced a trap composed of 4 places in 478 ms
[2020-05-22 01:38:04] [INFO ] Deduced a trap composed of 5 places in 86 ms
[2020-05-22 01:38:04] [INFO ] Deduced a trap composed of 6 places in 108 ms
[2020-05-22 01:38:05] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:38:05] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-05-22 01:38:05] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 01:38:05] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-05-22 01:38:05] [INFO ] Deduced a trap composed of 5 places in 87 ms
[2020-05-22 01:38:05] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-05-22 01:38:06] [INFO ] Deduced a trap composed of 6 places in 370 ms
[2020-05-22 01:38:06] [INFO ] Deduced a trap composed of 4 places in 110 ms
[2020-05-22 01:38:06] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-05-22 01:38:06] [INFO ] Deduced a trap composed of 4 places in 393 ms
[2020-05-22 01:38:07] [INFO ] Deduced a trap composed of 4 places in 326 ms
[2020-05-22 01:38:07] [INFO ] Deduced a trap composed of 5 places in 81 ms
[2020-05-22 01:38:07] [INFO ] Deduced a trap composed of 6 places in 127 ms
[2020-05-22 01:38:07] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-05-22 01:38:07] [INFO ] Deduced a trap composed of 4 places in 109 ms
[2020-05-22 01:38:07] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-05-22 01:38:07] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-05-22 01:38:08] [INFO ] Deduced a trap composed of 5 places in 111 ms
[2020-05-22 01:38:08] [INFO ] Deduced a trap composed of 4 places in 131 ms
[2020-05-22 01:38:08] [INFO ] Deduced a trap composed of 4 places in 117 ms
[2020-05-22 01:38:08] [INFO ] Deduced a trap composed of 5 places in 111 ms
[2020-05-22 01:38:08] [INFO ] Deduced a trap composed of 4 places in 110 ms
[2020-05-22 01:38:08] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-05-22 01:38:08] [INFO ] Deduced a trap composed of 5 places in 82 ms
[2020-05-22 01:38:09] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2020-05-22 01:38:09] [INFO ] Deduced a trap composed of 5 places in 83 ms
[2020-05-22 01:38:09] [INFO ] Deduced a trap composed of 5 places in 83 ms
[2020-05-22 01:38:09] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-05-22 01:38:09] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:38:09] [INFO ] Trap strengthening (SAT) tested/added 71/70 trap constraints in 10027 ms
[2020-05-22 01:38:09] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 191 ms.
[2020-05-22 01:38:12] [INFO ] Added : 101 causal constraints over 21 iterations in 2764 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 121 ms.
[2020-05-22 01:38:12] [INFO ] [Real]Absence check using 200 positive place invariants in 105 ms returned sat
[2020-05-22 01:38:12] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 51 ms returned sat
[2020-05-22 01:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:38:13] [INFO ] [Real]Absence check using state equation in 778 ms returned sat
[2020-05-22 01:38:13] [INFO ] [Real]Added 100 Read/Feed constraints in 71 ms returned sat
[2020-05-22 01:38:13] [INFO ] Deduced a trap composed of 4 places in 189 ms
[2020-05-22 01:38:14] [INFO ] Deduced a trap composed of 4 places in 151 ms
[2020-05-22 01:38:14] [INFO ] Deduced a trap composed of 4 places in 192 ms
[2020-05-22 01:38:14] [INFO ] Deduced a trap composed of 6 places in 151 ms
[2020-05-22 01:38:14] [INFO ] Deduced a trap composed of 6 places in 140 ms
[2020-05-22 01:38:14] [INFO ] Deduced a trap composed of 4 places in 126 ms
[2020-05-22 01:38:15] [INFO ] Deduced a trap composed of 4 places in 129 ms
[2020-05-22 01:38:15] [INFO ] Deduced a trap composed of 6 places in 124 ms
[2020-05-22 01:38:15] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2020-05-22 01:38:15] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-22 01:38:15] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-05-22 01:38:15] [INFO ] Deduced a trap composed of 4 places in 106 ms
[2020-05-22 01:38:15] [INFO ] Deduced a trap composed of 4 places in 106 ms
[2020-05-22 01:38:16] [INFO ] Deduced a trap composed of 4 places in 115 ms
[2020-05-22 01:38:16] [INFO ] Deduced a trap composed of 4 places in 126 ms
[2020-05-22 01:38:16] [INFO ] Deduced a trap composed of 5 places in 88 ms
[2020-05-22 01:38:16] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-05-22 01:38:16] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:38:16] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2776 ms
[2020-05-22 01:38:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:38:16] [INFO ] [Nat]Absence check using 200 positive place invariants in 90 ms returned sat
[2020-05-22 01:38:16] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 50 ms returned sat
[2020-05-22 01:38:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:38:17] [INFO ] [Nat]Absence check using state equation in 719 ms returned sat
[2020-05-22 01:38:17] [INFO ] [Nat]Added 100 Read/Feed constraints in 42 ms returned sat
[2020-05-22 01:38:17] [INFO ] Deduced a trap composed of 6 places in 233 ms
[2020-05-22 01:38:18] [INFO ] Deduced a trap composed of 4 places in 208 ms
[2020-05-22 01:38:18] [INFO ] Deduced a trap composed of 6 places in 164 ms
[2020-05-22 01:38:18] [INFO ] Deduced a trap composed of 4 places in 214 ms
[2020-05-22 01:38:18] [INFO ] Deduced a trap composed of 4 places in 171 ms
[2020-05-22 01:38:19] [INFO ] Deduced a trap composed of 4 places in 652 ms
[2020-05-22 01:38:19] [INFO ] Deduced a trap composed of 4 places in 198 ms
[2020-05-22 01:38:19] [INFO ] Deduced a trap composed of 4 places in 234 ms
[2020-05-22 01:38:20] [INFO ] Deduced a trap composed of 4 places in 181 ms
[2020-05-22 01:38:20] [INFO ] Deduced a trap composed of 4 places in 186 ms
[2020-05-22 01:38:20] [INFO ] Deduced a trap composed of 4 places in 165 ms
[2020-05-22 01:38:20] [INFO ] Deduced a trap composed of 4 places in 115 ms
[2020-05-22 01:38:20] [INFO ] Deduced a trap composed of 6 places in 104 ms
[2020-05-22 01:38:20] [INFO ] Deduced a trap composed of 6 places in 99 ms
[2020-05-22 01:38:20] [INFO ] Deduced a trap composed of 6 places in 91 ms
[2020-05-22 01:38:21] [INFO ] Deduced a trap composed of 6 places in 87 ms
[2020-05-22 01:38:21] [INFO ] Deduced a trap composed of 4 places in 140 ms
[2020-05-22 01:38:21] [INFO ] Deduced a trap composed of 6 places in 94 ms
[2020-05-22 01:38:21] [INFO ] Deduced a trap composed of 6 places in 119 ms
[2020-05-22 01:38:21] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-05-22 01:38:21] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-05-22 01:38:21] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2020-05-22 01:38:22] [INFO ] Deduced a trap composed of 6 places in 90 ms
[2020-05-22 01:38:22] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:38:22] [INFO ] Deduced a trap composed of 6 places in 76 ms
[2020-05-22 01:38:22] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:38:22] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-05-22 01:38:22] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-05-22 01:38:22] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:38:22] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-05-22 01:38:22] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-05-22 01:38:22] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-05-22 01:38:22] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5354 ms
[2020-05-22 01:38:23] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 177 ms.
[2020-05-22 01:38:25] [INFO ] Added : 101 causal constraints over 21 iterations in 2419 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 101 ms.
[2020-05-22 01:38:25] [INFO ] [Real]Absence check using 200 positive place invariants in 93 ms returned sat
[2020-05-22 01:38:25] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 52 ms returned sat
[2020-05-22 01:38:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:38:26] [INFO ] [Real]Absence check using state equation in 684 ms returned sat
[2020-05-22 01:38:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:38:26] [INFO ] [Nat]Absence check using 200 positive place invariants in 63 ms returned sat
[2020-05-22 01:38:26] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 36 ms returned sat
[2020-05-22 01:38:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:38:27] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2020-05-22 01:38:27] [INFO ] [Nat]Added 100 Read/Feed constraints in 39 ms returned sat
[2020-05-22 01:38:27] [INFO ] Deduced a trap composed of 4 places in 185 ms
[2020-05-22 01:38:27] [INFO ] Deduced a trap composed of 4 places in 170 ms
[2020-05-22 01:38:27] [INFO ] Deduced a trap composed of 4 places in 155 ms
[2020-05-22 01:38:28] [INFO ] Deduced a trap composed of 4 places in 159 ms
[2020-05-22 01:38:28] [INFO ] Deduced a trap composed of 4 places in 152 ms
[2020-05-22 01:38:28] [INFO ] Deduced a trap composed of 4 places in 143 ms
[2020-05-22 01:38:28] [INFO ] Deduced a trap composed of 6 places in 170 ms
[2020-05-22 01:38:28] [INFO ] Deduced a trap composed of 4 places in 131 ms
[2020-05-22 01:38:28] [INFO ] Deduced a trap composed of 6 places in 115 ms
[2020-05-22 01:38:29] [INFO ] Deduced a trap composed of 6 places in 112 ms
[2020-05-22 01:38:29] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-05-22 01:38:29] [INFO ] Deduced a trap composed of 5 places in 102 ms
[2020-05-22 01:38:29] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 01:38:29] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:38:29] [INFO ] Deduced a trap composed of 5 places in 50 ms
[2020-05-22 01:38:29] [INFO ] Deduced a trap composed of 5 places in 94 ms
[2020-05-22 01:38:29] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-05-22 01:38:29] [INFO ] Deduced a trap composed of 5 places in 86 ms
[2020-05-22 01:38:30] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:38:30] [INFO ] Deduced a trap composed of 5 places in 94 ms
[2020-05-22 01:38:30] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:38:30] [INFO ] Deduced a trap composed of 5 places in 108 ms
[2020-05-22 01:38:30] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:38:30] [INFO ] Deduced a trap composed of 5 places in 101 ms
[2020-05-22 01:38:30] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-05-22 01:38:30] [INFO ] Deduced a trap composed of 5 places in 91 ms
[2020-05-22 01:38:31] [INFO ] Deduced a trap composed of 4 places in 110 ms
[2020-05-22 01:38:31] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-05-22 01:38:31] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-05-22 01:38:31] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-05-22 01:38:31] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-05-22 01:38:31] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-05-22 01:38:31] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 4415 ms
[2020-05-22 01:38:31] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 194 ms.
[2020-05-22 01:38:33] [INFO ] Added : 101 causal constraints over 21 iterations in 2232 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 96 ms.
Incomplete Parikh walk after 23100 steps, including 98 resets, run finished after 1334 ms. (steps per millisecond=17 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 23400 steps, including 98 resets, run finished after 979 ms. (steps per millisecond=23 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 22200 steps, including 98 resets, run finished after 1009 ms. (steps per millisecond=22 ) properties seen :[0, 0, 1, 0, 0] could not realise parikh vector
FORMULA Dekker-PT-100-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 22500 steps, including 98 resets, run finished after 967 ms. (steps per millisecond=23 ) properties seen :[0, 1, 0, 0] could not realise parikh vector
FORMULA Dekker-PT-100-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 23300 steps, including 98 resets, run finished after 1137 ms. (steps per millisecond=20 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 6 out of 500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 499 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 10200/10200 transitions.
Starting structural reductions, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 414 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2020-05-22 01:38:40] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2020-05-22 01:38:40] [INFO ] Computed 300 place invariants in 7 ms
[2020-05-22 01:38:49] [INFO ] Implicit Places using invariants in 8667 ms returned [200, 203, 206, 209, 212, 215, 218, 221, 224, 227, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 266, 269, 272, 275, 278, 281, 284, 287, 290, 293, 296, 299, 302, 305, 308, 311, 314, 317, 320, 323, 326, 329, 332, 335, 338, 341, 344, 347, 350, 353, 356, 359, 362, 365, 368, 371, 374, 377, 380, 383, 386, 389, 392, 395, 398, 401, 404, 407, 410, 416, 419, 422, 425, 428, 431, 434, 437, 440, 443, 446, 449, 452, 455, 458, 461, 464, 467, 470, 473, 476, 479, 482, 485, 488, 491, 494, 497]
Discarding 99 places :
Implicit Place search using SMT only with invariants took 8690 ms to find 99 implicit places.
[2020-05-22 01:38:49] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 401 cols
[2020-05-22 01:38:49] [INFO ] Computed 201 place invariants in 5 ms
[2020-05-22 01:38:59] [INFO ] Dead Transitions using invariants and state equation in 10411 ms returned []
Starting structural reductions, iteration 1 : 401/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 337 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2020-05-22 01:38:59] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 401 cols
[2020-05-22 01:38:59] [INFO ] Computed 201 place invariants in 2 ms
[2020-05-22 01:39:10] [INFO ] Dead Transitions using invariants and state equation in 10624 ms returned []
Finished structural reductions, in 2 iterations. Remains : 401/500 places, 10200/10200 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 17168 ms. (steps per millisecond=58 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2571 ms. (steps per millisecond=388 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2617 ms. (steps per millisecond=382 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2468 ms. (steps per millisecond=405 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 5997900 steps, run timeout after 30001 ms. (steps per millisecond=199 ) properties seen :[0, 0, 0]
Probabilistic random walk after 5997900 steps, saw 33094 distinct states, run finished after 30002 ms. (steps per millisecond=199 ) properties seen :[0, 0, 0]
[2020-05-22 01:40:05] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 401 cols
[2020-05-22 01:40:05] [INFO ] Computed 201 place invariants in 2 ms
[2020-05-22 01:40:05] [INFO ] [Real]Absence check using 200 positive place invariants in 112 ms returned sat
[2020-05-22 01:40:05] [INFO ] [Real]Absence check using 200 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-22 01:40:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:40:06] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2020-05-22 01:40:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:40:06] [INFO ] [Nat]Absence check using 200 positive place invariants in 85 ms returned sat
[2020-05-22 01:40:06] [INFO ] [Nat]Absence check using 200 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-22 01:40:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:40:06] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2020-05-22 01:40:06] [INFO ] State equation strengthened by 100 read => feed constraints.
[2020-05-22 01:40:07] [INFO ] [Nat]Added 100 Read/Feed constraints in 66 ms returned sat
[2020-05-22 01:40:07] [INFO ] Deduced a trap composed of 4 places in 315 ms
[2020-05-22 01:40:07] [INFO ] Deduced a trap composed of 4 places in 224 ms
[2020-05-22 01:40:07] [INFO ] Deduced a trap composed of 4 places in 172 ms
[2020-05-22 01:40:08] [INFO ] Deduced a trap composed of 4 places in 185 ms
[2020-05-22 01:40:08] [INFO ] Deduced a trap composed of 4 places in 183 ms
[2020-05-22 01:40:08] [INFO ] Deduced a trap composed of 4 places in 733 ms
[2020-05-22 01:40:09] [INFO ] Deduced a trap composed of 4 places in 169 ms
[2020-05-22 01:40:09] [INFO ] Deduced a trap composed of 4 places in 155 ms
[2020-05-22 01:40:09] [INFO ] Deduced a trap composed of 4 places in 159 ms
[2020-05-22 01:40:09] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-05-22 01:40:09] [INFO ] Deduced a trap composed of 4 places in 122 ms
[2020-05-22 01:40:10] [INFO ] Deduced a trap composed of 4 places in 117 ms
[2020-05-22 01:40:10] [INFO ] Deduced a trap composed of 4 places in 474 ms
[2020-05-22 01:40:10] [INFO ] Deduced a trap composed of 4 places in 134 ms
[2020-05-22 01:40:10] [INFO ] Deduced a trap composed of 4 places in 123 ms
[2020-05-22 01:40:10] [INFO ] Deduced a trap composed of 4 places in 106 ms
[2020-05-22 01:40:11] [INFO ] Deduced a trap composed of 4 places in 130 ms
[2020-05-22 01:40:11] [INFO ] Deduced a trap composed of 4 places in 120 ms
[2020-05-22 01:40:11] [INFO ] Deduced a trap composed of 4 places in 111 ms
[2020-05-22 01:40:11] [INFO ] Deduced a trap composed of 4 places in 117 ms
[2020-05-22 01:40:12] [INFO ] Deduced a trap composed of 4 places in 438 ms
[2020-05-22 01:40:12] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-05-22 01:40:12] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-05-22 01:40:12] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2020-05-22 01:40:12] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:40:12] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 01:40:12] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 01:40:12] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:40:12] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:40:13] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-05-22 01:40:13] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:40:13] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-22 01:40:13] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-05-22 01:40:13] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2020-05-22 01:40:13] [INFO ] Deduced a trap composed of 4 places in 119 ms
[2020-05-22 01:40:13] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2020-05-22 01:40:14] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-05-22 01:40:14] [INFO ] Deduced a trap composed of 4 places in 395 ms
[2020-05-22 01:40:14] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2020-05-22 01:40:14] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-05-22 01:40:14] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-05-22 01:40:14] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-05-22 01:40:15] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-05-22 01:40:15] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-05-22 01:40:15] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:40:15] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:40:15] [INFO ] Deduced a trap composed of 4 places in 264 ms
[2020-05-22 01:40:15] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-05-22 01:40:15] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-05-22 01:40:16] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-05-22 01:40:16] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-05-22 01:40:16] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-05-22 01:40:16] [INFO ] Deduced a trap composed of 4 places in 124 ms
[2020-05-22 01:40:16] [INFO ] Deduced a trap composed of 4 places in 318 ms
[2020-05-22 01:40:16] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-05-22 01:40:17] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-05-22 01:40:17] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:40:17] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-05-22 01:40:17] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-05-22 01:40:17] [INFO ] Deduced a trap composed of 4 places in 236 ms
[2020-05-22 01:40:17] [INFO ] Deduced a trap composed of 4 places in 291 ms
[2020-05-22 01:40:18] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-05-22 01:40:18] [INFO ] Deduced a trap composed of 4 places in 128 ms
[2020-05-22 01:40:18] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-05-22 01:40:18] [INFO ] Trap strengthening (SAT) tested/added 65/64 trap constraints in 11399 ms
[2020-05-22 01:40:18] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 197 ms.
[2020-05-22 01:40:20] [INFO ] Added : 101 causal constraints over 21 iterations in 2375 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 104 ms.
[2020-05-22 01:40:21] [INFO ] [Real]Absence check using 200 positive place invariants in 85 ms returned sat
[2020-05-22 01:40:21] [INFO ] [Real]Absence check using 200 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-22 01:40:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:40:21] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2020-05-22 01:40:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:40:21] [INFO ] [Nat]Absence check using 200 positive place invariants in 83 ms returned sat
[2020-05-22 01:40:21] [INFO ] [Nat]Absence check using 200 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-22 01:40:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:40:22] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2020-05-22 01:40:22] [INFO ] [Nat]Added 100 Read/Feed constraints in 41 ms returned sat
[2020-05-22 01:40:22] [INFO ] Deduced a trap composed of 4 places in 429 ms
[2020-05-22 01:40:23] [INFO ] Deduced a trap composed of 4 places in 233 ms
[2020-05-22 01:40:23] [INFO ] Deduced a trap composed of 4 places in 202 ms
[2020-05-22 01:40:23] [INFO ] Deduced a trap composed of 4 places in 196 ms
[2020-05-22 01:40:23] [INFO ] Deduced a trap composed of 4 places in 158 ms
[2020-05-22 01:40:23] [INFO ] Deduced a trap composed of 4 places in 163 ms
[2020-05-22 01:40:24] [INFO ] Deduced a trap composed of 4 places in 196 ms
[2020-05-22 01:40:24] [INFO ] Deduced a trap composed of 4 places in 189 ms
[2020-05-22 01:40:24] [INFO ] Deduced a trap composed of 4 places in 186 ms
[2020-05-22 01:40:24] [INFO ] Deduced a trap composed of 4 places in 191 ms
[2020-05-22 01:40:24] [INFO ] Deduced a trap composed of 4 places in 214 ms
[2020-05-22 01:40:25] [INFO ] Deduced a trap composed of 4 places in 188 ms
[2020-05-22 01:40:25] [INFO ] Deduced a trap composed of 4 places in 203 ms
[2020-05-22 01:40:25] [INFO ] Deduced a trap composed of 4 places in 157 ms
[2020-05-22 01:40:25] [INFO ] Deduced a trap composed of 4 places in 143 ms
[2020-05-22 01:40:25] [INFO ] Deduced a trap composed of 4 places in 144 ms
[2020-05-22 01:40:26] [INFO ] Deduced a trap composed of 4 places in 124 ms
[2020-05-22 01:40:26] [INFO ] Deduced a trap composed of 4 places in 621 ms
[2020-05-22 01:40:27] [INFO ] Deduced a trap composed of 4 places in 782 ms
[2020-05-22 01:40:27] [INFO ] Deduced a trap composed of 4 places in 131 ms
[2020-05-22 01:40:27] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2020-05-22 01:40:27] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-05-22 01:40:28] [INFO ] Deduced a trap composed of 4 places in 124 ms
[2020-05-22 01:40:28] [INFO ] Deduced a trap composed of 4 places in 131 ms
[2020-05-22 01:40:28] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-05-22 01:40:28] [INFO ] Deduced a trap composed of 4 places in 126 ms
[2020-05-22 01:40:28] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-05-22 01:40:28] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-22 01:40:28] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2020-05-22 01:40:29] [INFO ] Deduced a trap composed of 4 places in 128 ms
[2020-05-22 01:40:29] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2020-05-22 01:40:29] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-05-22 01:40:29] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-05-22 01:40:29] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-05-22 01:40:29] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-22 01:40:29] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-05-22 01:40:29] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-22 01:40:29] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:40:29] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 01:40:30] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-05-22 01:40:30] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-05-22 01:40:30] [INFO ] Deduced a trap composed of 4 places in 126 ms
[2020-05-22 01:40:30] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-05-22 01:40:30] [INFO ] Deduced a trap composed of 4 places in 133 ms
[2020-05-22 01:40:30] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-05-22 01:40:30] [INFO ] Deduced a trap composed of 4 places in 115 ms
[2020-05-22 01:40:30] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-05-22 01:40:31] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-05-22 01:40:31] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2020-05-22 01:40:31] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-05-22 01:40:31] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-05-22 01:40:31] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-05-22 01:40:31] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:40:31] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:40:31] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:40:31] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:40:31] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-05-22 01:40:32] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-05-22 01:40:32] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-05-22 01:40:32] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-05-22 01:40:32] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-05-22 01:40:32] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:40:32] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-05-22 01:40:32] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-05-22 01:40:32] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-05-22 01:40:32] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-05-22 01:40:32] [INFO ] Trap strengthening (SAT) tested/added 67/66 trap constraints in 10455 ms
[2020-05-22 01:40:32] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 203 ms.
[2020-05-22 01:40:34] [INFO ] Added : 101 causal constraints over 21 iterations in 2149 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 103 ms.
[2020-05-22 01:40:35] [INFO ] [Real]Absence check using 200 positive place invariants in 88 ms returned sat
[2020-05-22 01:40:35] [INFO ] [Real]Absence check using 200 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-22 01:40:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:40:35] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2020-05-22 01:40:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:40:35] [INFO ] [Nat]Absence check using 200 positive place invariants in 66 ms returned sat
[2020-05-22 01:40:35] [INFO ] [Nat]Absence check using 200 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-22 01:40:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:40:36] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2020-05-22 01:40:36] [INFO ] [Nat]Added 100 Read/Feed constraints in 27 ms returned sat
[2020-05-22 01:40:36] [INFO ] Deduced a trap composed of 4 places in 162 ms
[2020-05-22 01:40:36] [INFO ] Deduced a trap composed of 4 places in 163 ms
[2020-05-22 01:40:36] [INFO ] Deduced a trap composed of 4 places in 133 ms
[2020-05-22 01:40:37] [INFO ] Deduced a trap composed of 4 places in 150 ms
[2020-05-22 01:40:37] [INFO ] Deduced a trap composed of 4 places in 139 ms
[2020-05-22 01:40:37] [INFO ] Deduced a trap composed of 4 places in 128 ms
[2020-05-22 01:40:37] [INFO ] Deduced a trap composed of 4 places in 173 ms
[2020-05-22 01:40:37] [INFO ] Deduced a trap composed of 4 places in 172 ms
[2020-05-22 01:40:37] [INFO ] Deduced a trap composed of 4 places in 171 ms
[2020-05-22 01:40:38] [INFO ] Deduced a trap composed of 4 places in 141 ms
[2020-05-22 01:40:38] [INFO ] Deduced a trap composed of 4 places in 177 ms
[2020-05-22 01:40:38] [INFO ] Deduced a trap composed of 4 places in 130 ms
[2020-05-22 01:40:38] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-05-22 01:40:38] [INFO ] Deduced a trap composed of 4 places in 134 ms
[2020-05-22 01:40:38] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2020-05-22 01:40:39] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2020-05-22 01:40:39] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2020-05-22 01:40:39] [INFO ] Deduced a trap composed of 4 places in 106 ms
[2020-05-22 01:40:39] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-05-22 01:40:39] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2020-05-22 01:40:39] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-05-22 01:40:39] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-05-22 01:40:39] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:40:39] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-05-22 01:40:39] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-05-22 01:40:40] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2020-05-22 01:40:40] [INFO ] Deduced a trap composed of 4 places in 139 ms
[2020-05-22 01:40:40] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-05-22 01:40:40] [INFO ] Deduced a trap composed of 4 places in 118 ms
[2020-05-22 01:40:40] [INFO ] Deduced a trap composed of 4 places in 111 ms
[2020-05-22 01:40:40] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-22 01:40:40] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:40:40] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-05-22 01:40:40] [INFO ] Deduced a trap composed of 4 places in 106 ms
[2020-05-22 01:40:41] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2020-05-22 01:40:41] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-05-22 01:40:41] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-05-22 01:40:41] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-05-22 01:40:41] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-22 01:40:41] [INFO ] Deduced a trap composed of 4 places in 122 ms
[2020-05-22 01:40:41] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-05-22 01:40:41] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-05-22 01:40:41] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:40:42] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-05-22 01:40:42] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 01:40:42] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-05-22 01:40:42] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-22 01:40:42] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2020-05-22 01:40:42] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:40:42] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:40:42] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-05-22 01:40:42] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:40:42] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2020-05-22 01:40:42] [INFO ] Deduced a trap composed of 4 places in 37 ms
[2020-05-22 01:40:42] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 6412 ms
[2020-05-22 01:40:42] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 147 ms.
[2020-05-22 01:40:44] [INFO ] Added : 101 causal constraints over 21 iterations in 2150 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 93 ms.
Incomplete Parikh walk after 24100 steps, including 98 resets, run finished after 1333 ms. (steps per millisecond=18 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 24500 steps, including 98 resets, run finished after 1056 ms. (steps per millisecond=23 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 24000 steps, including 98 resets, run finished after 1159 ms. (steps per millisecond=20 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 401/401 places, 10200/10200 transitions.
Applied a total of 0 rules in 318 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 10200/10200 transitions.
Starting structural reductions, iteration 0 : 401/401 places, 10200/10200 transitions.
Applied a total of 0 rules in 316 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2020-05-22 01:40:49] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 401 cols
[2020-05-22 01:40:49] [INFO ] Computed 201 place invariants in 2 ms
[2020-05-22 01:40:50] [INFO ] Implicit Places using invariants in 1548 ms returned []
Implicit Place search using SMT only with invariants took 1549 ms to find 0 implicit places.
[2020-05-22 01:40:50] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 401 cols
[2020-05-22 01:40:50] [INFO ] Computed 201 place invariants in 2 ms
[2020-05-22 01:41:01] [INFO ] Dead Transitions using invariants and state equation in 10523 ms returned []
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 10200/10200 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1978 ms. (steps per millisecond=50 ) properties seen :[0, 0, 0]
[2020-05-22 01:41:03] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 401 cols
[2020-05-22 01:41:03] [INFO ] Computed 201 place invariants in 3 ms
[2020-05-22 01:41:03] [INFO ] [Real]Absence check using 200 positive place invariants in 87 ms returned sat
[2020-05-22 01:41:03] [INFO ] [Real]Absence check using 200 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-22 01:41:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:41:04] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2020-05-22 01:41:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:41:04] [INFO ] [Nat]Absence check using 200 positive place invariants in 86 ms returned sat
[2020-05-22 01:41:04] [INFO ] [Nat]Absence check using 200 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-22 01:41:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:41:04] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2020-05-22 01:41:04] [INFO ] State equation strengthened by 100 read => feed constraints.
[2020-05-22 01:41:04] [INFO ] [Nat]Added 100 Read/Feed constraints in 63 ms returned sat
[2020-05-22 01:41:05] [INFO ] Deduced a trap composed of 4 places in 223 ms
[2020-05-22 01:41:05] [INFO ] Deduced a trap composed of 4 places in 199 ms
[2020-05-22 01:41:05] [INFO ] Deduced a trap composed of 4 places in 196 ms
[2020-05-22 01:41:05] [INFO ] Deduced a trap composed of 4 places in 173 ms
[2020-05-22 01:41:05] [INFO ] Deduced a trap composed of 4 places in 165 ms
[2020-05-22 01:41:06] [INFO ] Deduced a trap composed of 4 places in 166 ms
[2020-05-22 01:41:06] [INFO ] Deduced a trap composed of 4 places in 168 ms
[2020-05-22 01:41:06] [INFO ] Deduced a trap composed of 4 places in 163 ms
[2020-05-22 01:41:06] [INFO ] Deduced a trap composed of 4 places in 147 ms
[2020-05-22 01:41:06] [INFO ] Deduced a trap composed of 4 places in 151 ms
[2020-05-22 01:41:07] [INFO ] Deduced a trap composed of 4 places in 136 ms
[2020-05-22 01:41:07] [INFO ] Deduced a trap composed of 4 places in 117 ms
[2020-05-22 01:41:07] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-05-22 01:41:07] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-05-22 01:41:07] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-05-22 01:41:07] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-05-22 01:41:07] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2020-05-22 01:41:07] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-05-22 01:41:08] [INFO ] Deduced a trap composed of 4 places in 122 ms
[2020-05-22 01:41:08] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2020-05-22 01:41:08] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2020-05-22 01:41:08] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-05-22 01:41:08] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:41:08] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-05-22 01:41:08] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:41:08] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:41:08] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 01:41:08] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-05-22 01:41:09] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-05-22 01:41:09] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 01:41:09] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:41:09] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-22 01:41:09] [INFO ] Deduced a trap composed of 4 places in 106 ms
[2020-05-22 01:41:09] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-05-22 01:41:09] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-05-22 01:41:09] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 01:41:09] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-05-22 01:41:09] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-05-22 01:41:09] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-05-22 01:41:10] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-05-22 01:41:10] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-05-22 01:41:10] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-05-22 01:41:10] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:41:10] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-05-22 01:41:10] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-05-22 01:41:10] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:41:10] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:41:10] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-05-22 01:41:11] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-05-22 01:41:11] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-05-22 01:41:11] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:41:11] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-05-22 01:41:11] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-05-22 01:41:11] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:41:11] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 01:41:11] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-05-22 01:41:11] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:41:11] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:41:12] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:41:12] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:41:12] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 01:41:12] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-05-22 01:41:12] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-05-22 01:41:12] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-05-22 01:41:12] [INFO ] Trap strengthening (SAT) tested/added 65/64 trap constraints in 7545 ms
[2020-05-22 01:41:12] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 161 ms.
[2020-05-22 01:41:14] [INFO ] Added : 101 causal constraints over 21 iterations in 2505 ms. Result :sat
[2020-05-22 01:41:15] [INFO ] [Real]Absence check using 200 positive place invariants in 85 ms returned sat
[2020-05-22 01:41:15] [INFO ] [Real]Absence check using 200 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-22 01:41:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:41:15] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2020-05-22 01:41:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:41:15] [INFO ] [Nat]Absence check using 200 positive place invariants in 83 ms returned sat
[2020-05-22 01:41:15] [INFO ] [Nat]Absence check using 200 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-22 01:41:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:41:16] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2020-05-22 01:41:16] [INFO ] [Nat]Added 100 Read/Feed constraints in 67 ms returned sat
[2020-05-22 01:41:16] [INFO ] Deduced a trap composed of 4 places in 210 ms
[2020-05-22 01:41:16] [INFO ] Deduced a trap composed of 4 places in 246 ms
[2020-05-22 01:41:17] [INFO ] Deduced a trap composed of 4 places in 211 ms
[2020-05-22 01:41:17] [INFO ] Deduced a trap composed of 4 places in 182 ms
[2020-05-22 01:41:17] [INFO ] Deduced a trap composed of 4 places in 172 ms
[2020-05-22 01:41:17] [INFO ] Deduced a trap composed of 4 places in 174 ms
[2020-05-22 01:41:17] [INFO ] Deduced a trap composed of 4 places in 166 ms
[2020-05-22 01:41:18] [INFO ] Deduced a trap composed of 4 places in 180 ms
[2020-05-22 01:41:18] [INFO ] Deduced a trap composed of 4 places in 240 ms
[2020-05-22 01:41:18] [INFO ] Deduced a trap composed of 4 places in 156 ms
[2020-05-22 01:41:18] [INFO ] Deduced a trap composed of 4 places in 132 ms
[2020-05-22 01:41:18] [INFO ] Deduced a trap composed of 4 places in 161 ms
[2020-05-22 01:41:19] [INFO ] Deduced a trap composed of 4 places in 154 ms
[2020-05-22 01:41:19] [INFO ] Deduced a trap composed of 4 places in 135 ms
[2020-05-22 01:41:19] [INFO ] Deduced a trap composed of 4 places in 140 ms
[2020-05-22 01:41:19] [INFO ] Deduced a trap composed of 4 places in 119 ms
[2020-05-22 01:41:19] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-05-22 01:41:19] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-05-22 01:41:19] [INFO ] Deduced a trap composed of 4 places in 140 ms
[2020-05-22 01:41:20] [INFO ] Deduced a trap composed of 4 places in 143 ms
[2020-05-22 01:41:20] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2020-05-22 01:41:20] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-05-22 01:41:20] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2020-05-22 01:41:20] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-05-22 01:41:20] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-05-22 01:41:20] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:41:21] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-05-22 01:41:21] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-05-22 01:41:21] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-05-22 01:41:21] [INFO ] Deduced a trap composed of 4 places in 105 ms
[2020-05-22 01:41:21] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-05-22 01:41:21] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-05-22 01:41:21] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-22 01:41:21] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-05-22 01:41:21] [INFO ] Deduced a trap composed of 4 places in 111 ms
[2020-05-22 01:41:22] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-05-22 01:41:22] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-05-22 01:41:22] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-05-22 01:41:22] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-05-22 01:41:22] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:41:22] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:41:22] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-05-22 01:41:22] [INFO ] Deduced a trap composed of 4 places in 105 ms
[2020-05-22 01:41:23] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2020-05-22 01:41:23] [INFO ] Deduced a trap composed of 4 places in 118 ms
[2020-05-22 01:41:23] [INFO ] Deduced a trap composed of 4 places in 106 ms
[2020-05-22 01:41:23] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-05-22 01:41:23] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2020-05-22 01:41:23] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-05-22 01:41:23] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-05-22 01:41:23] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-05-22 01:41:24] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-05-22 01:41:24] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:41:24] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-05-22 01:41:24] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-05-22 01:41:24] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:41:24] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:41:24] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-05-22 01:41:24] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-05-22 01:41:24] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-05-22 01:41:24] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-05-22 01:41:25] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:41:25] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:41:25] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-05-22 01:41:25] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-05-22 01:41:25] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-05-22 01:41:25] [INFO ] Trap strengthening (SAT) tested/added 67/66 trap constraints in 8992 ms
[2020-05-22 01:41:25] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 215 ms.
[2020-05-22 01:41:27] [INFO ] Added : 101 causal constraints over 21 iterations in 2419 ms. Result :sat
[2020-05-22 01:41:28] [INFO ] [Real]Absence check using 200 positive place invariants in 75 ms returned sat
[2020-05-22 01:41:28] [INFO ] [Real]Absence check using 200 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-22 01:41:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:41:28] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2020-05-22 01:41:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:41:28] [INFO ] [Nat]Absence check using 200 positive place invariants in 61 ms returned sat
[2020-05-22 01:41:28] [INFO ] [Nat]Absence check using 200 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-22 01:41:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:41:28] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2020-05-22 01:41:28] [INFO ] [Nat]Added 100 Read/Feed constraints in 29 ms returned sat
[2020-05-22 01:41:29] [INFO ] Deduced a trap composed of 4 places in 154 ms
[2020-05-22 01:41:29] [INFO ] Deduced a trap composed of 4 places in 158 ms
[2020-05-22 01:41:29] [INFO ] Deduced a trap composed of 4 places in 131 ms
[2020-05-22 01:41:29] [INFO ] Deduced a trap composed of 4 places in 123 ms
[2020-05-22 01:41:29] [INFO ] Deduced a trap composed of 4 places in 141 ms
[2020-05-22 01:41:29] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-05-22 01:41:29] [INFO ] Deduced a trap composed of 4 places in 106 ms
[2020-05-22 01:41:30] [INFO ] Deduced a trap composed of 4 places in 105 ms
[2020-05-22 01:41:30] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-05-22 01:41:30] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2020-05-22 01:41:30] [INFO ] Deduced a trap composed of 4 places in 132 ms
[2020-05-22 01:41:30] [INFO ] Deduced a trap composed of 4 places in 132 ms
[2020-05-22 01:41:30] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 01:41:30] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:41:30] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-05-22 01:41:30] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:41:31] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 01:41:31] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-05-22 01:41:31] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-05-22 01:41:31] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:41:31] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-22 01:41:31] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:41:31] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-05-22 01:41:31] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-05-22 01:41:31] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2020-05-22 01:41:31] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-05-22 01:41:31] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2020-05-22 01:41:31] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 01:41:32] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-05-22 01:41:32] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-05-22 01:41:32] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-05-22 01:41:32] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:41:32] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-05-22 01:41:32] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:41:32] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-05-22 01:41:32] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 01:41:32] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-05-22 01:41:32] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-05-22 01:41:32] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-05-22 01:41:32] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:41:32] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-05-22 01:41:33] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-05-22 01:41:33] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:41:33] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:41:33] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-05-22 01:41:33] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-05-22 01:41:33] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2020-05-22 01:41:33] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2020-05-22 01:41:33] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-05-22 01:41:33] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-05-22 01:41:33] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-05-22 01:41:33] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-22 01:41:33] [INFO ] Deduced a trap composed of 4 places in 36 ms
[2020-05-22 01:41:33] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2020-05-22 01:41:33] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 5046 ms
[2020-05-22 01:41:34] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 154 ms.
[2020-05-22 01:41:36] [INFO ] Added : 101 causal constraints over 21 iterations in 2579 ms. Result :sat
Discarding 376 places :
Also discarding 9588 output transitions
Drop transitions removed 9588 transitions
Graph (complete) has 605 edges and 401 vertex of which 25 are kept as prefixes of interest. Removing 376 places using SCC suffix rule.17 ms
Ensure Unique test removed 1 places
Ensure Unique test removed 588 transitions
Reduce isomorphic transitions removed 588 transitions.
Iterating post reduction 0 with 589 rules applied. Total rules applied 590 place count 24 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 599 place count 18 transition count 21
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 602 place count 18 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 603 place count 18 transition count 17
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 606 place count 16 transition count 16
Applied a total of 606 rules in 29 ms. Remains 16 /401 variables (removed 385) and now considering 16/10200 (removed 10184) transitions.
// Phase 1: matrix 16 rows 16 cols
[2020-05-22 01:41:36] [INFO ] Computed 8 place invariants in 0 ms
[2020-05-22 01:41:36] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-05-22 01:41:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:41:36] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2020-05-22 01:41:36] [INFO ] Computed and/alt/rep : 10/14/10 causal constraints in 1 ms.
[2020-05-22 01:41:36] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2020-05-22 01:41:36] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-05-22 01:41:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:41:36] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-05-22 01:41:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:41:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-05-22 01:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:41:36] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-05-22 01:41:36] [INFO ] Computed and/alt/rep : 10/14/10 causal constraints in 1 ms.
[2020-05-22 01:41:36] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2020-05-22 01:41:36] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-05-22 01:41:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:41:36] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-05-22 01:41:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:41:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-05-22 01:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:41:36] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-05-22 01:41:36] [INFO ] Computed and/alt/rep : 10/14/10 causal constraints in 1 ms.
[2020-05-22 01:41:36] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2020-05-22 01:41:37] [INFO ] Flatten gal took : 735 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 01:41:39] [INFO ] Applying decomposition
[2020-05-22 01:41:40] [INFO ] Flatten gal took : 1504 ms
[2020-05-22 01:41:40] [INFO ] Input system was already deterministic with 10200 transitions.
[2020-05-22 01:41:40] [INFO ] Too many transitions (10200) to apply POR reductions. Disabling POR matrices.
[2020-05-22 01:41:41] [INFO ] Input system was already deterministic with 10200 transitions.
[2020-05-22 01:41:41] [INFO ] Flatten gal took : 1732 ms
[2020-05-22 01:41:42] [INFO ] Built C files in 2740ms 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]
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/graph8637641557557179848.txt, -o, /tmp/graph8637641557557179848.bin, -w, /tmp/graph8637641557557179848.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph8637641557557179848.bin, -l, -1, -v, -w, /tmp/graph8637641557557179848.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 01:41:43] [INFO ] Decomposing Gal with order
[2020-05-22 01:41:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 01:41:45] [INFO ] Removed a total of 29400 redundant transitions.
[2020-05-22 01:41:46] [INFO ] Flatten gal took : 2221 ms
[2020-05-22 01:41:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 585 ms.
[2020-05-22 01:41:47] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 114 ms
[2020-05-22 01:41:47] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 1 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], 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
Loading property file ReachabilityCardinality.prop.
Read [reachable] property : Dekker-PT-100-ReachabilityCardinality-05 with value :((u59.p3_59!=0)&&(u71.p0_71!=1))
Read [invariant] property : Dekker-PT-100-ReachabilityCardinality-12 with value :((u7.p3_7==0)||(u19.p1_19==1))
Read [invariant] property : Dekker-PT-100-ReachabilityCardinality-15 with value :((u56.p3_56==0)||(u12.p1_12==1))
built 4951 ordering constraints for composite.
[2020-05-22 01:41:49] [INFO ] Ran tautology test, simplified 0 / 3 in 9396 ms.
[2020-05-22 01:41:49] [INFO ] BMC solution for property Dekker-PT-100-ReachabilityCardinality-05(UNSAT) depth K=0 took 35 ms
[2020-05-22 01:41:49] [INFO ] BMC solution for property Dekker-PT-100-ReachabilityCardinality-12(UNSAT) depth K=0 took 14 ms
[2020-05-22 01:41:49] [INFO ] BMC solution for property Dekker-PT-100-ReachabilityCardinality-15(UNSAT) depth K=0 took 10 ms
[2020-05-22 01:41:50] [INFO ] BMC solution for property Dekker-PT-100-ReachabilityCardinality-05(UNSAT) depth K=1 took 156 ms
[2020-05-22 01:41:50] [INFO ] BMC solution for property Dekker-PT-100-ReachabilityCardinality-12(UNSAT) depth K=1 took 25 ms
[2020-05-22 01:41:50] [INFO ] BMC solution for property Dekker-PT-100-ReachabilityCardinality-15(UNSAT) depth K=1 took 24 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
Invariant property Dekker-PT-100-ReachabilityCardinality-12 does not hold.
FORMULA Dekker-PT-100-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation, new max is 64
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
SDD proceeding with computation, new max is 128
Normalized transition count is 400 out of 10200 initially.
Invariant property Dekker-PT-100-ReachabilityCardinality-15 does not hold.
// Phase 1: matrix 400 rows 401 cols
FORMULA Dekker-PT-100-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation, new max is 256
[2020-05-22 01:41:52] [INFO ] Computed 201 place invariants in 23 ms
inv : flag_0_52 + flag_1_52 = 1
inv : flag_0_99 + p1_99 + p3_99 = 1
inv : flag_0_5 + p1_5 + p3_5 = 1
inv : flag_0_62 + flag_1_62 = 1
inv : flag_0_23 + p1_23 + p3_23 = 1
inv : flag_0_72 + p1_72 + p3_72 = 1
inv : flag_0_90 + p1_90 + p3_90 = 1
inv : flag_0_32 + flag_1_32 = 1
inv : flag_0_42 + flag_1_42 = 1
inv : flag_0_27 + flag_1_27 = 1
inv : flag_0_14 + p1_14 + p3_14 = 1
inv : flag_0_50 + p1_50 + p3_50 = 1
inv : flag_0_87 + flag_1_87 = 1
inv : flag_0_67 + flag_1_67 = 1
inv : flag_0_47 + flag_1_47 = 1
inv : flag_0_2 + flag_1_2 = 1
inv : flag_0_7 + flag_1_7 = 1
inv : flag_0_59 + p1_59 + p3_59 = 1
inv : flag_0_46 + p1_46 + p3_46 = 1
inv : flag_0_64 + p1_64 + p3_64 = 1
inv : flag_0_82 + flag_1_82 = 1
inv : flag_0_32 + p1_32 + p3_32 = 1
inv : flag_0_19 + p1_19 + p3_19 = 1
inv : flag_0_77 + flag_1_77 = 1
inv : flag_0_72 + flag_1_72 = 1
inv : flag_0_81 + p1_81 + p3_81 = 1
inv : flag_0_37 + flag_1_37 = 1
inv : flag_0_86 + p1_86 + p3_86 = 1
inv : flag_0_77 + p1_77 + p3_77 = 1
inv : flag_0_1 + p1_1 + p3_1 = 1
inv : flag_0_27 + p1_27 + p3_27 = 1
inv : flag_0_4 + flag_1_4 = 1
inv : flag_0_14 + flag_1_14 = 1
inv : flag_0_94 + p1_94 + p3_94 = 1
inv : flag_0_90 + flag_1_90 = 1
inv : flag_0_75 + flag_1_75 = 1
inv : flag_0_51 + p1_51 + p3_51 = 1
inv : flag_0_39 + flag_1_39 = 1
inv : flag_0_36 + p1_36 + p3_36 = 1
inv : flag_0_97 + flag_1_97 = 1
inv : flag_0_68 + p1_68 + p3_68 = 1
inv : flag_0_55 + p1_55 + p3_55 = 1
inv : flag_0_42 + p1_42 + p3_42 = 1
inv : flag_0_71 + p1_71 + p3_71 = 1
inv : flag_0_17 + flag_1_17 = 1
inv : flag_0_65 + flag_1_65 = 1
inv : flag_0_49 + flag_1_49 = 1
inv : flag_0_10 + p1_10 + p3_10 = 1
inv : flag_0_15 + flag_1_15 = 1
inv : flag_0_84 + flag_1_84 = 1
inv : flag_0_94 + flag_1_94 = 1
inv : flag_0_82 + p1_82 + p3_82 = 1
inv : flag_0_22 + p1_22 + p3_22 = 1
inv : flag_0_49 + p1_49 + p349 = 1
inv : flag_0_0 + flag_1_0 = 1
inv : flag_0_4 + p1_4 + p3_4 = 1
inv : flag_0_20 + flag_1_20 = 1
inv : flag_0_30 + flag_1_30 = 1
inv : flag_0_67 + p1_67 + p3_67 = 1
inv : flag_0_99 + flag_1_99 = 1
inv : flag_0_79 + flag_1_79 = 1
inv : flag_0_55 + flag_1_55 = 1
inv : flag_0_59 + flag_1_59 = 1
inv : flag_0_35 + flag_1_35 = 1
inv : flag_0_29 + p1_29 + p3_29 = 1
inv : flag_0_33 + p1_33 + p3_33 = 1
inv : flag_0_63 + p1_63 + p3_63 = 1
inv : flag_0_15 + p1_15 + p3_15 = 1
inv : flag_0_24 + flag_1_24 = 1
inv : flag_0_60 + p1_60 + p3_60 = 1
inv : flag_0_50 + flag_1_50 = 1
inv : flag_0_93 + flag_1_93 = 1
inv : flag_0_64 + flag_1_64 = 1
inv : flag_0_85 + flag_1_85 = 1
inv : flag_0_88 + flag_1_88 = 1
inv : flag_0_21 + flag_1_21 = 1
inv : flag_0_29 + flag_1_29 = 1
inv : flag_0_96 + p1_96 + p3_96 = 1
inv : flag_0_73 + flag_1_73 = 1
inv : flag_0_0 + p1_0 + p3_0 = 1
inv : flag_0_18 + p1_18 + p3_18 = 1
inv : flag_0_26 + p1_26 + p3_26 = 1
inv : flag_0_52 + p1_52 + p3_52 = 1
inv : flag_0_45 + p1_45 + p3_45 = 1
inv : flag_0_78 + p1_78 + p3_78 = 1
inv : flag_0_93 + p1_93 + p3_93 = 1
inv : flag_0_85 + p1_85 + p3_85 = 1
inv : flag_0_7 + p1_7 + p3_7 = 1
inv : flag_0_76 + flag_1_76 = 1
inv : flag_0_11 + p1_11 + p3_11 = 1
inv : flag_0_37 + p1_37 + p3_37 = 1
inv : flag_0_70 + flag_1_70 = 1
inv : flag_0_12 + flag_1_12 = 1
inv : flag_0_41 + p1_41 + p3_41 = 1
inv : flag_0_38 + flag_1_38 = 1
inv : flag_0_44 + flag_1_44 = 1
inv : flag_0_56 + p1_56 + p3_56 = 1
inv : flag_0_74 + p1_74 + p3_74 = 1
inv : flag_0_6 + flag_1_6 = 1
inv : flag_0_89 + p1_89 + p3_89 = 1
inv : flag_0_9 + flag_1_9 = 1
inv : flag_0_41 + flag_1_41 = 1
inv : flag_0_66 + p1_66 + p3_66 = 1
inv : flag_0_48 + p1_48 + p3_48 = 1
inv : flag_0_57 + p1_57 + p3_57 = 1
inv : flag_0_3 + flag_1_3 = 1
inv : flag_0_30 + p1_30 + p3_30 = 1
inv : flag_0_91 + flag_1_91 = 1
inv : flag_0_92 + p1_92 + p3_92 = 1
inv : flag_0_21 + p1_21 + p3_21 = 1
inv : flag_0_23 + flag_1_23 = 1
inv : flag_0_97 + p1_97 + p3_97 = 1
inv : flag_0_66 + flag_1_66 = 1
inv : flag_1_71 - p1_71 - p3_71 = 0
inv : flag_0_8 + flag_1_8 = 1
inv : flag_0_16 + p1_16 + p3_16 = 1
inv : flag_0_18 + flag_1_18 = 1
inv : flag_0_79 + p1_79 + p3_79 = 1
inv : flag_0_34 + p1_34 + p3_34 = 1
inv : flag_0_83 + p1_83 + p3_83 = 1
inv : flag_0_56 + flag_1_56 = 1
inv : flag_0_96 + flag_1_96 = 1
inv : flag_0_62 + p1_62 + p3_62 = 1
inv : flag_0_13 + flag_1_13 = 1
inv : flag_0_61 + p1_61 + p3_61 = 1
inv : flag_0_3 + p1_3 + p3_3 = 1
inv : flag_0_53 + flag_1_53 = 1
inv : flag_0_61 + flag_1_61 = 1
inv : flag_0_44 + p1_44 + p3_44 = 1
inv : flag_0_68 + flag_1_68 = 1
inv : flag_0_53 + p1_53 + p3_53 = 1
inv : flag_0_70 + p1_70 + p3_70 = 1
inv : flag_0_58 + flag_1_58 = 1
inv : flag_0_78 + flag_1_78 = 1
inv : flag_0_26 + flag_1_26 = 1
inv : flag_0_36 + flag_1_36 = 1
inv : flag_0_46 + flag_1_46 = 1
inv : flag_0_8 + p1_8 + p3_8 = 1
inv : flag_0_11 + flag_1_11 = 1
inv : flag_0_43 + flag_1_43 = 1
inv : flag_0_75 + p1_75 + p3_75 = 1
inv : flag_0_88 + p1_88 + p3_88 = 1
inv : flag_0_81 + flag_1_81 = 1
inv : flag_0_38 + p1_38 + p3_38 = 1
inv : flag_0_12 + p1_12 + p3_12 = 1
inv : flag_0_25 + p1_25 + p3_25 = 1
inv : flag_0_1 + flag_1_1 = 1
inv : flag_0_40 + p1_40 + p3_40 = 1
inv : flag_0_33 + flag_1_33 = 1
inv : flag_0_89 + flag_1_89 = 1
inv : flag_0_31 + p1_31 + p3_31 = 1
inv : flag_0_10 + flag_1_10 = 1
inv : flag_0_73 + p1_73 + p3_73 = 1
inv : flag_0_74 + flag_1_74 = 1
inv : flag_0_98 + p1_98 + p3_98 = 1
inv : flag_0_91 + p1_91 + p3_91 = 1
inv : flag_0_13 + p1_13 + p3_13 = 1
inv : flag_0_65 + p1_65 + p3_65 = 1
inv : flag_0_6 + p1_6 + p3_6 = 1
inv : flag_0_58 + p1_58 + p3_58 = 1
inv : flag_0_20 + p1_20 + p3_20 = 1
inv : flag_0_84 + p1_84 + p3_84 = 1
inv : flag_0_40 + flag_1_40 = 1
inv : flag_0_34 + flag_1_34 = 1
inv : flag_0_69 + flag_1_69 = 1
inv : flag_0_80 + flag_1_80 = 1
inv : flag_0_80 + p1_80 + p3_80 = 1
inv : flag_0_2 + p1_2 + p3_2 = 1
inv : flag_0_5 + flag_1_5 = 1
inv : flag_0_17 + p1_17 + p3_17 = 1
inv : flag_0_47 + p1_47 + p3_47 = 1
inv : flag_0_45 + flag_1_45 = 1
inv : flag_0_31 + flag_1_31 = 1
inv : flag_0_35 + p1_35 + p3_35 = 1
inv : flag_0_9 + p1_9 + p3_9 = 1
inv : flag_0_95 + p1_95 + p3_95 = 1
inv : flag_0_16 + flag_1_16 = 1
inv : flag_0_48 + flag_1_48 = 1
inv : flag_0_19 + flag_1_19 = 1
inv : flag_0_43 + p1_43 + p3_43 = 1
inv : flag_0_76 + p1_76 + p3_76 = 1
inv : flag_0_98 + flag_1_98 = 1
inv : flag_0_95 + flag_1_95 = 1
inv : flag_0_83 + flag_1_83 = 1
inv : flag_0_28 + p1_28 + p3_28 = 1
inv : flag_0_51 + flag_1_51 = 1
inv : flag_0_63 + flag_1_63 = 1
inv : flag_0_60 + flag_1_60 = 1
inv : flag_0_92 + flag_1_92 = 1
inv : flag_0_24 + p1_24 + p3_24 = 1
inv : flag_0_54 + flag_1_54 = 1
inv : p0_71 + p1_71 + p3_71 = 1
inv : flag_0_86 + flag_1_86 = 1
inv : flag_0_28 + flag_1_28 = 1
inv : flag_0_22 + flag_1_22 = 1
inv : flag_0_87 + p1_87 + p3_87 = 1
inv : flag_0_54 + p1_54 + p3_54 = 1
inv : flag_0_25 + flag_1_25 = 1
inv : flag_0_39 + p1_39 + p3_39 = 1
inv : flag_0_57 + flag_1_57 = 1
inv : flag_0_69 + p1_69 + p3_69 = 1
Total of 201 invariants.
[2020-05-22 01:41:52] [INFO ] Computed 201 place invariants in 37 ms
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.46502e+31,4.68752,40360,205,15,7088,5189,10625,7190,38,5132,0
Total reachable state count : 64650180611639699476331863474176

Verifying 3 reachability properties.
Reachability property Dekker-PT-100-ReachabilityCardinality-05 is true.
FORMULA Dekker-PT-100-ReachabilityCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-100-ReachabilityCardinality-05,3.16913e+29,4.69216,40360,104,10,7088,5189,10626,7190,41,5132,4
Invariant property Dekker-PT-100-ReachabilityCardinality-12 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-100-ReachabilityCardinality-12,3.16913e+29,4.69335,40360,105,14,7088,5189,10632,7190,45,5132,40
Invariant property Dekker-PT-100-ReachabilityCardinality-15 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-100-ReachabilityCardinality-15,3.16913e+29,4.69466,40360,105,14,7088,5189,10636,7190,45,5132,136
[2020-05-22 01:41:52] [WARNING] Interrupting SMT solver.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2020-05-22 01:41:52] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Exception in thread "Thread-7" java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:282)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-22 01:41:52] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-22 01:41:52] [WARNING] Unexpected error occurred while running SMT. Was verifying Dekker-PT-100-ReachabilityCardinality-05 SMT depth 2
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
... 3 more
[2020-05-22 01:41:52] [INFO ] During BMC, SMT solver timed out at depth 2
[2020-05-22 01:41:52] [INFO ] BMC solving timed out (3600000 secs) at depth 2
[2020-05-22 01:41:52] [INFO ] SMT solved 0/ 3 properties. Interrupting SMT analysis.

BK_STOP 1590111712931

--------------------
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="Dekker-PT-100"
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 Dekker-PT-100, 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 r066-tajo-158922814200342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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