Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 6.3K Apr 29 13:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 29 13:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 50K May 10 09:33 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 1652639393088

Running Version 202205111006
[2022-05-15 18:29:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 18:29:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 18:29:54] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2022-05-15 18:29:54] [INFO ] Transformed 163 places.
[2022-05-15 18:29:54] [INFO ] Transformed 148 transitions.
[2022-05-15 18:29:54] [INFO ] Parsed PT model containing 163 places and 148 transitions in 172 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 148 rows 163 cols
[2022-05-15 18:29:54] [INFO ] Computed 19 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 336 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :10
FORMULA DoubleExponent-PT-003-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 274 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10000 steps, including 297 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10000 steps, including 272 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 286 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 285 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10000 steps, including 274 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 293 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 283 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :9
// Phase 1: matrix 148 rows 163 cols
[2022-05-15 18:29:54] [INFO ] Computed 19 place invariants in 5 ms
[2022-05-15 18:29:54] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2022-05-15 18:29:54] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2022-05-15 18:29:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:29:54] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-15 18:29:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:29:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-15 18:29:55] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2022-05-15 18:29:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:29:55] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2022-05-15 18:29:55] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-15 18:29:55] [INFO ] Added : 77 causal constraints over 16 iterations in 308 ms. Result :sat
Minimization took 75 ms.
[2022-05-15 18:29:55] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:29:55] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-15 18:29:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:29:55] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-05-15 18:29:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:29:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:29:55] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:29:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:29:55] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2022-05-15 18:29:55] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 3 ms to minimize.
[2022-05-15 18:29:55] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2022-05-15 18:29:55] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2022-05-15 18:29:55] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 1 ms to minimize.
[2022-05-15 18:29:56] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
[2022-05-15 18:29:56] [INFO ] Deduced a trap composed of 94 places in 53 ms of which 0 ms to minimize.
[2022-05-15 18:29:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 408 ms
[2022-05-15 18:29:56] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 15 ms.
[2022-05-15 18:29:56] [INFO ] Added : 108 causal constraints over 22 iterations in 362 ms. Result :sat
Minimization took 58 ms.
[2022-05-15 18:29:56] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:29:56] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:29:56] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-05-15 18:29:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:29:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:29:56] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:29:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:29:56] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-05-15 18:29:56] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-15 18:29:57] [INFO ] Added : 144 causal constraints over 29 iterations in 440 ms. Result :sat
Minimization took 53 ms.
[2022-05-15 18:29:57] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-15 18:29:57] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2022-05-15 18:29:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:29:57] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-05-15 18:29:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:29:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:29:57] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:29:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:29:57] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2022-05-15 18:29:57] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-15 18:29:57] [INFO ] Added : 108 causal constraints over 22 iterations in 358 ms. Result :sat
Minimization took 48 ms.
[2022-05-15 18:29:57] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2022-05-15 18:29:57] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-15 18:29:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:29:58] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-05-15 18:29:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:29:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:29:58] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:29:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:29:58] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2022-05-15 18:29:58] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2022-05-15 18:29:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2022-05-15 18:29:58] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-15 18:29:58] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 0 ms to minimize.
[2022-05-15 18:29:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2022-05-15 18:29:58] [INFO ] Added : 145 causal constraints over 30 iterations in 562 ms. Result :sat
Minimization took 62 ms.
[2022-05-15 18:29:58] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:29:58] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned unsat
[2022-05-15 18:29:58] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:29:58] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 1 ms returned unsat
[2022-05-15 18:29:58] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:29:58] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:29:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:29:58] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-05-15 18:29:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:29:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:29:59] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:29:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:29:59] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-05-15 18:29:59] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 0 ms to minimize.
[2022-05-15 18:29:59] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 0 ms to minimize.
[2022-05-15 18:29:59] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2022-05-15 18:29:59] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2022-05-15 18:29:59] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2022-05-15 18:29:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 317 ms
[2022-05-15 18:29:59] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-15 18:29:59] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 0 ms to minimize.
[2022-05-15 18:29:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2022-05-15 18:29:59] [INFO ] Added : 144 causal constraints over 30 iterations in 590 ms. Result :sat
Minimization took 71 ms.
[2022-05-15 18:30:00] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:30:00] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned unsat
[2022-05-15 18:30:00] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:30:00] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:00] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-05-15 18:30:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:30:00] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:30:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:00] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2022-05-15 18:30:00] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-15 18:30:00] [INFO ] Added : 114 causal constraints over 23 iterations in 324 ms. Result :sat
Minimization took 55 ms.
[2022-05-15 18:30:00] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:30:00] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 1 ms returned unsat
[2022-05-15 18:30:00] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:00] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:00] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-05-15 18:30:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:30:00] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:30:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:00] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2022-05-15 18:30:01] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 1 ms to minimize.
[2022-05-15 18:30:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2022-05-15 18:30:01] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-15 18:30:01] [INFO ] Added : 112 causal constraints over 23 iterations in 310 ms. Result :sat
Minimization took 49 ms.
[2022-05-15 18:30:01] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:30:01] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:01] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-05-15 18:30:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:01] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:30:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:01] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-05-15 18:30:01] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-15 18:30:01] [INFO ] Added : 113 causal constraints over 24 iterations in 334 ms. Result :sat
Minimization took 52 ms.
[2022-05-15 18:30:02] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:30:02] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:30:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:02] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2022-05-15 18:30:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 18:30:02] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:30:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:02] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-05-15 18:30:02] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-15 18:30:02] [INFO ] Added : 143 causal constraints over 30 iterations in 429 ms. Result :sat
Minimization took 64 ms.
[2022-05-15 18:30:02] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-15 18:30:02] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 1, 1, 1, -1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 1, 1, 4, 1, 0, 1, 0, 0, 0, 1]
FORMULA DoubleExponent-PT-003-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 163/163 places, 148/148 transitions.
Graph (complete) has 269 edges and 163 vertex of which 159 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 159 transition count 122
Reduce places removed 26 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 30 rules applied. Total rules applied 57 place count 133 transition count 118
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 61 place count 129 transition count 118
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 61 place count 129 transition count 109
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 79 place count 120 transition count 109
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 133 place count 93 transition count 82
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 141 place count 89 transition count 82
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 146 place count 89 transition count 77
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 151 place count 84 transition count 77
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 164 place count 84 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 83 transition count 76
Applied a total of 165 rules in 55 ms. Remains 83 /163 variables (removed 80) and now considering 76/148 (removed 72) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/163 places, 76/148 transitions.
// Phase 1: matrix 76 rows 83 cols
[2022-05-15 18:30:03] [INFO ] Computed 16 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 112978 resets, run finished after 873 ms. (steps per millisecond=1145 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77592 resets, run finished after 496 ms. (steps per millisecond=2016 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000001 steps, including 77747 resets, run finished after 490 ms. (steps per millisecond=2040 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000001 steps, including 77518 resets, run finished after 501 ms. (steps per millisecond=1996 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77958 resets, run finished after 503 ms. (steps per millisecond=1988 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000001 steps, including 77929 resets, run finished after 484 ms. (steps per millisecond=2066 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000001 steps, including 77474 resets, run finished after 491 ms. (steps per millisecond=2036 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77707 resets, run finished after 493 ms. (steps per millisecond=2028 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77801 resets, run finished after 495 ms. (steps per millisecond=2020 ) properties (out of 8) seen :8
// Phase 1: matrix 76 rows 83 cols
[2022-05-15 18:30:08] [INFO ] Computed 16 place invariants in 6 ms
[2022-05-15 18:30:08] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:08] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:08] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-15 18:30:08] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:30:08] [INFO ] [Real]Added 7 Read/Feed constraints in 4 ms returned sat
[2022-05-15 18:30:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:08] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:08] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-15 18:30:08] [INFO ] [Nat]Added 7 Read/Feed constraints in 9 ms returned sat
[2022-05-15 18:30:08] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2022-05-15 18:30:08] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2022-05-15 18:30:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2022-05-15 18:30:08] [INFO ] Computed and/alt/rep : 75/323/75 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 18:30:08] [INFO ] Added : 38 causal constraints over 9 iterations in 94 ms. Result :sat
Minimization took 21 ms.
[2022-05-15 18:30:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:08] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:08] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-15 18:30:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:08] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:08] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-05-15 18:30:08] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-15 18:30:08] [INFO ] Computed and/alt/rep : 75/323/75 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-15 18:30:08] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2022-05-15 18:30:09] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-15 18:30:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2022-05-15 18:30:09] [INFO ] Added : 74 causal constraints over 16 iterations in 270 ms. Result :sat
Minimization took 46 ms.
[2022-05-15 18:30:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:09] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:30:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:09] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-15 18:30:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:09] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:09] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-05-15 18:30:09] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-15 18:30:09] [INFO ] Computed and/alt/rep : 75/323/75 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 18:30:09] [INFO ] Added : 72 causal constraints over 16 iterations in 180 ms. Result :sat
Minimization took 48 ms.
[2022-05-15 18:30:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:09] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:09] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-15 18:30:09] [INFO ] [Real]Added 7 Read/Feed constraints in 11 ms returned sat
[2022-05-15 18:30:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:09] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:09] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-15 18:30:09] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2022-05-15 18:30:09] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2022-05-15 18:30:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-05-15 18:30:09] [INFO ] Computed and/alt/rep : 75/323/75 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-15 18:30:09] [INFO ] Added : 14 causal constraints over 4 iterations in 39 ms. Result :sat
Minimization took 16 ms.
[2022-05-15 18:30:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:09] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:30:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:09] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-15 18:30:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:09] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:09] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-15 18:30:09] [INFO ] [Nat]Added 7 Read/Feed constraints in 7 ms returned sat
[2022-05-15 18:30:09] [INFO ] Computed and/alt/rep : 75/323/75 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-15 18:30:10] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2022-05-15 18:30:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2022-05-15 18:30:10] [INFO ] Added : 69 causal constraints over 15 iterations in 243 ms. Result :sat
Minimization took 54 ms.
[2022-05-15 18:30:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:10] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:10] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-15 18:30:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:10] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 4 ms returned sat
[2022-05-15 18:30:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:10] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-15 18:30:10] [INFO ] [Nat]Added 7 Read/Feed constraints in 7 ms returned sat
[2022-05-15 18:30:10] [INFO ] Computed and/alt/rep : 75/323/75 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 18:30:10] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2022-05-15 18:30:10] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2022-05-15 18:30:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2022-05-15 18:30:10] [INFO ] Added : 39 causal constraints over 9 iterations in 189 ms. Result :sat
Minimization took 24 ms.
[2022-05-15 18:30:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:10] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:10] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-15 18:30:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:10] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:30:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:10] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-15 18:30:10] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2022-05-15 18:30:10] [INFO ] Computed and/alt/rep : 75/323/75 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-15 18:30:10] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2022-05-15 18:30:10] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2022-05-15 18:30:10] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2022-05-15 18:30:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 147 ms
[2022-05-15 18:30:10] [INFO ] Added : 59 causal constraints over 12 iterations in 263 ms. Result :sat
Minimization took 38 ms.
[2022-05-15 18:30:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:10] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 9 ms returned sat
[2022-05-15 18:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:10] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-15 18:30:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:10] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:10] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-15 18:30:11] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2022-05-15 18:30:11] [INFO ] Computed and/alt/rep : 75/323/75 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-15 18:30:11] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2022-05-15 18:30:11] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2022-05-15 18:30:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2022-05-15 18:30:11] [INFO ] Added : 69 causal constraints over 14 iterations in 245 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, -1, 1, 1, 1, 1] Max seen :[4, 0, 0, 4, 0, 0, 0, 0]
Support contains 8 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 76/76 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 83 cols
[2022-05-15 18:30:11] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-15 18:30:11] [INFO ] Implicit Places using invariants in 56 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 81/83 places, 76/76 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 80 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 75
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 0 with 2 rules applied. Total rules applied 4 place count 79 transition count 74
Applied a total of 4 rules in 12 ms. Remains 79 /81 variables (removed 2) and now considering 74/76 (removed 2) transitions.
// Phase 1: matrix 74 rows 79 cols
[2022-05-15 18:30:11] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:30:11] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 74 rows 79 cols
[2022-05-15 18:30:11] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:30:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:30:11] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [43, 48, 67]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 181 ms to find 3 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 76/83 places, 74/76 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 76 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 73
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 75 transition count 73
Applied a total of 3 rules in 13 ms. Remains 75 /76 variables (removed 1) and now considering 73/74 (removed 1) transitions.
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:11] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-15 18:30:11] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:11] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:30:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:30:11] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 75/83 places, 73/76 transitions.
Finished structural reductions, in 3 iterations. Remains : 75/83 places, 73/76 transitions.
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:11] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 124933 resets, run finished after 749 ms. (steps per millisecond=1335 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000001 steps, including 83365 resets, run finished after 483 ms. (steps per millisecond=2070 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000000 steps, including 83379 resets, run finished after 487 ms. (steps per millisecond=2053 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000000 steps, including 83463 resets, run finished after 484 ms. (steps per millisecond=2066 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000001 steps, including 83195 resets, run finished after 486 ms. (steps per millisecond=2057 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000001 steps, including 83124 resets, run finished after 489 ms. (steps per millisecond=2044 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000000 steps, including 83259 resets, run finished after 529 ms. (steps per millisecond=1890 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000000 steps, including 83235 resets, run finished after 505 ms. (steps per millisecond=1980 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000000 steps, including 83194 resets, run finished after 486 ms. (steps per millisecond=2057 ) properties (out of 8) seen :8
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:16] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-15 18:30:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:16] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:16] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-15 18:30:16] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:30:16] [INFO ] [Real]Added 7 Read/Feed constraints in 6 ms returned sat
[2022-05-15 18:30:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:16] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:16] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-05-15 18:30:16] [INFO ] [Nat]Added 7 Read/Feed constraints in 6 ms returned sat
[2022-05-15 18:30:16] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-15 18:30:16] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2022-05-15 18:30:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-05-15 18:30:16] [INFO ] Added : 59 causal constraints over 13 iterations in 178 ms. Result :sat
Minimization took 47 ms.
[2022-05-15 18:30:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:16] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:17] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-15 18:30:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:17] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:17] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-15 18:30:17] [INFO ] [Nat]Added 7 Read/Feed constraints in 5 ms returned sat
[2022-05-15 18:30:17] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-15 18:30:17] [INFO ] Added : 71 causal constraints over 16 iterations in 152 ms. Result :sat
Minimization took 40 ms.
[2022-05-15 18:30:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:17] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:17] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-15 18:30:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:17] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:17] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-15 18:30:17] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2022-05-15 18:30:17] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 18:30:17] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2022-05-15 18:30:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2022-05-15 18:30:17] [INFO ] Added : 69 causal constraints over 14 iterations in 192 ms. Result :sat
Minimization took 47 ms.
[2022-05-15 18:30:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:17] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:17] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-15 18:30:17] [INFO ] [Real]Added 7 Read/Feed constraints in 5 ms returned sat
[2022-05-15 18:30:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:17] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:17] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-15 18:30:17] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-15 18:30:17] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2022-05-15 18:30:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2022-05-15 18:30:17] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-15 18:30:17] [INFO ] Added : 36 causal constraints over 8 iterations in 103 ms. Result :sat
Minimization took 28 ms.
[2022-05-15 18:30:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:17] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:17] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-15 18:30:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:17] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:17] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-15 18:30:17] [INFO ] [Nat]Added 7 Read/Feed constraints in 5 ms returned sat
[2022-05-15 18:30:18] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-15 18:30:18] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2022-05-15 18:30:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-05-15 18:30:18] [INFO ] Added : 40 causal constraints over 8 iterations in 131 ms. Result :sat
Minimization took 24 ms.
[2022-05-15 18:30:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:18] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:18] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-15 18:30:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:18] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:18] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-15 18:30:18] [INFO ] [Nat]Added 7 Read/Feed constraints in 5 ms returned sat
[2022-05-15 18:30:18] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-15 18:30:18] [INFO ] Added : 40 causal constraints over 8 iterations in 72 ms. Result :sat
Minimization took 23 ms.
[2022-05-15 18:30:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:18] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:18] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-15 18:30:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:18] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:18] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-15 18:30:18] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2022-05-15 18:30:18] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-15 18:30:18] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2022-05-15 18:30:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2022-05-15 18:30:18] [INFO ] Added : 62 causal constraints over 14 iterations in 178 ms. Result :sat
Minimization took 34 ms.
[2022-05-15 18:30:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:18] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:18] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-15 18:30:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:18] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:18] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-15 18:30:18] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-15 18:30:18] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 18:30:18] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2022-05-15 18:30:18] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2022-05-15 18:30:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2022-05-15 18:30:19] [INFO ] Added : 66 causal constraints over 14 iterations in 231 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, -1, 1, 1, 1, 1] Max seen :[4, 0, 0, 4, 0, 0, 0, 0]
Support contains 8 out of 75 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 75/75 places, 73/73 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 73/73 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 75/75 places, 73/73 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:19] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-15 18:30:19] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:19] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 18:30:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:30:19] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2022-05-15 18:30:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:19] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-15 18:30:19] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 73/73 transitions.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-00
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:19] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1276 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 820 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :4
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:19] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 18:30:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:19] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:19] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-15 18:30:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:30:19] [INFO ] [Real]Added 7 Read/Feed constraints in 6 ms returned sat
[2022-05-15 18:30:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:19] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2022-05-15 18:30:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:19] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-15 18:30:19] [INFO ] [Nat]Added 7 Read/Feed constraints in 6 ms returned sat
[2022-05-15 18:30:19] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-15 18:30:19] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2022-05-15 18:30:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2022-05-15 18:30:19] [INFO ] Added : 59 causal constraints over 13 iterations in 171 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 75/75 places, 73/73 transitions.
Graph (complete) has 227 edges and 75 vertex of which 73 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 3 place count 73 transition count 70
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 5 place count 72 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 71 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 71 transition count 68
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 8 place count 70 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 12 place count 68 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 14 place count 67 transition count 66
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 67 transition count 62
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 22 place count 63 transition count 62
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 25 place count 63 transition count 62
Applied a total of 25 rules in 17 ms. Remains 63 /75 variables (removed 12) and now considering 62/73 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/75 places, 62/73 transitions.
// Phase 1: matrix 62 rows 63 cols
[2022-05-15 18:30:19] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 156012 resets, run finished after 616 ms. (steps per millisecond=1623 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 95599 resets, run finished after 446 ms. (steps per millisecond=2242 ) properties (out of 1) seen :4
// Phase 1: matrix 62 rows 63 cols
[2022-05-15 18:30:20] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-15 18:30:20] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:20] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:20] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-15 18:30:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:21] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:21] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-15 18:30:21] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-15 18:30:21] [INFO ] [Nat]Added 11 Read/Feed constraints in 7 ms returned sat
[2022-05-15 18:30:21] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2022-05-15 18:30:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-05-15 18:30:21] [INFO ] Computed and/alt/rep : 56/302/56 causal constraints (skipped 5 transitions) in 5 ms.
[2022-05-15 18:30:21] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2022-05-15 18:30:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2022-05-15 18:30:21] [INFO ] Added : 28 causal constraints over 6 iterations in 102 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 62/62 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 62/62 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 62/62 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 63 cols
[2022-05-15 18:30:21] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:30:21] [INFO ] Implicit Places using invariants in 53 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 62/63 places, 62/62 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 61
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 61
Applied a total of 2 rules in 5 ms. Remains 61 /62 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 61 cols
[2022-05-15 18:30:21] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:21] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 61 rows 61 cols
[2022-05-15 18:30:21] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:21] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-15 18:30:21] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 61/63 places, 61/62 transitions.
Finished structural reductions, in 2 iterations. Remains : 61/63 places, 61/62 transitions.
// Phase 1: matrix 61 rows 61 cols
[2022-05-15 18:30:21] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156336 resets, run finished after 600 ms. (steps per millisecond=1666 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 96054 resets, run finished after 443 ms. (steps per millisecond=2257 ) properties (out of 1) seen :4
// Phase 1: matrix 61 rows 61 cols
[2022-05-15 18:30:22] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:22] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:22] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-15 18:30:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:22] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:22] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-15 18:30:22] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-15 18:30:22] [INFO ] [Nat]Added 11 Read/Feed constraints in 7 ms returned sat
[2022-05-15 18:30:22] [INFO ] Computed and/alt/rep : 55/300/55 causal constraints (skipped 5 transitions) in 4 ms.
[2022-05-15 18:30:22] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2022-05-15 18:30:22] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2022-05-15 18:30:22] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2022-05-15 18:30:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 124 ms
[2022-05-15 18:30:22] [INFO ] Added : 44 causal constraints over 10 iterations in 210 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 61 cols
[2022-05-15 18:30:22] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 18:30:22] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 61 rows 61 cols
[2022-05-15 18:30:22] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 18:30:22] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-15 18:30:23] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2022-05-15 18:30:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 61 cols
[2022-05-15 18:30:23] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:23] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 61/61 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-00 in 3646 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-02
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:23] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1260 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:23] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:30:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:23] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-15 18:30:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:23] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:23] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-15 18:30:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:30:23] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2022-05-15 18:30:23] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 18:30:23] [INFO ] Added : 71 causal constraints over 16 iterations in 147 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 75/75 places, 73/73 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 75 transition count 70
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 72 transition count 70
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 69 transition count 67
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 16 place count 67 transition count 67
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 67 transition count 63
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 63 transition count 63
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 63 transition count 63
Applied a total of 26 rules in 17 ms. Remains 63 /75 variables (removed 12) and now considering 63/73 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/75 places, 63/73 transitions.
// Phase 1: matrix 63 rows 63 cols
[2022-05-15 18:30:23] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 156268 resets, run finished after 638 ms. (steps per millisecond=1567 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95930 resets, run finished after 445 ms. (steps per millisecond=2247 ) properties (out of 1) seen :0
// Phase 1: matrix 63 rows 63 cols
[2022-05-15 18:30:24] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-15 18:30:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:24] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:24] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-15 18:30:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:24] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:24] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-15 18:30:24] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-15 18:30:24] [INFO ] [Nat]Added 14 Read/Feed constraints in 5 ms returned sat
[2022-05-15 18:30:24] [INFO ] Computed and/alt/rep : 58/345/58 causal constraints (skipped 4 transitions) in 7 ms.
[2022-05-15 18:30:24] [INFO ] Added : 48 causal constraints over 10 iterations in 100 ms. Result :sat
Minimization took 37 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 SAFETY mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 63/63 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2022-05-15 18:30:24] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 18:30:24] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 63 rows 63 cols
[2022-05-15 18:30:24] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:30:24] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-15 18:30:24] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 153 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 62/63 places, 63/63 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 62
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 62
Applied a total of 2 rules in 6 ms. Remains 61 /62 variables (removed 1) and now considering 62/63 (removed 1) transitions.
// Phase 1: matrix 62 rows 61 cols
[2022-05-15 18:30:25] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-15 18:30:25] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 62 rows 61 cols
[2022-05-15 18:30:25] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:25] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-15 18:30:25] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 61/63 places, 62/63 transitions.
Finished structural reductions, in 2 iterations. Remains : 61/63 places, 62/63 transitions.
// Phase 1: matrix 62 rows 61 cols
[2022-05-15 18:30:25] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156194 resets, run finished after 627 ms. (steps per millisecond=1594 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96198 resets, run finished after 451 ms. (steps per millisecond=2217 ) properties (out of 1) seen :0
// Phase 1: matrix 62 rows 61 cols
[2022-05-15 18:30:26] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:26] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:26] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-15 18:30:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:26] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:26] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-15 18:30:26] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-15 18:30:26] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2022-05-15 18:30:26] [INFO ] Computed and/alt/rep : 57/342/57 causal constraints (skipped 4 transitions) in 5 ms.
[2022-05-15 18:30:26] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2022-05-15 18:30:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-05-15 18:30:26] [INFO ] Added : 54 causal constraints over 13 iterations in 222 ms. Result :sat
Minimization took 41 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 SAFETY mode, iteration 0 : 61/61 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 62/62 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 61 cols
[2022-05-15 18:30:26] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 18:30:26] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 62 rows 61 cols
[2022-05-15 18:30:26] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:26] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-15 18:30:26] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2022-05-15 18:30:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 61 cols
[2022-05-15 18:30:26] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:26] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 62/62 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-02 in 3703 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-04
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:26] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1259 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:26] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:30:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:26] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2022-05-15 18:30:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:26] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-15 18:30:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:26] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:26] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-15 18:30:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:30:26] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2022-05-15 18:30:26] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 18:30:27] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2022-05-15 18:30:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2022-05-15 18:30:27] [INFO ] Added : 69 causal constraints over 14 iterations in 187 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 75/75 places, 73/73 transitions.
Graph (complete) has 227 edges and 75 vertex of which 73 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 73 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 70 transition count 68
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 70 transition count 67
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 10 place count 69 transition count 67
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 12 place count 68 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 16 place count 66 transition count 66
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 66 transition count 62
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 62 transition count 62
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 27 place count 62 transition count 62
Applied a total of 27 rules in 15 ms. Remains 62 /75 variables (removed 13) and now considering 62/73 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/75 places, 62/73 transitions.
// Phase 1: matrix 62 rows 62 cols
[2022-05-15 18:30:27] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 156349 resets, run finished after 634 ms. (steps per millisecond=1577 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96027 resets, run finished after 458 ms. (steps per millisecond=2183 ) properties (out of 1) seen :0
// Phase 1: matrix 62 rows 62 cols
[2022-05-15 18:30:28] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:30:28] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-15 18:30:28] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-15 18:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:28] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-15 18:30:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:28] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:28] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-15 18:30:28] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-15 18:30:28] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2022-05-15 18:30:28] [INFO ] Computed and/alt/rep : 56/324/56 causal constraints (skipped 5 transitions) in 4 ms.
[2022-05-15 18:30:28] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2022-05-15 18:30:28] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2022-05-15 18:30:28] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2022-05-15 18:30:28] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2022-05-15 18:30:28] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2022-05-15 18:30:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 219 ms
[2022-05-15 18:30:28] [INFO ] Added : 55 causal constraints over 14 iterations in 358 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 62/62 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 62 cols
[2022-05-15 18:30:28] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 18:30:28] [INFO ] Implicit Places using invariants in 51 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 61/62 places, 62/62 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 61
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 61
Applied a total of 2 rules in 4 ms. Remains 60 /61 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 60 cols
[2022-05-15 18:30:28] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:28] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 61 rows 60 cols
[2022-05-15 18:30:28] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 18:30:28] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-15 18:30:29] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 60/62 places, 61/62 transitions.
Finished structural reductions, in 2 iterations. Remains : 60/62 places, 61/62 transitions.
// Phase 1: matrix 61 rows 60 cols
[2022-05-15 18:30:29] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156405 resets, run finished after 621 ms. (steps per millisecond=1610 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95786 resets, run finished after 448 ms. (steps per millisecond=2232 ) properties (out of 1) seen :0
// Phase 1: matrix 61 rows 60 cols
[2022-05-15 18:30:30] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 18:30:30] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:30] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-15 18:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:30] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-15 18:30:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:30] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-15 18:30:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:30] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-15 18:30:30] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-15 18:30:30] [INFO ] [Nat]Added 14 Read/Feed constraints in 8 ms returned sat
[2022-05-15 18:30:30] [INFO ] Computed and/alt/rep : 55/322/55 causal constraints (skipped 5 transitions) in 4 ms.
[2022-05-15 18:30:30] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2022-05-15 18:30:30] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2022-05-15 18:30:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2022-05-15 18:30:30] [INFO ] Added : 42 causal constraints over 9 iterations in 168 ms. Result :sat
Minimization took 29 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 SAFETY mode, iteration 0 : 60/60 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 61/61 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 60 cols
[2022-05-15 18:30:30] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 18:30:30] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 61 rows 60 cols
[2022-05-15 18:30:30] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:30] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-15 18:30:30] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2022-05-15 18:30:30] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 60 cols
[2022-05-15 18:30:30] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 18:30:30] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 61/61 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-04 in 3832 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-07
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:30] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1224 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 859 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :4
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:30] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 18:30:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:30] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:30] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-15 18:30:30] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:30:30] [INFO ] [Real]Added 7 Read/Feed constraints in 6 ms returned sat
[2022-05-15 18:30:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:30] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:30] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-15 18:30:30] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-15 18:30:30] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
[2022-05-15 18:30:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2022-05-15 18:30:30] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-15 18:30:30] [INFO ] Added : 36 causal constraints over 8 iterations in 105 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 75/75 places, 73/73 transitions.
Graph (complete) has 227 edges and 75 vertex of which 73 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 rules applied. Total rules applied 4 place count 73 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 71 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 71 transition count 68
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 70 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 12 place count 68 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 14 place count 67 transition count 66
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 67 transition count 62
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 22 place count 63 transition count 62
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 63 transition count 62
Applied a total of 25 rules in 14 ms. Remains 63 /75 variables (removed 12) and now considering 62/73 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/75 places, 62/73 transitions.
// Phase 1: matrix 62 rows 63 cols
[2022-05-15 18:30:30] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 124912 resets, run finished after 598 ms. (steps per millisecond=1672 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 83508 resets, run finished after 441 ms. (steps per millisecond=2267 ) properties (out of 1) seen :4
// Phase 1: matrix 62 rows 63 cols
[2022-05-15 18:30:32] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:30:32] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:32] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-15 18:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:32] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-15 18:30:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:32] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:32] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-15 18:30:32] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-15 18:30:32] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2022-05-15 18:30:32] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2022-05-15 18:30:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-05-15 18:30:32] [INFO ] Computed and/alt/rep : 56/302/56 causal constraints (skipped 5 transitions) in 6 ms.
[2022-05-15 18:30:32] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2022-05-15 18:30:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-15 18:30:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2022-05-15 18:30:32] [INFO ] Added : 18 causal constraints over 5 iterations in 152 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 62/62 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 63 cols
[2022-05-15 18:30:32] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:30:32] [INFO ] Implicit Places using invariants in 50 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 62/63 places, 62/62 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 61
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 61
Applied a total of 2 rules in 3 ms. Remains 61 /62 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 61 cols
[2022-05-15 18:30:32] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:32] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 61 rows 61 cols
[2022-05-15 18:30:32] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:32] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-15 18:30:32] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 61/63 places, 61/62 transitions.
Finished structural reductions, in 2 iterations. Remains : 61/63 places, 61/62 transitions.
// Phase 1: matrix 61 rows 61 cols
[2022-05-15 18:30:32] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 125060 resets, run finished after 590 ms. (steps per millisecond=1694 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 83428 resets, run finished after 441 ms. (steps per millisecond=2267 ) properties (out of 1) seen :4
// Phase 1: matrix 61 rows 61 cols
[2022-05-15 18:30:33] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 18:30:33] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:33] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-15 18:30:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:33] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-15 18:30:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:33] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-15 18:30:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:33] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-15 18:30:33] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-15 18:30:33] [INFO ] [Nat]Added 11 Read/Feed constraints in 1 ms returned sat
[2022-05-15 18:30:33] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2022-05-15 18:30:33] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2022-05-15 18:30:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
[2022-05-15 18:30:33] [INFO ] Computed and/alt/rep : 55/300/55 causal constraints (skipped 5 transitions) in 3 ms.
[2022-05-15 18:30:33] [INFO ] Added : 13 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 61 cols
[2022-05-15 18:30:33] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 18:30:33] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 61 rows 61 cols
[2022-05-15 18:30:33] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:33] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-15 18:30:33] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2022-05-15 18:30:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 61 cols
[2022-05-15 18:30:33] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 18:30:34] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 61/61 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-07 in 3380 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-10
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:34] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1262 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 825 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:34] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-15 18:30:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:34] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:34] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-15 18:30:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:34] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:34] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-15 18:30:34] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:30:34] [INFO ] [Nat]Added 7 Read/Feed constraints in 6 ms returned sat
[2022-05-15 18:30:34] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-15 18:30:34] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2022-05-15 18:30:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-05-15 18:30:34] [INFO ] Added : 40 causal constraints over 8 iterations in 122 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 75/75 places, 73/73 transitions.
Graph (complete) has 227 edges and 75 vertex of which 73 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 rules applied. Total rules applied 4 place count 73 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 71 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 71 transition count 68
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 70 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 12 place count 68 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 16 place count 66 transition count 66
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 66 transition count 62
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 62 transition count 62
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 27 place count 62 transition count 62
Applied a total of 27 rules in 6 ms. Remains 62 /75 variables (removed 13) and now considering 62/73 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/75 places, 62/73 transitions.
// Phase 1: matrix 62 rows 62 cols
[2022-05-15 18:30:34] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 156650 resets, run finished after 644 ms. (steps per millisecond=1552 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95955 resets, run finished after 456 ms. (steps per millisecond=2192 ) properties (out of 1) seen :0
// Phase 1: matrix 62 rows 62 cols
[2022-05-15 18:30:35] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-15 18:30:35] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:35] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:35] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-15 18:30:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:35] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-15 18:30:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:35] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-15 18:30:35] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-15 18:30:35] [INFO ] [Nat]Added 14 Read/Feed constraints in 9 ms returned sat
[2022-05-15 18:30:35] [INFO ] Computed and/alt/rep : 56/329/56 causal constraints (skipped 5 transitions) in 3 ms.
[2022-05-15 18:30:35] [INFO ] Added : 35 causal constraints over 7 iterations in 60 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 62/62 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 62 cols
[2022-05-15 18:30:35] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 18:30:35] [INFO ] Implicit Places using invariants in 53 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 61/62 places, 62/62 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 61
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 61
Applied a total of 2 rules in 3 ms. Remains 60 /61 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 60 cols
[2022-05-15 18:30:35] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-15 18:30:35] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 61 rows 60 cols
[2022-05-15 18:30:35] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:35] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-15 18:30:35] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 60/62 places, 61/62 transitions.
Finished structural reductions, in 2 iterations. Remains : 60/62 places, 61/62 transitions.
// Phase 1: matrix 61 rows 60 cols
[2022-05-15 18:30:35] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 156194 resets, run finished after 637 ms. (steps per millisecond=1569 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96065 resets, run finished after 450 ms. (steps per millisecond=2222 ) properties (out of 1) seen :0
// Phase 1: matrix 61 rows 60 cols
[2022-05-15 18:30:36] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 18:30:36] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:36] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:36] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-15 18:30:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:37] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-15 18:30:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:37] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-15 18:30:37] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-15 18:30:37] [INFO ] [Nat]Added 14 Read/Feed constraints in 8 ms returned sat
[2022-05-15 18:30:37] [INFO ] Computed and/alt/rep : 55/327/55 causal constraints (skipped 5 transitions) in 3 ms.
[2022-05-15 18:30:37] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2022-05-15 18:30:37] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2022-05-15 18:30:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2022-05-15 18:30:37] [INFO ] Added : 36 causal constraints over 9 iterations in 174 ms. Result :sat
Minimization took 28 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 SAFETY mode, iteration 0 : 60/60 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 61/61 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 60 cols
[2022-05-15 18:30:37] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 18:30:37] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 61 rows 60 cols
[2022-05-15 18:30:37] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:37] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-15 18:30:37] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2022-05-15 18:30:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 60 cols
[2022-05-15 18:30:37] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:37] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 61/61 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-10 in 3472 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-12
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:37] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1269 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:37] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:30:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:37] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:37] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-15 18:30:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:37] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:37] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-15 18:30:37] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:30:37] [INFO ] [Nat]Added 7 Read/Feed constraints in 6 ms returned sat
[2022-05-15 18:30:37] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-15 18:30:37] [INFO ] Added : 40 causal constraints over 8 iterations in 68 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 75/75 places, 73/73 transitions.
Graph (complete) has 227 edges and 75 vertex of which 73 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 73 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 70 transition count 68
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 70 transition count 67
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 10 place count 69 transition count 67
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 12 place count 68 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 16 place count 66 transition count 66
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 66 transition count 62
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 62 transition count 62
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 62 transition count 62
Applied a total of 26 rules in 5 ms. Remains 62 /75 variables (removed 13) and now considering 62/73 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/75 places, 62/73 transitions.
// Phase 1: matrix 62 rows 62 cols
[2022-05-15 18:30:37] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 156215 resets, run finished after 651 ms. (steps per millisecond=1536 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96057 resets, run finished after 449 ms. (steps per millisecond=2227 ) properties (out of 1) seen :0
// Phase 1: matrix 62 rows 62 cols
[2022-05-15 18:30:38] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-15 18:30:38] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:38] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-15 18:30:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:38] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-15 18:30:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:38] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:38] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-15 18:30:38] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-15 18:30:38] [INFO ] [Nat]Added 13 Read/Feed constraints in 6 ms returned sat
[2022-05-15 18:30:39] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2022-05-15 18:30:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2022-05-15 18:30:39] [INFO ] Computed and/alt/rep : 57/333/57 causal constraints (skipped 4 transitions) in 4 ms.
[2022-05-15 18:30:39] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2022-05-15 18:30:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2022-05-15 18:30:39] [INFO ] Added : 48 causal constraints over 10 iterations in 146 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 62/62 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 62 cols
[2022-05-15 18:30:39] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 18:30:39] [INFO ] Implicit Places using invariants in 47 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 61/62 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 61/62 places, 62/62 transitions.
// Phase 1: matrix 62 rows 61 cols
[2022-05-15 18:30:39] [INFO ] Computed 10 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 156135 resets, run finished after 638 ms. (steps per millisecond=1567 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96126 resets, run finished after 454 ms. (steps per millisecond=2202 ) properties (out of 1) seen :0
// Phase 1: matrix 62 rows 61 cols
[2022-05-15 18:30:40] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 18:30:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:40] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:40] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-15 18:30:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:40] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:40] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-15 18:30:40] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-15 18:30:40] [INFO ] [Nat]Added 13 Read/Feed constraints in 6 ms returned sat
[2022-05-15 18:30:40] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2022-05-15 18:30:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2022-05-15 18:30:40] [INFO ] Computed and/alt/rep : 57/332/57 causal constraints (skipped 4 transitions) in 3 ms.
[2022-05-15 18:30:40] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2022-05-15 18:30:40] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2022-05-15 18:30:40] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2022-05-15 18:30:40] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2022-05-15 18:30:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 168 ms
[2022-05-15 18:30:40] [INFO ] Added : 46 causal constraints over 10 iterations in 259 ms. Result :sat
Minimization took 31 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 SAFETY mode, iteration 0 : 61/61 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 62/62 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 61 cols
[2022-05-15 18:30:40] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 18:30:40] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 62 rows 61 cols
[2022-05-15 18:30:40] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:40] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-15 18:30:40] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2022-05-15 18:30:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 61 cols
[2022-05-15 18:30:40] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 18:30:41] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 62/62 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-12 in 3516 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-13
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:41] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1242 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:41] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:30:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:41] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:41] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-15 18:30:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:41] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:41] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-15 18:30:41] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:30:41] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2022-05-15 18:30:41] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 18:30:41] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2022-05-15 18:30:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2022-05-15 18:30:41] [INFO ] Added : 62 causal constraints over 14 iterations in 171 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 75/75 places, 73/73 transitions.
Graph (complete) has 227 edges and 75 vertex of which 73 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 73 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 70 transition count 68
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 70 transition count 67
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 10 place count 69 transition count 67
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 67 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 18 place count 65 transition count 65
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 65 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 63 transition count 63
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 63 transition count 63
Applied a total of 24 rules in 8 ms. Remains 63 /75 variables (removed 12) and now considering 63/73 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/75 places, 63/73 transitions.
// Phase 1: matrix 63 rows 63 cols
[2022-05-15 18:30:41] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156488 resets, run finished after 629 ms. (steps per millisecond=1589 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95985 resets, run finished after 444 ms. (steps per millisecond=2252 ) properties (out of 1) seen :0
// Phase 1: matrix 63 rows 63 cols
[2022-05-15 18:30:42] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 18:30:42] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:42] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:42] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-15 18:30:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:42] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:42] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-15 18:30:42] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-15 18:30:42] [INFO ] [Nat]Added 14 Read/Feed constraints in 3 ms returned sat
[2022-05-15 18:30:42] [INFO ] Computed and/alt/rep : 59/341/59 causal constraints (skipped 3 transitions) in 4 ms.
[2022-05-15 18:30:42] [INFO ] Added : 34 causal constraints over 7 iterations in 64 ms. Result :sat
Minimization took 26 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 SAFETY mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 63/63 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2022-05-15 18:30:42] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:30:42] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 63 rows 63 cols
[2022-05-15 18:30:42] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:30:42] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-15 18:30:42] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2022-05-15 18:30:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 63 cols
[2022-05-15 18:30:42] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 18:30:42] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 63/63 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-13 in 1903 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-14
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:42] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1263 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 826 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 73 rows 75 cols
[2022-05-15 18:30:42] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 18:30:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:42] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:42] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-15 18:30:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:43] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:43] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-15 18:30:43] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:30:43] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-15 18:30:43] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 18:30:43] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2022-05-15 18:30:43] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2022-05-15 18:30:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2022-05-15 18:30:43] [INFO ] Added : 66 causal constraints over 14 iterations in 243 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 75/75 places, 73/73 transitions.
Graph (complete) has 227 edges and 75 vertex of which 73 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 73 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 70 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 12 place count 68 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 16 place count 66 transition count 66
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 66 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 64 transition count 64
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 64 transition count 64
Applied a total of 23 rules in 6 ms. Remains 64 /75 variables (removed 11) and now considering 64/73 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/75 places, 64/73 transitions.
// Phase 1: matrix 64 rows 64 cols
[2022-05-15 18:30:43] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 156210 resets, run finished after 621 ms. (steps per millisecond=1610 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96179 resets, run finished after 447 ms. (steps per millisecond=2237 ) properties (out of 1) seen :0
// Phase 1: matrix 64 rows 64 cols
[2022-05-15 18:30:44] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-15 18:30:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:44] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:44] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-15 18:30:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-15 18:30:44] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:44] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-15 18:30:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-15 18:30:44] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2022-05-15 18:30:44] [INFO ] Computed and/alt/rep : 59/341/59 causal constraints (skipped 4 transitions) in 3 ms.
[2022-05-15 18:30:44] [INFO ] Added : 45 causal constraints over 9 iterations in 92 ms. Result :sat
Minimization took 33 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 SAFETY mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 64/64 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 64 cols
[2022-05-15 18:30:44] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-15 18:30:44] [INFO ] Implicit Places using invariants in 55 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 63/64 places, 64/64 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 63
Applied a total of 2 rules in 2 ms. Remains 62 /63 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 62 cols
[2022-05-15 18:30:44] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-15 18:30:44] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 63 rows 62 cols
[2022-05-15 18:30:44] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-15 18:30:44] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 62/64 places, 63/64 transitions.
Finished structural reductions, in 2 iterations. Remains : 62/64 places, 63/64 transitions.
// Phase 1: matrix 63 rows 62 cols
[2022-05-15 18:30:44] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156380 resets, run finished after 629 ms. (steps per millisecond=1589 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96237 resets, run finished after 436 ms. (steps per millisecond=2293 ) properties (out of 1) seen :0
// Phase 1: matrix 63 rows 62 cols
[2022-05-15 18:30:45] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-15 18:30:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:45] [INFO ] [Real]Absence check using 3 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-15 18:30:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:46] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-15 18:30:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:30:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 18:30:46] [INFO ] [Nat]Absence check using 3 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-15 18:30:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:30:46] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-15 18:30:46] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-15 18:30:46] [INFO ] [Nat]Added 14 Read/Feed constraints in 5 ms returned sat
[2022-05-15 18:30:46] [INFO ] Computed and/alt/rep : 58/339/58 causal constraints (skipped 4 transitions) in 3 ms.
[2022-05-15 18:30:46] [INFO ] Added : 55 causal constraints over 12 iterations in 118 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 63/63 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2022-05-15 18:30:46] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:46] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 63 rows 62 cols
[2022-05-15 18:30:46] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 18:30:46] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-15 18:30:46] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2022-05-15 18:30:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 62 cols
[2022-05-15 18:30:46] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-15 18:30:46] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 63/63 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-14 in 3598 ms.
[2022-05-15 18:30:46] [INFO ] Flatten gal took : 54 ms
[2022-05-15 18:30:46] [INFO ] Applying decomposition
[2022-05-15 18:30:46] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16009528377046661030.txt' '-o' '/tmp/graph16009528377046661030.bin' '-w' '/tmp/graph16009528377046661030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16009528377046661030.bin' '-l' '-1' '-v' '-w' '/tmp/graph16009528377046661030.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:30:46] [INFO ] Decomposing Gal with order
[2022-05-15 18:30:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:30:46] [INFO ] Removed a total of 21 redundant transitions.
[2022-05-15 18:30:46] [INFO ] Flatten gal took : 86 ms
[2022-05-15 18:30:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 15 ms.
[2022-05-15 18:30:47] [INFO ] Time to serialize gal into /tmp/UpperBounds2286861758491957399.gal : 18 ms
[2022-05-15 18:30:47] [INFO ] Time to serialize properties into /tmp/UpperBounds7874721179469799447.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2286861758491957399.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7874721179469799447.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds7874721179469799447.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,777417,1.51712,49692,1197,826,91288,2725,349,71733,121,10193,0
Total reachable state count : 777417

Verifying 8 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 16
Bounds property DoubleExponent-PT-003-UpperBounds-00 :0 <= i0.i1.u5.p108 <= 16
FORMULA DoubleExponent-PT-003-UpperBounds-00 16 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-00,0,1.56058,49692,1,0,91288,3334,442,71733,154,16181,884
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-02 :0 <= i0.i0.u6.p149 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-02 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-02,0,1.57015,49692,1,0,91288,4056,461,71733,159,20601,1006
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-04 :0 <= i2.u8.p156 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-04 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-04,0,1.57373,49692,1,0,91288,4162,478,71733,163,20949,1093
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DoubleExponent-PT-003-UpperBounds-07 :0 <= i1.u14.p55 <= 4
FORMULA DoubleExponent-PT-003-UpperBounds-07 4 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-07,0,1.5921,49692,1,0,91288,4928,495,71733,177,25353,1328
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-10 :0 <= i0.i1.u3.p115 <= 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,1.59251,49692,1,0,91288,4928,509,71733,177,25353,1474
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-12 :0 <= i5.u15.p93 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-12 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-12,0,1.59374,49692,1,0,91288,4976,525,71733,177,25527,1607
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-13 :0 <= i1.u12.p96 <= 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,1.59406,49692,1,0,91288,4979,542,71733,184,25541,1715
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-14 :0 <= i0.i1.u4.p137 <= 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,1.59454,49692,1,0,91288,4979,558,71733,184,25541,1824
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 54415 ms.

BK_STOP 1652639448774

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-4028"
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 r078-tall-165260110000181"
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 ;