Execution Chart

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

Trace from the execution

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

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

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652718879014

Running Version 0
[2022-05-16 16:34:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 16:34:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 16:34:40] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2022-05-16 16:34:40] [INFO ] Transformed 163 places.
[2022-05-16 16:34:40] [INFO ] Transformed 148 transitions.
[2022-05-16 16:34:40] [INFO ] Parsed PT model containing 163 places and 148 transitions in 75 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 148 rows 163 cols
[2022-05-16 16:34:40] [INFO ] Computed 19 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 331 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :10
FORMULA DoubleExponent-PT-003-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 298 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :14
FORMULA DoubleExponent-PT-003-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 279 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10000 steps, including 296 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 289 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :9
// Phase 1: matrix 148 rows 163 cols
[2022-05-16 16:34:40] [INFO ] Computed 19 place invariants in 15 ms
[2022-05-16 16:34:41] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2022-05-16 16:34:41] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 14 ms returned sat
[2022-05-16 16:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:41] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2022-05-16 16:34:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-16 16:34:41] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-16 16:34:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:41] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-16 16:34:41] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2022-05-16 16:34:41] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:34:41] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2022-05-16 16:34:41] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2022-05-16 16:34:41] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2022-05-16 16:34:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 357 ms
[2022-05-16 16:34:41] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-16 16:34:41] [INFO ] Added : 119 causal constraints over 24 iterations in 386 ms. Result :sat
Minimization took 50 ms.
[2022-05-16 16:34:42] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:42] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-16 16:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:42] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-05-16 16:34:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:42] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2022-05-16 16:34:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:42] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-05-16 16:34:42] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 15 ms.
[2022-05-16 16:34:42] [INFO ] Added : 140 causal constraints over 28 iterations in 422 ms. Result :sat
Minimization took 52 ms.
[2022-05-16 16:34:42] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:42] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:42] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2022-05-16 16:34:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:42] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-16 16:34:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:42] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-05-16 16:34:42] [INFO ] Deduced a trap composed of 74 places in 38 ms of which 0 ms to minimize.
[2022-05-16 16:34:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2022-05-16 16:34:42] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 16:34:43] [INFO ] Added : 134 causal constraints over 27 iterations in 398 ms. Result :sat
Minimization took 46 ms.
[2022-05-16 16:34:43] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-16 16:34:43] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned unsat
[2022-05-16 16:34:43] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:43] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned unsat
[2022-05-16 16:34:43] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:43] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2022-05-16 16:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:43] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2022-05-16 16:34:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:43] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-16 16:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:43] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-05-16 16:34:43] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 0 ms to minimize.
[2022-05-16 16:34:43] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 0 ms to minimize.
[2022-05-16 16:34:43] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
[2022-05-16 16:34:43] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2022-05-16 16:34:43] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2022-05-16 16:34:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 248 ms
[2022-05-16 16:34:43] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 16:34:44] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2022-05-16 16:34:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2022-05-16 16:34:44] [INFO ] Added : 144 causal constraints over 29 iterations in 530 ms. Result :sat
Minimization took 58 ms.
[2022-05-16 16:34:44] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 16:34:44] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 1 ms returned unsat
[2022-05-16 16:34:44] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:44] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:44] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-05-16 16:34:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:44] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-16 16:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:44] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-05-16 16:34:44] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 21 ms.
[2022-05-16 16:34:45] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2022-05-16 16:34:45] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2022-05-16 16:34:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2022-05-16 16:34:45] [INFO ] Added : 113 causal constraints over 24 iterations in 476 ms. Result :sat
Minimization took 42 ms.
[2022-05-16 16:34:45] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:45] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned unsat
[2022-05-16 16:34:45] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 16:34:45] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:45] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-05-16 16:34:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:45] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-16 16:34:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:45] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-05-16 16:34:45] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 0 ms to minimize.
[2022-05-16 16:34:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2022-05-16 16:34:45] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 16:34:45] [INFO ] Added : 107 causal constraints over 22 iterations in 308 ms. Result :sat
Minimization took 60 ms.
[2022-05-16 16:34:45] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:45] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-16 16:34:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:45] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-05-16 16:34:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:45] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-16 16:34:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:45] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-05-16 16:34:45] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 16:34:46] [INFO ] Added : 112 causal constraints over 23 iterations in 337 ms. Result :sat
Minimization took 48 ms.
[2022-05-16 16:34:46] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:46] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:46] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-05-16 16:34:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:46] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-16 16:34:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:46] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-05-16 16:34:46] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 16:34:46] [INFO ] Added : 140 causal constraints over 29 iterations in 406 ms. Result :sat
Minimization took 57 ms.
[2022-05-16 16:34:46] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 16:34:46] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 1, -1, 1, 1, 1, 1, 1, 1, 1] Max seen :[3, 0, 0, 1, 1, 4, 1, 0, 1, 0, 0, 0, 1]
FORMULA DoubleExponent-PT-003-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 89600 steps, including 3145 resets, run finished after 95 ms. (steps per millisecond=943 ) properties (out of 8) seen :4 could not realise parikh vector
Incomplete Parikh walk after 78100 steps, including 2892 resets, run finished after 59 ms. (steps per millisecond=1323 ) properties (out of 8) seen :4 could not realise parikh vector
Incomplete Parikh walk after 86200 steps, including 3183 resets, run finished after 65 ms. (steps per millisecond=1326 ) properties (out of 8) seen :5 could not realise parikh vector
Incomplete Parikh walk after 51600 steps, including 1807 resets, run finished after 41 ms. (steps per millisecond=1258 ) properties (out of 8) seen :4 could not realise parikh vector
Incomplete Parikh walk after 46600 steps, including 1636 resets, run finished after 38 ms. (steps per millisecond=1226 ) properties (out of 8) seen :4 could not realise parikh vector
Incomplete Parikh walk after 80900 steps, including 2873 resets, run finished after 103 ms. (steps per millisecond=785 ) properties (out of 8) seen :4 could not realise parikh vector
Incomplete Parikh walk after 132700 steps, including 4763 resets, run finished after 155 ms. (steps per millisecond=856 ) properties (out of 8) seen :5 could not realise parikh vector
Incomplete Parikh walk after 48500 steps, including 1704 resets, run finished after 31 ms. (steps per millisecond=1564 ) properties (out of 8) seen :4 could not realise parikh vector
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 148/148 transitions.
Graph (complete) has 269 edges and 163 vertex of which 159 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 159 transition count 122
Reduce places removed 26 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 30 rules applied. Total rules applied 57 place count 133 transition count 118
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 61 place count 129 transition count 118
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 61 place count 129 transition count 109
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 79 place count 120 transition count 109
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 133 place count 93 transition count 82
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 141 place count 89 transition count 82
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 146 place count 89 transition count 77
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 151 place count 84 transition count 77
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 164 place count 84 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 83 transition count 76
Applied a total of 165 rules in 51 ms. Remains 83 /163 variables (removed 80) and now considering 76/148 (removed 72) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/163 places, 76/148 transitions.
// Phase 1: matrix 76 rows 83 cols
[2022-05-16 16:34:47] [INFO ] Computed 16 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 112575 resets, run finished after 799 ms. (steps per millisecond=1251 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77926 resets, run finished after 486 ms. (steps per millisecond=2057 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000001 steps, including 77831 resets, run finished after 489 ms. (steps per millisecond=2044 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000001 steps, including 77781 resets, run finished after 476 ms. (steps per millisecond=2100 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77789 resets, run finished after 475 ms. (steps per millisecond=2105 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77767 resets, run finished after 472 ms. (steps per millisecond=2118 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000001 steps, including 77558 resets, run finished after 476 ms. (steps per millisecond=2100 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77585 resets, run finished after 488 ms. (steps per millisecond=2049 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000001 steps, including 77566 resets, run finished after 503 ms. (steps per millisecond=1988 ) properties (out of 8) seen :8
// Phase 1: matrix 76 rows 83 cols
[2022-05-16 16:34:52] [INFO ] Computed 16 place invariants in 4 ms
[2022-05-16 16:34:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:52] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:52] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 16:34:52] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 16:34:52] [INFO ] [Real]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:34:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:52] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:52] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 16:34:52] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:34:52] [INFO ] Computed and/alt/rep : 75/323/75 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:34:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:34:52] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2022-05-16 16:34:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 63 ms
[2022-05-16 16:34:52] [INFO ] Added : 32 causal constraints over 7 iterations in 149 ms. Result :sat
Minimization took 25 ms.
[2022-05-16 16:34:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:52] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:52] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:34:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:52] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:52] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:34:52] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:34:52] [INFO ] Computed and/alt/rep : 75/323/75 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 16:34:52] [INFO ] Added : 74 causal constraints over 16 iterations in 177 ms. Result :sat
Minimization took 57 ms.
[2022-05-16 16:34:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:52] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:52] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:34:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:34:52] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-16 16:34:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:52] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-16 16:34:52] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:34:52] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2022-05-16 16:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2022-05-16 16:34:53] [INFO ] Computed and/alt/rep : 75/323/75 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 16:34:53] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2022-05-16 16:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-05-16 16:34:53] [INFO ] Added : 73 causal constraints over 16 iterations in 248 ms. Result :sat
Minimization took 49 ms.
[2022-05-16 16:34:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:53] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 9 ms returned sat
[2022-05-16 16:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:53] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 16:34:53] [INFO ] [Real]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:34:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:53] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:53] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-16 16:34:53] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2022-05-16 16:34:53] [INFO ] Computed and/alt/rep : 75/323/75 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 16:34:53] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2022-05-16 16:34:53] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2022-05-16 16:34:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 83 ms
[2022-05-16 16:34:53] [INFO ] Added : 47 causal constraints over 11 iterations in 190 ms. Result :sat
Minimization took 44 ms.
[2022-05-16 16:34:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:53] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:53] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 16:34:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:53] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:53] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:34:53] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:34:53] [INFO ] Deduced a trap composed of 10 places in 14 ms of which 1 ms to minimize.
[2022-05-16 16:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2022-05-16 16:34:53] [INFO ] Computed and/alt/rep : 75/323/75 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 16:34:53] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-16 16:34:53] [INFO ] Added : 63 causal constraints over 13 iterations in 160 ms. Result :sat
Minimization took 36 ms.
[2022-05-16 16:34:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:53] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-16 16:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:53] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 16:34:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:34:54] [INFO ] Computed and/alt/rep : 75/323/75 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:34:54] [INFO ] Added : 70 causal constraints over 14 iterations in 140 ms. Result :sat
Minimization took 59 ms.
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:34:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2022-05-16 16:34:54] [INFO ] Computed and/alt/rep : 75/323/75 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2022-05-16 16:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-05-16 16:34:54] [INFO ] Added : 48 causal constraints over 10 iterations in 141 ms. Result :sat
Minimization took 38 ms.
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 6 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 16:34:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Added 7 Read/Feed constraints in 0 ms returned sat
[2022-05-16 16:34:54] [INFO ] Computed and/alt/rep : 75/323/75 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2022-05-16 16:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-05-16 16:34:54] [INFO ] Added : 69 causal constraints over 14 iterations in 214 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, -1, 1, 1, 1, 1] Max seen :[4, 0, 0, 4, 0, 0, 0, 0]
Incomplete Parikh walk after 37900 steps, including 5045 resets, run finished after 50 ms. (steps per millisecond=758 ) properties (out of 8) seen :6 could not realise parikh vector
Incomplete Parikh walk after 40000 steps, including 5363 resets, run finished after 52 ms. (steps per millisecond=769 ) properties (out of 8) seen :6 could not realise parikh vector
Incomplete Parikh walk after 33000 steps, including 4416 resets, run finished after 43 ms. (steps per millisecond=767 ) properties (out of 8) seen :6 could not realise parikh vector
Incomplete Parikh walk after 7200 steps, including 970 resets, run finished after 10 ms. (steps per millisecond=720 ) properties (out of 8) seen :4 could not realise parikh vector
Incomplete Parikh walk after 3500 steps, including 477 resets, run finished after 5 ms. (steps per millisecond=700 ) properties (out of 8) seen :2 could not realise parikh vector
Incomplete Parikh walk after 28100 steps, including 3768 resets, run finished after 37 ms. (steps per millisecond=759 ) properties (out of 8) seen :5 could not realise parikh vector
Incomplete Parikh walk after 23700 steps, including 3160 resets, run finished after 31 ms. (steps per millisecond=764 ) properties (out of 8) seen :7 could not realise parikh vector
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 8 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 76/76 transitions.
Starting structural reductions, iteration 0 : 83/83 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 83 cols
[2022-05-16 16:34:55] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-16 16:34:55] [INFO ] Implicit Places using invariants in 40 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
[2022-05-16 16:34:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 76 rows 81 cols
[2022-05-16 16:34:55] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 16:34:55] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 81/83 places, 76/76 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 80 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 79 transition count 74
Applied a total of 4 rules in 7 ms. Remains 79 /81 variables (removed 2) and now considering 74/76 (removed 2) transitions.
// Phase 1: matrix 74 rows 79 cols
[2022-05-16 16:34:55] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-16 16:34:55] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 74 rows 79 cols
[2022-05-16 16:34:55] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 16:34:55] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 16:34:55] [INFO ] Implicit Places using invariants and state equation in 85 ms returned [43, 48, 67]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 137 ms to find 3 implicit places.
Starting structural reductions, iteration 2 : 76/83 places, 74/76 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 76 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 73
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 75 transition count 73
Applied a total of 3 rules in 10 ms. Remains 75 /76 variables (removed 1) and now considering 73/74 (removed 1) transitions.
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:34:55] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 16:34:55] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:34:55] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 16:34:55] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 16:34:55] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 75/83 places, 73/76 transitions.
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:34:55] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 125082 resets, run finished after 737 ms. (steps per millisecond=1356 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000000 steps, including 83281 resets, run finished after 469 ms. (steps per millisecond=2132 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000001 steps, including 83233 resets, run finished after 458 ms. (steps per millisecond=2183 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000000 steps, including 83492 resets, run finished after 454 ms. (steps per millisecond=2202 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000001 steps, including 83204 resets, run finished after 454 ms. (steps per millisecond=2202 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000000 steps, including 83281 resets, run finished after 454 ms. (steps per millisecond=2202 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000000 steps, including 83417 resets, run finished after 452 ms. (steps per millisecond=2212 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000000 steps, including 83364 resets, run finished after 453 ms. (steps per millisecond=2207 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 1000000 steps, including 83021 resets, run finished after 457 ms. (steps per millisecond=2188 ) properties (out of 8) seen :8
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:34:59] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-16 16:34:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:59] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 16:34:59] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 16:34:59] [INFO ] [Real]Added 7 Read/Feed constraints in 5 ms returned sat
[2022-05-16 16:34:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:59] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:34:59] [INFO ] Deduced a trap composed of 10 places in 14 ms of which 0 ms to minimize.
[2022-05-16 16:34:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2022-05-16 16:34:59] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:35:00] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:35:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-05-16 16:35:00] [INFO ] Added : 60 causal constraints over 12 iterations in 155 ms. Result :sat
Minimization took 28 ms.
[2022-05-16 16:35:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:00] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 16:35:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:00] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:00] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:35:00] [INFO ] Added : 69 causal constraints over 14 iterations in 129 ms. Result :sat
Minimization took 43 ms.
[2022-05-16 16:35:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:00] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 16:35:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:00] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:00] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2022-05-16 16:35:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2022-05-16 16:35:00] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:35:00] [INFO ] Added : 69 causal constraints over 15 iterations in 153 ms. Result :sat
Minimization took 38 ms.
[2022-05-16 16:35:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:00] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Real]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:00] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2022-05-16 16:35:00] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 16:35:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-16 16:35:00] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2022-05-16 16:35:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2022-05-16 16:35:00] [INFO ] Added : 48 causal constraints over 12 iterations in 172 ms. Result :sat
Minimization took 29 ms.
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 16:35:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:01] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:01] [INFO ] Deduced a trap composed of 10 places in 12 ms of which 0 ms to minimize.
[2022-05-16 16:35:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2022-05-16 16:35:01] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:35:01] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2022-05-16 16:35:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-05-16 16:35:01] [INFO ] Added : 65 causal constraints over 13 iterations in 158 ms. Result :sat
Minimization took 47 ms.
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 16:35:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:01] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:01] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2022-05-16 16:35:01] [INFO ] Deduced a trap composed of 10 places in 8 ms of which 0 ms to minimize.
[2022-05-16 16:35:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 46 ms
[2022-05-16 16:35:01] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 16:35:01] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2022-05-16 16:35:01] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2022-05-16 16:35:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2022-05-16 16:35:01] [INFO ] Added : 70 causal constraints over 14 iterations in 213 ms. Result :sat
Minimization took 48 ms.
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 16:35:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:01] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:01] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2022-05-16 16:35:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-05-16 16:35:01] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:35:01] [INFO ] Added : 70 causal constraints over 14 iterations in 138 ms. Result :sat
Minimization took 47 ms.
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:02] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 16:35:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:02] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:02] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 16:35:02] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:02] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:35:02] [INFO ] Added : 66 causal constraints over 14 iterations in 146 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, -1, 1, 1, 1, 1] Max seen :[4, 0, 0, 4, 0, 0, 0, 0]
Incomplete Parikh walk after 26100 steps, including 3853 resets, run finished after 25 ms. (steps per millisecond=1044 ) properties (out of 8) seen :8 could not realise parikh vector
Incomplete Parikh walk after 19100 steps, including 2750 resets, run finished after 16 ms. (steps per millisecond=1193 ) properties (out of 8) seen :6 could not realise parikh vector
Incomplete Parikh walk after 8000 steps, including 1145 resets, run finished after 7 ms. (steps per millisecond=1142 ) properties (out of 8) seen :4 could not realise parikh vector
Incomplete Parikh walk after 12600 steps, including 1830 resets, run finished after 12 ms. (steps per millisecond=1050 ) properties (out of 8) seen :4 could not realise parikh vector
Incomplete Parikh walk after 13000 steps, including 1868 resets, run finished after 11 ms. (steps per millisecond=1181 ) properties (out of 8) seen :5 could not realise parikh vector
Incomplete Parikh walk after 22600 steps, including 3246 resets, run finished after 21 ms. (steps per millisecond=1076 ) properties (out of 8) seen :4 could not realise parikh vector
Incomplete Parikh walk after 54300 steps, including 7703 resets, run finished after 44 ms. (steps per millisecond=1234 ) properties (out of 8) seen :7 could not realise parikh vector
Incomplete Parikh walk after 7700 steps, including 989 resets, run finished after 7 ms. (steps per millisecond=1100 ) properties (out of 8) seen :5 could not realise parikh vector
Support contains 8 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 73/73 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 73/73 transitions.
Starting structural reductions, iteration 0 : 75/75 places, 73/73 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:35:02] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 16:35:02] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:35:02] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 16:35:02] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 16:35:02] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2022-05-16 16:35:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:35:02] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 16:35:02] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 73/73 transitions.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-00
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:35:02] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1265 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 829 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :2
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:35:02] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 16:35:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:02] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:02] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-16 16:35:02] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 16:35:02] [INFO ] [Real]Added 7 Read/Feed constraints in 5 ms returned sat
[2022-05-16 16:35:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:02] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:02] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-16 16:35:02] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2022-05-16 16:35:02] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 0 ms to minimize.
[2022-05-16 16:35:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2022-05-16 16:35:02] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 16:35:02] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2022-05-16 16:35:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2022-05-16 16:35:02] [INFO ] Added : 60 causal constraints over 12 iterations in 165 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 7700 steps, including 987 resets, run finished after 11 ms. (steps per millisecond=700 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 73/73 transitions.
Graph (complete) has 227 edges and 75 vertex of which 73 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 73 transition count 70
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 72 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 71 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 71 transition count 68
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 70 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 68 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 67 transition count 66
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 67 transition count 62
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 22 place count 63 transition count 62
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 25 place count 63 transition count 62
Applied a total of 25 rules in 13 ms. Remains 63 /75 variables (removed 12) and now considering 62/73 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/75 places, 62/73 transitions.
// Phase 1: matrix 62 rows 63 cols
[2022-05-16 16:35:02] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 155880 resets, run finished after 580 ms. (steps per millisecond=1724 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 1000000 steps, including 96141 resets, run finished after 416 ms. (steps per millisecond=2403 ) properties (out of 1) seen :4
// Phase 1: matrix 62 rows 63 cols
[2022-05-16 16:35:03] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-16 16:35:03] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:03] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-16 16:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:03] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 16:35:03] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-16 16:35:03] [INFO ] [Real]Added 11 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:03] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:03] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-16 16:35:03] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:04] [INFO ] Deduced a trap composed of 14 places in 14 ms of which 0 ms to minimize.
[2022-05-16 16:35:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2022-05-16 16:35:04] [INFO ] Computed and/alt/rep : 56/302/56 causal constraints (skipped 5 transitions) in 15 ms.
[2022-05-16 16:35:04] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2022-05-16 16:35:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-05-16 16:35:04] [INFO ] Added : 53 causal constraints over 11 iterations in 177 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[7]
Incomplete Parikh walk after 25400 steps, including 4682 resets, run finished after 23 ms. (steps per millisecond=1104 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 63/63 places, 62/62 transitions.
Applied a total of 0 rules in 11 ms. Remains 63 /63 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 62/62 transitions.
Starting structural reductions, iteration 0 : 63/63 places, 62/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 63 cols
[2022-05-16 16:35:04] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 16:35:04] [INFO ] Implicit Places using invariants in 32 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
[2022-05-16 16:35:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 62 rows 62 cols
[2022-05-16 16:35:04] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:04] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 62/63 places, 62/62 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 61
Applied a total of 2 rules in 5 ms. Remains 61 /62 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 61 cols
[2022-05-16 16:35:04] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:04] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 61 rows 61 cols
[2022-05-16 16:35:04] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:04] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-16 16:35:04] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 61/63 places, 61/62 transitions.
// Phase 1: matrix 61 rows 61 cols
[2022-05-16 16:35:04] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156075 resets, run finished after 580 ms. (steps per millisecond=1724 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 96247 resets, run finished after 408 ms. (steps per millisecond=2450 ) properties (out of 1) seen :4
// Phase 1: matrix 61 rows 61 cols
[2022-05-16 16:35:05] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 16:35:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:05] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-16 16:35:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:05] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 16:35:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:05] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-16 16:35:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:05] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-16 16:35:05] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-16 16:35:05] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:05] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2022-05-16 16:35:05] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2022-05-16 16:35:05] [INFO ] Deduced a trap composed of 21 places in 14 ms of which 0 ms to minimize.
[2022-05-16 16:35:05] [INFO ] Deduced a trap composed of 9 places in 7 ms of which 0 ms to minimize.
[2022-05-16 16:35:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 81 ms
[2022-05-16 16:35:05] [INFO ] Computed and/alt/rep : 55/300/55 causal constraints (skipped 5 transitions) in 3 ms.
[2022-05-16 16:35:05] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2022-05-16 16:35:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-05-16 16:35:05] [INFO ] Added : 53 causal constraints over 13 iterations in 172 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[7]
Incomplete Parikh walk after 8400 steps, including 1446 resets, run finished after 11 ms. (steps per millisecond=763 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 61 cols
[2022-05-16 16:35:05] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 16:35:05] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 61 rows 61 cols
[2022-05-16 16:35:05] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:05] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-16 16:35:05] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2022-05-16 16:35:05] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 61 rows 61 cols
[2022-05-16 16:35:05] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 16:35:05] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 61/61 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-00 in 3395 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-02
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:35:05] [INFO ] Computed 11 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 1241 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 817 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:35:05] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 16:35:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:05] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:05] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 16:35:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:06] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:06] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 16:35:06] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 16:35:06] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:06] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:35:06] [INFO ] Added : 69 causal constraints over 14 iterations in 128 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 54300 steps, including 7707 resets, run finished after 48 ms. (steps per millisecond=1131 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 73/73 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 75 transition count 70
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 72 transition count 70
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 69 transition count 67
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 67 transition count 67
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 67 transition count 63
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 63 transition count 63
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 63 transition count 63
Applied a total of 26 rules in 9 ms. Remains 63 /75 variables (removed 12) and now considering 63/73 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/75 places, 63/73 transitions.
// Phase 1: matrix 63 rows 63 cols
[2022-05-16 16:35:06] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 156182 resets, run finished after 608 ms. (steps per millisecond=1644 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96158 resets, run finished after 434 ms. (steps per millisecond=2304 ) properties (out of 1) seen :0
// Phase 1: matrix 63 rows 63 cols
[2022-05-16 16:35:07] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-16 16:35:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:07] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:07] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 16:35:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:07] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:07] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:35:07] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 16:35:07] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:07] [INFO ] Computed and/alt/rep : 58/345/58 causal constraints (skipped 4 transitions) in 7 ms.
[2022-05-16 16:35:07] [INFO ] Added : 55 causal constraints over 12 iterations in 146 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 30000 steps, including 3340 resets, run finished after 22 ms. (steps per millisecond=1363 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 63/63 transitions.
Starting structural reductions, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2022-05-16 16:35:07] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 16:35:07] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 63 rows 63 cols
[2022-05-16 16:35:07] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-16 16:35:07] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 16:35:07] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 109 ms to find 1 implicit places.
[2022-05-16 16:35:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 62 cols
[2022-05-16 16:35:07] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:07] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 62/63 places, 63/63 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 62
Applied a total of 2 rules in 5 ms. Remains 61 /62 variables (removed 1) and now considering 62/63 (removed 1) transitions.
// Phase 1: matrix 62 rows 61 cols
[2022-05-16 16:35:07] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 16:35:07] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 62 rows 61 cols
[2022-05-16 16:35:07] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 16:35:07] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 16:35:07] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 61/63 places, 62/63 transitions.
// Phase 1: matrix 62 rows 61 cols
[2022-05-16 16:35:07] [INFO ] Computed 10 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 156313 resets, run finished after 600 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96192 resets, run finished after 421 ms. (steps per millisecond=2375 ) properties (out of 1) seen :0
// Phase 1: matrix 62 rows 61 cols
[2022-05-16 16:35:08] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 16:35:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:08] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 16:35:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:08] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-16 16:35:08] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 16:35:08] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:08] [INFO ] Computed and/alt/rep : 57/342/57 causal constraints (skipped 4 transitions) in 3 ms.
[2022-05-16 16:35:09] [INFO ] Added : 56 causal constraints over 13 iterations in 147 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 31600 steps, including 5876 resets, run finished after 24 ms. (steps per millisecond=1316 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 61/61 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 62/62 transitions.
Starting structural reductions, iteration 0 : 61/61 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 61 cols
[2022-05-16 16:35:09] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-16 16:35:09] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 62 rows 61 cols
[2022-05-16 16:35:09] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:09] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 16:35:09] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2022-05-16 16:35:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 62 rows 61 cols
[2022-05-16 16:35:09] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 16:35:09] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 62/62 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-02 in 3387 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-04
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:35:09] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 797 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:35:09] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 16:35:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:09] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:09] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:35:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:09] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:09] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:35:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 16:35:09] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:09] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-05-16 16:35:09] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:35:09] [INFO ] Added : 69 causal constraints over 15 iterations in 155 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 22600 steps, including 3230 resets, run finished after 19 ms. (steps per millisecond=1189 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 73/73 transitions.
Graph (complete) has 227 edges and 75 vertex of which 73 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 73 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 70 transition count 68
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 70 transition count 67
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 69 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 68 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 66 transition count 66
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 66 transition count 62
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 62 transition count 62
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 27 place count 62 transition count 62
Applied a total of 27 rules in 17 ms. Remains 62 /75 variables (removed 13) and now considering 62/73 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/75 places, 62/73 transitions.
// Phase 1: matrix 62 rows 62 cols
[2022-05-16 16:35:09] [INFO ] Computed 11 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 156514 resets, run finished after 609 ms. (steps per millisecond=1642 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95795 resets, run finished after 419 ms. (steps per millisecond=2386 ) properties (out of 1) seen :0
// Phase 1: matrix 62 rows 62 cols
[2022-05-16 16:35:10] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 16:35:10] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:10] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:10] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 16:35:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:10] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:10] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-16 16:35:10] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 16:35:10] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:10] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 3 ms to minimize.
[2022-05-16 16:35:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2022-05-16 16:35:10] [INFO ] Computed and/alt/rep : 56/324/56 causal constraints (skipped 5 transitions) in 4 ms.
[2022-05-16 16:35:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-16 16:35:11] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2022-05-16 16:35:11] [INFO ] Deduced a trap composed of 21 places in 16 ms of which 0 ms to minimize.
[2022-05-16 16:35:11] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2022-05-16 16:35:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 120 ms
[2022-05-16 16:35:11] [INFO ] Added : 56 causal constraints over 13 iterations in 281 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 19300 steps, including 3431 resets, run finished after 20 ms. (steps per millisecond=965 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 62/62 transitions.
Starting structural reductions, iteration 0 : 62/62 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 62 cols
[2022-05-16 16:35:11] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 16:35:11] [INFO ] Implicit Places using invariants in 37 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
[2022-05-16 16:35:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 61 cols
[2022-05-16 16:35:11] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:11] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 61/62 places, 62/62 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 61
Applied a total of 2 rules in 3 ms. Remains 60 /61 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 60 cols
[2022-05-16 16:35:11] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:11] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 61 rows 60 cols
[2022-05-16 16:35:11] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:11] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 16:35:11] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 60/62 places, 61/62 transitions.
// Phase 1: matrix 61 rows 60 cols
[2022-05-16 16:35:11] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 156251 resets, run finished after 605 ms. (steps per millisecond=1652 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95876 resets, run finished after 419 ms. (steps per millisecond=2386 ) properties (out of 1) seen :0
// Phase 1: matrix 61 rows 60 cols
[2022-05-16 16:35:12] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-16 16:35:12] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:12] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:12] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 16:35:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:12] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-16 16:35:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:12] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-16 16:35:12] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 16:35:12] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:12] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2022-05-16 16:35:12] [INFO ] Deduced a trap composed of 7 places in 7 ms of which 1 ms to minimize.
[2022-05-16 16:35:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 38 ms
[2022-05-16 16:35:12] [INFO ] Computed and/alt/rep : 55/322/55 causal constraints (skipped 5 transitions) in 5 ms.
[2022-05-16 16:35:12] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2022-05-16 16:35:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2022-05-16 16:35:12] [INFO ] Added : 55 causal constraints over 13 iterations in 171 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 20600 steps, including 2380 resets, run finished after 16 ms. (steps per millisecond=1287 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 61/61 transitions.
Starting structural reductions, iteration 0 : 60/60 places, 61/61 transitions.
Applied a total of 0 rules in 9 ms. Remains 60 /60 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 60 cols
[2022-05-16 16:35:12] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 16:35:12] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 61 rows 60 cols
[2022-05-16 16:35:12] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 16:35:12] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 16:35:12] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2022-05-16 16:35:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 60 cols
[2022-05-16 16:35:12] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:12] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 61/61 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-04 in 3555 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-07
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:35:12] [INFO ] Computed 11 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 1267 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 833 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :4
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:35:12] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 16:35:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:12] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:12] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 16:35:12] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 16:35:12] [INFO ] [Real]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:12] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:12] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-16 16:35:12] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2022-05-16 16:35:12] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 16:35:13] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 7 ms to minimize.
[2022-05-16 16:35:13] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:35:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2022-05-16 16:35:13] [INFO ] Added : 48 causal constraints over 12 iterations in 201 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 13000 steps, including 1881 resets, run finished after 13 ms. (steps per millisecond=1000 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 73/73 transitions.
Graph (complete) has 227 edges and 75 vertex of which 73 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 73 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 71 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 71 transition count 68
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 70 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 68 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 67 transition count 66
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 67 transition count 62
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 22 place count 63 transition count 62
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 63 transition count 62
Applied a total of 25 rules in 9 ms. Remains 63 /75 variables (removed 12) and now considering 62/73 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/75 places, 62/73 transitions.
// Phase 1: matrix 62 rows 63 cols
[2022-05-16 16:35:13] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 125199 resets, run finished after 546 ms. (steps per millisecond=1831 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 83428 resets, run finished after 419 ms. (steps per millisecond=2386 ) properties (out of 1) seen :4
// Phase 1: matrix 62 rows 63 cols
[2022-05-16 16:35:14] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 16:35:14] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-16 16:35:14] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-16 16:35:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:14] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 16:35:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:14] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:14] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-16 16:35:14] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-16 16:35:14] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:14] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2022-05-16 16:35:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2022-05-16 16:35:14] [INFO ] Computed and/alt/rep : 56/302/56 causal constraints (skipped 5 transitions) in 2 ms.
[2022-05-16 16:35:14] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:35:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2022-05-16 16:35:14] [INFO ] Added : 52 causal constraints over 12 iterations in 140 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 5300 steps, including 753 resets, run finished after 8 ms. (steps per millisecond=662 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 63/63 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 62/62 transitions.
Starting structural reductions, iteration 0 : 63/63 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 63 cols
[2022-05-16 16:35:14] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 16:35:14] [INFO ] Implicit Places using invariants in 37 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
[2022-05-16 16:35:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 62 cols
[2022-05-16 16:35:14] [INFO ] Computed 10 place invariants in 19 ms
[2022-05-16 16:35:14] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 62/63 places, 62/62 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 61
Applied a total of 2 rules in 3 ms. Remains 61 /62 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 61 cols
[2022-05-16 16:35:14] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 16:35:14] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 61 rows 61 cols
[2022-05-16 16:35:14] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:14] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-16 16:35:14] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 61/63 places, 61/62 transitions.
// Phase 1: matrix 61 rows 61 cols
[2022-05-16 16:35:14] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 125100 resets, run finished after 545 ms. (steps per millisecond=1834 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 83318 resets, run finished after 416 ms. (steps per millisecond=2403 ) properties (out of 1) seen :4
// Phase 1: matrix 61 rows 61 cols
[2022-05-16 16:35:15] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 16:35:15] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:15] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:15] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 16:35:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:15] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:15] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-16 16:35:15] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-16 16:35:15] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2022-05-16 16:35:15] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2022-05-16 16:35:15] [INFO ] Deduced a trap composed of 20 places in 13 ms of which 1 ms to minimize.
[2022-05-16 16:35:15] [INFO ] Deduced a trap composed of 22 places in 14 ms of which 0 ms to minimize.
[2022-05-16 16:35:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 61 ms
[2022-05-16 16:35:15] [INFO ] Computed and/alt/rep : 55/300/55 causal constraints (skipped 5 transitions) in 4 ms.
[2022-05-16 16:35:15] [INFO ] Added : 54 causal constraints over 13 iterations in 117 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 3700 steps, including 505 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 61 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 61/61 transitions.
Starting structural reductions, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 61 cols
[2022-05-16 16:35:15] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:16] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 61 rows 61 cols
[2022-05-16 16:35:16] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 16:35:16] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-16 16:35:16] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2022-05-16 16:35:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 61 cols
[2022-05-16 16:35:16] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:16] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 61/61 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-07 in 3252 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-10
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:35:16] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1248 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 830 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:35:16] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 16:35:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:16] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:16] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:35:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:16] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:16] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 16:35:16] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 16:35:16] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:16] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2022-05-16 16:35:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2022-05-16 16:35:16] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:35:16] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2022-05-16 16:35:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-05-16 16:35:16] [INFO ] Added : 65 causal constraints over 13 iterations in 155 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 12600 steps, including 1813 resets, run finished after 11 ms. (steps per millisecond=1145 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 73/73 transitions.
Graph (complete) has 227 edges and 75 vertex of which 73 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 73 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 71 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 71 transition count 68
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 70 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 68 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 66 transition count 66
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 66 transition count 62
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 62 transition count 62
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 27 place count 62 transition count 62
Applied a total of 27 rules in 8 ms. Remains 62 /75 variables (removed 13) and now considering 62/73 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/75 places, 62/73 transitions.
// Phase 1: matrix 62 rows 62 cols
[2022-05-16 16:35:16] [INFO ] Computed 11 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 156475 resets, run finished after 603 ms. (steps per millisecond=1658 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96113 resets, run finished after 425 ms. (steps per millisecond=2352 ) properties (out of 1) seen :0
// Phase 1: matrix 62 rows 62 cols
[2022-05-16 16:35:17] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 16:35:17] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:17] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:17] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 16:35:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:17] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:17] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-16 16:35:17] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 16:35:17] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:17] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 0 ms to minimize.
[2022-05-16 16:35:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2022-05-16 16:35:17] [INFO ] Computed and/alt/rep : 56/329/56 causal constraints (skipped 5 transitions) in 4 ms.
[2022-05-16 16:35:17] [INFO ] Added : 52 causal constraints over 11 iterations in 109 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 17300 steps, including 2720 resets, run finished after 19 ms. (steps per millisecond=910 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 62/62 transitions.
Starting structural reductions, iteration 0 : 62/62 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 62 cols
[2022-05-16 16:35:17] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 16:35:17] [INFO ] Implicit Places using invariants in 33 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
[2022-05-16 16:35:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 61 cols
[2022-05-16 16:35:17] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 16:35:17] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 61/62 places, 62/62 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 61
Applied a total of 2 rules in 3 ms. Remains 60 /61 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 60 cols
[2022-05-16 16:35:17] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:17] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 61 rows 60 cols
[2022-05-16 16:35:17] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:17] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 16:35:17] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 60/62 places, 61/62 transitions.
// Phase 1: matrix 61 rows 60 cols
[2022-05-16 16:35:17] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156387 resets, run finished after 609 ms. (steps per millisecond=1642 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96309 resets, run finished after 423 ms. (steps per millisecond=2364 ) properties (out of 1) seen :0
// Phase 1: matrix 61 rows 60 cols
[2022-05-16 16:35:18] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 16:35:18] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:19] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:19] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 16:35:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:19] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-16 16:35:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:19] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-16 16:35:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 16:35:19] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:19] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 4 ms to minimize.
[2022-05-16 16:35:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2022-05-16 16:35:19] [INFO ] Computed and/alt/rep : 55/327/55 causal constraints (skipped 5 transitions) in 4 ms.
[2022-05-16 16:35:19] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2022-05-16 16:35:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2022-05-16 16:35:19] [INFO ] Added : 52 causal constraints over 12 iterations in 155 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 18100 steps, including 3376 resets, run finished after 21 ms. (steps per millisecond=861 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 61/61 transitions.
Starting structural reductions, iteration 0 : 60/60 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 60 cols
[2022-05-16 16:35:19] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 16:35:19] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 61 rows 60 cols
[2022-05-16 16:35:19] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 16:35:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 16:35:19] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2022-05-16 16:35:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 60 cols
[2022-05-16 16:35:19] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:19] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 61/61 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-10 in 3324 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-12
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:35:19] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1224 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 802 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:35:19] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 16:35:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:19] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:19] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 16:35:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:19] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:19] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-16 16:35:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 16:35:19] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:19] [INFO ] Deduced a trap composed of 13 places in 14 ms of which 1 ms to minimize.
[2022-05-16 16:35:19] [INFO ] Deduced a trap composed of 10 places in 8 ms of which 0 ms to minimize.
[2022-05-16 16:35:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 35 ms
[2022-05-16 16:35:19] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 16:35:19] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2022-05-16 16:35:19] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2022-05-16 16:35:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 68 ms
[2022-05-16 16:35:19] [INFO ] Added : 70 causal constraints over 14 iterations in 211 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 8000 steps, including 1124 resets, run finished after 9 ms. (steps per millisecond=888 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 73/73 transitions.
Graph (complete) has 227 edges and 75 vertex of which 73 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 73 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 70 transition count 68
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 70 transition count 67
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 69 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 68 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 66 transition count 66
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 66 transition count 62
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 62 transition count 62
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 62 transition count 62
Applied a total of 26 rules in 8 ms. Remains 62 /75 variables (removed 13) and now considering 62/73 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/75 places, 62/73 transitions.
// Phase 1: matrix 62 rows 62 cols
[2022-05-16 16:35:19] [INFO ] Computed 11 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 155950 resets, run finished after 598 ms. (steps per millisecond=1672 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96030 resets, run finished after 422 ms. (steps per millisecond=2369 ) properties (out of 1) seen :0
// Phase 1: matrix 62 rows 62 cols
[2022-05-16 16:35:20] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-16 16:35:20] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:20] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:20] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 16:35:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:20] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-16 16:35:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:20] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-16 16:35:20] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-16 16:35:20] [INFO ] [Nat]Added 13 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:20] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-16 16:35:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2022-05-16 16:35:20] [INFO ] Computed and/alt/rep : 57/333/57 causal constraints (skipped 4 transitions) in 4 ms.
[2022-05-16 16:35:21] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2022-05-16 16:35:21] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2022-05-16 16:35:21] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2022-05-16 16:35:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 113 ms
[2022-05-16 16:35:21] [INFO ] Added : 43 causal constraints over 10 iterations in 210 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 37600 steps, including 7022 resets, run finished after 32 ms. (steps per millisecond=1175 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 62/62 transitions.
Starting structural reductions, iteration 0 : 62/62 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 62 cols
[2022-05-16 16:35:21] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-16 16:35:21] [INFO ] Implicit Places using invariants in 35 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
[2022-05-16 16:35:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 61 cols
[2022-05-16 16:35:21] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 16:35:21] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 61/62 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2022-05-16 16:35:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 62 rows 61 cols
[2022-05-16 16:35:21] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 16:35:21] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 61/62 places, 62/62 transitions.
// Phase 1: matrix 62 rows 61 cols
[2022-05-16 16:35:21] [INFO ] Computed 10 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 156341 resets, run finished after 601 ms. (steps per millisecond=1663 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95874 resets, run finished after 424 ms. (steps per millisecond=2358 ) properties (out of 1) seen :0
// Phase 1: matrix 62 rows 61 cols
[2022-05-16 16:35:22] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-16 16:35:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:22] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:22] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:35:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:22] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-16 16:35:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:22] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 16:35:22] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-16 16:35:22] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 16 places in 14 ms of which 0 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 20 places in 14 ms of which 0 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 24 places in 15 ms of which 0 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 0 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 116 ms
[2022-05-16 16:35:22] [INFO ] Computed and/alt/rep : 57/332/57 causal constraints (skipped 4 transitions) in 3 ms.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 25 places in 18 ms of which 1 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 1 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 96 ms
[2022-05-16 16:35:22] [INFO ] Added : 56 causal constraints over 15 iterations in 267 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 22300 steps, including 4055 resets, run finished after 21 ms. (steps per millisecond=1061 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 61/61 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 62/62 transitions.
Starting structural reductions, iteration 0 : 61/61 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 61 cols
[2022-05-16 16:35:22] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 16:35:22] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 62 rows 61 cols
[2022-05-16 16:35:22] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-16 16:35:22] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-16 16:35:23] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2022-05-16 16:35:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 61 cols
[2022-05-16 16:35:23] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:23] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 62/62 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-12 in 3617 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-13
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:35:23] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1252 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:35:23] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 16:35:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:23] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:23] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 16:35:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:23] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:23] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 16:35:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 16:35:23] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:23] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2022-05-16 16:35:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2022-05-16 16:35:23] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:35:23] [INFO ] Added : 70 causal constraints over 14 iterations in 135 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 19100 steps, including 2719 resets, run finished after 17 ms. (steps per millisecond=1123 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 73/73 transitions.
Graph (complete) has 227 edges and 75 vertex of which 73 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 73 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 70 transition count 68
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 70 transition count 67
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 69 transition count 67
Performed 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 14 place count 67 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 65 transition count 65
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 65 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 63 transition count 63
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 63 transition count 63
Applied a total of 24 rules in 8 ms. Remains 63 /75 variables (removed 12) and now considering 63/73 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/75 places, 63/73 transitions.
// Phase 1: matrix 63 rows 63 cols
[2022-05-16 16:35:23] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156317 resets, run finished after 601 ms. (steps per millisecond=1663 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96150 resets, run finished after 422 ms. (steps per millisecond=2369 ) properties (out of 1) seen :0
// Phase 1: matrix 63 rows 63 cols
[2022-05-16 16:35:24] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 16:35:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:24] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:24] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 16:35:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:24] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:24] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-16 16:35:24] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 16:35:24] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:24] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 0 ms to minimize.
[2022-05-16 16:35:24] [INFO ] Deduced a trap composed of 6 places in 10 ms of which 0 ms to minimize.
[2022-05-16 16:35:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 37 ms
[2022-05-16 16:35:24] [INFO ] Computed and/alt/rep : 59/341/59 causal constraints (skipped 3 transitions) in 4 ms.
[2022-05-16 16:35:24] [INFO ] Added : 58 causal constraints over 14 iterations in 163 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 21800 steps, including 3571 resets, run finished after 24 ms. (steps per millisecond=908 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 63/63 transitions.
Starting structural reductions, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2022-05-16 16:35:24] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 16:35:24] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 63 rows 63 cols
[2022-05-16 16:35:24] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-16 16:35:24] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 16:35:24] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2022-05-16 16:35:24] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 63 rows 63 cols
[2022-05-16 16:35:24] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 16:35:24] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 63/63 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-13 in 1895 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-14
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:35:24] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1267 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 73 rows 75 cols
[2022-05-16 16:35:24] [INFO ] Computed 11 place invariants in 6 ms
[2022-05-16 16:35:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:24] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:25] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:35:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:25] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:25] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 16:35:25] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 16:35:25] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:25] [INFO ] Computed and/alt/rep : 72/297/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:35:25] [INFO ] Added : 66 causal constraints over 14 iterations in 131 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 26100 steps, including 3858 resets, run finished after 20 ms. (steps per millisecond=1305 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 73/73 transitions.
Graph (complete) has 227 edges and 75 vertex of which 73 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 73 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 70 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 68 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 66 transition count 66
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 66 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 64 transition count 64
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 64 transition count 64
Applied a total of 23 rules in 11 ms. Remains 64 /75 variables (removed 11) and now considering 64/73 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/75 places, 64/73 transitions.
// Phase 1: matrix 64 rows 64 cols
[2022-05-16 16:35:25] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156209 resets, run finished after 592 ms. (steps per millisecond=1689 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96029 resets, run finished after 416 ms. (steps per millisecond=2403 ) properties (out of 1) seen :0
// Phase 1: matrix 64 rows 64 cols
[2022-05-16 16:35:26] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 16:35:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:26] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:26] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 16:35:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:26] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:26] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:35:26] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 16:35:26] [INFO ] [Nat]Added 14 Read/Feed constraints in 3 ms returned sat
[2022-05-16 16:35:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-16 16:35:26] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 0 ms to minimize.
[2022-05-16 16:35:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 49 ms
[2022-05-16 16:35:26] [INFO ] Computed and/alt/rep : 59/341/59 causal constraints (skipped 4 transitions) in 5 ms.
[2022-05-16 16:35:26] [INFO ] Added : 50 causal constraints over 10 iterations in 91 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 30100 steps, including 5392 resets, run finished after 30 ms. (steps per millisecond=1003 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 64/64 transitions.
Starting structural reductions, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 64 cols
[2022-05-16 16:35:26] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 16:35:26] [INFO ] Implicit Places using invariants in 43 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
[2022-05-16 16:35:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 63 cols
[2022-05-16 16:35:26] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:26] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 63/64 places, 64/64 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 63
Applied a total of 2 rules in 2 ms. Remains 62 /63 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 62 cols
[2022-05-16 16:35:26] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 16:35:26] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 63 rows 62 cols
[2022-05-16 16:35:26] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:26] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 16:35:26] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 62/64 places, 63/64 transitions.
// Phase 1: matrix 63 rows 62 cols
[2022-05-16 16:35:26] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156284 resets, run finished after 604 ms. (steps per millisecond=1655 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96085 resets, run finished after 420 ms. (steps per millisecond=2380 ) properties (out of 1) seen :0
// Phase 1: matrix 63 rows 62 cols
[2022-05-16 16:35:27] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 16:35:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:27] [INFO ] [Real]Absence check using 3 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:27] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-16 16:35:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:27] [INFO ] [Nat]Absence check using 3 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:27] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-16 16:35:27] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 16:35:27] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:27] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-16 16:35:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2022-05-16 16:35:27] [INFO ] Computed and/alt/rep : 58/339/58 causal constraints (skipped 4 transitions) in 3 ms.
[2022-05-16 16:35:28] [INFO ] Added : 55 causal constraints over 12 iterations in 125 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 14300 steps, including 2315 resets, run finished after 14 ms. (steps per millisecond=1021 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 63/63 transitions.
Starting structural reductions, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2022-05-16 16:35:28] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:28] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 63 rows 62 cols
[2022-05-16 16:35:28] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:28] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 16:35:28] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2022-05-16 16:35:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 63 rows 62 cols
[2022-05-16 16:35:28] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 16:35:28] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 63/63 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-14 in 3290 ms.
[2022-05-16 16:35:28] [INFO ] Flatten gal took : 31 ms
[2022-05-16 16:35:28] [INFO ] Applying decomposition
[2022-05-16 16:35:28] [INFO ] Flatten gal took : 10 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/graph11250583020733196486.txt, -o, /tmp/graph11250583020733196486.bin, -w, /tmp/graph11250583020733196486.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/graph11250583020733196486.bin, -l, -1, -v, -w, /tmp/graph11250583020733196486.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 16:35:28] [INFO ] Decomposing Gal with order
[2022-05-16 16:35:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:35:28] [INFO ] Removed a total of 31 redundant transitions.
[2022-05-16 16:35:28] [INFO ] Flatten gal took : 35 ms
[2022-05-16 16:35:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 6 ms.
[2022-05-16 16:35:28] [INFO ] Time to serialize gal into /tmp/UpperBounds9481442503188015447.gal : 5 ms
[2022-05-16 16:35:28] [INFO ] Time to serialize properties into /tmp/UpperBounds4105643651467516452.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/UpperBounds9481442503188015447.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds4105643651467516452.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/UpperBounds9481442503188015447.gal -t CGAL -reachable-file /tmp/UpperBounds4105643651467516452.prop --nowitness
Loading property file /tmp/UpperBounds4105643651467516452.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,777417,1.62499,53860,1417,614,111455,1721,316,74926,110,7942,0
Total reachable state count : 777417

Verifying 8 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 16
Bounds property DoubleExponent-PT-003-UpperBounds-00 :0 <= i0.u0.p108 <= 16
FORMULA DoubleExponent-PT-003-UpperBounds-00 16 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-00,0,1.6808,53860,1,0,111455,2145,422,74926,141,13601,535
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-02 :0 <= i2.u7.p149 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-02,0,1.68148,53860,1,0,111455,2146,450,74926,150,13604,660
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-04 :0 <= i3.u8.p156 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-04,0,1.68419,53860,1,0,111455,2215,465,74926,150,13788,753
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DoubleExponent-PT-003-UpperBounds-07 :0 <= u11.p55 <= 4
FORMULA DoubleExponent-PT-003-UpperBounds-07 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-07,0,1.69228,53860,1,0,111455,2517,476,74926,164,15244,843
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-10 :0 <= i0.u3.p115 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-10,0,1.69293,53860,1,0,111455,2558,494,74926,164,15332,900
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-12 :0 <= i6.u16.p93 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-12,0,1.69439,53860,1,0,111455,2563,514,74926,169,15356,1004
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-13 :0 <= i2.u5.p96 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-13,0,1.69495,53860,1,0,111455,2592,531,74926,169,15417,1121
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-14 :0 <= i0.u6.p137 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-14,0,1.69531,53860,1,0,111455,2617,548,74926,169,15473,1144

BK_STOP 1652718931372

--------------------
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-003"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is DoubleExponent-PT-003, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r089-tall-165260117600067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;