Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r139-smll-167819423100469.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is DoubleExponent-PT-004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-167819423100469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.6K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 67K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678411949550

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-004
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-10 01:32:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 01:32:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 01:32:32] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-10 01:32:32] [INFO ] Transformed 216 places.
[2023-03-10 01:32:32] [INFO ] Transformed 198 transitions.
[2023-03-10 01:32:32] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 198 rows 216 cols
[2023-03-10 01:32:32] [INFO ] Computed 24 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 329 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :2
FORMULA DoubleExponent-PT-004-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-004-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 281 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 290 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 272 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :2
FORMULA DoubleExponent-PT-004-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-10 01:32:32] [INFO ] Invariant cache hit.
[2023-03-10 01:32:33] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-10 01:32:33] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 16 ms returned sat
[2023-03-10 01:32:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:33] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2023-03-10 01:32:33] [INFO ] Deduced a trap composed of 86 places in 236 ms of which 10 ms to minimize.
[2023-03-10 01:32:33] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 2 ms to minimize.
[2023-03-10 01:32:33] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 1 ms to minimize.
[2023-03-10 01:32:34] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2023-03-10 01:32:34] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 0 ms to minimize.
[2023-03-10 01:32:34] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 1 ms to minimize.
[2023-03-10 01:32:34] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 1 ms to minimize.
[2023-03-10 01:32:34] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 1 ms to minimize.
[2023-03-10 01:32:34] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 1 ms to minimize.
[2023-03-10 01:32:34] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 0 ms to minimize.
[2023-03-10 01:32:34] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 1 ms to minimize.
[2023-03-10 01:32:35] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 0 ms to minimize.
[2023-03-10 01:32:35] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1732 ms
[2023-03-10 01:32:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:32:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-10 01:32:35] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-10 01:32:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:35] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2023-03-10 01:32:35] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 1 ms to minimize.
[2023-03-10 01:32:35] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 1 ms to minimize.
[2023-03-10 01:32:35] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 1 ms to minimize.
[2023-03-10 01:32:35] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2023-03-10 01:32:36] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 1 ms to minimize.
[2023-03-10 01:32:36] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 1 ms to minimize.
[2023-03-10 01:32:36] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 0 ms to minimize.
[2023-03-10 01:32:36] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 1 ms to minimize.
[2023-03-10 01:32:36] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 1 ms to minimize.
[2023-03-10 01:32:36] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2023-03-10 01:32:36] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 0 ms to minimize.
[2023-03-10 01:32:36] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 0 ms to minimize.
[2023-03-10 01:32:36] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 0 ms to minimize.
[2023-03-10 01:32:37] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 1 ms to minimize.
[2023-03-10 01:32:37] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 1 ms to minimize.
[2023-03-10 01:32:37] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1914 ms
[2023-03-10 01:32:37] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 25 ms.
[2023-03-10 01:32:38] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 1 ms to minimize.
[2023-03-10 01:32:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-10 01:32:38] [INFO ] Added : 194 causal constraints over 39 iterations in 1573 ms. Result :sat
Minimization took 618 ms.
[2023-03-10 01:32:39] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-10 01:32:39] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-10 01:32:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:39] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2023-03-10 01:32:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:32:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 01:32:39] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:32:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:39] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-10 01:32:39] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2023-03-10 01:32:39] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 0 ms to minimize.
[2023-03-10 01:32:40] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2023-03-10 01:32:40] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2023-03-10 01:32:40] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 1 ms to minimize.
[2023-03-10 01:32:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 480 ms
[2023-03-10 01:32:40] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-10 01:32:40] [INFO ] Added : 113 causal constraints over 23 iterations in 602 ms. Result :sat
Minimization took 108 ms.
[2023-03-10 01:32:41] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 01:32:41] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 12 ms returned sat
[2023-03-10 01:32:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:41] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2023-03-10 01:32:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:32:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-10 01:32:41] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-10 01:32:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:41] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-10 01:32:41] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 30 ms.
[2023-03-10 01:32:42] [INFO ] Added : 192 causal constraints over 39 iterations in 1446 ms. Result :sat
Minimization took 205 ms.
[2023-03-10 01:32:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 01:32:43] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2023-03-10 01:32:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:43] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-10 01:32:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:32:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-10 01:32:43] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 14 ms returned sat
[2023-03-10 01:32:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:43] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-10 01:32:43] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 1 ms to minimize.
[2023-03-10 01:32:43] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 3 ms to minimize.
[2023-03-10 01:32:43] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 0 ms to minimize.
[2023-03-10 01:32:43] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
[2023-03-10 01:32:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 432 ms
[2023-03-10 01:32:43] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-10 01:32:44] [INFO ] Added : 132 causal constraints over 28 iterations in 684 ms. Result :sat
Minimization took 103 ms.
[2023-03-10 01:32:44] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 01:32:44] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 12 ms returned sat
[2023-03-10 01:32:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:44] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2023-03-10 01:32:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:32:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 01:32:44] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-10 01:32:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:45] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2023-03-10 01:32:45] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 1 ms to minimize.
[2023-03-10 01:32:45] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 1 ms to minimize.
[2023-03-10 01:32:45] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 0 ms to minimize.
[2023-03-10 01:32:45] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 0 ms to minimize.
[2023-03-10 01:32:45] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 0 ms to minimize.
[2023-03-10 01:32:45] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 1 ms to minimize.
[2023-03-10 01:32:45] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 0 ms to minimize.
[2023-03-10 01:32:46] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 0 ms to minimize.
[2023-03-10 01:32:46] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 1 ms to minimize.
[2023-03-10 01:32:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1070 ms
[2023-03-10 01:32:46] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-10 01:32:47] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 0 ms to minimize.
[2023-03-10 01:32:47] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 1 ms to minimize.
[2023-03-10 01:32:47] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 1 ms to minimize.
[2023-03-10 01:32:47] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 0 ms to minimize.
[2023-03-10 01:32:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 437 ms
[2023-03-10 01:32:47] [INFO ] Added : 165 causal constraints over 34 iterations in 1388 ms. Result :sat
Minimization took 120 ms.
[2023-03-10 01:32:47] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 01:32:47] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 13 ms returned sat
[2023-03-10 01:32:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:47] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2023-03-10 01:32:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:32:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 01:32:47] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:32:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:48] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2023-03-10 01:32:48] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2023-03-10 01:32:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-10 01:32:48] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 25 ms.
[2023-03-10 01:32:48] [INFO ] Added : 112 causal constraints over 23 iterations in 491 ms. Result :sat
Minimization took 105 ms.
[2023-03-10 01:32:48] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 01:32:48] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-10 01:32:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:48] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2023-03-10 01:32:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:32:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 01:32:48] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-10 01:32:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:49] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-10 01:32:49] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-10 01:32:50] [INFO ] Added : 195 causal constraints over 40 iterations in 981 ms. Result :sat
Minimization took 143 ms.
[2023-03-10 01:32:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 01:32:50] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-10 01:32:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:50] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2023-03-10 01:32:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:32:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 01:32:50] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-10 01:32:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:50] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2023-03-10 01:32:50] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 0 ms to minimize.
[2023-03-10 01:32:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-10 01:32:50] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 22 ms.
[2023-03-10 01:32:52] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 0 ms to minimize.
[2023-03-10 01:32:52] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 0 ms to minimize.
[2023-03-10 01:32:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2023-03-10 01:32:52] [INFO ] Added : 197 causal constraints over 40 iterations in 1607 ms. Result :sat
Minimization took 200 ms.
[2023-03-10 01:32:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 01:32:52] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-10 01:32:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:52] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2023-03-10 01:32:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:32:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-10 01:32:52] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 14 ms returned sat
[2023-03-10 01:32:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:52] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2023-03-10 01:32:52] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2023-03-10 01:32:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-10 01:32:52] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-10 01:32:53] [INFO ] Added : 147 causal constraints over 31 iterations in 785 ms. Result :sat
Minimization took 88 ms.
[2023-03-10 01:32:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 01:32:53] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-10 01:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:53] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2023-03-10 01:32:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:32:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 01:32:54] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-10 01:32:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:54] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-10 01:32:54] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2023-03-10 01:32:54] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2023-03-10 01:32:54] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 0 ms to minimize.
[2023-03-10 01:32:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 285 ms
[2023-03-10 01:32:54] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-10 01:32:55] [INFO ] Added : 174 causal constraints over 35 iterations in 939 ms. Result :sat
Minimization took 109 ms.
[2023-03-10 01:32:55] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 01:32:55] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-10 01:32:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:55] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2023-03-10 01:32:55] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 0 ms to minimize.
[2023-03-10 01:32:55] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 1 ms to minimize.
[2023-03-10 01:32:55] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 1 ms to minimize.
[2023-03-10 01:32:56] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 0 ms to minimize.
[2023-03-10 01:32:56] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 0 ms to minimize.
[2023-03-10 01:32:56] [INFO ] Deduced a trap composed of 109 places in 84 ms of which 1 ms to minimize.
[2023-03-10 01:32:56] [INFO ] Deduced a trap composed of 99 places in 75 ms of which 1 ms to minimize.
[2023-03-10 01:32:56] [INFO ] Deduced a trap composed of 117 places in 91 ms of which 3 ms to minimize.
[2023-03-10 01:32:56] [INFO ] Deduced a trap composed of 96 places in 78 ms of which 0 ms to minimize.
[2023-03-10 01:32:56] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 2 ms to minimize.
[2023-03-10 01:32:56] [INFO ] Deduced a trap composed of 98 places in 78 ms of which 4 ms to minimize.
[2023-03-10 01:32:56] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1044 ms
[2023-03-10 01:32:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:32:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 01:32:56] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-10 01:32:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:56] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-10 01:32:57] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 1 ms to minimize.
[2023-03-10 01:32:57] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 0 ms to minimize.
[2023-03-10 01:32:57] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 1 ms to minimize.
[2023-03-10 01:32:57] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 0 ms to minimize.
[2023-03-10 01:32:57] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 1 ms to minimize.
[2023-03-10 01:32:57] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 0 ms to minimize.
[2023-03-10 01:32:57] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 0 ms to minimize.
[2023-03-10 01:32:57] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 0 ms to minimize.
[2023-03-10 01:32:57] [INFO ] Deduced a trap composed of 94 places in 81 ms of which 0 ms to minimize.
[2023-03-10 01:32:57] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 0 ms to minimize.
[2023-03-10 01:32:57] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 1 ms to minimize.
[2023-03-10 01:32:58] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 2 ms to minimize.
[2023-03-10 01:32:58] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2023-03-10 01:32:58] [INFO ] Deduced a trap composed of 103 places in 81 ms of which 0 ms to minimize.
[2023-03-10 01:32:58] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 0 ms to minimize.
[2023-03-10 01:32:58] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1430 ms
[2023-03-10 01:32:58] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-10 01:32:59] [INFO ] Added : 195 causal constraints over 39 iterations in 1032 ms. Result :sat
Minimization took 260 ms.
[2023-03-10 01:32:59] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 01:32:59] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-10 01:32:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:59] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2023-03-10 01:32:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:32:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 01:32:59] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-10 01:32:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:32:59] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-10 01:33:00] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 1 ms to minimize.
[2023-03-10 01:33:00] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 0 ms to minimize.
[2023-03-10 01:33:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 199 ms
[2023-03-10 01:33:00] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-10 01:33:00] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2023-03-10 01:33:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-10 01:33:00] [INFO ] Added : 124 causal constraints over 25 iterations in 662 ms. Result :sat
Minimization took 76 ms.
[2023-03-10 01:33:00] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 01:33:00] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-10 01:33:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:01] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-10 01:33:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 01:33:01] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:01] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2023-03-10 01:33:01] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 1 ms to minimize.
[2023-03-10 01:33:01] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 1 ms to minimize.
[2023-03-10 01:33:01] [INFO ] Deduced a trap composed of 88 places in 76 ms of which 1 ms to minimize.
[2023-03-10 01:33:01] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2023-03-10 01:33:01] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2023-03-10 01:33:01] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 1 ms to minimize.
[2023-03-10 01:33:01] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 1 ms to minimize.
[2023-03-10 01:33:02] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 1 ms to minimize.
[2023-03-10 01:33:02] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2023-03-10 01:33:02] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 940 ms
[2023-03-10 01:33:02] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-10 01:33:02] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 0 ms to minimize.
[2023-03-10 01:33:02] [INFO ] Deduced a trap composed of 100 places in 81 ms of which 0 ms to minimize.
[2023-03-10 01:33:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2023-03-10 01:33:03] [INFO ] Added : 112 causal constraints over 23 iterations in 800 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : [-1, 3, 1, 1, 44, 1, 1, 1, 1, 1, -1, -1, 3] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
Support contains 13 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 198/198 transitions.
Graph (complete) has 360 edges and 216 vertex of which 215 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 215 transition count 164
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 181 transition count 162
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 179 transition count 162
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 73 place count 179 transition count 153
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 91 place count 170 transition count 153
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 169 place count 131 transition count 114
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 181 place count 125 transition count 114
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 196 place count 125 transition count 99
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 211 place count 110 transition count 99
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 228 place count 110 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 229 place count 109 transition count 98
Applied a total of 229 rules in 93 ms. Remains 109 /216 variables (removed 107) and now considering 98/198 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 109/216 places, 98/198 transitions.
// Phase 1: matrix 98 rows 109 cols
[2023-03-10 01:33:05] [INFO ] Computed 23 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 128351 resets, run finished after 1374 ms. (steps per millisecond=727 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 1000001 steps, including 84496 resets, run finished after 819 ms. (steps per millisecond=1221 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 1000001 steps, including 84645 resets, run finished after 913 ms. (steps per millisecond=1095 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 1000000 steps, including 84789 resets, run finished after 837 ms. (steps per millisecond=1194 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 1000000 steps, including 84759 resets, run finished after 832 ms. (steps per millisecond=1201 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 1000001 steps, including 84977 resets, run finished after 833 ms. (steps per millisecond=1200 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 1000001 steps, including 84410 resets, run finished after 830 ms. (steps per millisecond=1204 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 1000000 steps, including 84807 resets, run finished after 836 ms. (steps per millisecond=1196 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 1000000 steps, including 84922 resets, run finished after 822 ms. (steps per millisecond=1216 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 1000001 steps, including 84775 resets, run finished after 824 ms. (steps per millisecond=1213 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 1000000 steps, including 84640 resets, run finished after 834 ms. (steps per millisecond=1199 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 1000000 steps, including 84328 resets, run finished after 829 ms. (steps per millisecond=1206 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 1000001 steps, including 84590 resets, run finished after 829 ms. (steps per millisecond=1206 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 1000001 steps, including 84451 resets, run finished after 836 ms. (steps per millisecond=1196 ) properties (out of 13) seen :3
[2023-03-10 01:33:17] [INFO ] Invariant cache hit.
[2023-03-10 01:33:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:17] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:17] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-10 01:33:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:17] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-10 01:33:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:17] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-10 01:33:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 01:33:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 44 ms returned sat
[2023-03-10 01:33:17] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2023-03-10 01:33:17] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2023-03-10 01:33:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2023-03-10 01:33:17] [INFO ] Computed and/alt/rep : 94/440/94 causal constraints (skipped 3 transitions) in 9 ms.
[2023-03-10 01:33:18] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2023-03-10 01:33:18] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2023-03-10 01:33:18] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2023-03-10 01:33:18] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2023-03-10 01:33:18] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 0 ms to minimize.
[2023-03-10 01:33:18] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2023-03-10 01:33:18] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2023-03-10 01:33:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 479 ms
[2023-03-10 01:33:18] [INFO ] Added : 79 causal constraints over 16 iterations in 772 ms. Result :sat
Minimization took 74 ms.
[2023-03-10 01:33:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:18] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 5 ms returned unsat
[2023-03-10 01:33:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:18] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:18] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-10 01:33:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:18] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 13 ms returned sat
[2023-03-10 01:33:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:19] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-10 01:33:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 13 ms returned sat
[2023-03-10 01:33:19] [INFO ] Computed and/alt/rep : 94/440/94 causal constraints (skipped 3 transitions) in 9 ms.
[2023-03-10 01:33:19] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2023-03-10 01:33:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-10 01:33:19] [INFO ] Added : 93 causal constraints over 20 iterations in 482 ms. Result :sat
Minimization took 115 ms.
[2023-03-10 01:33:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:19] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-10 01:33:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:19] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-10 01:33:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:19] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:19] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-10 01:33:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 21 ms returned sat
[2023-03-10 01:33:19] [INFO ] Computed and/alt/rep : 94/440/94 causal constraints (skipped 3 transitions) in 9 ms.
[2023-03-10 01:33:20] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2023-03-10 01:33:20] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2023-03-10 01:33:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2023-03-10 01:33:20] [INFO ] Added : 55 causal constraints over 11 iterations in 293 ms. Result :sat
Minimization took 52 ms.
[2023-03-10 01:33:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:20] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-10 01:33:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:20] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-10 01:33:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:20] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-10 01:33:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:20] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-10 01:33:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 19 ms returned sat
[2023-03-10 01:33:20] [INFO ] Computed and/alt/rep : 94/440/94 causal constraints (skipped 3 transitions) in 8 ms.
[2023-03-10 01:33:20] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2023-03-10 01:33:20] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2023-03-10 01:33:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2023-03-10 01:33:20] [INFO ] Added : 89 causal constraints over 19 iterations in 552 ms. Result :sat
Minimization took 96 ms.
[2023-03-10 01:33:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 01:33:21] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-10 01:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:21] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-10 01:33:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:21] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:21] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-10 01:33:21] [INFO ] [Nat]Added 10 Read/Feed constraints in 13 ms returned sat
[2023-03-10 01:33:21] [INFO ] Computed and/alt/rep : 94/440/94 causal constraints (skipped 3 transitions) in 8 ms.
[2023-03-10 01:33:21] [INFO ] Added : 90 causal constraints over 18 iterations in 395 ms. Result :sat
Minimization took 94 ms.
[2023-03-10 01:33:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:21] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-10 01:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:21] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-10 01:33:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 01:33:21] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:21] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-10 01:33:21] [INFO ] [Nat]Added 10 Read/Feed constraints in 11 ms returned sat
[2023-03-10 01:33:21] [INFO ] Computed and/alt/rep : 94/440/94 causal constraints (skipped 3 transitions) in 8 ms.
[2023-03-10 01:33:22] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2023-03-10 01:33:22] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2023-03-10 01:33:22] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2023-03-10 01:33:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 188 ms
[2023-03-10 01:33:22] [INFO ] Added : 94 causal constraints over 20 iterations in 653 ms. Result :sat
Minimization took 111 ms.
[2023-03-10 01:33:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:22] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-10 01:33:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:22] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-10 01:33:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:22] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-10 01:33:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:22] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-10 01:33:22] [INFO ] [Nat]Added 10 Read/Feed constraints in 22 ms returned sat
[2023-03-10 01:33:22] [INFO ] Computed and/alt/rep : 94/440/94 causal constraints (skipped 3 transitions) in 7 ms.
[2023-03-10 01:33:23] [INFO ] Added : 94 causal constraints over 19 iterations in 418 ms. Result :sat
Minimization took 102 ms.
[2023-03-10 01:33:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:23] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:23] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-10 01:33:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 01:33:23] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 9 ms returned sat
[2023-03-10 01:33:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:23] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-10 01:33:23] [INFO ] [Nat]Added 10 Read/Feed constraints in 12 ms returned sat
[2023-03-10 01:33:23] [INFO ] Computed and/alt/rep : 94/440/94 causal constraints (skipped 3 transitions) in 6 ms.
[2023-03-10 01:33:24] [INFO ] Added : 89 causal constraints over 19 iterations in 474 ms. Result :sat
Minimization took 115 ms.
[2023-03-10 01:33:24] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:24] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:24] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-10 01:33:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 01:33:24] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 9 ms returned sat
[2023-03-10 01:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:24] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-10 01:33:24] [INFO ] [Nat]Added 10 Read/Feed constraints in 21 ms returned sat
[2023-03-10 01:33:24] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2023-03-10 01:33:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-10 01:33:24] [INFO ] Computed and/alt/rep : 94/440/94 causal constraints (skipped 3 transitions) in 11 ms.
[2023-03-10 01:33:25] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2023-03-10 01:33:25] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2023-03-10 01:33:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2023-03-10 01:33:25] [INFO ] Added : 92 causal constraints over 19 iterations in 613 ms. Result :sat
Minimization took 104 ms.
[2023-03-10 01:33:25] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:25] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 9 ms returned sat
[2023-03-10 01:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:25] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-10 01:33:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:25] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:25] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-10 01:33:25] [INFO ] [Nat]Added 10 Read/Feed constraints in 20 ms returned sat
[2023-03-10 01:33:25] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2023-03-10 01:33:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-10 01:33:25] [INFO ] Computed and/alt/rep : 94/440/94 causal constraints (skipped 3 transitions) in 7 ms.
[2023-03-10 01:33:26] [INFO ] Added : 92 causal constraints over 20 iterations in 496 ms. Result :sat
Minimization took 86 ms.
[2023-03-10 01:33:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:26] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:26] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-10 01:33:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:26] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-10 01:33:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:26] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-10 01:33:26] [INFO ] [Nat]Added 10 Read/Feed constraints in 18 ms returned sat
[2023-03-10 01:33:26] [INFO ] Computed and/alt/rep : 94/440/94 causal constraints (skipped 3 transitions) in 8 ms.
[2023-03-10 01:33:26] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2023-03-10 01:33:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-10 01:33:27] [INFO ] Added : 89 causal constraints over 18 iterations in 525 ms. Result :sat
Minimization took 136 ms.
[2023-03-10 01:33:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:27] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 44, 1, 1, 1, 1, 1, -1, -1, 1] Max seen :[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1]
FORMULA DoubleExponent-PT-004-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-004-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 11 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 98/98 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 109 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 97
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 108 transition count 97
Applied a total of 3 rules in 20 ms. Remains 108 /109 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 108/109 places, 97/98 transitions.
// Phase 1: matrix 97 rows 108 cols
[2023-03-10 01:33:28] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 128125 resets, run finished after 1104 ms. (steps per millisecond=905 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 1000000 steps, including 84689 resets, run finished after 796 ms. (steps per millisecond=1256 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84472 resets, run finished after 794 ms. (steps per millisecond=1259 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84594 resets, run finished after 793 ms. (steps per millisecond=1261 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84788 resets, run finished after 793 ms. (steps per millisecond=1261 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84766 resets, run finished after 794 ms. (steps per millisecond=1259 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84559 resets, run finished after 796 ms. (steps per millisecond=1256 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84755 resets, run finished after 794 ms. (steps per millisecond=1259 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84572 resets, run finished after 793 ms. (steps per millisecond=1261 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84851 resets, run finished after 791 ms. (steps per millisecond=1264 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84712 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84685 resets, run finished after 786 ms. (steps per millisecond=1272 ) properties (out of 11) seen :1
[2023-03-10 01:33:38] [INFO ] Invariant cache hit.
[2023-03-10 01:33:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:38] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 6 ms returned sat
[2023-03-10 01:33:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:38] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-10 01:33:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 01:33:38] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:38] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-10 01:33:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 01:33:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 28 ms returned sat
[2023-03-10 01:33:38] [INFO ] Computed and/alt/rep : 87/407/87 causal constraints (skipped 9 transitions) in 7 ms.
[2023-03-10 01:33:38] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2023-03-10 01:33:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-10 01:33:38] [INFO ] Added : 69 causal constraints over 14 iterations in 319 ms. Result :sat
Minimization took 69 ms.
[2023-03-10 01:33:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:38] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:38] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-10 01:33:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:38] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-10 01:33:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:38] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-10 01:33:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 17 ms returned sat
[2023-03-10 01:33:38] [INFO ] Computed and/alt/rep : 87/407/87 causal constraints (skipped 9 transitions) in 8 ms.
[2023-03-10 01:33:39] [INFO ] Added : 81 causal constraints over 17 iterations in 318 ms. Result :sat
Minimization took 79 ms.
[2023-03-10 01:33:39] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:39] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-10 01:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:39] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-10 01:33:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:39] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:39] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-10 01:33:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 10 ms returned sat
[2023-03-10 01:33:39] [INFO ] Computed and/alt/rep : 87/407/87 causal constraints (skipped 9 transitions) in 12 ms.
[2023-03-10 01:33:39] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2023-03-10 01:33:39] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2023-03-10 01:33:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2023-03-10 01:33:39] [INFO ] Added : 85 causal constraints over 18 iterations in 470 ms. Result :sat
Minimization took 77 ms.
[2023-03-10 01:33:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:40] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:40] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-10 01:33:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:40] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:40] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-10 01:33:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 9 ms returned sat
[2023-03-10 01:33:40] [INFO ] Computed and/alt/rep : 87/407/87 causal constraints (skipped 9 transitions) in 6 ms.
[2023-03-10 01:33:40] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2023-03-10 01:33:40] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2023-03-10 01:33:40] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2023-03-10 01:33:40] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2023-03-10 01:33:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 333 ms
[2023-03-10 01:33:40] [INFO ] Added : 81 causal constraints over 18 iterations in 700 ms. Result :sat
Minimization took 79 ms.
[2023-03-10 01:33:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 01:33:40] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-10 01:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:41] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-10 01:33:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:41] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 9 ms returned sat
[2023-03-10 01:33:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:41] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-10 01:33:41] [INFO ] [Nat]Added 10 Read/Feed constraints in 14 ms returned sat
[2023-03-10 01:33:41] [INFO ] Computed and/alt/rep : 87/407/87 causal constraints (skipped 9 transitions) in 7 ms.
[2023-03-10 01:33:41] [INFO ] Added : 65 causal constraints over 13 iterations in 264 ms. Result :sat
Minimization took 68 ms.
[2023-03-10 01:33:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:41] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 19 ms returned sat
[2023-03-10 01:33:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:41] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-10 01:33:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 01:33:41] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-10 01:33:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:41] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-10 01:33:41] [INFO ] [Nat]Added 10 Read/Feed constraints in 25 ms returned sat
[2023-03-10 01:33:41] [INFO ] Computed and/alt/rep : 87/407/87 causal constraints (skipped 9 transitions) in 11 ms.
[2023-03-10 01:33:42] [INFO ] Added : 85 causal constraints over 18 iterations in 431 ms. Result :sat
Minimization took 129 ms.
[2023-03-10 01:33:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:42] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:42] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-10 01:33:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 01:33:42] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-10 01:33:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:42] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-10 01:33:42] [INFO ] [Nat]Added 10 Read/Feed constraints in 18 ms returned sat
[2023-03-10 01:33:42] [INFO ] Computed and/alt/rep : 87/407/87 causal constraints (skipped 9 transitions) in 9 ms.
[2023-03-10 01:33:43] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2023-03-10 01:33:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-10 01:33:43] [INFO ] Added : 87 causal constraints over 19 iterations in 640 ms. Result :sat
Minimization took 132 ms.
[2023-03-10 01:33:43] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:43] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 9 ms returned sat
[2023-03-10 01:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:43] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-10 01:33:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:43] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:43] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-10 01:33:43] [INFO ] [Nat]Added 10 Read/Feed constraints in 9 ms returned sat
[2023-03-10 01:33:43] [INFO ] Computed and/alt/rep : 87/407/87 causal constraints (skipped 9 transitions) in 8 ms.
[2023-03-10 01:33:43] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2023-03-10 01:33:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-10 01:33:43] [INFO ] Added : 78 causal constraints over 17 iterations in 387 ms. Result :sat
Minimization took 94 ms.
[2023-03-10 01:33:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 01:33:44] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-10 01:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:44] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-10 01:33:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:44] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-10 01:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:44] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-10 01:33:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 11 ms returned sat
[2023-03-10 01:33:44] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2023-03-10 01:33:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-10 01:33:44] [INFO ] Computed and/alt/rep : 87/407/87 causal constraints (skipped 9 transitions) in 7 ms.
[2023-03-10 01:33:44] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2023-03-10 01:33:44] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2023-03-10 01:33:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2023-03-10 01:33:44] [INFO ] Added : 80 causal constraints over 17 iterations in 406 ms. Result :sat
Minimization took 77 ms.
[2023-03-10 01:33:44] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:44] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:44] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-10 01:33:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:44] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-10 01:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:44] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-10 01:33:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 26 ms returned sat
[2023-03-10 01:33:44] [INFO ] Computed and/alt/rep : 87/407/87 causal constraints (skipped 9 transitions) in 8 ms.
[2023-03-10 01:33:45] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2023-03-10 01:33:45] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2023-03-10 01:33:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2023-03-10 01:33:45] [INFO ] Added : 81 causal constraints over 19 iterations in 541 ms. Result :sat
Minimization took 106 ms.
[2023-03-10 01:33:45] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:45] [INFO ] [Real]Absence check using 2 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:45] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-10 01:33:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 01:33:45] [INFO ] [Nat]Absence check using 2 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-10 01:33:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:45] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-10 01:33:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 18 ms returned sat
[2023-03-10 01:33:45] [INFO ] Computed and/alt/rep : 87/407/87 causal constraints (skipped 9 transitions) in 9 ms.
[2023-03-10 01:33:46] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2023-03-10 01:33:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-10 01:33:46] [INFO ] Added : 37 causal constraints over 8 iterations in 221 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 44, 1, 1, 1, 1, 1, -1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2]
Support contains 11 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 97/97 transitions.
Applied a total of 0 rules in 7 ms. Remains 108 /108 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 108/108 places, 97/97 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 97/97 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-10 01:33:46] [INFO ] Invariant cache hit.
[2023-03-10 01:33:46] [INFO ] Implicit Places using invariants in 166 ms returned [22, 28, 46, 47, 54, 60, 75, 80, 98, 105]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 169 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 98/108 places, 97/97 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 96 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 96 transition count 95
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 96 transition count 89
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 90 transition count 89
Applied a total of 16 rules in 14 ms. Remains 90 /98 variables (removed 8) and now considering 89/97 (removed 8) transitions.
// Phase 1: matrix 89 rows 90 cols
[2023-03-10 01:33:46] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-10 01:33:46] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-10 01:33:46] [INFO ] Invariant cache hit.
[2023-03-10 01:33:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 01:33:47] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 90/108 places, 89/97 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 544 ms. Remains : 90/108 places, 89/97 transitions.
[2023-03-10 01:33:47] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144224 resets, run finished after 1123 ms. (steps per millisecond=890 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000001 steps, including 91330 resets, run finished after 758 ms. (steps per millisecond=1319 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000000 steps, including 91834 resets, run finished after 761 ms. (steps per millisecond=1314 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000000 steps, including 91623 resets, run finished after 778 ms. (steps per millisecond=1285 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000000 steps, including 91588 resets, run finished after 778 ms. (steps per millisecond=1285 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000000 steps, including 91227 resets, run finished after 762 ms. (steps per millisecond=1312 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000000 steps, including 91400 resets, run finished after 763 ms. (steps per millisecond=1310 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000000 steps, including 91587 resets, run finished after 756 ms. (steps per millisecond=1322 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000000 steps, including 91398 resets, run finished after 755 ms. (steps per millisecond=1324 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000000 steps, including 91378 resets, run finished after 782 ms. (steps per millisecond=1278 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000001 steps, including 91529 resets, run finished after 758 ms. (steps per millisecond=1319 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000001 steps, including 91307 resets, run finished after 758 ms. (steps per millisecond=1319 ) properties (out of 11) seen :1
[2023-03-10 01:33:56] [INFO ] Invariant cache hit.
[2023-03-10 01:33:56] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:33:56] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:56] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-10 01:33:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:33:56] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-10 01:33:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:56] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-10 01:33:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 01:33:56] [INFO ] [Nat]Added 10 Read/Feed constraints in 20 ms returned sat
[2023-03-10 01:33:57] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2023-03-10 01:33:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-10 01:33:57] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 7 ms.
[2023-03-10 01:33:57] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2023-03-10 01:33:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-10 01:33:57] [INFO ] Added : 85 causal constraints over 18 iterations in 529 ms. Result :sat
Minimization took 212 ms.
[2023-03-10 01:33:57] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:33:57] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:33:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:57] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-10 01:33:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:33:57] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:33:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:57] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-10 01:33:57] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
[2023-03-10 01:33:57] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 7 ms.
[2023-03-10 01:33:58] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-10 01:33:58] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2023-03-10 01:33:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2023-03-10 01:33:58] [INFO ] Added : 84 causal constraints over 17 iterations in 454 ms. Result :sat
Minimization took 138 ms.
[2023-03-10 01:33:58] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:33:58] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:33:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:58] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-10 01:33:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 01:33:58] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:33:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:58] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-10 01:33:58] [INFO ] [Nat]Added 10 Read/Feed constraints in 15 ms returned sat
[2023-03-10 01:33:58] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 14 ms.
[2023-03-10 01:33:58] [INFO ] Added : 55 causal constraints over 11 iterations in 195 ms. Result :sat
Minimization took 57 ms.
[2023-03-10 01:33:59] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:33:59] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:59] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-10 01:33:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 01:33:59] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-10 01:33:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:59] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-10 01:33:59] [INFO ] [Nat]Added 10 Read/Feed constraints in 10 ms returned sat
[2023-03-10 01:33:59] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2023-03-10 01:33:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-10 01:33:59] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 9 ms.
[2023-03-10 01:33:59] [INFO ] Added : 48 causal constraints over 10 iterations in 162 ms. Result :sat
Minimization took 55 ms.
[2023-03-10 01:33:59] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:33:59] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:59] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-10 01:33:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:33:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 01:33:59] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:33:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:33:59] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-10 01:33:59] [INFO ] [Nat]Added 10 Read/Feed constraints in 12 ms returned sat
[2023-03-10 01:33:59] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 10 ms.
[2023-03-10 01:34:00] [INFO ] Added : 84 causal constraints over 17 iterations in 343 ms. Result :sat
Minimization took 91 ms.
[2023-03-10 01:34:00] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 01:34:00] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:00] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-10 01:34:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 01:34:00] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:00] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-10 01:34:00] [INFO ] [Nat]Added 10 Read/Feed constraints in 19 ms returned sat
[2023-03-10 01:34:00] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-10 01:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-10 01:34:00] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 9 ms.
[2023-03-10 01:34:00] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2023-03-10 01:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-10 01:34:00] [INFO ] Added : 83 causal constraints over 17 iterations in 446 ms. Result :sat
Minimization took 131 ms.
[2023-03-10 01:34:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:01] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:01] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-10 01:34:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 01:34:01] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:01] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-10 01:34:01] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
[2023-03-10 01:34:01] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 9 ms.
[2023-03-10 01:34:01] [INFO ] Added : 86 causal constraints over 18 iterations in 469 ms. Result :sat
Minimization took 94 ms.
[2023-03-10 01:34:01] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 01:34:01] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:01] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-10 01:34:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 01:34:01] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:01] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-10 01:34:01] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2023-03-10 01:34:01] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 9 ms.
[2023-03-10 01:34:02] [INFO ] Added : 75 causal constraints over 15 iterations in 256 ms. Result :sat
Minimization took 123 ms.
[2023-03-10 01:34:02] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:02] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:02] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-10 01:34:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 01:34:02] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:02] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-10 01:34:02] [INFO ] [Nat]Added 10 Read/Feed constraints in 16 ms returned sat
[2023-03-10 01:34:02] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 9 ms.
[2023-03-10 01:34:03] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2023-03-10 01:34:03] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2023-03-10 01:34:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2023-03-10 01:34:03] [INFO ] Added : 84 causal constraints over 17 iterations in 554 ms. Result :sat
Minimization took 187 ms.
[2023-03-10 01:34:03] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:03] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:03] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-10 01:34:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 01:34:03] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:03] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-10 01:34:03] [INFO ] [Nat]Added 10 Read/Feed constraints in 20 ms returned sat
[2023-03-10 01:34:03] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2023-03-10 01:34:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-10 01:34:03] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 8 ms.
[2023-03-10 01:34:03] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2023-03-10 01:34:04] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 0 ms to minimize.
[2023-03-10 01:34:04] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2023-03-10 01:34:04] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2023-03-10 01:34:04] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2023-03-10 01:34:04] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-10 01:34:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 387 ms
[2023-03-10 01:34:04] [INFO ] Added : 73 causal constraints over 15 iterations in 715 ms. Result :sat
Minimization took 71 ms.
[2023-03-10 01:34:04] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:04] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:04] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-10 01:34:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 01:34:04] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:04] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-10 01:34:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 14 ms returned sat
[2023-03-10 01:34:04] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 10 ms.
[2023-03-10 01:34:04] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2023-03-10 01:34:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-10 01:34:04] [INFO ] Added : 64 causal constraints over 14 iterations in 315 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 1, 1, 1, 1, 1, -1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2]
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 89/89 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 90/90 places, 89/89 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 89/89 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2023-03-10 01:34:05] [INFO ] Invariant cache hit.
[2023-03-10 01:34:06] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-10 01:34:06] [INFO ] Invariant cache hit.
[2023-03-10 01:34:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 01:34:06] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2023-03-10 01:34:06] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 01:34:06] [INFO ] Invariant cache hit.
[2023-03-10 01:34:06] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 441 ms. Remains : 90/90 places, 89/89 transitions.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-00
[2023-03-10 01:34:06] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1431 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-10 01:34:06] [INFO ] Invariant cache hit.
[2023-03-10 01:34:06] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:06] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:06] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-10 01:34:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 01:34:06] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:06] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-10 01:34:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 01:34:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 22 ms returned sat
[2023-03-10 01:34:06] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2023-03-10 01:34:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-10 01:34:06] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 9 ms.
[2023-03-10 01:34:07] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2023-03-10 01:34:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-10 01:34:07] [INFO ] Added : 85 causal constraints over 18 iterations in 572 ms. Result :sat
Minimization took 202 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 89/89 transitions.
Graph (complete) has 311 edges and 90 vertex of which 88 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 88 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 87
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 81 transition count 81
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 81 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 80 transition count 80
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 80 transition count 80
Applied a total of 19 rules in 28 ms. Remains 80 /90 variables (removed 10) and now considering 80/89 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 80/90 places, 80/89 transitions.
// Phase 1: matrix 80 rows 80 cols
[2023-03-10 01:34:07] [INFO ] Computed 13 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 144636 resets, run finished after 1031 ms. (steps per millisecond=969 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91025 resets, run finished after 619 ms. (steps per millisecond=1615 ) properties (out of 1) seen :0
[2023-03-10 01:34:09] [INFO ] Invariant cache hit.
[2023-03-10 01:34:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:09] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:09] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-10 01:34:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:09] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:09] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-10 01:34:09] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 01:34:09] [INFO ] [Nat]Added 14 Read/Feed constraints in 18 ms returned sat
[2023-03-10 01:34:09] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2023-03-10 01:34:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-10 01:34:09] [INFO ] Computed and/alt/rep : 75/424/75 causal constraints (skipped 4 transitions) in 6 ms.
[2023-03-10 01:34:09] [INFO ] Added : 59 causal constraints over 13 iterations in 229 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 80 /80 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 80/80 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 80 /80 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-10 01:34:09] [INFO ] Invariant cache hit.
[2023-03-10 01:34:09] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-10 01:34:09] [INFO ] Invariant cache hit.
[2023-03-10 01:34:10] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 01:34:10] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2023-03-10 01:34:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 01:34:10] [INFO ] Invariant cache hit.
[2023-03-10 01:34:10] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 80/80 places, 80/80 transitions.
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-00 in 3905 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-02
// Phase 1: matrix 89 rows 90 cols
[2023-03-10 01:34:10] [INFO ] Computed 14 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 1476 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 935 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-10 01:34:10] [INFO ] Invariant cache hit.
[2023-03-10 01:34:10] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:10] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:10] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-10 01:34:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:10] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:10] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-10 01:34:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 01:34:10] [INFO ] [Nat]Added 10 Read/Feed constraints in 7 ms returned sat
[2023-03-10 01:34:10] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 6 ms.
[2023-03-10 01:34:10] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-10 01:34:10] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2023-03-10 01:34:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2023-03-10 01:34:10] [INFO ] Added : 84 causal constraints over 17 iterations in 455 ms. Result :sat
Minimization took 135 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 89/89 transitions.
Graph (complete) has 311 edges and 90 vertex of which 87 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 87 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 86 transition count 87
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 80 transition count 81
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 80 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 79 transition count 80
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 79 transition count 80
Applied a total of 19 rules in 18 ms. Remains 79 /90 variables (removed 11) and now considering 80/89 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 79/90 places, 80/89 transitions.
// Phase 1: matrix 80 rows 79 cols
[2023-03-10 01:34:11] [INFO ] Computed 13 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 144107 resets, run finished after 884 ms. (steps per millisecond=1131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91617 resets, run finished after 627 ms. (steps per millisecond=1594 ) properties (out of 1) seen :0
[2023-03-10 01:34:12] [INFO ] Invariant cache hit.
[2023-03-10 01:34:12] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 01:34:12] [INFO ] [Real]Absence check using 4 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-10 01:34:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:12] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-10 01:34:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-10 01:34:12] [INFO ] [Nat]Absence check using 4 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-10 01:34:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:12] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-10 01:34:12] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 01:34:12] [INFO ] [Nat]Added 13 Read/Feed constraints in 20 ms returned sat
[2023-03-10 01:34:12] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-10 01:34:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-10 01:34:12] [INFO ] Computed and/alt/rep : 75/430/75 causal constraints (skipped 4 transitions) in 5 ms.
[2023-03-10 01:34:13] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2023-03-10 01:34:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-10 01:34:13] [INFO ] Added : 74 causal constraints over 17 iterations in 382 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 79/79 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-10 01:34:13] [INFO ] Invariant cache hit.
[2023-03-10 01:34:13] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-10 01:34:13] [INFO ] Invariant cache hit.
[2023-03-10 01:34:13] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 01:34:13] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-10 01:34:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 01:34:13] [INFO ] Invariant cache hit.
[2023-03-10 01:34:13] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 79/79 places, 80/80 transitions.
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-02 in 3623 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-03
// Phase 1: matrix 89 rows 90 cols
[2023-03-10 01:34:13] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1411 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 897 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-10 01:34:13] [INFO ] Invariant cache hit.
[2023-03-10 01:34:14] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-10 01:34:14] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:14] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-10 01:34:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 01:34:14] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:14] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-10 01:34:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 01:34:14] [INFO ] [Nat]Added 10 Read/Feed constraints in 13 ms returned sat
[2023-03-10 01:34:14] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 5 ms.
[2023-03-10 01:34:14] [INFO ] Added : 55 causal constraints over 11 iterations in 160 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 89/89 transitions.
Graph (complete) has 311 edges and 90 vertex of which 87 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 87 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 86 transition count 87
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 80 transition count 81
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 80 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 79 transition count 80
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 79 transition count 80
Applied a total of 19 rules in 23 ms. Remains 79 /90 variables (removed 11) and now considering 80/89 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 79/90 places, 80/89 transitions.
// Phase 1: matrix 80 rows 79 cols
[2023-03-10 01:34:14] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 143999 resets, run finished after 866 ms. (steps per millisecond=1154 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91396 resets, run finished after 618 ms. (steps per millisecond=1618 ) properties (out of 1) seen :0
[2023-03-10 01:34:15] [INFO ] Invariant cache hit.
[2023-03-10 01:34:16] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 01:34:16] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:16] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-10 01:34:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:16] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:16] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-10 01:34:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 01:34:16] [INFO ] [Nat]Added 13 Read/Feed constraints in 11 ms returned sat
[2023-03-10 01:34:16] [INFO ] Computed and/alt/rep : 75/426/75 causal constraints (skipped 4 transitions) in 6 ms.
[2023-03-10 01:34:16] [INFO ] Added : 45 causal constraints over 9 iterations in 132 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 79/79 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-10 01:34:16] [INFO ] Invariant cache hit.
[2023-03-10 01:34:16] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-10 01:34:16] [INFO ] Invariant cache hit.
[2023-03-10 01:34:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 01:34:16] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2023-03-10 01:34:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 01:34:16] [INFO ] Invariant cache hit.
[2023-03-10 01:34:16] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 488 ms. Remains : 79/79 places, 80/80 transitions.
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-03 in 2904 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-04
// Phase 1: matrix 89 rows 90 cols
[2023-03-10 01:34:16] [INFO ] Computed 14 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 1457 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 891 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-10 01:34:16] [INFO ] Invariant cache hit.
[2023-03-10 01:34:16] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:16] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:16] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-10 01:34:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:16] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:17] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-10 01:34:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 01:34:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 10 ms returned sat
[2023-03-10 01:34:17] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-10 01:34:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-10 01:34:17] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 6 ms.
[2023-03-10 01:34:17] [INFO ] Added : 48 causal constraints over 10 iterations in 133 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 89/89 transitions.
Graph (complete) has 311 edges and 90 vertex of which 87 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 87 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 86 transition count 87
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 18 place count 79 transition count 80
Applied a total of 18 rules in 10 ms. Remains 79 /90 variables (removed 11) and now considering 80/89 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 79/90 places, 80/89 transitions.
// Phase 1: matrix 80 rows 79 cols
[2023-03-10 01:34:17] [INFO ] Computed 13 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 143921 resets, run finished after 1023 ms. (steps per millisecond=977 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91464 resets, run finished after 704 ms. (steps per millisecond=1420 ) properties (out of 1) seen :0
[2023-03-10 01:34:19] [INFO ] Invariant cache hit.
[2023-03-10 01:34:19] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 01:34:19] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:19] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-10 01:34:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:19] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:19] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-10 01:34:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 01:34:19] [INFO ] [Nat]Added 14 Read/Feed constraints in 9 ms returned sat
[2023-03-10 01:34:19] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2023-03-10 01:34:19] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2023-03-10 01:34:19] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2023-03-10 01:34:19] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2023-03-10 01:34:19] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2023-03-10 01:34:19] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2023-03-10 01:34:19] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2023-03-10 01:34:19] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2023-03-10 01:34:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 394 ms
[2023-03-10 01:34:19] [INFO ] Computed and/alt/rep : 76/436/76 causal constraints (skipped 3 transitions) in 6 ms.
[2023-03-10 01:34:19] [INFO ] Added : 52 causal constraints over 12 iterations in 179 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 79/79 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-10 01:34:19] [INFO ] Invariant cache hit.
[2023-03-10 01:34:20] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-10 01:34:20] [INFO ] Invariant cache hit.
[2023-03-10 01:34:20] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 01:34:20] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2023-03-10 01:34:20] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 01:34:20] [INFO ] Invariant cache hit.
[2023-03-10 01:34:20] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 470 ms. Remains : 79/79 places, 80/80 transitions.
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-04 in 3543 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-07
// Phase 1: matrix 89 rows 90 cols
[2023-03-10 01:34:20] [INFO ] Computed 14 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 1424 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 942 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-10 01:34:20] [INFO ] Invariant cache hit.
[2023-03-10 01:34:20] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:20] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:20] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-10 01:34:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 01:34:20] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:20] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-10 01:34:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 01:34:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 11 ms returned sat
[2023-03-10 01:34:20] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 10 ms.
[2023-03-10 01:34:20] [INFO ] Added : 84 causal constraints over 17 iterations in 328 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 89/89 transitions.
Graph (complete) has 311 edges and 90 vertex of which 87 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 87 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 86 transition count 87
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 80 transition count 81
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 80 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 79 transition count 80
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 79 transition count 80
Applied a total of 19 rules in 19 ms. Remains 79 /90 variables (removed 11) and now considering 80/89 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 79/90 places, 80/89 transitions.
// Phase 1: matrix 80 rows 79 cols
[2023-03-10 01:34:21] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144355 resets, run finished after 869 ms. (steps per millisecond=1150 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91399 resets, run finished after 618 ms. (steps per millisecond=1618 ) properties (out of 1) seen :0
[2023-03-10 01:34:22] [INFO ] Invariant cache hit.
[2023-03-10 01:34:22] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 01:34:22] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:22] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-10 01:34:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:22] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:22] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-10 01:34:22] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 01:34:22] [INFO ] [Nat]Added 13 Read/Feed constraints in 8 ms returned sat
[2023-03-10 01:34:22] [INFO ] Computed and/alt/rep : 75/425/75 causal constraints (skipped 4 transitions) in 6 ms.
[2023-03-10 01:34:22] [INFO ] Added : 61 causal constraints over 13 iterations in 201 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 79/79 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-10 01:34:23] [INFO ] Invariant cache hit.
[2023-03-10 01:34:23] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-10 01:34:23] [INFO ] Invariant cache hit.
[2023-03-10 01:34:23] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 01:34:23] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2023-03-10 01:34:23] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 01:34:23] [INFO ] Invariant cache hit.
[2023-03-10 01:34:23] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 457 ms. Remains : 79/79 places, 80/80 transitions.
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-07 in 3118 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-08
// Phase 1: matrix 89 rows 90 cols
[2023-03-10 01:34:23] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1464 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 943 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-10 01:34:23] [INFO ] Invariant cache hit.
[2023-03-10 01:34:23] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:23] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:23] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-10 01:34:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:23] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:23] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-10 01:34:23] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 01:34:23] [INFO ] [Nat]Added 10 Read/Feed constraints in 18 ms returned sat
[2023-03-10 01:34:23] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-10 01:34:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-10 01:34:23] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 6 ms.
[2023-03-10 01:34:24] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2023-03-10 01:34:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-10 01:34:24] [INFO ] Added : 83 causal constraints over 17 iterations in 408 ms. Result :sat
Minimization took 133 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 89/89 transitions.
Graph (complete) has 311 edges and 90 vertex of which 87 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 87 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 86 transition count 87
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 80 transition count 81
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 80 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 79 transition count 80
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 79 transition count 80
Applied a total of 19 rules in 12 ms. Remains 79 /90 variables (removed 11) and now considering 80/89 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 79/90 places, 80/89 transitions.
// Phase 1: matrix 80 rows 79 cols
[2023-03-10 01:34:24] [INFO ] Computed 13 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 144735 resets, run finished after 1145 ms. (steps per millisecond=873 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91448 resets, run finished after 620 ms. (steps per millisecond=1612 ) properties (out of 1) seen :0
[2023-03-10 01:34:26] [INFO ] Invariant cache hit.
[2023-03-10 01:34:26] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 01:34:26] [INFO ] [Real]Absence check using 4 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:26] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-10 01:34:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 01:34:26] [INFO ] [Nat]Absence check using 4 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-10 01:34:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:26] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-10 01:34:26] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 01:34:26] [INFO ] [Nat]Added 14 Read/Feed constraints in 9 ms returned sat
[2023-03-10 01:34:26] [INFO ] Computed and/alt/rep : 75/429/75 causal constraints (skipped 4 transitions) in 6 ms.
[2023-03-10 01:34:26] [INFO ] Added : 74 causal constraints over 15 iterations in 388 ms. Result :sat
Minimization took 209 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 79/79 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-10 01:34:27] [INFO ] Invariant cache hit.
[2023-03-10 01:34:27] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-10 01:34:27] [INFO ] Invariant cache hit.
[2023-03-10 01:34:27] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 01:34:27] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2023-03-10 01:34:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 01:34:27] [INFO ] Invariant cache hit.
[2023-03-10 01:34:27] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 492 ms. Remains : 79/79 places, 80/80 transitions.
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-08 in 4005 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-09
// Phase 1: matrix 89 rows 90 cols
[2023-03-10 01:34:27] [INFO ] Computed 14 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 1448 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-10 01:34:27] [INFO ] Invariant cache hit.
[2023-03-10 01:34:27] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:27] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:27] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-10 01:34:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:27] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:27] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-10 01:34:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 01:34:27] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2023-03-10 01:34:27] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 7 ms.
[2023-03-10 01:34:28] [INFO ] Added : 86 causal constraints over 18 iterations in 434 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 89/89 transitions.
Graph (complete) has 311 edges and 90 vertex of which 88 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 88 transition count 88
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 87 transition count 88
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 17 place count 80 transition count 81
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 80 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 79 transition count 80
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 79 transition count 80
Applied a total of 20 rules in 17 ms. Remains 79 /90 variables (removed 11) and now considering 80/89 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 79/90 places, 80/89 transitions.
// Phase 1: matrix 80 rows 79 cols
[2023-03-10 01:34:28] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144456 resets, run finished after 866 ms. (steps per millisecond=1154 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91192 resets, run finished after 621 ms. (steps per millisecond=1610 ) properties (out of 1) seen :0
[2023-03-10 01:34:29] [INFO ] Invariant cache hit.
[2023-03-10 01:34:29] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 01:34:29] [INFO ] [Real]Absence check using 4 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:29] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-10 01:34:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 01:34:29] [INFO ] [Nat]Absence check using 4 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-10 01:34:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:29] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-10 01:34:29] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 01:34:30] [INFO ] [Nat]Added 14 Read/Feed constraints in 17 ms returned sat
[2023-03-10 01:34:30] [INFO ] Computed and/alt/rep : 75/438/75 causal constraints (skipped 4 transitions) in 8 ms.
[2023-03-10 01:34:30] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-03-10 01:34:30] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2023-03-10 01:34:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2023-03-10 01:34:30] [INFO ] Added : 68 causal constraints over 15 iterations in 369 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 79/79 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-10 01:34:30] [INFO ] Invariant cache hit.
[2023-03-10 01:34:30] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-10 01:34:30] [INFO ] Invariant cache hit.
[2023-03-10 01:34:30] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 01:34:30] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-10 01:34:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 01:34:30] [INFO ] Invariant cache hit.
[2023-03-10 01:34:30] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 416 ms. Remains : 79/79 places, 80/80 transitions.
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-09 in 3456 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-10
// Phase 1: matrix 89 rows 90 cols
[2023-03-10 01:34:30] [INFO ] Computed 14 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 1447 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
[2023-03-10 01:34:30] [INFO ] Invariant cache hit.
[2023-03-10 01:34:31] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:31] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:31] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-10 01:34:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 01:34:31] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:31] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-10 01:34:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 01:34:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2023-03-10 01:34:31] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 7 ms.
[2023-03-10 01:34:31] [INFO ] Added : 75 causal constraints over 15 iterations in 220 ms. Result :sat
Minimization took 124 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 89/89 transitions.
Graph (complete) has 311 edges and 90 vertex of which 87 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 87 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 86 transition count 87
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 80 transition count 81
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 80 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 79 transition count 80
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 79 transition count 80
Applied a total of 19 rules in 11 ms. Remains 79 /90 variables (removed 11) and now considering 80/89 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 79/90 places, 80/89 transitions.
// Phase 1: matrix 80 rows 79 cols
[2023-03-10 01:34:31] [INFO ] Computed 13 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 144114 resets, run finished after 1239 ms. (steps per millisecond=807 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91661 resets, run finished after 619 ms. (steps per millisecond=1615 ) properties (out of 1) seen :0
[2023-03-10 01:34:33] [INFO ] Invariant cache hit.
[2023-03-10 01:34:33] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 01:34:33] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:33] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-10 01:34:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 01:34:33] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:33] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-10 01:34:33] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 01:34:33] [INFO ] [Nat]Added 14 Read/Feed constraints in 15 ms returned sat
[2023-03-10 01:34:33] [INFO ] Computed and/alt/rep : 76/438/76 causal constraints (skipped 3 transitions) in 6 ms.
[2023-03-10 01:34:33] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2023-03-10 01:34:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-10 01:34:33] [INFO ] Added : 74 causal constraints over 17 iterations in 353 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 79/79 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-10 01:34:34] [INFO ] Invariant cache hit.
[2023-03-10 01:34:34] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-10 01:34:34] [INFO ] Invariant cache hit.
[2023-03-10 01:34:34] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 01:34:34] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2023-03-10 01:34:34] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 01:34:34] [INFO ] Invariant cache hit.
[2023-03-10 01:34:34] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 430 ms. Remains : 79/79 places, 80/80 transitions.
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-10 in 3552 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-11
// Phase 1: matrix 89 rows 90 cols
[2023-03-10 01:34:34] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1445 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 891 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-10 01:34:34] [INFO ] Invariant cache hit.
[2023-03-10 01:34:34] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:34] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:34] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-10 01:34:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:34] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:34] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-10 01:34:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 01:34:34] [INFO ] [Nat]Added 10 Read/Feed constraints in 15 ms returned sat
[2023-03-10 01:34:34] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 9 ms.
[2023-03-10 01:34:35] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2023-03-10 01:34:35] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2023-03-10 01:34:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2023-03-10 01:34:35] [INFO ] Added : 84 causal constraints over 17 iterations in 561 ms. Result :sat
Minimization took 127 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 89/89 transitions.
Graph (complete) has 311 edges and 90 vertex of which 87 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 87 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 86 transition count 87
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 80 transition count 81
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 80 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 79 transition count 80
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 79 transition count 80
Applied a total of 19 rules in 9 ms. Remains 79 /90 variables (removed 11) and now considering 80/89 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 79/90 places, 80/89 transitions.
// Phase 1: matrix 80 rows 79 cols
[2023-03-10 01:34:35] [INFO ] Computed 13 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 144217 resets, run finished after 870 ms. (steps per millisecond=1149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91391 resets, run finished after 619 ms. (steps per millisecond=1615 ) properties (out of 1) seen :0
[2023-03-10 01:34:37] [INFO ] Invariant cache hit.
[2023-03-10 01:34:37] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 01:34:37] [INFO ] [Real]Absence check using 4 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-10 01:34:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:37] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-10 01:34:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 01:34:37] [INFO ] [Nat]Absence check using 4 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-10 01:34:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:37] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-10 01:34:37] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 01:34:37] [INFO ] [Nat]Added 13 Read/Feed constraints in 16 ms returned sat
[2023-03-10 01:34:37] [INFO ] Computed and/alt/rep : 75/431/75 causal constraints (skipped 4 transitions) in 6 ms.
[2023-03-10 01:34:37] [INFO ] Added : 75 causal constraints over 16 iterations in 354 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 79/79 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-10 01:34:37] [INFO ] Invariant cache hit.
[2023-03-10 01:34:37] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-10 01:34:37] [INFO ] Invariant cache hit.
[2023-03-10 01:34:37] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 01:34:37] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-10 01:34:37] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 01:34:38] [INFO ] Invariant cache hit.
[2023-03-10 01:34:38] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 482 ms. Remains : 79/79 places, 80/80 transitions.
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-11 in 3628 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-12
// Phase 1: matrix 89 rows 90 cols
[2023-03-10 01:34:38] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1456 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 896 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-10 01:34:38] [INFO ] Invariant cache hit.
[2023-03-10 01:34:38] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:38] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:38] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-10 01:34:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 01:34:38] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:38] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-10 01:34:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 01:34:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 20 ms returned sat
[2023-03-10 01:34:38] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2023-03-10 01:34:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-10 01:34:38] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 6 ms.
[2023-03-10 01:34:38] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2023-03-10 01:34:38] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2023-03-10 01:34:38] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 0 ms to minimize.
[2023-03-10 01:34:38] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2023-03-10 01:34:39] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2023-03-10 01:34:39] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-10 01:34:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 395 ms
[2023-03-10 01:34:39] [INFO ] Added : 73 causal constraints over 15 iterations in 691 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 89/89 transitions.
Graph (complete) has 311 edges and 90 vertex of which 88 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 88
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 16 place count 81 transition count 81
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 81 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 80 transition count 80
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 80 transition count 80
Applied a total of 19 rules in 9 ms. Remains 80 /90 variables (removed 10) and now considering 80/89 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 80/90 places, 80/89 transitions.
// Phase 1: matrix 80 rows 80 cols
[2023-03-10 01:34:39] [INFO ] Computed 13 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 144421 resets, run finished after 865 ms. (steps per millisecond=1156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91482 resets, run finished after 620 ms. (steps per millisecond=1612 ) properties (out of 1) seen :0
[2023-03-10 01:34:40] [INFO ] Invariant cache hit.
[2023-03-10 01:34:40] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 01:34:40] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:40] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-10 01:34:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 01:34:40] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:40] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-10 01:34:40] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 01:34:40] [INFO ] [Nat]Added 14 Read/Feed constraints in 18 ms returned sat
[2023-03-10 01:34:40] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2023-03-10 01:34:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-10 01:34:40] [INFO ] Computed and/alt/rep : 75/424/75 causal constraints (skipped 4 transitions) in 6 ms.
[2023-03-10 01:34:41] [INFO ] Added : 63 causal constraints over 14 iterations in 197 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 80/80 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-10 01:34:41] [INFO ] Invariant cache hit.
[2023-03-10 01:34:41] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-10 01:34:41] [INFO ] Invariant cache hit.
[2023-03-10 01:34:41] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 01:34:41] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-10 01:34:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 01:34:41] [INFO ] Invariant cache hit.
[2023-03-10 01:34:41] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 426 ms. Remains : 80/80 places, 80/80 transitions.
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-12 in 3542 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-13
// Phase 1: matrix 89 rows 90 cols
[2023-03-10 01:34:41] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1421 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :1
[2023-03-10 01:34:41] [INFO ] Invariant cache hit.
[2023-03-10 01:34:41] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:41] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 01:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:41] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-10 01:34:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 01:34:41] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:41] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-10 01:34:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 01:34:41] [INFO ] [Nat]Added 10 Read/Feed constraints in 12 ms returned sat
[2023-03-10 01:34:41] [INFO ] Computed and/alt/rep : 86/431/86 causal constraints (skipped 2 transitions) in 9 ms.
[2023-03-10 01:34:42] [INFO ] Added : 35 causal constraints over 7 iterations in 114 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 89/89 transitions.
Graph (complete) has 311 edges and 90 vertex of which 87 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 87 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 86 transition count 87
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 80 transition count 81
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 80 transition count 79
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 78 transition count 79
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 78 transition count 79
Applied a total of 21 rules in 18 ms. Remains 78 /90 variables (removed 12) and now considering 79/89 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 78/90 places, 79/89 transitions.
// Phase 1: matrix 79 rows 78 cols
[2023-03-10 01:34:42] [INFO ] Computed 13 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 144013 resets, run finished after 1026 ms. (steps per millisecond=974 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 91596 resets, run finished after 614 ms. (steps per millisecond=1628 ) properties (out of 1) seen :1
[2023-03-10 01:34:43] [INFO ] Invariant cache hit.
[2023-03-10 01:34:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 01:34:43] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:43] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-10 01:34:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:34:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 01:34:43] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 01:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:34:43] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-10 01:34:43] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 01:34:43] [INFO ] [Nat]Added 14 Read/Feed constraints in 7 ms returned sat
[2023-03-10 01:34:43] [INFO ] Computed and/alt/rep : 74/431/74 causal constraints (skipped 4 transitions) in 6 ms.
[2023-03-10 01:34:44] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2023-03-10 01:34:44] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2023-03-10 01:34:44] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2023-03-10 01:34:44] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2023-03-10 01:34:44] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2023-03-10 01:34:44] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2023-03-10 01:34:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 301 ms
[2023-03-10 01:34:44] [INFO ] Added : 52 causal constraints over 13 iterations in 482 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 79/79 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 79/79 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 78/78 places, 79/79 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 79/79 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2023-03-10 01:34:44] [INFO ] Invariant cache hit.
[2023-03-10 01:34:44] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-10 01:34:44] [INFO ] Invariant cache hit.
[2023-03-10 01:34:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 01:34:44] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-10 01:34:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 01:34:44] [INFO ] Invariant cache hit.
[2023-03-10 01:34:44] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 404 ms. Remains : 78/78 places, 79/79 transitions.
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-13 in 3232 ms.
[2023-03-10 01:34:45] [INFO ] Flatten gal took : 60 ms
[2023-03-10 01:34:45] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-10 01:34:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 90 places, 89 transitions and 420 arcs took 2 ms.
Total runtime 133201 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DoubleExponent (PT), instance 004
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 90 places, 89 transitions, 420 arcs.
Final Score: 1612.392
Took : 4 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10944880 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16106440 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="DoubleExponent-PT-004"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-5348"
echo " Executing tool smartxred"
echo " Input is DoubleExponent-PT-004, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r139-smll-167819423100469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-004.tgz
mv DoubleExponent-PT-004 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;