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.r133-smll-167819411100461.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 itstools
Input is DoubleExponent-PT-003, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819411100461
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.9K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 13K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K 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 50K 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-003-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678468326629

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-10 17:12:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 17:12:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 17:12:09] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-10 17:12:09] [INFO ] Transformed 163 places.
[2023-03-10 17:12:09] [INFO ] Transformed 148 transitions.
[2023-03-10 17:12:09] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 148 rows 163 cols
[2023-03-10 17:12:09] [INFO ] Computed 19 place invariants in 57 ms
Incomplete random walk after 10000 steps, including 338 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :8
FORMULA DoubleExponent-PT-003-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 296 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 284 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :2
FORMULA DoubleExponent-PT-003-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-10 17:12:09] [INFO ] Invariant cache hit.
[2023-03-10 17:12:10] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2023-03-10 17:12:10] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2023-03-10 17:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:10] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-10 17:12:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-10 17:12:10] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 11 ms returned sat
[2023-03-10 17:12:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:10] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2023-03-10 17:12:10] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 5 ms to minimize.
[2023-03-10 17:12:10] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2023-03-10 17:12:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2023-03-10 17:12:10] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-10 17:12:11] [INFO ] Added : 100 causal constraints over 20 iterations in 498 ms. Result :sat
Minimization took 68 ms.
[2023-03-10 17:12:11] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-10 17:12:11] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2023-03-10 17:12:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:11] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-10 17:12:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-10 17:12:11] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2023-03-10 17:12:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:11] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2023-03-10 17:12:11] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 2 ms to minimize.
[2023-03-10 17:12:12] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2023-03-10 17:12:12] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 0 ms to minimize.
[2023-03-10 17:12:12] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 1 ms to minimize.
[2023-03-10 17:12:12] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 1 ms to minimize.
[2023-03-10 17:12:12] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2023-03-10 17:12:12] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 1 ms to minimize.
[2023-03-10 17:12:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 804 ms
[2023-03-10 17:12:12] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-10 17:12:13] [INFO ] Added : 133 causal constraints over 27 iterations in 548 ms. Result :sat
Minimization took 151 ms.
[2023-03-10 17:12:13] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-10 17:12:13] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2023-03-10 17:12:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:13] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-10 17:12:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-10 17:12:13] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2023-03-10 17:12:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:13] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2023-03-10 17:12:13] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 0 ms to minimize.
[2023-03-10 17:12:13] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 0 ms to minimize.
[2023-03-10 17:12:13] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2023-03-10 17:12:14] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 0 ms to minimize.
[2023-03-10 17:12:14] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2023-03-10 17:12:14] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 0 ms to minimize.
[2023-03-10 17:12:14] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2023-03-10 17:12:14] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 1 ms to minimize.
[2023-03-10 17:12:14] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2023-03-10 17:12:14] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 1 ms to minimize.
[2023-03-10 17:12:14] [INFO ] Deduced a trap composed of 78 places in 77 ms of which 1 ms to minimize.
[2023-03-10 17:12:14] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 1 ms to minimize.
[2023-03-10 17:12:14] [INFO ] Deduced a trap composed of 100 places in 63 ms of which 1 ms to minimize.
[2023-03-10 17:12:14] [INFO ] Deduced a trap composed of 98 places in 62 ms of which 0 ms to minimize.
[2023-03-10 17:12:14] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 1 ms to minimize.
[2023-03-10 17:12:14] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1287 ms
[2023-03-10 17:12:14] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-10 17:12:15] [INFO ] Added : 112 causal constraints over 23 iterations in 557 ms. Result :sat
Minimization took 106 ms.
[2023-03-10 17:12:15] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-10 17:12:15] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned unsat
[2023-03-10 17:12:15] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:15] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-10 17:12:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:15] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-10 17:12:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:15] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2023-03-10 17:12:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:15] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2023-03-10 17:12:16] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 0 ms to minimize.
[2023-03-10 17:12:16] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2023-03-10 17:12:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2023-03-10 17:12:16] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-10 17:12:16] [INFO ] Added : 108 causal constraints over 22 iterations in 454 ms. Result :sat
Minimization took 98 ms.
[2023-03-10 17:12:16] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-10 17:12:16] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 11 ms returned sat
[2023-03-10 17:12:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:16] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2023-03-10 17:12:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-10 17:12:16] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-10 17:12:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:17] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-10 17:12:17] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-10 17:12:17] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
[2023-03-10 17:12:17] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2023-03-10 17:12:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2023-03-10 17:12:17] [INFO ] Added : 143 causal constraints over 30 iterations in 763 ms. Result :sat
Minimization took 118 ms.
[2023-03-10 17:12:17] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-10 17:12:17] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-10 17:12:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:18] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-10 17:12:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-10 17:12:18] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-10 17:12:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:18] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-03-10 17:12:18] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 0 ms to minimize.
[2023-03-10 17:12:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-10 17:12:18] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-10 17:12:19] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2023-03-10 17:12:19] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2023-03-10 17:12:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2023-03-10 17:12:19] [INFO ] Added : 142 causal constraints over 29 iterations in 839 ms. Result :sat
Minimization took 135 ms.
[2023-03-10 17:12:19] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-10 17:12:19] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-10 17:12:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:19] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-10 17:12:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-10 17:12:19] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-10 17:12:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:19] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-10 17:12:19] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2023-03-10 17:12:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-10 17:12:19] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-10 17:12:20] [INFO ] Added : 101 causal constraints over 21 iterations in 370 ms. Result :sat
Minimization took 63 ms.
[2023-03-10 17:12:20] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-10 17:12:20] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-10 17:12:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:20] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-10 17:12:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-10 17:12:20] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2023-03-10 17:12:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:20] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2023-03-10 17:12:20] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 0 ms to minimize.
[2023-03-10 17:12:20] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2023-03-10 17:12:20] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 4 ms to minimize.
[2023-03-10 17:12:20] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 0 ms to minimize.
[2023-03-10 17:12:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 298 ms
[2023-03-10 17:12:20] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-10 17:12:21] [INFO ] Deduced a trap composed of 76 places in 74 ms of which 1 ms to minimize.
[2023-03-10 17:12:21] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2023-03-10 17:12:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2023-03-10 17:12:21] [INFO ] Added : 145 causal constraints over 30 iterations in 855 ms. Result :sat
Minimization took 119 ms.
Current structural bounds on expressions (after SMT) : [1, -1, 44, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA DoubleExponent-PT-003-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 148/148 transitions.
Graph (complete) has 269 edges and 163 vertex of which 158 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 157 transition count 115
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 67 place count 126 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 125 transition count 114
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 68 place count 125 transition count 107
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 82 place count 118 transition count 107
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 142 place count 88 transition count 77
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 150 place count 84 transition count 77
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 155 place count 84 transition count 72
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 160 place count 79 transition count 72
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 172 place count 79 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 173 place count 78 transition count 71
Applied a total of 173 rules in 72 ms. Remains 78 /163 variables (removed 85) and now considering 71/148 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 78/163 places, 71/148 transitions.
// Phase 1: matrix 71 rows 78 cols
[2023-03-10 17:12:22] [INFO ] Computed 15 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 128143 resets, run finished after 1171 ms. (steps per millisecond=853 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84660 resets, run finished after 745 ms. (steps per millisecond=1342 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84847 resets, run finished after 760 ms. (steps per millisecond=1315 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84942 resets, run finished after 755 ms. (steps per millisecond=1324 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84684 resets, run finished after 761 ms. (steps per millisecond=1314 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84858 resets, run finished after 765 ms. (steps per millisecond=1307 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84847 resets, run finished after 751 ms. (steps per millisecond=1331 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84772 resets, run finished after 752 ms. (steps per millisecond=1329 ) properties (out of 7) seen :0
[2023-03-10 17:12:28] [INFO ] Invariant cache hit.
[2023-03-10 17:12:28] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 17:12:28] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-10 17:12:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:28] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-10 17:12:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 17:12:29] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-10 17:12:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:29] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-10 17:12:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 17:12:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-10 17:12:29] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 24 ms.
[2023-03-10 17:12:29] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2023-03-10 17:12:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-03-10 17:12:29] [INFO ] Added : 67 causal constraints over 14 iterations in 665 ms. Result :sat
Minimization took 86 ms.
[2023-03-10 17:12:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 17:12:29] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-10 17:12:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:29] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-10 17:12:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 17:12:30] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-10 17:12:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:30] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-10 17:12:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-10 17:12:30] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 8 ms.
[2023-03-10 17:12:30] [INFO ] Added : 46 causal constraints over 10 iterations in 166 ms. Result :sat
Minimization took 93 ms.
[2023-03-10 17:12:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 17:12:30] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-10 17:12:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:30] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-10 17:12:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 17:12:30] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-10 17:12:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:30] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-10 17:12:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-10 17:12:30] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 8 ms.
[2023-03-10 17:12:30] [INFO ] Added : 47 causal constraints over 10 iterations in 165 ms. Result :sat
Minimization took 62 ms.
[2023-03-10 17:12:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 17:12:30] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-10 17:12:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:30] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-10 17:12:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 17:12:30] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-10 17:12:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:30] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-10 17:12:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-10 17:12:30] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 10 ms.
[2023-03-10 17:12:31] [INFO ] Added : 65 causal constraints over 14 iterations in 279 ms. Result :sat
Minimization took 93 ms.
[2023-03-10 17:12:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 17:12:31] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-10 17:12:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:31] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-10 17:12:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 17:12:31] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-10 17:12:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:31] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-10 17:12:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-10 17:12:31] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 5 ms.
[2023-03-10 17:12:31] [INFO ] Added : 66 causal constraints over 14 iterations in 184 ms. Result :sat
Minimization took 62 ms.
[2023-03-10 17:12:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 17:12:31] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-10 17:12:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:31] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-10 17:12:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 17:12:31] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-10 17:12:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:31] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-10 17:12:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-10 17:12:31] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 5 ms.
[2023-03-10 17:12:32] [INFO ] Added : 68 causal constraints over 14 iterations in 189 ms. Result :sat
Minimization took 56 ms.
[2023-03-10 17:12:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 17:12:32] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-10 17:12:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:32] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-10 17:12:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 17:12:32] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-10 17:12:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:32] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-10 17:12:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-10 17:12:32] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 6 ms.
[2023-03-10 17:12:32] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2023-03-10 17:12:32] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2023-03-10 17:12:32] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2023-03-10 17:12:32] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2023-03-10 17:12:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 197 ms
[2023-03-10 17:12:32] [INFO ] Added : 66 causal constraints over 14 iterations in 400 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [1, -1, 44, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 71/71 transitions.
Applied a total of 0 rules in 6 ms. Remains 78 /78 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 78/78 places, 71/71 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 71/71 transitions.
Applied a total of 0 rules in 5 ms. Remains 78 /78 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2023-03-10 17:12:33] [INFO ] Invariant cache hit.
[2023-03-10 17:12:33] [INFO ] Implicit Places using invariants in 84 ms returned [23, 43, 48]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 87 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 75/78 places, 71/71 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 73 transition count 69
Applied a total of 4 rules in 9 ms. Remains 73 /75 variables (removed 2) and now considering 69/71 (removed 2) transitions.
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 17:12:33] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-10 17:12:33] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-10 17:12:33] [INFO ] Invariant cache hit.
[2023-03-10 17:12:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 17:12:33] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 73/78 places, 69/71 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 343 ms. Remains : 73/78 places, 69/71 transitions.
[2023-03-10 17:12:33] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144226 resets, run finished after 1003 ms. (steps per millisecond=997 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91674 resets, run finished after 698 ms. (steps per millisecond=1432 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91302 resets, run finished after 659 ms. (steps per millisecond=1517 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91281 resets, run finished after 657 ms. (steps per millisecond=1522 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91359 resets, run finished after 656 ms. (steps per millisecond=1524 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91353 resets, run finished after 656 ms. (steps per millisecond=1524 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91721 resets, run finished after 659 ms. (steps per millisecond=1517 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91177 resets, run finished after 670 ms. (steps per millisecond=1492 ) properties (out of 7) seen :0
[2023-03-10 17:12:39] [INFO ] Invariant cache hit.
[2023-03-10 17:12:39] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:39] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:39] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-10 17:12:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 17:12:39] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:39] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-10 17:12:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 17:12:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-10 17:12:39] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 7 ms.
[2023-03-10 17:12:39] [INFO ] Added : 36 causal constraints over 8 iterations in 96 ms. Result :sat
Minimization took 35 ms.
[2023-03-10 17:12:39] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:39] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:39] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-10 17:12:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 17:12:39] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:39] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-10 17:12:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-10 17:12:39] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 6 ms.
[2023-03-10 17:12:39] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2023-03-10 17:12:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-10 17:12:39] [INFO ] Added : 42 causal constraints over 9 iterations in 163 ms. Result :sat
Minimization took 57 ms.
[2023-03-10 17:12:39] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:39] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:39] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-10 17:12:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 17:12:39] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:39] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-10 17:12:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-10 17:12:39] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 6 ms.
[2023-03-10 17:12:39] [INFO ] Added : 39 causal constraints over 8 iterations in 87 ms. Result :sat
Minimization took 29 ms.
[2023-03-10 17:12:39] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 17:12:39] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:39] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-10 17:12:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 17:12:40] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:40] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-10 17:12:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-10 17:12:40] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 6 ms.
[2023-03-10 17:12:40] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2023-03-10 17:12:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-10 17:12:40] [INFO ] Added : 58 causal constraints over 13 iterations in 201 ms. Result :sat
Minimization took 41 ms.
[2023-03-10 17:12:40] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:40] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:40] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-10 17:12:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:40] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-10 17:12:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:40] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-10 17:12:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-10 17:12:40] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 6 ms.
[2023-03-10 17:12:40] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2023-03-10 17:12:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-10 17:12:40] [INFO ] Added : 58 causal constraints over 13 iterations in 202 ms. Result :sat
Minimization took 45 ms.
[2023-03-10 17:12:40] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 17:12:40] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:40] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-10 17:12:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 17:12:40] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:40] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-10 17:12:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-10 17:12:40] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 7 ms.
[2023-03-10 17:12:41] [INFO ] Added : 39 causal constraints over 8 iterations in 129 ms. Result :sat
Minimization took 52 ms.
[2023-03-10 17:12:41] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:41] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:41] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-10 17:12:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:41] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:41] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-10 17:12:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-10 17:12:41] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 8 ms.
[2023-03-10 17:12:41] [INFO ] Added : 63 causal constraints over 13 iterations in 260 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : [1, -1, 44, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 69/69 transitions.
Applied a total of 0 rules in 5 ms. Remains 73 /73 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 73/73 places, 69/69 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 69/69 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-10 17:12:41] [INFO ] Invariant cache hit.
[2023-03-10 17:12:41] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-10 17:12:41] [INFO ] Invariant cache hit.
[2023-03-10 17:12:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 17:12:42] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-10 17:12:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 17:12:42] [INFO ] Invariant cache hit.
[2023-03-10 17:12:42] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 73/73 places, 69/69 transitions.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-01
[2023-03-10 17:12:42] [INFO ] Invariant cache hit.
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 10000 steps, including 921 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-10 17:12:42] [INFO ] Invariant cache hit.
[2023-03-10 17:12:42] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:42] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:42] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-10 17:12:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:42] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:42] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-10 17:12:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 17:12:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-10 17:12:42] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 6 ms.
[2023-03-10 17:12:42] [INFO ] Added : 36 causal constraints over 8 iterations in 88 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 69/69 transitions.
Graph (complete) has 231 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 72 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 70 transition count 67
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 70 transition count 65
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 68 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 67 transition count 64
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 67 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 66 transition count 63
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 66 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 65 transition count 62
Applied a total of 15 rules in 18 ms. Remains 65 /73 variables (removed 8) and now considering 62/69 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 65/73 places, 62/69 transitions.
// Phase 1: matrix 62 rows 65 cols
[2023-03-10 17:12:42] [INFO ] Computed 12 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 143976 resets, run finished after 830 ms. (steps per millisecond=1204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91517 resets, run finished after 589 ms. (steps per millisecond=1697 ) properties (out of 1) seen :0
[2023-03-10 17:12:43] [INFO ] Invariant cache hit.
[2023-03-10 17:12:44] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 17:12:44] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:44] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-10 17:12:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 17:12:44] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:44] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-10 17:12:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 17:12:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2023-03-10 17:12:44] [INFO ] Computed and/alt/rep : 60/300/60 causal constraints (skipped 1 transitions) in 6 ms.
[2023-03-10 17:12:44] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2023-03-10 17:12:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-10 17:12:44] [INFO ] Added : 49 causal constraints over 11 iterations in 185 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 65/65 places, 62/62 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 62/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-10 17:12:44] [INFO ] Invariant cache hit.
[2023-03-10 17:12:44] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-10 17:12:44] [INFO ] Invariant cache hit.
[2023-03-10 17:12:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 17:12:44] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2023-03-10 17:12:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 17:12:44] [INFO ] Invariant cache hit.
[2023-03-10 17:12:44] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 65/65 places, 62/62 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-01 in 2475 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-02
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 17:12:44] [INFO ] Computed 12 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 1425 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 901 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-10 17:12:44] [INFO ] Invariant cache hit.
[2023-03-10 17:12:44] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:44] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:44] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-10 17:12:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 17:12:44] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:44] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-10 17:12:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 17:12:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-10 17:12:44] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 7 ms.
[2023-03-10 17:12:45] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2023-03-10 17:12:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-10 17:12:45] [INFO ] Added : 42 causal constraints over 9 iterations in 200 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 69/69 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 71 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 71 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 70 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 69 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 69 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 68 transition count 64
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 68 transition count 60
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 18 place count 64 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 19 place count 64 transition count 60
Applied a total of 19 rules in 22 ms. Remains 64 /73 variables (removed 9) and now considering 60/69 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 64/73 places, 60/69 transitions.
// Phase 1: matrix 60 rows 64 cols
[2023-03-10 17:12:45] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 144397 resets, run finished after 823 ms. (steps per millisecond=1215 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91328 resets, run finished after 615 ms. (steps per millisecond=1626 ) properties (out of 1) seen :0
[2023-03-10 17:12:46] [INFO ] Invariant cache hit.
[2023-03-10 17:12:46] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:46] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:46] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-10 17:12:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 17:12:46] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:46] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-10 17:12:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 17:12:46] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2023-03-10 17:12:46] [INFO ] Computed and/alt/rep : 55/282/55 causal constraints (skipped 4 transitions) in 6 ms.
[2023-03-10 17:12:46] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2023-03-10 17:12:46] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2023-03-10 17:12:47] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2023-03-10 17:12:47] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2023-03-10 17:12:47] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 3 ms to minimize.
[2023-03-10 17:12:47] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2023-03-10 17:12:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 313 ms
[2023-03-10 17:12:47] [INFO ] Added : 41 causal constraints over 10 iterations in 421 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 60/60 transitions.
Applied a total of 0 rules in 9 ms. Remains 64 /64 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 64/64 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 60/60 transitions.
Applied a total of 0 rules in 9 ms. Remains 64 /64 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-10 17:12:47] [INFO ] Invariant cache hit.
[2023-03-10 17:12:47] [INFO ] Implicit Places using invariants in 83 ms returned [55, 61]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 84 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/64 places, 60/60 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 59
Applied a total of 2 rules in 6 ms. Remains 61 /62 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 61 cols
[2023-03-10 17:12:47] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 17:12:47] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-10 17:12:47] [INFO ] Invariant cache hit.
[2023-03-10 17:12:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 17:12:47] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 61/64 places, 59/60 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 302 ms. Remains : 61/64 places, 59/60 transitions.
[2023-03-10 17:12:47] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144030 resets, run finished after 937 ms. (steps per millisecond=1067 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91266 resets, run finished after 612 ms. (steps per millisecond=1633 ) properties (out of 1) seen :0
[2023-03-10 17:12:49] [INFO ] Invariant cache hit.
[2023-03-10 17:12:49] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:49] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:49] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-10 17:12:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-10 17:12:49] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:49] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-10 17:12:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 17:12:49] [INFO ] [Nat]Added 10 Read/Feed constraints in 7 ms returned sat
[2023-03-10 17:12:49] [INFO ] Computed and/alt/rep : 56/297/56 causal constraints (skipped 2 transitions) in 5 ms.
[2023-03-10 17:12:49] [INFO ] Added : 47 causal constraints over 11 iterations in 119 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 61/61 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2023-03-10 17:12:49] [INFO ] Invariant cache hit.
[2023-03-10 17:12:49] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-10 17:12:49] [INFO ] Invariant cache hit.
[2023-03-10 17:12:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 17:12:49] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-10 17:12:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 17:12:49] [INFO ] Invariant cache hit.
[2023-03-10 17:12:49] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 61/61 places, 59/59 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-02 in 5055 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-03
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 17:12:49] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1453 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 927 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-10 17:12:49] [INFO ] Invariant cache hit.
[2023-03-10 17:12:49] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:49] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:49] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-10 17:12:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:49] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:49] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-10 17:12:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 17:12:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-10 17:12:49] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 7 ms.
[2023-03-10 17:12:50] [INFO ] Added : 39 causal constraints over 8 iterations in 95 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 69/69 transitions.
Graph (complete) has 231 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 72 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 70 transition count 67
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 70 transition count 65
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 68 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 68 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 67 transition count 64
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 14 place count 67 transition count 61
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 17 place count 64 transition count 61
Applied a total of 17 rules in 14 ms. Remains 64 /73 variables (removed 9) and now considering 61/69 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 64/73 places, 61/69 transitions.
// Phase 1: matrix 61 rows 64 cols
[2023-03-10 17:12:50] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 144276 resets, run finished after 851 ms. (steps per millisecond=1175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91564 resets, run finished after 612 ms. (steps per millisecond=1633 ) properties (out of 1) seen :0
[2023-03-10 17:12:51] [INFO ] Invariant cache hit.
[2023-03-10 17:12:51] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 17:12:51] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:51] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-10 17:12:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:51] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:51] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-10 17:12:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 17:12:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
[2023-03-10 17:12:51] [INFO ] Computed and/alt/rep : 58/291/58 causal constraints (skipped 2 transitions) in 6 ms.
[2023-03-10 17:12:51] [INFO ] Added : 34 causal constraints over 7 iterations in 79 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 64/64 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-10 17:12:51] [INFO ] Invariant cache hit.
[2023-03-10 17:12:51] [INFO ] Implicit Places using invariants in 66 ms returned [55, 61]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 67 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/64 places, 61/61 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 60
Applied a total of 2 rules in 5 ms. Remains 61 /62 variables (removed 1) and now considering 60/61 (removed 1) transitions.
// Phase 1: matrix 60 rows 61 cols
[2023-03-10 17:12:51] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 17:12:51] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-10 17:12:51] [INFO ] Invariant cache hit.
[2023-03-10 17:12:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 17:12:52] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 61/64 places, 60/61 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 323 ms. Remains : 61/64 places, 60/61 transitions.
[2023-03-10 17:12:52] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144273 resets, run finished after 1042 ms. (steps per millisecond=959 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91730 resets, run finished after 608 ms. (steps per millisecond=1644 ) properties (out of 1) seen :0
[2023-03-10 17:12:53] [INFO ] Invariant cache hit.
[2023-03-10 17:12:53] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-10 17:12:53] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:53] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-10 17:12:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:53] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:53] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-10 17:12:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 17:12:53] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2023-03-10 17:12:53] [INFO ] Computed and/alt/rep : 58/296/58 causal constraints (skipped 1 transitions) in 8 ms.
[2023-03-10 17:12:54] [INFO ] Added : 37 causal constraints over 8 iterations in 99 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 60/60 transitions.
Applied a total of 0 rules in 5 ms. Remains 61 /61 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 61/61 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-10 17:12:54] [INFO ] Invariant cache hit.
[2023-03-10 17:12:54] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-10 17:12:54] [INFO ] Invariant cache hit.
[2023-03-10 17:12:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 17:12:54] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-10 17:12:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 17:12:54] [INFO ] Invariant cache hit.
[2023-03-10 17:12:54] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 61/61 places, 60/60 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-03 in 4670 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-09
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 17:12:54] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1455 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 925 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-10 17:12:54] [INFO ] Invariant cache hit.
[2023-03-10 17:12:54] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:54] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 17:12:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:54] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-10 17:12:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 17:12:54] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:54] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-10 17:12:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 17:12:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-10 17:12:54] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 9 ms.
[2023-03-10 17:12:54] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2023-03-10 17:12:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-10 17:12:54] [INFO ] Added : 58 causal constraints over 13 iterations in 260 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 69/69 transitions.
Graph (complete) has 231 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 68
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 71 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 70 transition count 67
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 5 place count 70 transition count 65
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9 place count 68 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 67 transition count 64
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 67 transition count 60
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 19 place count 63 transition count 60
Applied a total of 19 rules in 13 ms. Remains 63 /73 variables (removed 10) and now considering 60/69 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 63/73 places, 60/69 transitions.
// Phase 1: matrix 60 rows 63 cols
[2023-03-10 17:12:54] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144567 resets, run finished after 855 ms. (steps per millisecond=1169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91428 resets, run finished after 611 ms. (steps per millisecond=1636 ) properties (out of 1) seen :0
[2023-03-10 17:12:56] [INFO ] Invariant cache hit.
[2023-03-10 17:12:56] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 17:12:56] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:56] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-10 17:12:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-10 17:12:56] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 17:12:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:56] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-10 17:12:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 17:12:56] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2023-03-10 17:12:56] [INFO ] Computed and/alt/rep : 56/295/56 causal constraints (skipped 3 transitions) in 6 ms.
[2023-03-10 17:12:56] [INFO ] Added : 54 causal constraints over 12 iterations in 132 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 63/63 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-10 17:12:56] [INFO ] Invariant cache hit.
[2023-03-10 17:12:56] [INFO ] Implicit Places using invariants in 64 ms returned [54, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/63 places, 60/60 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 59
Applied a total of 2 rules in 5 ms. Remains 60 /61 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 17:12:56] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 17:12:56] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-10 17:12:56] [INFO ] Invariant cache hit.
[2023-03-10 17:12:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 17:12:57] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 60/63 places, 59/60 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 404 ms. Remains : 60/63 places, 59/60 transitions.
[2023-03-10 17:12:57] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144426 resets, run finished after 924 ms. (steps per millisecond=1082 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91235 resets, run finished after 605 ms. (steps per millisecond=1652 ) properties (out of 1) seen :0
[2023-03-10 17:12:58] [INFO ] Invariant cache hit.
[2023-03-10 17:12:58] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-10 17:12:58] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:58] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-10 17:12:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-10 17:12:58] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-10 17:12:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:58] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-10 17:12:58] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 17:12:58] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2023-03-10 17:12:58] [INFO ] Computed and/alt/rep : 57/309/57 causal constraints (skipped 1 transitions) in 4 ms.
[2023-03-10 17:12:59] [INFO ] Added : 54 causal constraints over 12 iterations in 212 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 60/60 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2023-03-10 17:12:59] [INFO ] Invariant cache hit.
[2023-03-10 17:12:59] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-10 17:12:59] [INFO ] Invariant cache hit.
[2023-03-10 17:12:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 17:12:59] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-10 17:12:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 17:12:59] [INFO ] Invariant cache hit.
[2023-03-10 17:12:59] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 415 ms. Remains : 60/60 places, 59/59 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-09 in 5173 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-10
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 17:12:59] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1469 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 920 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-10 17:12:59] [INFO ] Invariant cache hit.
[2023-03-10 17:12:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 17:12:59] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-10 17:12:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:59] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-10 17:12:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:12:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 17:12:59] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:12:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:12:59] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-10 17:12:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 17:12:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-10 17:12:59] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 6 ms.
[2023-03-10 17:12:59] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2023-03-10 17:12:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-10 17:12:59] [INFO ] Added : 58 causal constraints over 13 iterations in 220 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 69/69 transitions.
Graph (complete) has 231 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 71 transition count 68
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 71 transition count 66
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 69 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 68 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 68 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 67 transition count 64
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 67 transition count 60
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 19 place count 63 transition count 60
Applied a total of 19 rules in 14 ms. Remains 63 /73 variables (removed 10) and now considering 60/69 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 63/73 places, 60/69 transitions.
// Phase 1: matrix 60 rows 63 cols
[2023-03-10 17:13:00] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 144175 resets, run finished after 850 ms. (steps per millisecond=1176 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91430 resets, run finished after 611 ms. (steps per millisecond=1636 ) properties (out of 1) seen :0
[2023-03-10 17:13:01] [INFO ] Invariant cache hit.
[2023-03-10 17:13:01] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 17:13:01] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 17:13:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:13:01] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-10 17:13:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:13:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 17:13:01] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:13:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:13:01] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-10 17:13:01] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-10 17:13:01] [INFO ] [Nat]Added 9 Read/Feed constraints in 7 ms returned sat
[2023-03-10 17:13:01] [INFO ] Computed and/alt/rep : 55/284/55 causal constraints (skipped 4 transitions) in 9 ms.
[2023-03-10 17:13:01] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2023-03-10 17:13:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-10 17:13:01] [INFO ] Added : 41 causal constraints over 9 iterations in 153 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 63/63 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-10 17:13:01] [INFO ] Invariant cache hit.
[2023-03-10 17:13:02] [INFO ] Implicit Places using invariants in 94 ms returned [54, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 96 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/63 places, 60/60 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 59
Applied a total of 2 rules in 8 ms. Remains 60 /61 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 17:13:02] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 17:13:02] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-10 17:13:02] [INFO ] Invariant cache hit.
[2023-03-10 17:13:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-10 17:13:02] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 60/63 places, 59/60 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 346 ms. Remains : 60/63 places, 59/60 transitions.
[2023-03-10 17:13:02] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144561 resets, run finished after 997 ms. (steps per millisecond=1003 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91333 resets, run finished after 610 ms. (steps per millisecond=1639 ) properties (out of 1) seen :0
[2023-03-10 17:13:03] [INFO ] Invariant cache hit.
[2023-03-10 17:13:03] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-10 17:13:03] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-10 17:13:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:13:03] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-10 17:13:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:13:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-10 17:13:03] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-10 17:13:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:13:04] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-10 17:13:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-10 17:13:04] [INFO ] [Nat]Added 9 Read/Feed constraints in 10 ms returned sat
[2023-03-10 17:13:04] [INFO ] Computed and/alt/rep : 55/290/55 causal constraints (skipped 3 transitions) in 7 ms.
[2023-03-10 17:13:04] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2023-03-10 17:13:04] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2023-03-10 17:13:04] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2023-03-10 17:13:04] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2023-03-10 17:13:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 207 ms
[2023-03-10 17:13:04] [INFO ] Added : 51 causal constraints over 13 iterations in 397 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 60/60 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2023-03-10 17:13:04] [INFO ] Invariant cache hit.
[2023-03-10 17:13:04] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-10 17:13:04] [INFO ] Invariant cache hit.
[2023-03-10 17:13:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-10 17:13:04] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-10 17:13:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 17:13:04] [INFO ] Invariant cache hit.
[2023-03-10 17:13:04] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 60/60 places, 59/59 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-10 in 5245 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-13
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 17:13:04] [INFO ] Computed 12 place invariants in 2 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 10000 steps, including 918 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-10 17:13:04] [INFO ] Invariant cache hit.
[2023-03-10 17:13:04] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 17:13:04] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 17:13:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:13:04] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-10 17:13:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:13:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 17:13:04] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 17:13:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:13:05] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-10 17:13:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 17:13:05] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-10 17:13:05] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 7 ms.
[2023-03-10 17:13:05] [INFO ] Added : 39 causal constraints over 8 iterations in 128 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 69/69 transitions.
Graph (complete) has 231 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 71 transition count 68
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 71 transition count 66
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 69 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 68 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 68 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 67 transition count 64
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 67 transition count 60
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 19 place count 63 transition count 60
Applied a total of 19 rules in 14 ms. Remains 63 /73 variables (removed 10) and now considering 60/69 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 63/73 places, 60/69 transitions.
// Phase 1: matrix 60 rows 63 cols
[2023-03-10 17:13:05] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 144245 resets, run finished after 858 ms. (steps per millisecond=1165 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91689 resets, run finished after 606 ms. (steps per millisecond=1650 ) properties (out of 1) seen :0
[2023-03-10 17:13:06] [INFO ] Invariant cache hit.
[2023-03-10 17:13:06] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 17:13:06] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:13:06] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-10 17:13:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:13:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 17:13:06] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-10 17:13:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:13:06] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-10 17:13:06] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-10 17:13:06] [INFO ] [Nat]Added 9 Read/Feed constraints in 7 ms returned sat
[2023-03-10 17:13:06] [INFO ] Computed and/alt/rep : 53/269/53 causal constraints (skipped 6 transitions) in 6 ms.
[2023-03-10 17:13:07] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2023-03-10 17:13:07] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2023-03-10 17:13:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2023-03-10 17:13:07] [INFO ] Added : 50 causal constraints over 10 iterations in 246 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 63/63 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-10 17:13:07] [INFO ] Invariant cache hit.
[2023-03-10 17:13:07] [INFO ] Implicit Places using invariants in 66 ms returned [53, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/63 places, 60/60 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 59
Applied a total of 2 rules in 4 ms. Remains 60 /61 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 17:13:07] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 17:13:07] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-10 17:13:07] [INFO ] Invariant cache hit.
[2023-03-10 17:13:07] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-10 17:13:07] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 60/63 places, 59/60 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 288 ms. Remains : 60/63 places, 59/60 transitions.
[2023-03-10 17:13:07] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144112 resets, run finished after 851 ms. (steps per millisecond=1175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91240 resets, run finished after 610 ms. (steps per millisecond=1639 ) properties (out of 1) seen :0
[2023-03-10 17:13:09] [INFO ] Invariant cache hit.
[2023-03-10 17:13:09] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-10 17:13:09] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-10 17:13:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:13:09] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-10 17:13:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:13:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-10 17:13:09] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-10 17:13:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:13:09] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-10 17:13:09] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-10 17:13:09] [INFO ] [Nat]Added 9 Read/Feed constraints in 5 ms returned sat
[2023-03-10 17:13:09] [INFO ] Computed and/alt/rep : 54/284/54 causal constraints (skipped 4 transitions) in 5 ms.
[2023-03-10 17:13:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2023-03-10 17:13:09] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2023-03-10 17:13:09] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 3 ms to minimize.
[2023-03-10 17:13:09] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2023-03-10 17:13:09] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 5 ms to minimize.
[2023-03-10 17:13:09] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 2 ms to minimize.
[2023-03-10 17:13:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 246 ms
[2023-03-10 17:13:09] [INFO ] Added : 48 causal constraints over 10 iterations in 362 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 60/60 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2023-03-10 17:13:09] [INFO ] Invariant cache hit.
[2023-03-10 17:13:09] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-10 17:13:09] [INFO ] Invariant cache hit.
[2023-03-10 17:13:09] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-10 17:13:09] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-10 17:13:09] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 17:13:09] [INFO ] Invariant cache hit.
[2023-03-10 17:13:09] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 323 ms. Remains : 60/60 places, 59/59 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-13 in 5041 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-14
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 17:13:09] [INFO ] Computed 12 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 1470 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 934 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-10 17:13:09] [INFO ] Invariant cache hit.
[2023-03-10 17:13:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 17:13:09] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:13:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:13:09] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-10 17:13:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:13:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 17:13:09] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:13:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:13:10] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-10 17:13:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 17:13:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-10 17:13:10] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 5 ms.
[2023-03-10 17:13:10] [INFO ] Added : 63 causal constraints over 13 iterations in 174 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 69/69 transitions.
Graph (complete) has 231 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 72 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 70 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 70 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 69 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 68 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 68 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 67 transition count 64
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 67 transition count 60
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 19 place count 63 transition count 60
Applied a total of 19 rules in 18 ms. Remains 63 /73 variables (removed 10) and now considering 60/69 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 63/73 places, 60/69 transitions.
// Phase 1: matrix 60 rows 63 cols
[2023-03-10 17:13:10] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 144436 resets, run finished after 855 ms. (steps per millisecond=1169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91142 resets, run finished after 608 ms. (steps per millisecond=1644 ) properties (out of 1) seen :0
[2023-03-10 17:13:11] [INFO ] Invariant cache hit.
[2023-03-10 17:13:11] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 17:13:11] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:13:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:13:11] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-10 17:13:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:13:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 17:13:11] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 17:13:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:13:11] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-10 17:13:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 17:13:11] [INFO ] [Nat]Added 10 Read/Feed constraints in 10 ms returned sat
[2023-03-10 17:13:11] [INFO ] Computed and/alt/rep : 55/278/55 causal constraints (skipped 4 transitions) in 5 ms.
[2023-03-10 17:13:12] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2023-03-10 17:13:12] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2023-03-10 17:13:12] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2023-03-10 17:13:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 129 ms
[2023-03-10 17:13:12] [INFO ] Added : 41 causal constraints over 9 iterations in 233 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 63/63 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-10 17:13:12] [INFO ] Invariant cache hit.
[2023-03-10 17:13:12] [INFO ] Implicit Places using invariants in 98 ms returned [54, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 99 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/63 places, 60/60 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 59
Applied a total of 2 rules in 4 ms. Remains 60 /61 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 17:13:12] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-10 17:13:12] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-10 17:13:12] [INFO ] Invariant cache hit.
[2023-03-10 17:13:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 17:13:12] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 60/63 places, 59/60 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 607 ms. Remains : 60/63 places, 59/60 transitions.
[2023-03-10 17:13:12] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144094 resets, run finished after 1059 ms. (steps per millisecond=944 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91369 resets, run finished after 606 ms. (steps per millisecond=1650 ) properties (out of 1) seen :0
[2023-03-10 17:13:14] [INFO ] Invariant cache hit.
[2023-03-10 17:13:14] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-10 17:13:14] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-10 17:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:13:14] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-10 17:13:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:13:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-10 17:13:14] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-10 17:13:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:13:14] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-10 17:13:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 17:13:14] [INFO ] [Nat]Added 10 Read/Feed constraints in 8 ms returned sat
[2023-03-10 17:13:14] [INFO ] Computed and/alt/rep : 56/293/56 causal constraints (skipped 2 transitions) in 5 ms.
[2023-03-10 17:13:14] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2023-03-10 17:13:14] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-10 17:13:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2023-03-10 17:13:14] [INFO ] Added : 56 causal constraints over 12 iterations in 261 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 60/60 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2023-03-10 17:13:14] [INFO ] Invariant cache hit.
[2023-03-10 17:13:15] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-10 17:13:15] [INFO ] Invariant cache hit.
[2023-03-10 17:13:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 17:13:15] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-10 17:13:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 17:13:15] [INFO ] Invariant cache hit.
[2023-03-10 17:13:15] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 60/60 places, 59/59 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-14 in 5430 ms.
[2023-03-10 17:13:15] [INFO ] Flatten gal took : 54 ms
[2023-03-10 17:13:15] [INFO ] Applying decomposition
[2023-03-10 17:13:15] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11606243777502882319.txt' '-o' '/tmp/graph11606243777502882319.bin' '-w' '/tmp/graph11606243777502882319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11606243777502882319.bin' '-l' '-1' '-v' '-w' '/tmp/graph11606243777502882319.weights' '-q' '0' '-e' '0.001'
[2023-03-10 17:13:15] [INFO ] Decomposing Gal with order
[2023-03-10 17:13:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 17:13:15] [INFO ] Removed a total of 33 redundant transitions.
[2023-03-10 17:13:15] [INFO ] Flatten gal took : 57 ms
[2023-03-10 17:13:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 8 ms.
[2023-03-10 17:13:15] [INFO ] Time to serialize gal into /tmp/UpperBounds2585854833929155114.gal : 7 ms
[2023-03-10 17:13:15] [INFO ] Time to serialize properties into /tmp/UpperBounds6633746478395737590.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2585854833929155114.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6633746478395737590.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds6633746478395737590.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,804813,6.08856,134092,3399,1167,261662,8093,370,169546,91,36802,0
Total reachable state count : 804813

Verifying 7 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-01 :0 <= i2.u1.p107 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-01,0,6.8767,134092,1,0,261662,8093,487,193406,105,112738,1229
Min sum of variable value : 0
Maximum sum along a path : 256
Bounds property DoubleExponent-PT-003-UpperBounds-02 :0 <= i0.i0.u10.p163 <= 256
FORMULA DoubleExponent-PT-003-UpperBounds-02 256 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-02,0,6.88164,134092,1,0,261662,8229,513,193873,360,113434,1471
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-03 :0 <= i0.i0.u4.p122 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-03,0,6.88194,134092,1,0,261662,8229,530,193878,362,113443,1494
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-09 :0 <= i0.i1.u7.p140 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-09,0,6.91896,134092,1,0,261662,8301,545,196367,362,115677,1636
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-10 :0 <= i0.i1.u8.p141 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-10,0,6.93564,134092,1,0,261662,8329,560,197201,367,116351,1914
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-13 :0 <= i4.i1.u19.p88 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-13,0,6.95422,134092,1,0,261662,8358,576,199137,367,116912,2077
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-14 :0 <= i1.u9.p155 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-14,0,7.08329,134092,1,0,261662,9141,588,210695,376,124237,2437
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 73817 ms.

BK_STOP 1678468404062

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-003"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DoubleExponent-PT-003, 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 r133-smll-167819411100461"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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