Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 129K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 18:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 18:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 33K May 5 16:51 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-002-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620583276094

Running Version 0
[2021-05-09 18:01:17] [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]
[2021-05-09 18:01:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 18:01:17] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2021-05-09 18:01:17] [INFO ] Transformed 110 places.
[2021-05-09 18:01:17] [INFO ] Transformed 98 transitions.
[2021-05-09 18:01:17] [INFO ] Parsed PT model containing 110 places and 98 transitions in 73 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 98 rows 110 cols
[2021-05-09 18:01:17] [INFO ] Computed 14 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 336 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :14
FORMULA DoubleExponent-PT-002-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 296 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10000 steps, including 299 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :9
// Phase 1: matrix 98 rows 110 cols
[2021-05-09 18:01:18] [INFO ] Computed 14 place invariants in 15 ms
[2021-05-09 18:01:18] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-09 18:01:18] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-09 18:01:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:18] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-09 18:01:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:01:18] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-09 18:01:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:18] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2021-05-09 18:01:18] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
[2021-05-09 18:01:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2021-05-09 18:01:18] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-09 18:01:18] [INFO ] Added : 87 causal constraints over 18 iterations in 203 ms. Result :sat
Minimization took 38 ms.
[2021-05-09 18:01:18] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:01:18] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:18] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-09 18:01:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:01:18] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:18] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-09 18:01:18] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2021-05-09 18:01:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2021-05-09 18:01:18] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:01:19] [INFO ] Added : 67 causal constraints over 14 iterations in 163 ms. Result :sat
Minimization took 31 ms.
[2021-05-09 18:01:19] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 18:01:19] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-09 18:01:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:19] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-09 18:01:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:01:19] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:19] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2021-05-09 18:01:19] [INFO ] Deduced a trap composed of 30 places in 16 ms of which 0 ms to minimize.
[2021-05-09 18:01:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2021-05-09 18:01:19] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 17 ms.
[2021-05-09 18:01:19] [INFO ] Added : 86 causal constraints over 18 iterations in 184 ms. Result :sat
Minimization took 28 ms.
[2021-05-09 18:01:19] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:01:19] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned unsat
[2021-05-09 18:01:19] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 18:01:19] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:19] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2021-05-09 18:01:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 18:01:19] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:19] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-09 18:01:19] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
[2021-05-09 18:01:19] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2021-05-09 18:01:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
[2021-05-09 18:01:19] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-09 18:01:19] [INFO ] Added : 66 causal constraints over 14 iterations in 119 ms. Result :sat
Minimization took 22 ms.
[2021-05-09 18:01:19] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-09 18:01:19] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 8 ms returned sat
[2021-05-09 18:01:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:19] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-09 18:01:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 18:01:19] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:20] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-09 18:01:20] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2021-05-09 18:01:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2021-05-09 18:01:20] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-09 18:01:20] [INFO ] Added : 86 causal constraints over 18 iterations in 162 ms. Result :sat
Minimization took 29 ms.
[2021-05-09 18:01:20] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 18:01:20] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:20] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-09 18:01:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:01:20] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:20] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-09 18:01:20] [INFO ] Deduced a trap composed of 30 places in 14 ms of which 0 ms to minimize.
[2021-05-09 18:01:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2021-05-09 18:01:20] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-09 18:01:20] [INFO ] Added : 90 causal constraints over 18 iterations in 148 ms. Result :sat
Minimization took 33 ms.
[2021-05-09 18:01:20] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 18:01:20] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:20] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-09 18:01:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 18:01:20] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:20] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2021-05-09 18:01:20] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2021-05-09 18:01:20] [INFO ] Deduced a trap composed of 33 places in 24 ms of which 0 ms to minimize.
[2021-05-09 18:01:20] [INFO ] Deduced a trap composed of 45 places in 25 ms of which 0 ms to minimize.
[2021-05-09 18:01:20] [INFO ] Deduced a trap composed of 70 places in 25 ms of which 0 ms to minimize.
[2021-05-09 18:01:20] [INFO ] Deduced a trap composed of 44 places in 24 ms of which 0 ms to minimize.
[2021-05-09 18:01:20] [INFO ] Deduced a trap composed of 30 places in 14 ms of which 1 ms to minimize.
[2021-05-09 18:01:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 171 ms
[2021-05-09 18:01:20] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-09 18:01:21] [INFO ] Deduced a trap composed of 16 places in 13 ms of which 0 ms to minimize.
[2021-05-09 18:01:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2021-05-09 18:01:21] [INFO ] Added : 93 causal constraints over 19 iterations in 198 ms. Result :sat
Minimization took 33 ms.
[2021-05-09 18:01:21] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 18:01:21] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:21] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-09 18:01:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 18:01:21] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:21] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-09 18:01:21] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2021-05-09 18:01:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2021-05-09 18:01:21] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-09 18:01:21] [INFO ] Added : 67 causal constraints over 14 iterations in 137 ms. Result :sat
Minimization took 32 ms.
[2021-05-09 18:01:21] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:01:21] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:21] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-09 18:01:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 18:01:21] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:21] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-09 18:01:21] [INFO ] Deduced a trap composed of 48 places in 23 ms of which 1 ms to minimize.
[2021-05-09 18:01:21] [INFO ] Deduced a trap composed of 38 places in 24 ms of which 1 ms to minimize.
[2021-05-09 18:01:21] [INFO ] Deduced a trap composed of 48 places in 28 ms of which 0 ms to minimize.
[2021-05-09 18:01:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 93 ms
[2021-05-09 18:01:21] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:01:21] [INFO ] Added : 93 causal constraints over 19 iterations in 163 ms. Result :sat
Minimization took 31 ms.
[2021-05-09 18:01:21] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 18:01:21] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2021-05-09 18:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:21] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-09 18:01:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 18:01:21] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:21] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-09 18:01:21] [INFO ] Deduced a trap composed of 30 places in 13 ms of which 0 ms to minimize.
[2021-05-09 18:01:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2021-05-09 18:01:21] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-09 18:01:22] [INFO ] Added : 87 causal constraints over 18 iterations in 148 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [1, -1, 1, 1, 1, 1, 1, 1, -1, 12, 1] Max seen :[0, 4, 0, 1, 0, 0, 0, 0, 4, 0, 0]
FORMULA DoubleExponent-PT-002-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 37400 steps, including 1495 resets, run finished after 155 ms. (steps per millisecond=241 ) properties (out of 10) seen :8 could not realise parikh vector
Incomplete Parikh walk after 33900 steps, including 1258 resets, run finished after 80 ms. (steps per millisecond=423 ) properties (out of 10) seen :8 could not realise parikh vector
Incomplete Parikh walk after 14600 steps, including 512 resets, run finished after 28 ms. (steps per millisecond=521 ) properties (out of 10) seen :6 could not realise parikh vector
Incomplete Parikh walk after 35100 steps, including 1245 resets, run finished after 83 ms. (steps per millisecond=422 ) properties (out of 10) seen :11 could not realise parikh vector
FORMULA DoubleExponent-PT-002-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 29700 steps, including 1176 resets, run finished after 50 ms. (steps per millisecond=594 ) properties (out of 7) seen :8 could not realise parikh vector
Incomplete Parikh walk after 37800 steps, including 1504 resets, run finished after 77 ms. (steps per millisecond=490 ) properties (out of 7) seen :8 could not realise parikh vector
Incomplete Parikh walk after 22700 steps, including 841 resets, run finished after 35 ms. (steps per millisecond=648 ) properties (out of 7) seen :8 could not realise parikh vector
Incomplete Parikh walk after 31400 steps, including 1125 resets, run finished after 49 ms. (steps per millisecond=640 ) properties (out of 7) seen :8 could not realise parikh vector
Incomplete Parikh walk after 14600 steps, including 516 resets, run finished after 23 ms. (steps per millisecond=634 ) properties (out of 7) seen :8 could not realise parikh vector
Incomplete Parikh walk after 33800 steps, including 1175 resets, run finished after 54 ms. (steps per millisecond=625 ) properties (out of 7) seen :8 could not realise parikh vector
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 106 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 106 transition count 78
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 86 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 41 place count 86 transition count 73
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 51 place count 81 transition count 73
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 91 place count 61 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 95 place count 59 transition count 53
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 101 place count 59 transition count 47
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 107 place count 53 transition count 47
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 114 place count 53 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 52 transition count 46
Applied a total of 115 rules in 39 ms. Remains 52 /110 variables (removed 58) and now considering 46/98 (removed 52) transitions.
Finished structural reductions, in 1 iterations. Remains : 52/110 places, 46/98 transitions.
// Phase 1: matrix 46 rows 52 cols
[2021-05-09 18:01:22] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 113087 resets, run finished after 1650 ms. (steps per millisecond=606 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77710 resets, run finished after 1177 ms. (steps per millisecond=849 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77671 resets, run finished after 1178 ms. (steps per millisecond=848 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 1000001 steps, including 77899 resets, run finished after 1177 ms. (steps per millisecond=849 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 1000001 steps, including 77588 resets, run finished after 1120 ms. (steps per millisecond=892 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77865 resets, run finished after 1127 ms. (steps per millisecond=887 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 1000000 steps, including 78076 resets, run finished after 1121 ms. (steps per millisecond=892 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77829 resets, run finished after 1117 ms. (steps per millisecond=895 ) properties (out of 7) seen :8
// Phase 1: matrix 46 rows 52 cols
[2021-05-09 18:01:32] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-09 18:01:32] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-05-09 18:01:32] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:32] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-09 18:01:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:32] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:32] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-09 18:01:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:01:32] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2021-05-09 18:01:32] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2021-05-09 18:01:32] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2021-05-09 18:01:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 31 ms
[2021-05-09 18:01:32] [INFO ] Computed and/alt/rep : 45/166/45 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-09 18:01:32] [INFO ] Added : 42 causal constraints over 9 iterations in 53 ms. Result :sat
Minimization took 18 ms.
[2021-05-09 18:01:32] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 18:01:32] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:32] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-09 18:01:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-05-09 18:01:32] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:32] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-09 18:01:32] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:01:32] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2021-05-09 18:01:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-09 18:01:32] [INFO ] Computed and/alt/rep : 45/166/45 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 18:01:32] [INFO ] Added : 40 causal constraints over 8 iterations in 45 ms. Result :sat
Minimization took 21 ms.
[2021-05-09 18:01:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:32] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:32] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-09 18:01:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:32] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:32] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-09 18:01:32] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:01:32] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 1 ms to minimize.
[2021-05-09 18:01:32] [INFO ] Deduced a trap composed of 7 places in 10 ms of which 0 ms to minimize.
[2021-05-09 18:01:32] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2021-05-09 18:01:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 59 ms
[2021-05-09 18:01:32] [INFO ] Computed and/alt/rep : 45/166/45 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-09 18:01:33] [INFO ] Added : 38 causal constraints over 8 iterations in 48 ms. Result :sat
Minimization took 17 ms.
[2021-05-09 18:01:33] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:33] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-09 18:01:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:33] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:01:33] [INFO ] Computed and/alt/rep : 45/166/45 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-09 18:01:33] [INFO ] Added : 38 causal constraints over 8 iterations in 48 ms. Result :sat
Minimization took 17 ms.
[2021-05-09 18:01:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:33] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-09 18:01:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:33] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2021-05-09 18:01:33] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2021-05-09 18:01:33] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2021-05-09 18:01:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 33 ms
[2021-05-09 18:01:33] [INFO ] Computed and/alt/rep : 45/166/45 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-09 18:01:33] [INFO ] Added : 42 causal constraints over 9 iterations in 62 ms. Result :sat
Minimization took 17 ms.
[2021-05-09 18:01:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-09 18:01:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:33] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:01:33] [INFO ] Computed and/alt/rep : 45/166/45 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-09 18:01:33] [INFO ] Added : 44 causal constraints over 9 iterations in 62 ms. Result :sat
Minimization took 23 ms.
[2021-05-09 18:01:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-09 18:01:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:33] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-09 18:01:33] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:01:33] [INFO ] Computed and/alt/rep : 45/166/45 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 18:01:33] [INFO ] Deduced a trap composed of 12 places in 12 ms of which 0 ms to minimize.
[2021-05-09 18:01:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2021-05-09 18:01:33] [INFO ] Added : 38 causal constraints over 8 iterations in 79 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, -1, 12, 1] Max seen :[4, 0, 0, 0, 4, 0, 0]
Incomplete Parikh walk after 6100 steps, including 665 resets, run finished after 15 ms. (steps per millisecond=406 ) properties (out of 7) seen :8 could not realise parikh vector
Incomplete Parikh walk after 9400 steps, including 1260 resets, run finished after 21 ms. (steps per millisecond=447 ) properties (out of 7) seen :8 could not realise parikh vector
Incomplete Parikh walk after 7600 steps, including 838 resets, run finished after 17 ms. (steps per millisecond=447 ) properties (out of 7) seen :8 could not realise parikh vector
Incomplete Parikh walk after 10300 steps, including 1376 resets, run finished after 22 ms. (steps per millisecond=468 ) properties (out of 7) seen :8 could not realise parikh vector
Incomplete Parikh walk after 11400 steps, including 1517 resets, run finished after 24 ms. (steps per millisecond=475 ) properties (out of 7) seen :8 could not realise parikh vector
Incomplete Parikh walk after 11000 steps, including 1405 resets, run finished after 23 ms. (steps per millisecond=478 ) properties (out of 7) seen :8 could not realise parikh vector
Incomplete Parikh walk after 7600 steps, including 811 resets, run finished after 16 ms. (steps per millisecond=475 ) properties (out of 7) seen :8 could not realise parikh vector
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 52/52 places, 46/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 46/46 transitions.
Starting structural reductions, iteration 0 : 52/52 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 46/46 (removed 0) transitions.
// Phase 1: matrix 46 rows 52 cols
[2021-05-09 18:01:33] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-09 18:01:33] [INFO ] Implicit Places using invariants in 39 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
[2021-05-09 18:01:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 46 rows 51 cols
[2021-05-09 18:01:33] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-09 18:01:33] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 51/52 places, 46/46 transitions.
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 2 place count 50 transition count 45
Applied a total of 2 rules in 4 ms. Remains 50 /51 variables (removed 1) and now considering 45/46 (removed 1) transitions.
// Phase 1: matrix 45 rows 50 cols
[2021-05-09 18:01:33] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-09 18:01:33] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 45 rows 50 cols
[2021-05-09 18:01:33] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:01:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:01:33] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [16, 21, 47]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 105 ms to find 3 implicit places.
Starting structural reductions, iteration 2 : 47/52 places, 45/46 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 46 transition count 44
Applied a total of 2 rules in 4 ms. Remains 46 /47 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:01:33] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 18:01:33] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:01:33] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 18:01:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:01:34] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 46/52 places, 44/46 transitions.
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:01:34] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 125327 resets, run finished after 1490 ms. (steps per millisecond=671 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 1000000 steps, including 83534 resets, run finished after 1067 ms. (steps per millisecond=937 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 1000000 steps, including 83226 resets, run finished after 1052 ms. (steps per millisecond=950 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 1000000 steps, including 83369 resets, run finished after 1054 ms. (steps per millisecond=948 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 1000001 steps, including 83274 resets, run finished after 1054 ms. (steps per millisecond=948 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 1000001 steps, including 83212 resets, run finished after 1045 ms. (steps per millisecond=956 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 1000001 steps, including 83572 resets, run finished after 1052 ms. (steps per millisecond=950 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 1000001 steps, including 83228 resets, run finished after 1113 ms. (steps per millisecond=898 ) properties (out of 7) seen :8
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:01:42] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 18:01:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:42] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:42] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-09 18:01:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:42] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:43] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-09 18:01:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:01:43] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] Computed and/alt/rep : 43/156/43 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-09 18:01:43] [INFO ] Added : 41 causal constraints over 9 iterations in 56 ms. Result :sat
Minimization took 14 ms.
[2021-05-09 18:01:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:43] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-09 18:01:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:43] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2021-05-09 18:01:43] [INFO ] Computed and/alt/rep : 43/156/43 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-09 18:01:43] [INFO ] Added : 40 causal constraints over 8 iterations in 44 ms. Result :sat
Minimization took 18 ms.
[2021-05-09 18:01:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:43] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-09 18:01:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:43] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2021-05-09 18:01:43] [INFO ] Computed and/alt/rep : 43/156/43 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-09 18:01:43] [INFO ] Deduced a trap composed of 9 places in 11 ms of which 0 ms to minimize.
[2021-05-09 18:01:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-09 18:01:43] [INFO ] Added : 37 causal constraints over 8 iterations in 60 ms. Result :sat
Minimization took 17 ms.
[2021-05-09 18:01:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:43] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-09 18:01:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:43] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] Computed and/alt/rep : 43/156/43 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-09 18:01:43] [INFO ] Added : 36 causal constraints over 8 iterations in 40 ms. Result :sat
Minimization took 16 ms.
[2021-05-09 18:01:43] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:43] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-09 18:01:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:43] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] Computed and/alt/rep : 43/156/43 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-09 18:01:43] [INFO ] Added : 41 causal constraints over 9 iterations in 46 ms. Result :sat
Minimization took 14 ms.
[2021-05-09 18:01:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:43] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-09 18:01:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:43] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] Computed and/alt/rep : 43/156/43 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 18:01:43] [INFO ] Added : 40 causal constraints over 8 iterations in 42 ms. Result :sat
Minimization took 17 ms.
[2021-05-09 18:01:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:43] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-09 18:01:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:43] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-09 18:01:43] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:01:43] [INFO ] Computed and/alt/rep : 43/156/43 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-09 18:01:43] [INFO ] Added : 36 causal constraints over 8 iterations in 42 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, -1, 12, 1] Max seen :[4, 0, 0, 0, 4, 0, 0]
Incomplete Parikh walk after 8800 steps, including 957 resets, run finished after 19 ms. (steps per millisecond=463 ) properties (out of 7) seen :8 could not realise parikh vector
Incomplete Parikh walk after 8500 steps, including 1228 resets, run finished after 18 ms. (steps per millisecond=472 ) properties (out of 7) seen :8 could not realise parikh vector
Incomplete Parikh walk after 3700 steps, including 524 resets, run finished after 8 ms. (steps per millisecond=462 ) properties (out of 7) seen :8 could not realise parikh vector
Incomplete Parikh walk after 8700 steps, including 956 resets, run finished after 20 ms. (steps per millisecond=435 ) properties (out of 7) seen :8 could not realise parikh vector
Incomplete Parikh walk after 11200 steps, including 1614 resets, run finished after 23 ms. (steps per millisecond=486 ) properties (out of 7) seen :8 could not realise parikh vector
Incomplete Parikh walk after 8000 steps, including 1129 resets, run finished after 18 ms. (steps per millisecond=444 ) properties (out of 7) seen :8 could not realise parikh vector
Incomplete Parikh walk after 3700 steps, including 528 resets, run finished after 8 ms. (steps per millisecond=462 ) properties (out of 7) seen :8 could not realise parikh vector
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 44/44 transitions.
Starting structural reductions, iteration 0 : 46/46 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 44/44 (removed 0) transitions.
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:01:43] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 18:01:44] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:01:44] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:01:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:01:44] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2021-05-09 18:01:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:01:44] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:01:44] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 44/44 transitions.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-01
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:01:44] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1258 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :4
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:01:44] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:01:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:44] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:44] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-09 18:01:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:44] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:44] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-09 18:01:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:01:44] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:01:44] [INFO ] Computed and/alt/rep : 43/156/43 causal constraints (skipped 0 transitions) in 21 ms.
[2021-05-09 18:01:44] [INFO ] Added : 41 causal constraints over 9 iterations in 65 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 3700 steps, including 527 resets, run finished after 7 ms. (steps per millisecond=528 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 44/44 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 3 rules applied. Total rules applied 3 place count 45 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 44 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 44 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 43 transition count 41
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 10 place count 41 transition count 39
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 41 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 40 transition count 38
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 40 transition count 38
Applied a total of 13 rules in 7 ms. Remains 40 /46 variables (removed 6) and now considering 38/44 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/46 places, 38/44 transitions.
// Phase 1: matrix 38 rows 40 cols
[2021-05-09 18:01:44] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 125268 resets, run finished after 1405 ms. (steps per millisecond=711 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 83154 resets, run finished after 994 ms. (steps per millisecond=1006 ) properties (out of 1) seen :4
// Phase 1: matrix 38 rows 40 cols
[2021-05-09 18:01:46] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:01:46] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:46] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 18:01:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:46] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-09 18:01:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:46] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:46] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-09 18:01:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:01:46] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2021-05-09 18:01:46] [INFO ] Deduced a trap composed of 15 places in 12 ms of which 0 ms to minimize.
[2021-05-09 18:01:46] [INFO ] Deduced a trap composed of 18 places in 13 ms of which 1 ms to minimize.
[2021-05-09 18:01:46] [INFO ] Deduced a trap composed of 13 places in 15 ms of which 1 ms to minimize.
[2021-05-09 18:01:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 46 ms
[2021-05-09 18:01:46] [INFO ] Computed and/alt/rep : 37/157/37 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-09 18:01:46] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2021-05-09 18:01:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2021-05-09 18:01:46] [INFO ] Added : 36 causal constraints over 8 iterations in 68 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 7900 steps, including 1133 resets, run finished after 13 ms. (steps per millisecond=607 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 40/40 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 38/38 transitions.
Starting structural reductions, iteration 0 : 40/40 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 40 cols
[2021-05-09 18:01:46] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:01:46] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 38 rows 40 cols
[2021-05-09 18:01:46] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:01:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:01:46] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2021-05-09 18:01:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 38 rows 40 cols
[2021-05-09 18:01:46] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:01:46] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 38/38 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-01 in 2896 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-02
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:01:46] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1282 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 837 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:01:47] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 18:01:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:47] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:47] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-09 18:01:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:47] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-09 18:01:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:47] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-09 18:01:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:01:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:01:47] [INFO ] Computed and/alt/rep : 43/156/43 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-09 18:01:47] [INFO ] Added : 40 causal constraints over 8 iterations in 43 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 8000 steps, including 1115 resets, run finished after 17 ms. (steps per millisecond=470 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 44/44 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 3 rules applied. Total rules applied 3 place count 45 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 44 transition count 42
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 8 place count 42 transition count 40
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 10 place count 41 transition count 40
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 41 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 39 transition count 38
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 39 transition count 38
Applied a total of 16 rules in 8 ms. Remains 39 /46 variables (removed 7) and now considering 38/44 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 39/46 places, 38/44 transitions.
// Phase 1: matrix 38 rows 39 cols
[2021-05-09 18:01:47] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156227 resets, run finished after 1512 ms. (steps per millisecond=661 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96305 resets, run finished after 950 ms. (steps per millisecond=1052 ) properties (out of 1) seen :0
// Phase 1: matrix 38 rows 39 cols
[2021-05-09 18:01:49] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:01:49] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:49] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-09 18:01:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:49] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:49] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-09 18:01:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 18:01:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:01:49] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2021-05-09 18:01:49] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 5 ms to minimize.
[2021-05-09 18:01:49] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2021-05-09 18:01:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 57 ms
[2021-05-09 18:01:49] [INFO ] Computed and/alt/rep : 36/180/36 causal constraints (skipped 1 transitions) in 3 ms.
[2021-05-09 18:01:49] [INFO ] Added : 28 causal constraints over 6 iterations in 31 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 7800 steps, including 1446 resets, run finished after 12 ms. (steps per millisecond=650 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 38/38 transitions.
Starting structural reductions, iteration 0 : 39/39 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 39 cols
[2021-05-09 18:01:49] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 18:01:49] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 38 rows 39 cols
[2021-05-09 18:01:49] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:01:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 18:01:49] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2021-05-09 18:01:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 38 rows 39 cols
[2021-05-09 18:01:49] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 18:01:49] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 38/38 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-02 in 2897 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-05
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:01:49] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1263 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:01:49] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:01:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:49] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:49] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-09 18:01:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:49] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:49] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-09 18:01:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:01:49] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:01:49] [INFO ] Computed and/alt/rep : 43/156/43 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 18:01:50] [INFO ] Deduced a trap composed of 9 places in 10 ms of which 0 ms to minimize.
[2021-05-09 18:01:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2021-05-09 18:01:50] [INFO ] Added : 37 causal constraints over 8 iterations in 63 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 11200 steps, including 1589 resets, run finished after 18 ms. (steps per millisecond=622 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 44/44 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 3 rules applied. Total rules applied 3 place count 45 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 44 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 44 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 43 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 42 transition count 40
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 10 place count 41 transition count 40
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 41 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 39 transition count 38
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 39 transition count 38
Applied a total of 16 rules in 7 ms. Remains 39 /46 variables (removed 7) and now considering 38/44 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 39/46 places, 38/44 transitions.
// Phase 1: matrix 38 rows 39 cols
[2021-05-09 18:01:50] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156131 resets, run finished after 1434 ms. (steps per millisecond=697 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96300 resets, run finished after 955 ms. (steps per millisecond=1047 ) properties (out of 1) seen :0
// Phase 1: matrix 38 rows 39 cols
[2021-05-09 18:01:52] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:01:52] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 18:01:52] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 18:01:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:52] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-09 18:01:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 18:01:52] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 18:01:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:52] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-09 18:01:52] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-05-09 18:01:52] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:01:52] [INFO ] Computed and/alt/rep : 36/179/36 causal constraints (skipped 1 transitions) in 17 ms.
[2021-05-09 18:01:52] [INFO ] Added : 35 causal constraints over 7 iterations in 94 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 10000 steps, including 1444 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 38/38 transitions.
Starting structural reductions, iteration 0 : 39/39 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 39 cols
[2021-05-09 18:01:52] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:01:52] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 38 rows 39 cols
[2021-05-09 18:01:52] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:01:52] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-05-09 18:01:53] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2021-05-09 18:01:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 38 rows 39 cols
[2021-05-09 18:01:53] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 18:01:53] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 38/38 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-05 in 3320 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-09
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:01:53] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1222 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 799 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:01:53] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 18:01:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:53] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:53] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-09 18:01:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-05-09 18:01:53] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-09 18:01:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:53] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-09 18:01:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:01:53] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2021-05-09 18:01:53] [INFO ] Computed and/alt/rep : 43/156/43 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 18:01:53] [INFO ] Added : 36 causal constraints over 8 iterations in 51 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 8700 steps, including 1012 resets, run finished after 15 ms. (steps per millisecond=580 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 44/44 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 45 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 44 transition count 42
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 1 with 4 rules applied. Total rules applied 8 place count 42 transition count 40
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 1 with 2 rules applied. Total rules applied 10 place count 41 transition count 40
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 41 transition count 40
Applied a total of 13 rules in 6 ms. Remains 41 /46 variables (removed 5) and now considering 40/44 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 41/46 places, 40/44 transitions.
// Phase 1: matrix 40 rows 41 cols
[2021-05-09 18:01:53] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 156478 resets, run finished after 1502 ms. (steps per millisecond=665 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95902 resets, run finished after 969 ms. (steps per millisecond=1031 ) properties (out of 1) seen :0
// Phase 1: matrix 40 rows 41 cols
[2021-05-09 18:01:55] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 18:01:55] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 18:01:55] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 18:01:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:55] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-09 18:01:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 18:01:55] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 18:01:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:55] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-09 18:01:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 18:01:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:01:55] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 1 ms to minimize.
[2021-05-09 18:01:55] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 18:01:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 25 ms
[2021-05-09 18:01:55] [INFO ] Computed and/alt/rep : 39/189/39 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-09 18:01:56] [INFO ] Deduced a trap composed of 8 places in 12 ms of which 0 ms to minimize.
[2021-05-09 18:01:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2021-05-09 18:01:56] [INFO ] Added : 35 causal constraints over 7 iterations in 69 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 7700 steps, including 1479 resets, run finished after 13 ms. (steps per millisecond=592 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 40/40 transitions.
Starting structural reductions, iteration 0 : 41/41 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 41 cols
[2021-05-09 18:01:56] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:01:56] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 40 rows 41 cols
[2021-05-09 18:01:56] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:01:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 18:01:56] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2021-05-09 18:01:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 40 rows 41 cols
[2021-05-09 18:01:56] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:01:56] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 40/40 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-09 in 3002 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-11
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:01:56] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1235 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :4
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:01:56] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 18:01:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:56] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:56] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-09 18:01:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-05-09 18:01:56] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-09 18:01:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:56] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-09 18:01:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:01:56] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2021-05-09 18:01:56] [INFO ] Computed and/alt/rep : 43/156/43 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-09 18:01:56] [INFO ] Added : 41 causal constraints over 9 iterations in 47 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 3700 steps, including 533 resets, run finished after 7 ms. (steps per millisecond=528 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 44/44 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 3 rules applied. Total rules applied 3 place count 45 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 44 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 44 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 43 transition count 41
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 10 place count 41 transition count 39
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 41 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 40 transition count 38
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 40 transition count 38
Applied a total of 13 rules in 8 ms. Remains 40 /46 variables (removed 6) and now considering 38/44 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/46 places, 38/44 transitions.
// Phase 1: matrix 38 rows 40 cols
[2021-05-09 18:01:56] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 125252 resets, run finished after 1404 ms. (steps per millisecond=712 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 83251 resets, run finished after 996 ms. (steps per millisecond=1004 ) properties (out of 1) seen :4
// Phase 1: matrix 38 rows 40 cols
[2021-05-09 18:01:58] [INFO ] Computed 7 place invariants in 9 ms
[2021-05-09 18:01:58] [INFO ] [Real]Absence check using 5 positive place invariants in 23 ms returned sat
[2021-05-09 18:01:58] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 18:01:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:58] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-09 18:01:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:58] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:58] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-09 18:01:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:01:58] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:01:58] [INFO ] Deduced a trap composed of 15 places in 14 ms of which 0 ms to minimize.
[2021-05-09 18:01:58] [INFO ] Deduced a trap composed of 18 places in 13 ms of which 0 ms to minimize.
[2021-05-09 18:01:58] [INFO ] Deduced a trap composed of 13 places in 12 ms of which 0 ms to minimize.
[2021-05-09 18:01:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 50 ms
[2021-05-09 18:01:58] [INFO ] Computed and/alt/rep : 37/157/37 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 18:01:58] [INFO ] Deduced a trap composed of 9 places in 11 ms of which 0 ms to minimize.
[2021-05-09 18:01:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-09 18:01:58] [INFO ] Added : 36 causal constraints over 8 iterations in 60 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 7900 steps, including 1140 resets, run finished after 13 ms. (steps per millisecond=607 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 40/40 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 38/38 transitions.
Starting structural reductions, iteration 0 : 40/40 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 40 cols
[2021-05-09 18:01:59] [INFO ] Computed 7 place invariants in 7 ms
[2021-05-09 18:01:59] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 38 rows 40 cols
[2021-05-09 18:01:59] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:01:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:01:59] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2021-05-09 18:01:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 38 rows 40 cols
[2021-05-09 18:01:59] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:01:59] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 38/38 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-11 in 2934 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-13
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:01:59] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1252 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 818 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:01:59] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:01:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:59] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-09 18:01:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:59] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-09 18:01:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:01:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:01:59] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 18:01:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:01:59] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-09 18:01:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:01:59] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:01:59] [INFO ] Computed and/alt/rep : 43/156/43 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 18:01:59] [INFO ] Added : 40 causal constraints over 8 iterations in 42 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 8500 steps, including 1224 resets, run finished after 14 ms. (steps per millisecond=607 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 44/44 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 44 transition count 42
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 0 with 2 rules applied. Total rules applied 6 place count 43 transition count 42
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 43 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 42 transition count 41
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 42 transition count 41
Applied a total of 11 rules in 7 ms. Remains 42 /46 variables (removed 4) and now considering 41/44 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 42/46 places, 41/44 transitions.
// Phase 1: matrix 41 rows 42 cols
[2021-05-09 18:01:59] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 155981 resets, run finished after 1458 ms. (steps per millisecond=685 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96472 resets, run finished after 979 ms. (steps per millisecond=1021 ) properties (out of 1) seen :0
// Phase 1: matrix 41 rows 42 cols
[2021-05-09 18:02:01] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:02:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:02:01] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 8 ms returned sat
[2021-05-09 18:02:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-09 18:02:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:02:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:02:01] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-09 18:02:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:01] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-09 18:02:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 18:02:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:02:01] [INFO ] Computed and/alt/rep : 40/199/40 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 18:02:01] [INFO ] Added : 35 causal constraints over 7 iterations in 42 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 5200 steps, including 832 resets, run finished after 9 ms. (steps per millisecond=577 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 42/42 places, 41/41 transitions.
Starting structural reductions, iteration 0 : 42/42 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 42 cols
[2021-05-09 18:02:01] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:02:01] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 41 rows 42 cols
[2021-05-09 18:02:01] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:02:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 18:02:01] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2021-05-09 18:02:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 41 rows 42 cols
[2021-05-09 18:02:01] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:02:01] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 42/42 places, 41/41 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-13 in 2849 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-14
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:02:01] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1256 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 821 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 44 rows 46 cols
[2021-05-09 18:02:02] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 18:02:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:02:02] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-09 18:02:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:02] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-09 18:02:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:02:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-05-09 18:02:02] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-09 18:02:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:02] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-09 18:02:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:02:02] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:02:02] [INFO ] Computed and/alt/rep : 43/156/43 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 18:02:02] [INFO ] Added : 36 causal constraints over 8 iterations in 41 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 8800 steps, including 992 resets, run finished after 15 ms. (steps per millisecond=586 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 46/46 places, 44/44 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 45 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 44 transition count 42
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 1 with 2 rules applied. Total rules applied 6 place count 43 transition count 41
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 1 with 2 rules applied. Total rules applied 8 place count 42 transition count 41
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 42 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 41 transition count 40
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 41 transition count 40
Applied a total of 13 rules in 8 ms. Remains 41 /46 variables (removed 5) and now considering 40/44 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 41/46 places, 40/44 transitions.
// Phase 1: matrix 40 rows 41 cols
[2021-05-09 18:02:02] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156557 resets, run finished after 1434 ms. (steps per millisecond=697 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95939 resets, run finished after 956 ms. (steps per millisecond=1046 ) properties (out of 1) seen :0
// Phase 1: matrix 40 rows 41 cols
[2021-05-09 18:02:04] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:02:04] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 18:02:04] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 18:02:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-09 18:02:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:02:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 18:02:04] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 18:02:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:04] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-09 18:02:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 18:02:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2021-05-09 18:02:04] [INFO ] Computed and/alt/rep : 39/189/39 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 18:02:04] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2021-05-09 18:02:04] [INFO ] Deduced a trap composed of 14 places in 12 ms of which 0 ms to minimize.
[2021-05-09 18:02:04] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2021-05-09 18:02:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 90 ms
[2021-05-09 18:02:04] [INFO ] Added : 33 causal constraints over 7 iterations in 133 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 7500 steps, including 1244 resets, run finished after 13 ms. (steps per millisecond=576 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 40/40 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 40/40 transitions.
Starting structural reductions, iteration 0 : 41/41 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 41 cols
[2021-05-09 18:02:04] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:02:04] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 40 rows 41 cols
[2021-05-09 18:02:04] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 18:02:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 18:02:04] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2021-05-09 18:02:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 40 rows 41 cols
[2021-05-09 18:02:04] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 18:02:04] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 40/40 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-14 in 2922 ms.
[2021-05-09 18:02:05] [INFO ] Flatten gal took : 39 ms
[2021-05-09 18:02:05] [INFO ] Applying decomposition
[2021-05-09 18:02:05] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1797723705037437697.txt, -o, /tmp/graph1797723705037437697.bin, -w, /tmp/graph1797723705037437697.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1797723705037437697.bin, -l, -1, -v, -w, /tmp/graph1797723705037437697.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 18:02:05] [INFO ] Decomposing Gal with order
[2021-05-09 18:02:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 18:02:05] [INFO ] Removed a total of 18 redundant transitions.
[2021-05-09 18:02:05] [INFO ] Flatten gal took : 30 ms
[2021-05-09 18:02:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2021-05-09 18:02:05] [INFO ] Time to serialize gal into /tmp/UpperBounds15306719790331645809.gal : 3 ms
[2021-05-09 18:02:05] [INFO ] Time to serialize properties into /tmp/UpperBounds8337716327558400737.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds15306719790331645809.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds8337716327558400737.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds15306719790331645809.gal -t CGAL -reachable-file /tmp/UpperBounds8337716327558400737.prop --nowitness
Loading property file /tmp/UpperBounds8337716327558400737.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,1254,0.1001,7464,428,166,8371,529,215,9017,69,1749,0
Total reachable state count : 1254

Verifying 7 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DoubleExponent-PT-002-UpperBounds-01 :0 <= i5.u12.p57 <= 4
FORMULA DoubleExponent-PT-002-UpperBounds-01 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-002-UpperBounds-01,0,0.104358,7464,1,0,8371,529,295,9017,87,1749,481
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-002-UpperBounds-02 :0 <= i3.u9.p89 <= 1
FORMULA DoubleExponent-PT-002-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-002-UpperBounds-02,0,0.106603,7464,1,0,8371,529,323,9017,92,1749,613
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-002-UpperBounds-05 :0 <= i5.u11.p92 <= 1
FORMULA DoubleExponent-PT-002-UpperBounds-05 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-002-UpperBounds-05,0,0.107831,7464,1,0,8371,529,341,9017,94,1749,705
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-002-UpperBounds-09 :0 <= i3.u5.p70 <= 1
FORMULA DoubleExponent-PT-002-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-002-UpperBounds-09,0,0.108644,7464,1,0,8371,529,360,9017,94,1749,759
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DoubleExponent-PT-002-UpperBounds-11 :0 <= i5.u12.p57 <= 4
FORMULA DoubleExponent-PT-002-UpperBounds-11 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-002-UpperBounds-11,0,0.108832,7464,1,0,8371,529,360,9017,94,1749,759
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-002-UpperBounds-13 :0 <= i3.u5.p71 <= 1
FORMULA DoubleExponent-PT-002-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-002-UpperBounds-13,0,0.109144,7464,1,0,8371,529,380,9017,102,1749,828
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-002-UpperBounds-14 :0 <= i3.u8.p85 <= 1
FORMULA DoubleExponent-PT-002-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-002-UpperBounds-14,0,0.109325,7464,1,0,8371,529,400,9017,102,1749,869

BK_STOP 1620583326265

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-002"
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-002, 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 r083-tall-162048875300403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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