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

--------------------
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 1591217857870

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:57:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 20:57:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:57:40] [INFO ] Load time of PNML (sax parser for PT used): 380 ms
[2020-06-03 20:57:40] [INFO ] Transformed 500 places.
[2020-06-03 20:57:40] [INFO ] Transformed 10200 transitions.
[2020-06-03 20:57:40] [INFO ] Found NUPN structural information;
[2020-06-03 20:57:40] [INFO ] Parsed PT model containing 500 places and 10200 transitions in 470 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 80 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 244 ms. (steps per millisecond=40 ) 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 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 1, 0, 0]
FORMULA Dekker-PT-100-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0]
[2020-06-03 20:57:40] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2020-06-03 20:57:40] [INFO ] Computed 300 place invariants in 42 ms
[2020-06-03 20:57:41] [INFO ] [Real]Absence check using 200 positive place invariants in 106 ms returned sat
[2020-06-03 20:57:41] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 54 ms returned sat
[2020-06-03 20:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:57:41] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2020-06-03 20:57:41] [INFO ] State equation strengthened by 100 read => feed constraints.
[2020-06-03 20:57:41] [INFO ] [Real]Added 100 Read/Feed constraints in 46 ms returned sat
[2020-06-03 20:57:42] [INFO ] Deduced a trap composed of 4 places in 227 ms
[2020-06-03 20:57:42] [INFO ] Deduced a trap composed of 4 places in 118 ms
[2020-06-03 20:57:42] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-06-03 20:57:42] [INFO ] Deduced a trap composed of 6 places in 98 ms
[2020-06-03 20:57:42] [INFO ] Deduced a trap composed of 6 places in 72 ms
[2020-06-03 20:57:42] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 20:57:42] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-03 20:57:42] [INFO ] Deduced a trap composed of 6 places in 56 ms
[2020-06-03 20:57:42] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 20:57:43] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-06-03 20:57:43] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-06-03 20:57:43] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 20:57:43] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-06-03 20:57:43] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-06-03 20:57:43] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-06-03 20:57:43] [INFO ] Deduced a trap composed of 5 places in 58 ms
[2020-06-03 20:57:43] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 20:57:43] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-06-03 20:57:43] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1808 ms
[2020-06-03 20:57:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:57:43] [INFO ] [Nat]Absence check using 200 positive place invariants in 92 ms returned sat
[2020-06-03 20:57:43] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 42 ms returned sat
[2020-06-03 20:57:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:57:44] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2020-06-03 20:57:44] [INFO ] [Nat]Added 100 Read/Feed constraints in 36 ms returned sat
[2020-06-03 20:57:44] [INFO ] Deduced a trap composed of 4 places in 183 ms
[2020-06-03 20:57:44] [INFO ] Deduced a trap composed of 4 places in 134 ms
[2020-06-03 20:57:45] [INFO ] Deduced a trap composed of 4 places in 132 ms
[2020-06-03 20:57:45] [INFO ] Deduced a trap composed of 6 places in 137 ms
[2020-06-03 20:57:45] [INFO ] Deduced a trap composed of 4 places in 177 ms
[2020-06-03 20:57:45] [INFO ] Deduced a trap composed of 4 places in 137 ms
[2020-06-03 20:57:45] [INFO ] Deduced a trap composed of 4 places in 136 ms
[2020-06-03 20:57:45] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2020-06-03 20:57:46] [INFO ] Deduced a trap composed of 4 places in 110 ms
[2020-06-03 20:57:46] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-06-03 20:57:46] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2020-06-03 20:57:46] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-06-03 20:57:46] [INFO ] Deduced a trap composed of 6 places in 87 ms
[2020-06-03 20:57:46] [INFO ] Deduced a trap composed of 5 places in 76 ms
[2020-06-03 20:57:46] [INFO ] Deduced a trap composed of 5 places in 76 ms
[2020-06-03 20:57:46] [INFO ] Deduced a trap composed of 6 places in 92 ms
[2020-06-03 20:57:47] [INFO ] Deduced a trap composed of 5 places in 85 ms
[2020-06-03 20:57:47] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2020-06-03 20:57:47] [INFO ] Deduced a trap composed of 5 places in 79 ms
[2020-06-03 20:57:47] [INFO ] Deduced a trap composed of 5 places in 82 ms
[2020-06-03 20:57:47] [INFO ] Deduced a trap composed of 4 places in 114 ms
[2020-06-03 20:57:47] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2020-06-03 20:57:47] [INFO ] Deduced a trap composed of 6 places in 93 ms
[2020-06-03 20:57:47] [INFO ] Deduced a trap composed of 5 places in 103 ms
[2020-06-03 20:57:48] [INFO ] Deduced a trap composed of 5 places in 78 ms
[2020-06-03 20:57:48] [INFO ] Deduced a trap composed of 5 places in 74 ms
[2020-06-03 20:57:48] [INFO ] Deduced a trap composed of 6 places in 105 ms
[2020-06-03 20:57:48] [INFO ] Deduced a trap composed of 5 places in 86 ms
[2020-06-03 20:57:48] [INFO ] Deduced a trap composed of 5 places in 81 ms
[2020-06-03 20:57:48] [INFO ] Deduced a trap composed of 5 places in 102 ms
[2020-06-03 20:57:48] [INFO ] Deduced a trap composed of 5 places in 78 ms
[2020-06-03 20:57:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 20:57:50] [INFO ] Deduced a trap composed of 2 places in 1420 ms
[2020-06-03 20:57:50] [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-06-03 20:57:50] [INFO ] [Real]Absence check using 200 positive place invariants in 65 ms returned sat
[2020-06-03 20:57:50] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 38 ms returned sat
[2020-06-03 20:57:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:57:50] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2020-06-03 20:57:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:57:51] [INFO ] [Nat]Absence check using 200 positive place invariants in 92 ms returned sat
[2020-06-03 20:57:51] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 54 ms returned sat
[2020-06-03 20:57:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:57:51] [INFO ] [Nat]Absence check using state equation in 695 ms returned sat
[2020-06-03 20:57:51] [INFO ] [Nat]Added 100 Read/Feed constraints in 44 ms returned sat
[2020-06-03 20:57:51] [INFO ] Deduced a trap composed of 6 places in 130 ms
[2020-06-03 20:57:52] [INFO ] Deduced a trap composed of 6 places in 153 ms
[2020-06-03 20:57:52] [INFO ] Deduced a trap composed of 4 places in 126 ms
[2020-06-03 20:57:52] [INFO ] Deduced a trap composed of 4 places in 126 ms
[2020-06-03 20:57:52] [INFO ] Deduced a trap composed of 4 places in 130 ms
[2020-06-03 20:57:52] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2020-06-03 20:57:52] [INFO ] Deduced a trap composed of 4 places in 128 ms
[2020-06-03 20:57:53] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2020-06-03 20:57:53] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-06-03 20:57:53] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-06-03 20:57:53] [INFO ] Deduced a trap composed of 5 places in 89 ms
[2020-06-03 20:57:53] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-06-03 20:57:53] [INFO ] Deduced a trap composed of 5 places in 59 ms
[2020-06-03 20:57:53] [INFO ] Deduced a trap composed of 5 places in 91 ms
[2020-06-03 20:57:53] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-06-03 20:57:53] [INFO ] Deduced a trap composed of 5 places in 80 ms
[2020-06-03 20:57:54] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 20:57:54] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2020-06-03 20:57:54] [INFO ] Deduced a trap composed of 5 places in 83 ms
[2020-06-03 20:57:54] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-06-03 20:57:54] [INFO ] Deduced a trap composed of 5 places in 62 ms
[2020-06-03 20:57:54] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 20:57:54] [INFO ] Deduced a trap composed of 5 places in 68 ms
[2020-06-03 20:57:54] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-06-03 20:57:54] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-06-03 20:57:54] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-06-03 20:57:54] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-06-03 20:57:54] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3152 ms
[2020-06-03 20:57:55] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 220 ms.
[2020-06-03 20:57:55] [INFO ] Added : 45 causal constraints over 9 iterations in 864 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 20:57:56] [INFO ] [Real]Absence check using 200 positive place invariants in 90 ms returned sat
[2020-06-03 20:57:56] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 50 ms returned sat
[2020-06-03 20:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:57:56] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2020-06-03 20:57:56] [INFO ] [Real]Added 100 Read/Feed constraints in 32 ms returned sat
[2020-06-03 20:57:56] [INFO ] Deduced a trap composed of 4 places in 184 ms
[2020-06-03 20:57:57] [INFO ] Deduced a trap composed of 4 places in 135 ms
[2020-06-03 20:57:57] [INFO ] Deduced a trap composed of 4 places in 131 ms
[2020-06-03 20:57:57] [INFO ] Deduced a trap composed of 6 places in 112 ms
[2020-06-03 20:57:57] [INFO ] Deduced a trap composed of 6 places in 106 ms
[2020-06-03 20:57:57] [INFO ] Deduced a trap composed of 4 places in 133 ms
[2020-06-03 20:57:57] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-06-03 20:57:57] [INFO ] Deduced a trap composed of 6 places in 94 ms
[2020-06-03 20:57:58] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-06-03 20:57:58] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 20:57:58] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-06-03 20:57:58] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-03 20:57:58] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-06-03 20:57:58] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-06-03 20:57:58] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 20:57:58] [INFO ] Deduced a trap composed of 5 places in 59 ms
[2020-06-03 20:57:58] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-06-03 20:57:58] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-06-03 20:57:58] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2272 ms
[2020-06-03 20:57:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:57:59] [INFO ] [Nat]Absence check using 200 positive place invariants in 84 ms returned sat
[2020-06-03 20:57:59] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 49 ms returned sat
[2020-06-03 20:57:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:57:59] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2020-06-03 20:58:00] [INFO ] [Nat]Added 100 Read/Feed constraints in 37 ms returned sat
[2020-06-03 20:58:00] [INFO ] Deduced a trap composed of 6 places in 165 ms
[2020-06-03 20:58:00] [INFO ] Deduced a trap composed of 4 places in 152 ms
[2020-06-03 20:58:00] [INFO ] Deduced a trap composed of 6 places in 136 ms
[2020-06-03 20:58:00] [INFO ] Deduced a trap composed of 4 places in 118 ms
[2020-06-03 20:58:00] [INFO ] Deduced a trap composed of 4 places in 127 ms
[2020-06-03 20:58:00] [INFO ] Deduced a trap composed of 4 places in 118 ms
[2020-06-03 20:58:01] [INFO ] Deduced a trap composed of 4 places in 119 ms
[2020-06-03 20:58:01] [INFO ] Deduced a trap composed of 4 places in 133 ms
[2020-06-03 20:58:01] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2020-06-03 20:58:01] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-06-03 20:58:01] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 20:58:01] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-06-03 20:58:01] [INFO ] Deduced a trap composed of 6 places in 96 ms
[2020-06-03 20:58:01] [INFO ] Deduced a trap composed of 6 places in 84 ms
[2020-06-03 20:58:02] [INFO ] Deduced a trap composed of 6 places in 117 ms
[2020-06-03 20:58:02] [INFO ] Deduced a trap composed of 6 places in 95 ms
[2020-06-03 20:58:02] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 20:58:02] [INFO ] Deduced a trap composed of 6 places in 110 ms
[2020-06-03 20:58:02] [INFO ] Deduced a trap composed of 6 places in 92 ms
[2020-06-03 20:58:02] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 20:58:02] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-06-03 20:58:02] [INFO ] Deduced a trap composed of 6 places in 101 ms
[2020-06-03 20:58:03] [INFO ] Deduced a trap composed of 6 places in 94 ms
[2020-06-03 20:58:03] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-06-03 20:58:03] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2020-06-03 20:58:03] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 20:58:03] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-06-03 20:58:03] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-03 20:58:03] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 20:58:03] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 20:58:03] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 20:58:03] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-06-03 20:58:04] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 4008 ms
[2020-06-03 20:58:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 2
[2020-06-03 20:58:04] [INFO ] [Real]Absence check using 200 positive place invariants in 94 ms returned sat
[2020-06-03 20:58:04] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 56 ms returned sat
[2020-06-03 20:58:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:58:04] [INFO ] [Real]Absence check using state equation in 667 ms returned sat
[2020-06-03 20:58:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:58:05] [INFO ] [Nat]Absence check using 200 positive place invariants in 99 ms returned sat
[2020-06-03 20:58:05] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 51 ms returned sat
[2020-06-03 20:58:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:58:05] [INFO ] [Nat]Absence check using state equation in 689 ms returned sat
[2020-06-03 20:58:05] [INFO ] [Nat]Added 100 Read/Feed constraints in 32 ms returned sat
[2020-06-03 20:58:06] [INFO ] Deduced a trap composed of 4 places in 151 ms
[2020-06-03 20:58:06] [INFO ] Deduced a trap composed of 4 places in 141 ms
[2020-06-03 20:58:06] [INFO ] Deduced a trap composed of 4 places in 141 ms
[2020-06-03 20:58:06] [INFO ] Deduced a trap composed of 4 places in 134 ms
[2020-06-03 20:58:06] [INFO ] Deduced a trap composed of 4 places in 143 ms
[2020-06-03 20:58:06] [INFO ] Deduced a trap composed of 4 places in 132 ms
[2020-06-03 20:58:07] [INFO ] Deduced a trap composed of 6 places in 127 ms
[2020-06-03 20:58:07] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-06-03 20:58:07] [INFO ] Deduced a trap composed of 6 places in 107 ms
[2020-06-03 20:58:07] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2020-06-03 20:58:07] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-06-03 20:58:07] [INFO ] Deduced a trap composed of 5 places in 73 ms
[2020-06-03 20:58:07] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-06-03 20:58:07] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 20:58:07] [INFO ] Deduced a trap composed of 5 places in 60 ms
[2020-06-03 20:58:08] [INFO ] Deduced a trap composed of 5 places in 63 ms
[2020-06-03 20:58:08] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-06-03 20:58:08] [INFO ] Deduced a trap composed of 5 places in 62 ms
[2020-06-03 20:58:08] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 20:58:08] [INFO ] Deduced a trap composed of 5 places in 75 ms
[2020-06-03 20:58:08] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 20:58:08] [INFO ] Deduced a trap composed of 5 places in 52 ms
[2020-06-03 20:58:08] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-06-03 20:58:08] [INFO ] Deduced a trap composed of 5 places in 58 ms
[2020-06-03 20:58:08] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-03 20:58:08] [INFO ] Deduced a trap composed of 5 places in 63 ms
[2020-06-03 20:58:08] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 20:58:09] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 20:58:09] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-06-03 20:58:09] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 20:58:09] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2020-06-03 20:58:09] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2020-06-03 20:58:09] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 3444 ms
[2020-06-03 20:58:09] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 164 ms.
[2020-06-03 20:58:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t120 0) (or (and (and (> t1 0) (< o1 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t5 0) (< o5 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t9 0) (< o9 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t13 0) (< o13 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t17 0) (< o17 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t21 0) (< o21 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t25 0) (< o25 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t29 0) (< o29 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t33 0) (< o33 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t37 0) (< o37 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t41 0) (< o41 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t45 0) (< o45 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t49 0) (< o49 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t53 0) (< o53 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t57 0) (< o57 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t61 0) (< o61 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t65 0) (< o65 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t69 0) (< o69 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t73 0) (< o73 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t77 0) (< o77 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t81 0) (< o81 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t85 0) (< o85 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t89 0) (< o89 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t93 0) (< o93 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t97 0) (< o97 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t101 0) (< o101 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t105 0) (< o105 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t109 0) (< o109 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t113 0) (< o113 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t117 0) (< o117 o120)) (and (> t121 0) (< o121 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t125 0) (< o125 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t129 0) (< o129 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t133 0) (< o133 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t137 0) (< o137 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t141 0) (< o141 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t145 0) (< o145 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t149 0) (< o149 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t153 0) (< o153 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t157 0) (< o157 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t161 0) (< o161 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t165 0) (< o165 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t169 0) (< o169 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t173 0) (< o173 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t177 0) (< o177 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t181 0) (< o181 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t185 0) (< o185 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t189 0) (< o189 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t193 0) (< o193 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t197 0) (< o197 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t201 0) (< o201 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t205 0) (< o205 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t209 0) (< o209 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t213 0) (< o213 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t217 0) (< o217 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t221 0) (< o221 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t225 0) (< o225 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t229 0) (< o229 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t233 0) (< o233 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t237 0) (< o237 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t241 0) (< o241 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t245 0) (< o245 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t249 0) (< o249 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t253 0) (< o253 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t257 0) (< o257 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t261 0) (< o261 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t265 0) (< o265 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t269 0) (< o269 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t273 0) (< o273 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t277 0) (< o277 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t281 0) (< o281 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t285 0) (< o285 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t289 0) (< o289 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t293 0) (< o293 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t297 0) (< o297 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t301 0) (< o301 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t305 0) (< o305 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t309 0) (< o309 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t313 0) (< o313 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t317 0) (< o317 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t321 0) (< o321 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t325 0) (< o325 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t329 0) (< o329 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t333 0) (< o333 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t337 0) (< o337 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t341 0) (< o341 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t345 0) (< o345 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t349 0) (< o349 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t353 0) (< o353 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t357 0) (< o357 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t361 0) (< o361 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t365 0) (< o365 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t369 0) (< o369 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t373 0) (< o373 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t377 0) (< o377 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t381 0) (< o381 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t385 0) (< o385 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t389 0) (< o389 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t393 0) (< o393 o120)) (and (> t121 0) (< o121 o120))) (and (and (> t121 0) (< o121 o120)) (and (> t397 0) (< o397 o120)) (and (> t121 0) (< o121 o120)))))") while checking expression at index 3
Support contains 14 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 1240 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 15453 ms. (steps per millisecond=64 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3014 ms. (steps per millisecond=331 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3769 ms. (steps per millisecond=265 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3372 ms. (steps per millisecond=296 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2988 ms. (steps per millisecond=334 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 4608505 steps, run timeout after 30001 ms. (steps per millisecond=153 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 4608505 steps, saw 25937 distinct states, run finished after 30003 ms. (steps per millisecond=153 ) properties seen :[0, 0, 0, 0]
[2020-06-03 20:59:09] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2020-06-03 20:59:09] [INFO ] Computed 300 place invariants in 6 ms
[2020-06-03 20:59:09] [INFO ] [Real]Absence check using 200 positive place invariants in 68 ms returned sat
[2020-06-03 20:59:10] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 38 ms returned sat
[2020-06-03 20:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:59:10] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2020-06-03 20:59:10] [INFO ] State equation strengthened by 100 read => feed constraints.
[2020-06-03 20:59:10] [INFO ] [Real]Added 100 Read/Feed constraints in 36 ms returned sat
[2020-06-03 20:59:10] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-06-03 20:59:11] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-06-03 20:59:11] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-06-03 20:59:11] [INFO ] Deduced a trap composed of 6 places in 93 ms
[2020-06-03 20:59:11] [INFO ] Deduced a trap composed of 6 places in 85 ms
[2020-06-03 20:59:11] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-06-03 20:59:11] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 20:59:11] [INFO ] Deduced a trap composed of 6 places in 64 ms
[2020-06-03 20:59:11] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 20:59:11] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 20:59:11] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 20:59:12] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 20:59:12] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-06-03 20:59:12] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 20:59:12] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 20:59:12] [INFO ] Deduced a trap composed of 5 places in 39 ms
[2020-06-03 20:59:12] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2020-06-03 20:59:12] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2020-06-03 20:59:12] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1658 ms
[2020-06-03 20:59:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:59:12] [INFO ] [Nat]Absence check using 200 positive place invariants in 85 ms returned sat
[2020-06-03 20:59:12] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 48 ms returned sat
[2020-06-03 20:59:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:59:13] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2020-06-03 20:59:13] [INFO ] [Nat]Added 100 Read/Feed constraints in 33 ms returned sat
[2020-06-03 20:59:13] [INFO ] Deduced a trap composed of 4 places in 120 ms
[2020-06-03 20:59:13] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2020-06-03 20:59:13] [INFO ] Deduced a trap composed of 4 places in 114 ms
[2020-06-03 20:59:13] [INFO ] Deduced a trap composed of 6 places in 99 ms
[2020-06-03 20:59:14] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 20:59:14] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-06-03 20:59:14] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-06-03 20:59:14] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-06-03 20:59:14] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 20:59:14] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 20:59:14] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-06-03 20:59:14] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 20:59:14] [INFO ] Deduced a trap composed of 6 places in 60 ms
[2020-06-03 20:59:14] [INFO ] Deduced a trap composed of 5 places in 54 ms
[2020-06-03 20:59:14] [INFO ] Deduced a trap composed of 5 places in 46 ms
[2020-06-03 20:59:15] [INFO ] Deduced a trap composed of 6 places in 59 ms
[2020-06-03 20:59:15] [INFO ] Deduced a trap composed of 5 places in 64 ms
[2020-06-03 20:59:15] [INFO ] Deduced a trap composed of 6 places in 83 ms
[2020-06-03 20:59:15] [INFO ] Deduced a trap composed of 5 places in 59 ms
[2020-06-03 20:59:15] [INFO ] Deduced a trap composed of 5 places in 75 ms
[2020-06-03 20:59:15] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-06-03 20:59:15] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 20:59:15] [INFO ] Deduced a trap composed of 6 places in 63 ms
[2020-06-03 20:59:15] [INFO ] Deduced a trap composed of 5 places in 83 ms
[2020-06-03 20:59:15] [INFO ] Deduced a trap composed of 5 places in 77 ms
[2020-06-03 20:59:16] [INFO ] Deduced a trap composed of 5 places in 74 ms
[2020-06-03 20:59:16] [INFO ] Deduced a trap composed of 6 places in 80 ms
[2020-06-03 20:59:16] [INFO ] Deduced a trap composed of 5 places in 84 ms
[2020-06-03 20:59:16] [INFO ] Deduced a trap composed of 5 places in 84 ms
[2020-06-03 20:59:16] [INFO ] Deduced a trap composed of 5 places in 84 ms
[2020-06-03 20:59:16] [INFO ] Deduced a trap composed of 5 places in 174 ms
[2020-06-03 20:59:16] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-06-03 20:59:16] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-06-03 20:59:16] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-06-03 20:59:16] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-06-03 20:59:17] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-06-03 20:59:17] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 3670 ms
[2020-06-03 20:59:17] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 217 ms.
[2020-06-03 20:59:19] [INFO ] Added : 101 causal constraints over 21 iterations in 2466 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 113 ms.
[2020-06-03 20:59:19] [INFO ] [Real]Absence check using 200 positive place invariants in 99 ms returned sat
[2020-06-03 20:59:19] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 55 ms returned sat
[2020-06-03 20:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:59:20] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2020-06-03 20:59:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:59:20] [INFO ] [Nat]Absence check using 200 positive place invariants in 91 ms returned sat
[2020-06-03 20:59:20] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 51 ms returned sat
[2020-06-03 20:59:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:59:21] [INFO ] [Nat]Absence check using state equation in 695 ms returned sat
[2020-06-03 20:59:21] [INFO ] [Nat]Added 100 Read/Feed constraints in 49 ms returned sat
[2020-06-03 20:59:21] [INFO ] Deduced a trap composed of 6 places in 143 ms
[2020-06-03 20:59:21] [INFO ] Deduced a trap composed of 6 places in 115 ms
[2020-06-03 20:59:21] [INFO ] Deduced a trap composed of 4 places in 134 ms
[2020-06-03 20:59:22] [INFO ] Deduced a trap composed of 4 places in 123 ms
[2020-06-03 20:59:22] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2020-06-03 20:59:22] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-06-03 20:59:22] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 20:59:22] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 20:59:22] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-06-03 20:59:22] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2020-06-03 20:59:23] [INFO ] Deduced a trap composed of 5 places in 78 ms
[2020-06-03 20:59:23] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 20:59:23] [INFO ] Deduced a trap composed of 5 places in 60 ms
[2020-06-03 20:59:23] [INFO ] Deduced a trap composed of 5 places in 72 ms
[2020-06-03 20:59:23] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 20:59:23] [INFO ] Deduced a trap composed of 5 places in 59 ms
[2020-06-03 20:59:23] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-06-03 20:59:23] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-06-03 20:59:23] [INFO ] Deduced a trap composed of 5 places in 95 ms
[2020-06-03 20:59:23] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 20:59:23] [INFO ] Deduced a trap composed of 5 places in 54 ms
[2020-06-03 20:59:24] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 20:59:24] [INFO ] Deduced a trap composed of 5 places in 73 ms
[2020-06-03 20:59:24] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-06-03 20:59:24] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 20:59:24] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-06-03 20:59:24] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-06-03 20:59:24] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 2975 ms
[2020-06-03 20:59:24] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 206 ms.
[2020-06-03 20:59:26] [INFO ] Added : 101 causal constraints over 21 iterations in 2371 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 76 ms.
[2020-06-03 20:59:27] [INFO ] [Real]Absence check using 200 positive place invariants in 92 ms returned sat
[2020-06-03 20:59:27] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 76 ms returned sat
[2020-06-03 20:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:59:27] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2020-06-03 20:59:28] [INFO ] [Real]Added 100 Read/Feed constraints in 37 ms returned sat
[2020-06-03 20:59:28] [INFO ] Deduced a trap composed of 4 places in 137 ms
[2020-06-03 20:59:28] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2020-06-03 20:59:28] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-06-03 20:59:28] [INFO ] Deduced a trap composed of 6 places in 102 ms
[2020-06-03 20:59:28] [INFO ] Deduced a trap composed of 6 places in 95 ms
[2020-06-03 20:59:28] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-06-03 20:59:28] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-06-03 20:59:28] [INFO ] Deduced a trap composed of 6 places in 67 ms
[2020-06-03 20:59:29] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-06-03 20:59:29] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 20:59:29] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 20:59:29] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 20:59:29] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 20:59:29] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 20:59:29] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-06-03 20:59:29] [INFO ] Deduced a trap composed of 5 places in 67 ms
[2020-06-03 20:59:29] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 20:59:29] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 20:59:29] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1901 ms
[2020-06-03 20:59:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:59:30] [INFO ] [Nat]Absence check using 200 positive place invariants in 86 ms returned sat
[2020-06-03 20:59:30] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 51 ms returned sat
[2020-06-03 20:59:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:59:30] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2020-06-03 20:59:30] [INFO ] [Nat]Added 100 Read/Feed constraints in 29 ms returned sat
[2020-06-03 20:59:31] [INFO ] Deduced a trap composed of 6 places in 127 ms
[2020-06-03 20:59:31] [INFO ] Deduced a trap composed of 4 places in 126 ms
[2020-06-03 20:59:31] [INFO ] Deduced a trap composed of 6 places in 105 ms
[2020-06-03 20:59:31] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 20:59:31] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-06-03 20:59:31] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 20:59:31] [INFO ] Deduced a trap composed of 4 places in 130 ms
[2020-06-03 20:59:31] [INFO ] Deduced a trap composed of 4 places in 140 ms
[2020-06-03 20:59:32] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-06-03 20:59:32] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-06-03 20:59:32] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-06-03 20:59:32] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-06-03 20:59:32] [INFO ] Deduced a trap composed of 6 places in 66 ms
[2020-06-03 20:59:32] [INFO ] Deduced a trap composed of 6 places in 59 ms
[2020-06-03 20:59:32] [INFO ] Deduced a trap composed of 6 places in 64 ms
[2020-06-03 20:59:32] [INFO ] Deduced a trap composed of 6 places in 63 ms
[2020-06-03 20:59:32] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-06-03 20:59:32] [INFO ] Deduced a trap composed of 6 places in 53 ms
[2020-06-03 20:59:33] [INFO ] Deduced a trap composed of 6 places in 61 ms
[2020-06-03 20:59:33] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-06-03 20:59:33] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-06-03 20:59:33] [INFO ] Deduced a trap composed of 6 places in 90 ms
[2020-06-03 20:59:33] [INFO ] Deduced a trap composed of 6 places in 70 ms
[2020-06-03 20:59:33] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-06-03 20:59:33] [INFO ] Deduced a trap composed of 6 places in 68 ms
[2020-06-03 20:59:33] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 20:59:33] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-03 20:59:33] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-06-03 20:59:34] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-06-03 20:59:34] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-06-03 20:59:34] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 20:59:34] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2020-06-03 20:59:34] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 3429 ms
[2020-06-03 20:59:34] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 194 ms.
[2020-06-03 20:59:36] [INFO ] Added : 101 causal constraints over 21 iterations in 2088 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 78 ms.
[2020-06-03 20:59:36] [INFO ] [Real]Absence check using 200 positive place invariants in 102 ms returned sat
[2020-06-03 20:59:36] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 50 ms returned sat
[2020-06-03 20:59:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:59:37] [INFO ] [Real]Absence check using state equation in 744 ms returned sat
[2020-06-03 20:59:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:59:37] [INFO ] [Nat]Absence check using 200 positive place invariants in 83 ms returned sat
[2020-06-03 20:59:37] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 48 ms returned sat
[2020-06-03 20:59:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:59:38] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2020-06-03 20:59:38] [INFO ] [Nat]Added 100 Read/Feed constraints in 32 ms returned sat
[2020-06-03 20:59:38] [INFO ] Deduced a trap composed of 4 places in 172 ms
[2020-06-03 20:59:38] [INFO ] Deduced a trap composed of 4 places in 150 ms
[2020-06-03 20:59:38] [INFO ] Deduced a trap composed of 4 places in 136 ms
[2020-06-03 20:59:39] [INFO ] Deduced a trap composed of 4 places in 109 ms
[2020-06-03 20:59:39] [INFO ] Deduced a trap composed of 4 places in 106 ms
[2020-06-03 20:59:39] [INFO ] Deduced a trap composed of 4 places in 114 ms
[2020-06-03 20:59:39] [INFO ] Deduced a trap composed of 6 places in 108 ms
[2020-06-03 20:59:39] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 20:59:39] [INFO ] Deduced a trap composed of 6 places in 109 ms
[2020-06-03 20:59:39] [INFO ] Deduced a trap composed of 6 places in 92 ms
[2020-06-03 20:59:39] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-06-03 20:59:40] [INFO ] Deduced a trap composed of 5 places in 92 ms
[2020-06-03 20:59:40] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 20:59:40] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 20:59:40] [INFO ] Deduced a trap composed of 5 places in 75 ms
[2020-06-03 20:59:40] [INFO ] Deduced a trap composed of 5 places in 72 ms
[2020-06-03 20:59:40] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-06-03 20:59:40] [INFO ] Deduced a trap composed of 5 places in 74 ms
[2020-06-03 20:59:40] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-06-03 20:59:40] [INFO ] Deduced a trap composed of 5 places in 88 ms
[2020-06-03 20:59:40] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 20:59:40] [INFO ] Deduced a trap composed of 5 places in 63 ms
[2020-06-03 20:59:41] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-06-03 20:59:41] [INFO ] Deduced a trap composed of 5 places in 51 ms
[2020-06-03 20:59:41] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 20:59:41] [INFO ] Deduced a trap composed of 5 places in 64 ms
[2020-06-03 20:59:41] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-06-03 20:59:41] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 20:59:41] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 20:59:41] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 20:59:41] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-06-03 20:59:41] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-06-03 20:59:41] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 3406 ms
[2020-06-03 20:59:41] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 180 ms.
[2020-06-03 20:59:43] [INFO ] Added : 101 causal constraints over 21 iterations in 2058 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 104 ms.
Incomplete Parikh walk after 23100 steps, including 98 resets, run finished after 1215 ms. (steps per millisecond=19 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 23400 steps, including 98 resets, run finished after 962 ms. (steps per millisecond=24 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 22500 steps, including 98 resets, run finished after 915 ms. (steps per millisecond=24 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 23300 steps, including 98 resets, run finished after 1156 ms. (steps per millisecond=20 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 14 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 674 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 374 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2020-06-03 20:59:49] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2020-06-03 20:59:49] [INFO ] Computed 300 place invariants in 6 ms
[2020-06-03 20:59:56] [INFO ] Implicit Places using invariants in 7619 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 7632 ms to find 99 implicit places.
[2020-06-03 20:59:56] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 401 cols
[2020-06-03 20:59:56] [INFO ] Computed 201 place invariants in 5 ms
[2020-06-03 21:00:07] [INFO ] Dead Transitions using invariants and state equation in 10456 ms returned []
Starting structural reductions, iteration 1 : 401/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 373 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2020-06-03 21:00:07] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 401 cols
[2020-06-03 21:00:07] [INFO ] Computed 201 place invariants in 3 ms
[2020-06-03 21:00:17] [INFO ] Dead Transitions using invariants and state equation in 9571 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 17449 ms. (steps per millisecond=57 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2760 ms. (steps per millisecond=362 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3045 ms. (steps per millisecond=328 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3001 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2789 ms. (steps per millisecond=358 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 6471567 steps, run timeout after 30002 ms. (steps per millisecond=215 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 6471567 steps, saw 35388 distinct states, run finished after 30004 ms. (steps per millisecond=215 ) properties seen :[0, 0, 0, 0]
[2020-06-03 21:01:16] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 401 cols
[2020-06-03 21:01:16] [INFO ] Computed 201 place invariants in 5 ms
[2020-06-03 21:01:16] [INFO ] [Real]Absence check using 200 positive place invariants in 60 ms returned sat
[2020-06-03 21:01:16] [INFO ] [Real]Absence check using 200 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-03 21:01:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:01:16] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2020-06-03 21:01:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:01:17] [INFO ] [Nat]Absence check using 200 positive place invariants in 77 ms returned sat
[2020-06-03 21:01:17] [INFO ] [Nat]Absence check using 200 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 21:01:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:01:17] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2020-06-03 21:01:17] [INFO ] State equation strengthened by 100 read => feed constraints.
[2020-06-03 21:01:17] [INFO ] [Nat]Added 100 Read/Feed constraints in 63 ms returned sat
[2020-06-03 21:01:17] [INFO ] Deduced a trap composed of 4 places in 166 ms
[2020-06-03 21:01:17] [INFO ] Deduced a trap composed of 4 places in 174 ms
[2020-06-03 21:01:18] [INFO ] Deduced a trap composed of 4 places in 212 ms
[2020-06-03 21:01:18] [INFO ] Deduced a trap composed of 4 places in 241 ms
[2020-06-03 21:01:18] [INFO ] Deduced a trap composed of 4 places in 146 ms
[2020-06-03 21:01:18] [INFO ] Deduced a trap composed of 4 places in 164 ms
[2020-06-03 21:01:19] [INFO ] Deduced a trap composed of 4 places in 159 ms
[2020-06-03 21:01:19] [INFO ] Deduced a trap composed of 4 places in 137 ms
[2020-06-03 21:01:19] [INFO ] Deduced a trap composed of 4 places in 149 ms
[2020-06-03 21:01:19] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-06-03 21:01:19] [INFO ] Deduced a trap composed of 4 places in 120 ms
[2020-06-03 21:01:19] [INFO ] Deduced a trap composed of 4 places in 115 ms
[2020-06-03 21:01:19] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-06-03 21:01:20] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-06-03 21:01:20] [INFO ] Deduced a trap composed of 4 places in 119 ms
[2020-06-03 21:01:20] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-06-03 21:01:20] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2020-06-03 21:01:20] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2020-06-03 21:01:20] [INFO ] Deduced a trap composed of 4 places in 128 ms
[2020-06-03 21:01:20] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 21:01:21] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-06-03 21:01:21] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-06-03 21:01:21] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-03 21:01:21] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 21:01:21] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 21:01:21] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 21:01:21] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-03 21:01:21] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 21:01:21] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-06-03 21:01:21] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-06-03 21:01:22] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-06-03 21:01:22] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2020-06-03 21:01:22] [INFO ] Deduced a trap composed of 4 places in 322 ms
[2020-06-03 21:01:22] [INFO ] Deduced a trap composed of 4 places in 109 ms
[2020-06-03 21:01:22] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2020-06-03 21:01:22] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-06-03 21:01:23] [INFO ] Deduced a trap composed of 4 places in 145 ms
[2020-06-03 21:01:23] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-06-03 21:01:23] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-06-03 21:01:23] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-06-03 21:01:23] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-06-03 21:01:23] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 21:01:23] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 21:01:23] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-06-03 21:01:23] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 21:01:23] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 21:01:23] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 21:01:24] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-06-03 21:01:24] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 21:01:24] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 21:01:24] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-03 21:01:24] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-06-03 21:01:24] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 21:01:24] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 21:01:24] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 21:01:24] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-06-03 21:01:24] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 21:01:25] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-06-03 21:01:25] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-06-03 21:01:25] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-06-03 21:01:25] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-06-03 21:01:25] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2020-06-03 21:01:25] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2020-06-03 21:01:25] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2020-06-03 21:01:25] [INFO ] Trap strengthening (SAT) tested/added 65/64 trap constraints in 7896 ms
[2020-06-03 21:01:25] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 170 ms.
[2020-06-03 21:01:27] [INFO ] Added : 101 causal constraints over 21 iterations in 2046 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 94 ms.
[2020-06-03 21:01:27] [INFO ] [Real]Absence check using 200 positive place invariants in 70 ms returned sat
[2020-06-03 21:01:27] [INFO ] [Real]Absence check using 200 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 21:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:01:28] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2020-06-03 21:01:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:01:28] [INFO ] [Nat]Absence check using 200 positive place invariants in 85 ms returned sat
[2020-06-03 21:01:28] [INFO ] [Nat]Absence check using 200 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 21:01:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:01:28] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2020-06-03 21:01:28] [INFO ] [Nat]Added 100 Read/Feed constraints in 42 ms returned sat
[2020-06-03 21:01:29] [INFO ] Deduced a trap composed of 4 places in 181 ms
[2020-06-03 21:01:29] [INFO ] Deduced a trap composed of 4 places in 158 ms
[2020-06-03 21:01:29] [INFO ] Deduced a trap composed of 4 places in 214 ms
[2020-06-03 21:01:29] [INFO ] Deduced a trap composed of 4 places in 187 ms
[2020-06-03 21:01:29] [INFO ] Deduced a trap composed of 4 places in 184 ms
[2020-06-03 21:01:30] [INFO ] Deduced a trap composed of 4 places in 173 ms
[2020-06-03 21:01:30] [INFO ] Deduced a trap composed of 4 places in 154 ms
[2020-06-03 21:01:30] [INFO ] Deduced a trap composed of 4 places in 139 ms
[2020-06-03 21:01:30] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2020-06-03 21:01:30] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2020-06-03 21:01:30] [INFO ] Deduced a trap composed of 4 places in 124 ms
[2020-06-03 21:01:31] [INFO ] Deduced a trap composed of 4 places in 124 ms
[2020-06-03 21:01:31] [INFO ] Deduced a trap composed of 4 places in 120 ms
[2020-06-03 21:01:31] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2020-06-03 21:01:31] [INFO ] Deduced a trap composed of 4 places in 109 ms
[2020-06-03 21:01:31] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-06-03 21:01:31] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-06-03 21:01:31] [INFO ] Deduced a trap composed of 4 places in 158 ms
[2020-06-03 21:01:32] [INFO ] Deduced a trap composed of 4 places in 135 ms
[2020-06-03 21:01:32] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2020-06-03 21:01:32] [INFO ] Deduced a trap composed of 4 places in 118 ms
[2020-06-03 21:01:32] [INFO ] Deduced a trap composed of 4 places in 124 ms
[2020-06-03 21:01:32] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2020-06-03 21:01:32] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-06-03 21:01:32] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 21:01:32] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-06-03 21:01:32] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-06-03 21:01:33] [INFO ] Deduced a trap composed of 4 places in 138 ms
[2020-06-03 21:01:33] [INFO ] Deduced a trap composed of 4 places in 134 ms
[2020-06-03 21:01:33] [INFO ] Deduced a trap composed of 4 places in 128 ms
[2020-06-03 21:01:33] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2020-06-03 21:01:33] [INFO ] Deduced a trap composed of 4 places in 114 ms
[2020-06-03 21:01:33] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 21:01:33] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-06-03 21:01:33] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-06-03 21:01:34] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-06-03 21:01:34] [INFO ] Deduced a trap composed of 4 places in 128 ms
[2020-06-03 21:01:34] [INFO ] Deduced a trap composed of 4 places in 120 ms
[2020-06-03 21:01:34] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-06-03 21:01:34] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-06-03 21:01:34] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-06-03 21:01:34] [INFO ] Deduced a trap composed of 4 places in 122 ms
[2020-06-03 21:01:34] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-03 21:01:35] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 21:01:35] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2020-06-03 21:01:35] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-06-03 21:01:35] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-06-03 21:01:35] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 21:01:35] [INFO ] Deduced a trap composed of 4 places in 109 ms
[2020-06-03 21:01:35] [INFO ] Deduced a trap composed of 4 places in 109 ms
[2020-06-03 21:01:35] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 21:01:36] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 21:01:36] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 21:01:36] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 21:01:36] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-06-03 21:01:36] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-06-03 21:01:36] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-06-03 21:01:36] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 21:01:36] [INFO ] Deduced a trap composed of 6 places in 106 ms
[2020-06-03 21:01:36] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-06-03 21:01:36] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-06-03 21:01:37] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 21:01:37] [INFO ] Deduced a trap composed of 4 places in 272 ms
[2020-06-03 21:01:37] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2020-06-03 21:01:37] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-06-03 21:01:37] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-06-03 21:01:37] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 21:01:37] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 21:01:37] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 21:01:38] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 21:01:38] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 21:01:38] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-06-03 21:01:38] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 21:01:38] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 21:01:38] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-06-03 21:01:38] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-06-03 21:01:38] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 21:01:38] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-06-03 21:01:38] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 21:01:38] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 21:01:39] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 21:01:39] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 21:01:39] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-06-03 21:01:39] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-06-03 21:01:39] [INFO ] Trap strengthening (SAT) tested/added 85/84 trap constraints in 10345 ms
[2020-06-03 21:01:39] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 194 ms.
[2020-06-03 21:01:41] [INFO ] Added : 101 causal constraints over 21 iterations in 2249 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 78 ms.
[2020-06-03 21:01:41] [INFO ] [Real]Absence check using 200 positive place invariants in 87 ms returned sat
[2020-06-03 21:01:41] [INFO ] [Real]Absence check using 200 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-03 21:01:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:01:42] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2020-06-03 21:01:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:01:42] [INFO ] [Nat]Absence check using 200 positive place invariants in 82 ms returned sat
[2020-06-03 21:01:42] [INFO ] [Nat]Absence check using 200 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 21:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:01:43] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2020-06-03 21:01:43] [INFO ] [Nat]Added 100 Read/Feed constraints in 38 ms returned sat
[2020-06-03 21:01:43] [INFO ] Deduced a trap composed of 4 places in 195 ms
[2020-06-03 21:01:43] [INFO ] Deduced a trap composed of 4 places in 214 ms
[2020-06-03 21:01:43] [INFO ] Deduced a trap composed of 4 places in 172 ms
[2020-06-03 21:01:43] [INFO ] Deduced a trap composed of 4 places in 201 ms
[2020-06-03 21:01:44] [INFO ] Deduced a trap composed of 4 places in 170 ms
[2020-06-03 21:01:44] [INFO ] Deduced a trap composed of 4 places in 156 ms
[2020-06-03 21:01:44] [INFO ] Deduced a trap composed of 4 places in 149 ms
[2020-06-03 21:01:44] [INFO ] Deduced a trap composed of 4 places in 154 ms
[2020-06-03 21:01:44] [INFO ] Deduced a trap composed of 4 places in 167 ms
[2020-06-03 21:01:44] [INFO ] Deduced a trap composed of 4 places in 171 ms
[2020-06-03 21:01:45] [INFO ] Deduced a trap composed of 4 places in 184 ms
[2020-06-03 21:01:45] [INFO ] Deduced a trap composed of 4 places in 163 ms
[2020-06-03 21:01:45] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-06-03 21:01:45] [INFO ] Deduced a trap composed of 4 places in 163 ms
[2020-06-03 21:01:45] [INFO ] Deduced a trap composed of 4 places in 137 ms
[2020-06-03 21:01:45] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-06-03 21:01:46] [INFO ] Deduced a trap composed of 4 places in 110 ms
[2020-06-03 21:01:46] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 21:01:46] [INFO ] Deduced a trap composed of 4 places in 111 ms
[2020-06-03 21:01:46] [INFO ] Deduced a trap composed of 4 places in 115 ms
[2020-06-03 21:01:46] [INFO ] Deduced a trap composed of 4 places in 115 ms
[2020-06-03 21:01:46] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-06-03 21:01:46] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 21:01:47] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-06-03 21:01:47] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 21:01:47] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-06-03 21:01:47] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-06-03 21:01:47] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-06-03 21:01:47] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-06-03 21:01:47] [INFO ] Deduced a trap composed of 4 places in 180 ms
[2020-06-03 21:01:47] [INFO ] Deduced a trap composed of 4 places in 170 ms
[2020-06-03 21:01:48] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2020-06-03 21:01:48] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 21:01:48] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-06-03 21:01:48] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 21:01:48] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-06-03 21:01:48] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-06-03 21:01:48] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-06-03 21:01:48] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-06-03 21:01:49] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 21:01:49] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-06-03 21:01:49] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2020-06-03 21:01:49] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2020-06-03 21:01:49] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2020-06-03 21:01:49] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-06-03 21:01:49] [INFO ] Deduced a trap composed of 4 places in 117 ms
[2020-06-03 21:01:49] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-06-03 21:01:49] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 21:01:50] [INFO ] Deduced a trap composed of 4 places in 106 ms
[2020-06-03 21:01:50] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-06-03 21:01:50] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-06-03 21:01:50] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-06-03 21:01:50] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-06-03 21:01:50] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-06-03 21:01:50] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 21:01:50] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 21:01:50] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 21:01:51] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-06-03 21:01:51] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-06-03 21:01:51] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-03 21:01:51] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-03 21:01:51] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 21:01:51] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 21:01:51] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-06-03 21:01:51] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-06-03 21:01:51] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 21:01:51] [INFO ] Trap strengthening (SAT) tested/added 67/66 trap constraints in 8781 ms
[2020-06-03 21:01:52] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 176 ms.
[2020-06-03 21:01:53] [INFO ] Added : 101 causal constraints over 21 iterations in 2060 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 81 ms.
[2020-06-03 21:01:54] [INFO ] [Real]Absence check using 200 positive place invariants in 84 ms returned sat
[2020-06-03 21:01:54] [INFO ] [Real]Absence check using 200 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 21:01:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:01:54] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2020-06-03 21:01:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:01:54] [INFO ] [Nat]Absence check using 200 positive place invariants in 88 ms returned sat
[2020-06-03 21:01:54] [INFO ] [Nat]Absence check using 200 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-03 21:01:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:01:55] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2020-06-03 21:01:55] [INFO ] [Nat]Added 100 Read/Feed constraints in 35 ms returned sat
[2020-06-03 21:01:55] [INFO ] Deduced a trap composed of 4 places in 211 ms
[2020-06-03 21:01:55] [INFO ] Deduced a trap composed of 4 places in 160 ms
[2020-06-03 21:01:55] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2020-06-03 21:01:56] [INFO ] Deduced a trap composed of 4 places in 135 ms
[2020-06-03 21:01:56] [INFO ] Deduced a trap composed of 4 places in 137 ms
[2020-06-03 21:01:56] [INFO ] Deduced a trap composed of 4 places in 120 ms
[2020-06-03 21:01:56] [INFO ] Deduced a trap composed of 4 places in 115 ms
[2020-06-03 21:01:56] [INFO ] Deduced a trap composed of 4 places in 129 ms
[2020-06-03 21:01:56] [INFO ] Deduced a trap composed of 4 places in 124 ms
[2020-06-03 21:01:57] [INFO ] Deduced a trap composed of 4 places in 234 ms
[2020-06-03 21:01:57] [INFO ] Deduced a trap composed of 4 places in 191 ms
[2020-06-03 21:01:57] [INFO ] Deduced a trap composed of 4 places in 186 ms
[2020-06-03 21:01:57] [INFO ] Deduced a trap composed of 4 places in 165 ms
[2020-06-03 21:01:57] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-06-03 21:01:57] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-06-03 21:01:58] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 21:01:58] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-06-03 21:01:58] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-06-03 21:01:58] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-06-03 21:01:58] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 21:01:58] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 21:01:58] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-06-03 21:01:58] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-06-03 21:01:58] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-06-03 21:01:58] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-06-03 21:01:58] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2020-06-03 21:01:58] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2020-06-03 21:01:59] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-06-03 21:01:59] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-06-03 21:01:59] [INFO ] Deduced a trap composed of 4 places in 152 ms
[2020-06-03 21:01:59] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-06-03 21:01:59] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-06-03 21:01:59] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 21:01:59] [INFO ] Deduced a trap composed of 4 places in 106 ms
[2020-06-03 21:01:59] [INFO ] Deduced a trap composed of 4 places in 142 ms
[2020-06-03 21:02:00] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-06-03 21:02:00] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2020-06-03 21:02:00] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-06-03 21:02:00] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 21:02:00] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-06-03 21:02:00] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-06-03 21:02:00] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-06-03 21:02:00] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2020-06-03 21:02:00] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-06-03 21:02:01] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-06-03 21:02:01] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 21:02:01] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 21:02:01] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 21:02:01] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-06-03 21:02:01] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-06-03 21:02:01] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 21:02:01] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 21:02:01] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-06-03 21:02:01] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2020-06-03 21:02:01] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 6525 ms
[2020-06-03 21:02:02] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 164 ms.
[2020-06-03 21:02:04] [INFO ] Added : 101 causal constraints over 21 iterations in 2169 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 108 ms.
Incomplete Parikh walk after 24100 steps, including 98 resets, run finished after 1497 ms. (steps per millisecond=16 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 24500 steps, including 98 resets, run finished after 1321 ms. (steps per millisecond=18 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 24100 steps, including 98 resets, run finished after 928 ms. (steps per millisecond=25 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 24000 steps, including 98 resets, run finished after 926 ms. (steps per millisecond=25 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 14 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 291 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 323 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2020-06-03 21:02:09] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 401 cols
[2020-06-03 21:02:09] [INFO ] Computed 201 place invariants in 1 ms
[2020-06-03 21:02:11] [INFO ] Implicit Places using invariants in 1853 ms returned []
Implicit Place search using SMT only with invariants took 1855 ms to find 0 implicit places.
[2020-06-03 21:02:11] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 401 cols
[2020-06-03 21:02:11] [INFO ] Computed 201 place invariants in 1 ms
[2020-06-03 21:02:21] [INFO ] Dead Transitions using invariants and state equation in 9912 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 2023 ms. (steps per millisecond=49 ) properties seen :[0, 0, 0, 0]
[2020-06-03 21:02:23] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 401 cols
[2020-06-03 21:02:23] [INFO ] Computed 201 place invariants in 2 ms
[2020-06-03 21:02:23] [INFO ] [Real]Absence check using 200 positive place invariants in 84 ms returned sat
[2020-06-03 21:02:23] [INFO ] [Real]Absence check using 200 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-03 21:02:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:23] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2020-06-03 21:02:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:02:24] [INFO ] [Nat]Absence check using 200 positive place invariants in 134 ms returned sat
[2020-06-03 21:02:24] [INFO ] [Nat]Absence check using 200 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-03 21:02:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:24] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2020-06-03 21:02:24] [INFO ] State equation strengthened by 100 read => feed constraints.
[2020-06-03 21:02:24] [INFO ] [Nat]Added 100 Read/Feed constraints in 42 ms returned sat
[2020-06-03 21:02:24] [INFO ] Deduced a trap composed of 4 places in 176 ms
[2020-06-03 21:02:24] [INFO ] Deduced a trap composed of 4 places in 162 ms
[2020-06-03 21:02:25] [INFO ] Deduced a trap composed of 4 places in 179 ms
[2020-06-03 21:02:25] [INFO ] Deduced a trap composed of 4 places in 163 ms
[2020-06-03 21:02:25] [INFO ] Deduced a trap composed of 4 places in 202 ms
[2020-06-03 21:02:25] [INFO ] Deduced a trap composed of 4 places in 133 ms
[2020-06-03 21:02:25] [INFO ] Deduced a trap composed of 4 places in 117 ms
[2020-06-03 21:02:25] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2020-06-03 21:02:26] [INFO ] Deduced a trap composed of 4 places in 115 ms
[2020-06-03 21:02:26] [INFO ] Deduced a trap composed of 4 places in 124 ms
[2020-06-03 21:02:26] [INFO ] Deduced a trap composed of 4 places in 148 ms
[2020-06-03 21:02:26] [INFO ] Deduced a trap composed of 4 places in 105 ms
[2020-06-03 21:02:26] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-06-03 21:02:26] [INFO ] Deduced a trap composed of 4 places in 133 ms
[2020-06-03 21:02:26] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-06-03 21:02:26] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-06-03 21:02:27] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-06-03 21:02:27] [INFO ] Deduced a trap composed of 4 places in 109 ms
[2020-06-03 21:02:27] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2020-06-03 21:02:27] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 21:02:27] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-06-03 21:02:27] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 21:02:27] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 21:02:27] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-06-03 21:02:27] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 21:02:28] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 21:02:28] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2020-06-03 21:02:28] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 21:02:28] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 21:02:28] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 21:02:28] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-06-03 21:02:28] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2020-06-03 21:02:28] [INFO ] Deduced a trap composed of 4 places in 117 ms
[2020-06-03 21:02:28] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2020-06-03 21:02:28] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-06-03 21:02:29] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 21:02:29] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-06-03 21:02:29] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 21:02:29] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 21:02:29] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-06-03 21:02:29] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 21:02:29] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-06-03 21:02:29] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 21:02:29] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-06-03 21:02:29] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-06-03 21:02:30] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-03 21:02:30] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 21:02:30] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-06-03 21:02:30] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-06-03 21:02:30] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-06-03 21:02:30] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 21:02:30] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 21:02:30] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-03 21:02:30] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 21:02:30] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 21:02:30] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-06-03 21:02:31] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-06-03 21:02:31] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-03 21:02:31] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-06-03 21:02:31] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-06-03 21:02:31] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-06-03 21:02:31] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-06-03 21:02:31] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2020-06-03 21:02:31] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2020-06-03 21:02:31] [INFO ] Trap strengthening (SAT) tested/added 65/64 trap constraints in 7142 ms
[2020-06-03 21:02:31] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 204 ms.
[2020-06-03 21:02:33] [INFO ] Added : 101 causal constraints over 21 iterations in 2051 ms. Result :sat
[2020-06-03 21:02:33] [INFO ] [Real]Absence check using 200 positive place invariants in 85 ms returned sat
[2020-06-03 21:02:33] [INFO ] [Real]Absence check using 200 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-03 21:02:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:34] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2020-06-03 21:02:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:02:34] [INFO ] [Nat]Absence check using 200 positive place invariants in 76 ms returned sat
[2020-06-03 21:02:34] [INFO ] [Nat]Absence check using 200 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-03 21:02:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:34] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2020-06-03 21:02:34] [INFO ] [Nat]Added 100 Read/Feed constraints in 61 ms returned sat
[2020-06-03 21:02:35] [INFO ] Deduced a trap composed of 4 places in 143 ms
[2020-06-03 21:02:35] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2020-06-03 21:02:35] [INFO ] Deduced a trap composed of 4 places in 106 ms
[2020-06-03 21:02:35] [INFO ] Deduced a trap composed of 4 places in 145 ms
[2020-06-03 21:02:35] [INFO ] Deduced a trap composed of 4 places in 164 ms
[2020-06-03 21:02:35] [INFO ] Deduced a trap composed of 4 places in 140 ms
[2020-06-03 21:02:35] [INFO ] Deduced a trap composed of 4 places in 159 ms
[2020-06-03 21:02:36] [INFO ] Deduced a trap composed of 4 places in 120 ms
[2020-06-03 21:02:36] [INFO ] Deduced a trap composed of 4 places in 153 ms
[2020-06-03 21:02:36] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2020-06-03 21:02:36] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-06-03 21:02:36] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-06-03 21:02:36] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-06-03 21:02:36] [INFO ] Deduced a trap composed of 4 places in 114 ms
[2020-06-03 21:02:37] [INFO ] Deduced a trap composed of 4 places in 105 ms
[2020-06-03 21:02:37] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 21:02:37] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 21:02:37] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2020-06-03 21:02:37] [INFO ] Deduced a trap composed of 4 places in 117 ms
[2020-06-03 21:02:37] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2020-06-03 21:02:37] [INFO ] Deduced a trap composed of 4 places in 150 ms
[2020-06-03 21:02:37] [INFO ] Deduced a trap composed of 4 places in 106 ms
[2020-06-03 21:02:38] [INFO ] Deduced a trap composed of 4 places in 118 ms
[2020-06-03 21:02:38] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-06-03 21:02:38] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-06-03 21:02:38] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-06-03 21:02:38] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-06-03 21:02:38] [INFO ] Deduced a trap composed of 4 places in 115 ms
[2020-06-03 21:02:38] [INFO ] Deduced a trap composed of 4 places in 144 ms
[2020-06-03 21:02:38] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2020-06-03 21:02:38] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-06-03 21:02:39] [INFO ] Deduced a trap composed of 4 places in 110 ms
[2020-06-03 21:02:39] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-06-03 21:02:39] [INFO ] Deduced a trap composed of 4 places in 124 ms
[2020-06-03 21:02:39] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-06-03 21:02:39] [INFO ] Deduced a trap composed of 4 places in 111 ms
[2020-06-03 21:02:39] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 21:02:39] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-06-03 21:02:39] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 21:02:39] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-06-03 21:02:40] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-06-03 21:02:40] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 21:02:40] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-06-03 21:02:40] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 21:02:40] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-06-03 21:02:40] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-06-03 21:02:40] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 21:02:40] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 21:02:40] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 21:02:40] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 21:02:40] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-06-03 21:02:40] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-06-03 21:02:41] [INFO ] Deduced a trap composed of 4 places in 37 ms
[2020-06-03 21:02:41] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-06-03 21:02:41] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-06-03 21:02:41] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2020-06-03 21:02:41] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2020-06-03 21:02:41] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-06-03 21:02:41] [INFO ] Deduced a trap composed of 6 places in 91 ms
[2020-06-03 21:02:41] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-06-03 21:02:41] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 21:02:41] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-06-03 21:02:41] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 21:02:42] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-06-03 21:02:42] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-06-03 21:02:42] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-06-03 21:02:42] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-03 21:02:42] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 21:02:42] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-06-03 21:02:42] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-06-03 21:02:42] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-03 21:02:42] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 21:02:42] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 21:02:43] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-06-03 21:02:43] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 21:02:43] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-06-03 21:02:43] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 21:02:43] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-06-03 21:02:43] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 21:02:43] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 21:02:43] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-03 21:02:43] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-06-03 21:02:43] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 21:02:43] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2020-06-03 21:02:43] [INFO ] Trap strengthening (SAT) tested/added 85/84 trap constraints in 9041 ms
[2020-06-03 21:02:44] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 252 ms.
[2020-06-03 21:02:45] [INFO ] Added : 101 causal constraints over 21 iterations in 1991 ms. Result :sat
[2020-06-03 21:02:46] [INFO ] [Real]Absence check using 200 positive place invariants in 87 ms returned sat
[2020-06-03 21:02:46] [INFO ] [Real]Absence check using 200 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-03 21:02:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:46] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2020-06-03 21:02:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:02:46] [INFO ] [Nat]Absence check using 200 positive place invariants in 78 ms returned sat
[2020-06-03 21:02:46] [INFO ] [Nat]Absence check using 200 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-03 21:02:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:47] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2020-06-03 21:02:47] [INFO ] [Nat]Added 100 Read/Feed constraints in 39 ms returned sat
[2020-06-03 21:02:47] [INFO ] Deduced a trap composed of 4 places in 238 ms
[2020-06-03 21:02:47] [INFO ] Deduced a trap composed of 4 places in 219 ms
[2020-06-03 21:02:48] [INFO ] Deduced a trap composed of 4 places in 194 ms
[2020-06-03 21:02:48] [INFO ] Deduced a trap composed of 4 places in 213 ms
[2020-06-03 21:02:48] [INFO ] Deduced a trap composed of 4 places in 153 ms
[2020-06-03 21:02:48] [INFO ] Deduced a trap composed of 4 places in 194 ms
[2020-06-03 21:02:48] [INFO ] Deduced a trap composed of 4 places in 155 ms
[2020-06-03 21:02:49] [INFO ] Deduced a trap composed of 4 places in 163 ms
[2020-06-03 21:02:49] [INFO ] Deduced a trap composed of 4 places in 160 ms
[2020-06-03 21:02:49] [INFO ] Deduced a trap composed of 4 places in 163 ms
[2020-06-03 21:02:49] [INFO ] Deduced a trap composed of 4 places in 164 ms
[2020-06-03 21:02:49] [INFO ] Deduced a trap composed of 4 places in 151 ms
[2020-06-03 21:02:49] [INFO ] Deduced a trap composed of 4 places in 114 ms
[2020-06-03 21:02:50] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2020-06-03 21:02:50] [INFO ] Deduced a trap composed of 4 places in 109 ms
[2020-06-03 21:02:50] [INFO ] Deduced a trap composed of 4 places in 124 ms
[2020-06-03 21:02:50] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2020-06-03 21:02:50] [INFO ] Deduced a trap composed of 4 places in 119 ms
[2020-06-03 21:02:50] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-06-03 21:02:50] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2020-06-03 21:02:51] [INFO ] Deduced a trap composed of 4 places in 109 ms
[2020-06-03 21:02:51] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-06-03 21:02:51] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-06-03 21:02:51] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-06-03 21:02:51] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-06-03 21:02:51] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-06-03 21:02:51] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 21:02:51] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 21:02:51] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 21:02:52] [INFO ] Deduced a trap composed of 4 places in 132 ms
[2020-06-03 21:02:52] [INFO ] Deduced a trap composed of 4 places in 119 ms
[2020-06-03 21:02:52] [INFO ] Deduced a trap composed of 4 places in 137 ms
[2020-06-03 21:02:52] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2020-06-03 21:02:52] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-06-03 21:02:52] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-06-03 21:02:52] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-03 21:02:52] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-03 21:02:53] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 21:02:53] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-06-03 21:02:53] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-06-03 21:02:53] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-06-03 21:02:53] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-06-03 21:02:53] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-06-03 21:02:53] [INFO ] Deduced a trap composed of 4 places in 96 ms
[2020-06-03 21:02:53] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 21:02:53] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-06-03 21:02:54] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-03 21:02:54] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-06-03 21:02:54] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-06-03 21:02:54] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-06-03 21:02:54] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-06-03 21:02:54] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-03 21:02:54] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-03 21:02:54] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-03 21:02:54] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-06-03 21:02:54] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-06-03 21:02:55] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 21:02:55] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-03 21:02:55] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-06-03 21:02:55] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 21:02:55] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-06-03 21:02:55] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-06-03 21:02:55] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-06-03 21:02:55] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-06-03 21:02:55] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-06-03 21:02:55] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2020-06-03 21:02:55] [INFO ] Trap strengthening (SAT) tested/added 67/66 trap constraints in 8395 ms
[2020-06-03 21:02:55] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 187 ms.
[2020-06-03 21:02:58] [INFO ] Added : 101 causal constraints over 21 iterations in 2288 ms. Result :sat
[2020-06-03 21:02:58] [INFO ] [Real]Absence check using 200 positive place invariants in 85 ms returned sat
[2020-06-03 21:02:58] [INFO ] [Real]Absence check using 200 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 21:02:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:58] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2020-06-03 21:02:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:02:58] [INFO ] [Nat]Absence check using 200 positive place invariants in 75 ms returned sat
[2020-06-03 21:02:58] [INFO ] [Nat]Absence check using 200 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 21:02:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:59] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2020-06-03 21:02:59] [INFO ] [Nat]Added 100 Read/Feed constraints in 27 ms returned sat
[2020-06-03 21:02:59] [INFO ] Deduced a trap composed of 4 places in 142 ms
[2020-06-03 21:02:59] [INFO ] Deduced a trap composed of 4 places in 134 ms
[2020-06-03 21:02:59] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2020-06-03 21:02:59] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2020-06-03 21:02:59] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-06-03 21:02:59] [INFO ] Deduced a trap composed of 4 places in 118 ms
[2020-06-03 21:03:00] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-06-03 21:03:00] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2020-06-03 21:03:00] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2020-06-03 21:03:00] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-06-03 21:03:00] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-06-03 21:03:00] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-06-03 21:03:00] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-03 21:03:00] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-06-03 21:03:00] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-06-03 21:03:00] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-06-03 21:03:00] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 21:03:01] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-06-03 21:03:01] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-06-03 21:03:01] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-06-03 21:03:01] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-06-03 21:03:01] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-06-03 21:03:01] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-06-03 21:03:01] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2020-06-03 21:03:01] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2020-06-03 21:03:01] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2020-06-03 21:03:01] [INFO ] Deduced a trap composed of 4 places in 123 ms
[2020-06-03 21:03:02] [INFO ] Deduced a trap composed of 4 places in 494 ms
[2020-06-03 21:03:02] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-06-03 21:03:02] [INFO ] Deduced a trap composed of 4 places in 117 ms
[2020-06-03 21:03:02] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-06-03 21:03:02] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-06-03 21:03:02] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-06-03 21:03:02] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-06-03 21:03:02] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-06-03 21:03:03] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-06-03 21:03:03] [INFO ] Deduced a trap composed of 4 places in 245 ms
[2020-06-03 21:03:03] [INFO ] Deduced a trap composed of 4 places in 246 ms
[2020-06-03 21:03:03] [INFO ] Deduced a trap composed of 4 places in 193 ms
[2020-06-03 21:03:03] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-06-03 21:03:04] [INFO ] Deduced a trap composed of 4 places in 101 ms
[2020-06-03 21:03:04] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-03 21:03:04] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 21:03:04] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-06-03 21:03:04] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-06-03 21:03:04] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 21:03:04] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-06-03 21:03:04] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-03 21:03:05] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2020-06-03 21:03:05] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-06-03 21:03:05] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-06-03 21:03:05] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-06-03 21:03:05] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 21:03:05] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-06-03 21:03:05] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 6307 ms
[2020-06-03 21:03:05] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 172 ms.
[2020-06-03 21:03:07] [INFO ] Added : 101 causal constraints over 21 iterations in 2140 ms. Result :sat
Discarding 348 places :
Also discarding 8874 output transitions
Drop transitions removed 8874 transitions
Graph (complete) has 605 edges and 401 vertex of which 53 are kept as prefixes of interest. Removing 348 places using SCC suffix rule.37 ms
Ensure Unique test removed 1 places
Ensure Unique test removed 1274 transitions
Reduce isomorphic transitions removed 1274 transitions.
Iterating post reduction 0 with 1275 rules applied. Total rules applied 1276 place count 52 transition count 52
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1288 place count 44 transition count 48
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1292 place count 44 transition count 44
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 1297 place count 44 transition count 39
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1312 place count 34 transition count 34
Applied a total of 1312 rules in 96 ms. Remains 34 /401 variables (removed 367) and now considering 34/10200 (removed 10166) transitions.
// Phase 1: matrix 34 rows 34 cols
[2020-06-03 21:03:07] [INFO ] Computed 17 place invariants in 0 ms
[2020-06-03 21:03:07] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2020-06-03 21:03:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:07] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-06-03 21:03:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:03:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2020-06-03 21:03:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:07] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-06-03 21:03:07] [INFO ] Computed and/alt/rep : 21/29/21 causal constraints in 2 ms.
[2020-06-03 21:03:07] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2020-06-03 21:03:07] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2020-06-03 21:03:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:08] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-03 21:03:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:03:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2020-06-03 21:03:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:08] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2020-06-03 21:03:08] [INFO ] Computed and/alt/rep : 21/29/21 causal constraints in 3 ms.
[2020-06-03 21:03:08] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2020-06-03 21:03:08] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2020-06-03 21:03:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:08] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-03 21:03:08] [INFO ] Computed and/alt/rep : 21/29/21 causal constraints in 2 ms.
[2020-06-03 21:03:08] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2020-06-03 21:03:08] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2020-06-03 21:03:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:08] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-03 21:03:08] [INFO ] Computed and/alt/rep : 21/29/21 causal constraints in 3 ms.
[2020-06-03 21:03:08] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2020-06-03 21:03:08] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2020-06-03 21:03:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 149 ms.
[2020-06-03 21:03:10] [INFO ] Flatten gal took : 1157 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ Dekker-PT-100 @ 3570 seconds

FORMULA Dekker-PT-100-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-100-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3563
rslt: Output for ReachabilityCardinality @ Dekker-PT-100

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 21:03:10 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p319)) AND ((p342 <= 0)))))",
"processed_size": 41,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p215 <= 0)) OR ((1 <= p238)))))",
"processed_size": 41,
"rewrites": 2
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p313 <= 0)) OR ((1 <= p224)))))",
"processed_size": 41,
"rewrites": 2
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3563
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 5,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p284)) AND ((p312 <= 0)) AND ((1 <= p368)) AND ((p97 <= 0)) AND (((p197 <= 0)) OR ((1 <= p194)) OR ((p341 <= 0)) OR ((1 <= p6))))))",
"processed_size": 148,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 20,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 359524,
"runtime": 7.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 70201,
"conflict_clusters": 1,
"places": 401,
"places_significant": 200,
"singleton_clusters": 0,
"transitions": 10200
},
"result":
{
"preliminary_value": "yes yes no no ",
"value": "yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 10601/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 401
lola: finding significant places
lola: 401 places, 10200 transitions, 200 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (p342 <= 1)
lola: LP says that atomic proposition is always true: (p312 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: E (F ((((1 <= p319)) AND ((p342 <= 0))))) : E (F ((((1 <= p284)) AND ((p312 <= 0)) AND ((1 <= p368)) AND ((p97 <= 0)) AND (((p197 <= 0)) OR ((1 <= p194)) OR ((p341 <= 0)) OR ((1 <= p6)))))) : A (G ((((p215 <= 0)) OR ((1 <= p238))))) : A (G ((((p313 <= 0)) OR ((1 <= p224)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p319)) AND ((p342 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p319)) AND ((p342 <= 0)))))
lola: processed formula length: 41
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p319)) AND ((p342 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 1 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p215 <= 0)) OR ((1 <= p238)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p215 <= 0)) OR ((1 <= p238)))))
lola: processed formula length: 41
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p215)) AND ((p238 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 2 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p313 <= 0)) OR ((1 <= p224)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p313 <= 0)) OR ((1 <= p224)))))
lola: processed formula length: 41
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p313)) AND ((p224 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 3 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p284)) AND ((p312 <= 0)) AND ((1 <= p368)) AND ((p97 <= 0)) AND (((p197 <= 0)) OR ((1 <= p194)) OR ((p341 <= 0)) OR ((1 <= p6))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p284)) AND ((p312 <= 0)) AND ((1 <= p368)) AND ((p97 <= 0)) AND (((p197 <= 0)) OR ((1 <= p194)) OR ((p341 <= 0)) OR ((1 <= p6))))))
lola: processed formula length: 148
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p284)) AND ((p312 <= 0)) AND ((1 <= p368)) AND ((p97 <= 0)) AND (((p197 <= 0)) OR ((1 <= p194)) OR ((p341 <= 0)) OR ((1 <= p6))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no
lola:
preliminary result: yes yes no no
lola: memory consumption: 359524 KB
lola: time consumption: 7 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is 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 r178-tajo-158987882200342"
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 ;