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-165260117600070.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-004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r089-tall-165260117600070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 8.9K Apr 29 13:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 29 13:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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.6K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 67K 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-004-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652718892036

Running Version 0
[2022-05-16 16:34:53] [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:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 16:34:53] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2022-05-16 16:34:53] [INFO ] Transformed 216 places.
[2022-05-16 16:34:53] [INFO ] Transformed 198 transitions.
[2022-05-16 16:34:53] [INFO ] Parsed PT model containing 216 places and 198 transitions in 85 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 198 rows 216 cols
[2022-05-16 16:34:53] [INFO ] Computed 24 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 330 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :10
FORMULA DoubleExponent-PT-004-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-004-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 292 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :11
FORMULA DoubleExponent-PT-004-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-004-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10000 steps, including 295 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 274 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10000 steps, including 296 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :8
// Phase 1: matrix 198 rows 216 cols
[2022-05-16 16:34:53] [INFO ] Computed 24 place invariants in 20 ms
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 7 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 74 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 3 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 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 57 ms returned sat
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 3 ms to minimize.
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2022-05-16 16:34:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 512 ms
[2022-05-16 16:34:54] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 17 ms.
[2022-05-16 16:34:55] [INFO ] Added : 69 causal constraints over 14 iterations in 364 ms. Result :sat
Minimization took 84 ms.
[2022-05-16 16:34:55] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:55] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2022-05-16 16:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:55] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2022-05-16 16:34:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-05-16 16:34:55] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2022-05-16 16:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:55] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2022-05-16 16:34:55] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:34:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2022-05-16 16:34:55] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 39 ms.
[2022-05-16 16:34:56] [INFO ] Added : 177 causal constraints over 36 iterations in 811 ms. Result :sat
Minimization took 93 ms.
[2022-05-16 16:34:56] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:56] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 1 ms returned unsat
[2022-05-16 16:34:56] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:56] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2022-05-16 16:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:56] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2022-05-16 16:34:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:56] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2022-05-16 16:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:56] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2022-05-16 16:34:56] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:34:57] [INFO ] Deduced a trap composed of 61 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:34:57] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2022-05-16 16:34:57] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
[2022-05-16 16:34:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 228 ms
[2022-05-16 16:34:57] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-16 16:34:57] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:34:57] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:34:58] [INFO ] Deduced a trap composed of 96 places in 64 ms of which 1 ms to minimize.
[2022-05-16 16:34:58] [INFO ] Deduced a trap composed of 102 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:34:58] [INFO ] Deduced a trap composed of 103 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:34:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 382 ms
[2022-05-16 16:34:58] [INFO ] Added : 168 causal constraints over 34 iterations in 1083 ms. Result :sat
Minimization took 135 ms.
[2022-05-16 16:34:58] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:34:58] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2022-05-16 16:34:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:58] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-05-16 16:34:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:58] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2022-05-16 16:34:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:58] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2022-05-16 16:34:58] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:34:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2022-05-16 16:34:58] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-16 16:34:59] [INFO ] Added : 115 causal constraints over 23 iterations in 430 ms. Result :sat
Minimization took 78 ms.
[2022-05-16 16:34:59] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 7 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 59 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 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 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 60 ms returned sat
[2022-05-16 16:34:59] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-16 16:35:00] [INFO ] Added : 197 causal constraints over 41 iterations in 1000 ms. Result :sat
Minimization took 81 ms.
[2022-05-16 16:35:00] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 1 ms returned unsat
[2022-05-16 16:35:00] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 4 ms returned unsat
[2022-05-16 16:35:00] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 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 51 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 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 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 61 ms returned sat
[2022-05-16 16:35:00] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:35:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2022-05-16 16:35:00] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-16 16:35:01] [INFO ] Added : 190 causal constraints over 38 iterations in 911 ms. Result :sat
Minimization took 83 ms.
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned unsat
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned unsat
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 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 55 ms returned sat
[2022-05-16 16:35:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-16 16:35:02] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 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 65 ms returned sat
[2022-05-16 16:35:02] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-16 16:35:02] [INFO ] Added : 179 causal constraints over 36 iterations in 773 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 3, 1, 1, 1, 1, -1, 1, 1, 1] Max seen :[4, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0]
FORMULA DoubleExponent-PT-004-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-004-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-004-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-004-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-004-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 199300 steps, including 7014 resets, run finished after 190 ms. (steps per millisecond=1048 ) properties (out of 7) seen :4 could not realise parikh vector
Incomplete Parikh walk after 185400 steps, including 6486 resets, run finished after 159 ms. (steps per millisecond=1166 ) properties (out of 7) seen :4 could not realise parikh vector
Incomplete Parikh walk after 218300 steps, including 7639 resets, run finished after 184 ms. (steps per millisecond=1186 ) properties (out of 7) seen :5 could not realise parikh vector
Incomplete Parikh walk after 97400 steps, including 3610 resets, run finished after 67 ms. (steps per millisecond=1453 ) properties (out of 7) seen :6 could not realise parikh vector
Incomplete Parikh walk after 58300 steps, including 2042 resets, run finished after 43 ms. (steps per millisecond=1355 ) properties (out of 7) seen :4 could not realise parikh vector
Incomplete Parikh walk after 254700 steps, including 8926 resets, run finished after 177 ms. (steps per millisecond=1438 ) properties (out of 7) seen :5 could not realise parikh vector
Incomplete Parikh walk after 41100 steps, including 1457 resets, run finished after 29 ms. (steps per millisecond=1417 ) properties (out of 7) seen :4 could not realise parikh vector
Support contains 7 out of 216 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 216/216 places, 198/198 transitions.
Graph (complete) has 360 edges and 216 vertex of which 213 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 213 transition count 157
Reduce places removed 41 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 45 rules applied. Total rules applied 87 place count 172 transition count 153
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 91 place count 168 transition count 153
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 91 place count 168 transition count 145
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 107 place count 160 transition count 145
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 173 place count 127 transition count 112
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 183 place count 122 transition count 112
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 122 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 185 place count 121 transition count 111
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 200 place count 121 transition count 96
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 215 place count 106 transition count 96
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 230 place count 106 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 105 transition count 95
Applied a total of 231 rules in 125 ms. Remains 105 /216 variables (removed 111) and now considering 95/198 (removed 103) transitions.
Finished structural reductions, in 1 iterations. Remains : 105/216 places, 95/198 transitions.
// Phase 1: matrix 95 rows 105 cols
[2022-05-16 16:35:03] [INFO ] Computed 22 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 112908 resets, run finished after 795 ms. (steps per millisecond=1257 ) properties (out of 7) seen :9
Incomplete Best-First random walk after 1000000 steps, including 77480 resets, run finished after 547 ms. (steps per millisecond=1828 ) properties (out of 7) seen :9
Incomplete Best-First random walk after 1000000 steps, including 77910 resets, run finished after 549 ms. (steps per millisecond=1821 ) properties (out of 7) seen :9
Incomplete Best-First random walk after 1000000 steps, including 77907 resets, run finished after 481 ms. (steps per millisecond=2079 ) properties (out of 7) seen :9
Incomplete Best-First random walk after 1000001 steps, including 77577 resets, run finished after 495 ms. (steps per millisecond=2020 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77717 resets, run finished after 482 ms. (steps per millisecond=2074 ) properties (out of 7) seen :9
Incomplete Best-First random walk after 1000000 steps, including 77908 resets, run finished after 473 ms. (steps per millisecond=2114 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77519 resets, run finished after 468 ms. (steps per millisecond=2136 ) properties (out of 7) seen :8
// Phase 1: matrix 95 rows 105 cols
[2022-05-16 16:35:08] [INFO ] Computed 22 place invariants in 6 ms
[2022-05-16 16:35:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Real]Absence check using 3 positive and 19 generalized place invariants in 4 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 23 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 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Nat]Absence check using 3 positive and 19 generalized place invariants in 4 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 23 ms returned sat
[2022-05-16 16:35:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 16:35:08] [INFO ] [Nat]Added 10 Read/Feed constraints in 9 ms returned sat
[2022-05-16 16:35:08] [INFO ] Computed and/alt/rep : 93/439/93 causal constraints (skipped 1 transitions) in 6 ms.
[2022-05-16 16:35:08] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2022-05-16 16:35:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2022-05-16 16:35:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2022-05-16 16:35:08] [INFO ] Added : 37 causal constraints over 8 iterations in 181 ms. Result :sat
Minimization took 41 ms.
[2022-05-16 16:35:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Real]Absence check using 3 positive and 19 generalized place invariants in 4 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 27 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 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Nat]Absence check using 3 positive and 19 generalized place invariants in 4 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 29 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:08] [INFO ] Computed and/alt/rep : 93/439/93 causal constraints (skipped 1 transitions) in 8 ms.
[2022-05-16 16:35:08] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2022-05-16 16:35:09] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2022-05-16 16:35:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2022-05-16 16:35:09] [INFO ] Added : 81 causal constraints over 17 iterations in 342 ms. Result :sat
Minimization took 67 ms.
[2022-05-16 16:35:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:09] [INFO ] [Real]Absence check using 3 positive and 19 generalized place invariants in 2 ms returned unsat
[2022-05-16 16:35:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:09] [INFO ] [Real]Absence check using 3 positive and 19 generalized place invariants in 4 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 22 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 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:09] [INFO ] [Nat]Absence check using 3 positive and 19 generalized place invariants in 5 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 23 ms returned sat
[2022-05-16 16:35:09] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2022-05-16 16:35:09] [INFO ] Computed and/alt/rep : 93/439/93 causal constraints (skipped 1 transitions) in 6 ms.
[2022-05-16 16:35:09] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2022-05-16 16:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2022-05-16 16:35:09] [INFO ] Added : 67 causal constraints over 15 iterations in 263 ms. Result :sat
Minimization took 48 ms.
[2022-05-16 16:35:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:09] [INFO ] [Real]Absence check using 3 positive and 19 generalized place invariants in 4 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 22 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 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:09] [INFO ] [Nat]Absence check using 3 positive and 19 generalized place invariants in 5 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 27 ms returned sat
[2022-05-16 16:35:09] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:09] [INFO ] Computed and/alt/rep : 93/439/93 causal constraints (skipped 1 transitions) in 6 ms.
[2022-05-16 16:35:09] [INFO ] Deduced a trap composed of 16 places in 16 ms of which 1 ms to minimize.
[2022-05-16 16:35:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-05-16 16:35:10] [INFO ] Added : 93 causal constraints over 19 iterations in 357 ms. Result :sat
Minimization took 84 ms.
[2022-05-16 16:35:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:10] [INFO ] [Real]Absence check using 3 positive and 19 generalized place invariants in 3 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 30 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 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:10] [INFO ] [Nat]Absence check using 3 positive and 19 generalized place invariants in 6 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 25 ms returned sat
[2022-05-16 16:35:10] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2022-05-16 16:35:10] [INFO ] Computed and/alt/rep : 93/439/93 causal constraints (skipped 1 transitions) in 8 ms.
[2022-05-16 16:35:10] [INFO ] Added : 61 causal constraints over 13 iterations in 177 ms. Result :sat
Minimization took 42 ms.
[2022-05-16 16:35:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:10] [INFO ] [Real]Absence check using 3 positive and 19 generalized place invariants in 4 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 24 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 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:10] [INFO ] [Nat]Absence check using 3 positive and 19 generalized place invariants in 5 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 25 ms returned sat
[2022-05-16 16:35:10] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2022-05-16 16:35:10] [INFO ] Computed and/alt/rep : 93/439/93 causal constraints (skipped 1 transitions) in 6 ms.
[2022-05-16 16:35:10] [INFO ] Added : 87 causal constraints over 18 iterations in 316 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 1, -1, 1] Max seen :[4, 0, 1, 0, 0, 4, 0]
FORMULA DoubleExponent-PT-004-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 77400 steps, including 10419 resets, run finished after 67 ms. (steps per millisecond=1155 ) properties (out of 6) seen :5 could not realise parikh vector
Incomplete Parikh walk after 45200 steps, including 6057 resets, run finished after 38 ms. (steps per millisecond=1189 ) properties (out of 6) seen :5 could not realise parikh vector
Incomplete Parikh walk after 76500 steps, including 10269 resets, run finished after 64 ms. (steps per millisecond=1195 ) properties (out of 6) seen :6 could not realise parikh vector
Incomplete Parikh walk after 14300 steps, including 1919 resets, run finished after 11 ms. (steps per millisecond=1300 ) properties (out of 6) seen :4 could not realise parikh vector
Incomplete Parikh walk after 67500 steps, including 8557 resets, run finished after 50 ms. (steps per millisecond=1350 ) properties (out of 6) seen :7 could not realise parikh vector
Incomplete Parikh walk after 5300 steps, including 715 resets, run finished after 4 ms. (steps per millisecond=1325 ) properties (out of 6) seen :4 could not realise parikh vector
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 95/95 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 94
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 104 transition count 94
Applied a total of 3 rules in 13 ms. Remains 104 /105 variables (removed 1) and now considering 94/95 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 104/105 places, 94/95 transitions.
// Phase 1: matrix 94 rows 104 cols
[2022-05-16 16:35:11] [INFO ] Computed 22 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 112863 resets, run finished after 605 ms. (steps per millisecond=1652 ) properties (out of 6) seen :7
Incomplete Best-First random walk after 1000000 steps, including 77773 resets, run finished after 460 ms. (steps per millisecond=2173 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77636 resets, run finished after 471 ms. (steps per millisecond=2123 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77768 resets, run finished after 485 ms. (steps per millisecond=2061 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000001 steps, including 77706 resets, run finished after 465 ms. (steps per millisecond=2150 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000001 steps, including 77733 resets, run finished after 463 ms. (steps per millisecond=2159 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77619 resets, run finished after 462 ms. (steps per millisecond=2164 ) properties (out of 6) seen :8
// Phase 1: matrix 94 rows 104 cols
[2022-05-16 16:35:14] [INFO ] Computed 22 place invariants in 7 ms
[2022-05-16 16:35:14] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:14] [INFO ] [Real]Absence check using 3 positive and 19 generalized place invariants in 3 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 24 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 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:14] [INFO ] [Nat]Absence check using 3 positive and 19 generalized place invariants in 4 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 24 ms returned sat
[2022-05-16 16:35:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 16:35:14] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:14] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2022-05-16 16:35:14] [INFO ] Deduced a trap composed of 27 places in 22 ms of which 0 ms to minimize.
[2022-05-16 16:35:14] [INFO ] Deduced a trap composed of 41 places in 26 ms of which 1 ms to minimize.
[2022-05-16 16:35:14] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 0 ms to minimize.
[2022-05-16 16:35:14] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:35:14] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 0 ms to minimize.
[2022-05-16 16:35:14] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2022-05-16 16:35:15] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2022-05-16 16:35:15] [INFO ] Deduced a trap composed of 33 places in 24 ms of which 0 ms to minimize.
[2022-05-16 16:35:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 324 ms
[2022-05-16 16:35:15] [INFO ] Computed and/alt/rep : 87/411/87 causal constraints (skipped 6 transitions) in 5 ms.
[2022-05-16 16:35:15] [INFO ] Added : 79 causal constraints over 16 iterations in 223 ms. Result :sat
Minimization took 81 ms.
[2022-05-16 16:35:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:15] [INFO ] [Real]Absence check using 3 positive and 19 generalized place invariants in 3 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 22 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 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:15] [INFO ] [Nat]Absence check using 3 positive and 19 generalized place invariants in 4 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 21 ms returned sat
[2022-05-16 16:35:15] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:15] [INFO ] Deduced a trap composed of 16 places in 13 ms of which 0 ms to minimize.
[2022-05-16 16:35:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2022-05-16 16:35:15] [INFO ] Computed and/alt/rep : 87/411/87 causal constraints (skipped 6 transitions) in 5 ms.
[2022-05-16 16:35:15] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2022-05-16 16:35:15] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 4 ms to minimize.
[2022-05-16 16:35:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2022-05-16 16:35:15] [INFO ] Added : 87 causal constraints over 19 iterations in 354 ms. Result :sat
Minimization took 89 ms.
[2022-05-16 16:35:15] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:15] [INFO ] [Real]Absence check using 3 positive and 19 generalized place invariants in 3 ms returned sat
[2022-05-16 16:35:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:16] [INFO ] [Real]Absence check using state equation in 24 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 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:16] [INFO ] [Nat]Absence check using 3 positive and 19 generalized place invariants in 3 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 26 ms returned sat
[2022-05-16 16:35:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2022-05-16 16:35:16] [INFO ] Computed and/alt/rep : 87/411/87 causal constraints (skipped 6 transitions) in 6 ms.
[2022-05-16 16:35:16] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2022-05-16 16:35:16] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2022-05-16 16:35:16] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2022-05-16 16:35:16] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2022-05-16 16:35:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 184 ms
[2022-05-16 16:35:16] [INFO ] Added : 61 causal constraints over 13 iterations in 349 ms. Result :sat
Minimization took 47 ms.
[2022-05-16 16:35:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:16] [INFO ] [Real]Absence check using 3 positive and 19 generalized place invariants in 3 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 24 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 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:16] [INFO ] [Nat]Absence check using 3 positive and 19 generalized place invariants in 3 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 24 ms returned sat
[2022-05-16 16:35:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2022-05-16 16:35:16] [INFO ] Computed and/alt/rep : 87/411/87 causal constraints (skipped 6 transitions) in 7 ms.
[2022-05-16 16:35:16] [INFO ] Added : 83 causal constraints over 19 iterations in 269 ms. Result :sat
Minimization took 54 ms.
[2022-05-16 16:35:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:16] [INFO ] [Real]Absence check using 3 positive and 19 generalized place invariants in 4 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 30 ms returned sat
[2022-05-16 16:35:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:17] [INFO ] [Nat]Absence check using 3 positive and 19 generalized place invariants in 3 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 23 ms returned sat
[2022-05-16 16:35:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:17] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2022-05-16 16:35:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-05-16 16:35:17] [INFO ] Computed and/alt/rep : 87/411/87 causal constraints (skipped 6 transitions) in 5 ms.
[2022-05-16 16:35:17] [INFO ] Added : 58 causal constraints over 12 iterations in 148 ms. Result :sat
Minimization took 67 ms.
[2022-05-16 16:35:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:17] [INFO ] [Real]Absence check using 3 positive and 19 generalized place invariants in 3 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 27 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 3 positive place invariants in 6 ms returned sat
[2022-05-16 16:35:17] [INFO ] [Nat]Absence check using 3 positive and 19 generalized place invariants in 3 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 22 ms returned sat
[2022-05-16 16:35:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:17] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2022-05-16 16:35:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2022-05-16 16:35:17] [INFO ] Computed and/alt/rep : 87/411/87 causal constraints (skipped 6 transitions) in 5 ms.
[2022-05-16 16:35:17] [INFO ] Added : 76 causal constraints over 16 iterations in 219 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, -1, 1] Max seen :[4, 0, 0, 0, 4, 0]
Incomplete Parikh walk after 63100 steps, including 8464 resets, run finished after 49 ms. (steps per millisecond=1287 ) properties (out of 6) seen :6 could not realise parikh vector
Incomplete Parikh walk after 11900 steps, including 1602 resets, run finished after 8 ms. (steps per millisecond=1487 ) properties (out of 6) seen :4 could not realise parikh vector
Incomplete Parikh walk after 73600 steps, including 9865 resets, run finished after 49 ms. (steps per millisecond=1502 ) properties (out of 6) seen :5 could not realise parikh vector
Incomplete Parikh walk after 15100 steps, including 2027 resets, run finished after 11 ms. (steps per millisecond=1372 ) properties (out of 6) seen :5 could not realise parikh vector
Incomplete Parikh walk after 82200 steps, including 11039 resets, run finished after 73 ms. (steps per millisecond=1126 ) properties (out of 6) seen :7 could not realise parikh vector
Incomplete Parikh walk after 3900 steps, including 524 resets, run finished after 4 ms. (steps per millisecond=975 ) properties (out of 6) seen :4 could not realise parikh vector
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 104/104 places, 94/94 transitions.
Applied a total of 0 rules in 13 ms. Remains 104 /104 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 94/94 transitions.
Starting structural reductions, iteration 0 : 104/104 places, 94/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 104 cols
[2022-05-16 16:35:17] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-16 16:35:18] [INFO ] Implicit Places using invariants in 76 ms returned [22, 28, 42, 43, 50, 57, 69, 74, 93, 101]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 78 ms to find 10 implicit places.
[2022-05-16 16:35:18] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 94 rows 94 cols
[2022-05-16 16:35:18] [INFO ] Computed 13 place invariants in 7 ms
[2022-05-16 16:35:18] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 94/104 places, 94/94 transitions.
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 2 place count 93 transition count 93
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 93 transition count 88
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 12 place count 88 transition count 88
Applied a total of 12 rules in 9 ms. Remains 88 /94 variables (removed 6) and now considering 88/94 (removed 6) transitions.
// Phase 1: matrix 88 rows 88 cols
[2022-05-16 16:35:18] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 16:35:18] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 88 rows 88 cols
[2022-05-16 16:35:18] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 16:35:18] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 88/104 places, 88/94 transitions.
// Phase 1: matrix 88 rows 88 cols
[2022-05-16 16:35:18] [INFO ] Computed 13 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 124994 resets, run finished after 604 ms. (steps per millisecond=1655 ) properties (out of 6) seen :7
Incomplete Best-First random walk after 1000000 steps, including 83355 resets, run finished after 464 ms. (steps per millisecond=2155 ) properties (out of 6) seen :7
Incomplete Best-First random walk after 1000000 steps, including 83335 resets, run finished after 454 ms. (steps per millisecond=2202 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000000 steps, including 83266 resets, run finished after 458 ms. (steps per millisecond=2183 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000001 steps, including 83401 resets, run finished after 447 ms. (steps per millisecond=2237 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000000 steps, including 83298 resets, run finished after 447 ms. (steps per millisecond=2237 ) properties (out of 6) seen :7
Incomplete Best-First random walk after 1000001 steps, including 83187 resets, run finished after 463 ms. (steps per millisecond=2159 ) properties (out of 6) seen :7
// Phase 1: matrix 88 rows 88 cols
[2022-05-16 16:35:21] [INFO ] Computed 13 place invariants in 5 ms
[2022-05-16 16:35:21] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-16 16:35:21] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:21] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 16:35:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:21] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:21] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-16 16:35:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 16:35:21] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2022-05-16 16:35:21] [INFO ] Deduced a trap composed of 29 places in 21 ms of which 0 ms to minimize.
[2022-05-16 16:35:21] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 0 ms to minimize.
[2022-05-16 16:35:21] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 1 ms to minimize.
[2022-05-16 16:35:21] [INFO ] Deduced a trap composed of 35 places in 20 ms of which 0 ms to minimize.
[2022-05-16 16:35:21] [INFO ] Deduced a trap composed of 36 places in 21 ms of which 0 ms to minimize.
[2022-05-16 16:35:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 137 ms
[2022-05-16 16:35:21] [INFO ] Computed and/alt/rep : 83/410/83 causal constraints (skipped 4 transitions) in 4 ms.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 193 ms
[2022-05-16 16:35:22] [INFO ] Added : 72 causal constraints over 15 iterations in 398 ms. Result :sat
Minimization took 68 ms.
[2022-05-16 16:35:22] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:22] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 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 21 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 7 positive place invariants in 8 ms returned sat
[2022-05-16 16:35:22] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 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 26 ms returned sat
[2022-05-16 16:35:22] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 31 places in 20 ms of which 0 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 29 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 31 places in 22 ms of which 0 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 37 places in 26 ms of which 8 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 33 places in 21 ms of which 0 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 200 ms
[2022-05-16 16:35:22] [INFO ] Computed and/alt/rep : 83/410/83 causal constraints (skipped 4 transitions) in 5 ms.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 23 places in 17 ms of which 0 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2022-05-16 16:35:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 99 ms
[2022-05-16 16:35:22] [INFO ] Added : 77 causal constraints over 16 iterations in 321 ms. Result :sat
Minimization took 75 ms.
[2022-05-16 16:35:23] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:23] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 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 26 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 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:23] [INFO ] [Nat]Absence check using 7 positive and 6 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 22 ms returned sat
[2022-05-16 16:35:23] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2022-05-16 16:35:23] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2022-05-16 16:35:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-05-16 16:35:23] [INFO ] Computed and/alt/rep : 83/410/83 causal constraints (skipped 4 transitions) in 5 ms.
[2022-05-16 16:35:23] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2022-05-16 16:35:23] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:35:23] [INFO ] Deduced a trap composed of 34 places in 24 ms of which 0 ms to minimize.
[2022-05-16 16:35:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 111 ms
[2022-05-16 16:35:23] [INFO ] Added : 80 causal constraints over 16 iterations in 335 ms. Result :sat
Minimization took 64 ms.
[2022-05-16 16:35:23] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:23] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 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 25 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 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:23] [INFO ] [Nat]Absence check using 7 positive and 6 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 28 ms returned sat
[2022-05-16 16:35:23] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:23] [INFO ] Computed and/alt/rep : 83/410/83 causal constraints (skipped 4 transitions) in 5 ms.
[2022-05-16 16:35:23] [INFO ] Added : 82 causal constraints over 17 iterations in 234 ms. Result :sat
Minimization took 61 ms.
[2022-05-16 16:35:24] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:24] [INFO ] [Real]Absence check using 7 positive and 6 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 25 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 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:24] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 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 26 ms returned sat
[2022-05-16 16:35:24] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2022-05-16 16:35:24] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2022-05-16 16:35:24] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 2 ms to minimize.
[2022-05-16 16:35:24] [INFO ] Deduced a trap composed of 33 places in 22 ms of which 2 ms to minimize.
[2022-05-16 16:35:24] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 9 ms to minimize.
[2022-05-16 16:35:24] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 0 ms to minimize.
[2022-05-16 16:35:24] [INFO ] Deduced a trap composed of 35 places in 19 ms of which 1 ms to minimize.
[2022-05-16 16:35:24] [INFO ] Deduced a trap composed of 32 places in 21 ms of which 1 ms to minimize.
[2022-05-16 16:35:24] [INFO ] Deduced a trap composed of 30 places in 18 ms of which 0 ms to minimize.
[2022-05-16 16:35:24] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 223 ms
[2022-05-16 16:35:24] [INFO ] Computed and/alt/rep : 83/410/83 causal constraints (skipped 4 transitions) in 4 ms.
[2022-05-16 16:35:24] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-16 16:35:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2022-05-16 16:35:24] [INFO ] Added : 81 causal constraints over 17 iterations in 369 ms. Result :sat
Minimization took 57 ms.
[2022-05-16 16:35:24] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:24] [INFO ] [Real]Absence check using 7 positive and 6 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 27 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 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:24] [INFO ] [Nat]Absence check using 7 positive and 6 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 21 ms returned sat
[2022-05-16 16:35:24] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2022-05-16 16:35:24] [INFO ] Computed and/alt/rep : 83/410/83 causal constraints (skipped 4 transitions) in 5 ms.
[2022-05-16 16:35:25] [INFO ] Added : 74 causal constraints over 15 iterations in 170 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, -1, 1] Max seen :[4, 0, 0, 0, 4, 0]
Incomplete Parikh walk after 118500 steps, including 17492 resets, run finished after 81 ms. (steps per millisecond=1462 ) properties (out of 6) seen :7 could not realise parikh vector
Incomplete Parikh walk after 78200 steps, including 11202 resets, run finished after 52 ms. (steps per millisecond=1503 ) properties (out of 6) seen :5 could not realise parikh vector
Incomplete Parikh walk after 38200 steps, including 5512 resets, run finished after 25 ms. (steps per millisecond=1528 ) properties (out of 6) seen :5 could not realise parikh vector
Incomplete Parikh walk after 13600 steps, including 2020 resets, run finished after 9 ms. (steps per millisecond=1511 ) properties (out of 6) seen :5 could not realise parikh vector
Incomplete Parikh walk after 49900 steps, including 7126 resets, run finished after 33 ms. (steps per millisecond=1512 ) properties (out of 6) seen :6 could not realise parikh vector
Incomplete Parikh walk after 3400 steps, including 455 resets, run finished after 3 ms. (steps per millisecond=1133 ) properties (out of 6) seen :4 could not realise parikh vector
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 88/88 places, 88/88 transitions.
Starting structural reductions, iteration 0 : 88/88 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 88/88 (removed 0) transitions.
// Phase 1: matrix 88 rows 88 cols
[2022-05-16 16:35:25] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:25] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 88 rows 88 cols
[2022-05-16 16:35:25] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 16:35:25] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2022-05-16 16:35:25] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 88 rows 88 cols
[2022-05-16 16:35:25] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 16:35:25] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 88/88 places, 88/88 transitions.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-00
// Phase 1: matrix 88 rows 88 cols
[2022-05-16 16:35:25] [INFO ] Computed 13 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1280 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :4
// Phase 1: matrix 88 rows 88 cols
[2022-05-16 16:35:25] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 16:35:25] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:25] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:25] [INFO ] [Real]Absence check using state equation in 19 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 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:25] [INFO ] [Nat]Absence check using 7 positive and 6 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 17 ms returned sat
[2022-05-16 16:35:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 16:35:25] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2022-05-16 16:35:25] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2022-05-16 16:35:25] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2022-05-16 16:35:25] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
[2022-05-16 16:35:25] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2022-05-16 16:35:25] [INFO ] Deduced a trap composed of 36 places in 21 ms of which 0 ms to minimize.
[2022-05-16 16:35:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 158 ms
[2022-05-16 16:35:25] [INFO ] Computed and/alt/rep : 83/410/83 causal constraints (skipped 4 transitions) in 5 ms.
[2022-05-16 16:35:25] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2022-05-16 16:35:25] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2022-05-16 16:35:26] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2022-05-16 16:35:26] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2022-05-16 16:35:26] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2022-05-16 16:35:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 171 ms
[2022-05-16 16:35:26] [INFO ] Added : 72 causal constraints over 15 iterations in 363 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 3400 steps, including 465 resets, run finished after 3 ms. (steps per millisecond=1133 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 88/88 transitions.
Graph (complete) has 322 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 87
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 10 place count 83 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 82 transition count 83
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 82 transition count 80
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 18 place count 79 transition count 80
Applied a total of 18 rules in 10 ms. Remains 79 /88 variables (removed 9) and now considering 80/88 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/88 places, 80/88 transitions.
// Phase 1: matrix 80 rows 79 cols
[2022-05-16 16:35:26] [INFO ] Computed 13 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 124841 resets, run finished after 638 ms. (steps per millisecond=1567 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 83361 resets, run finished after 425 ms. (steps per millisecond=2352 ) properties (out of 1) seen :4
// Phase 1: matrix 80 rows 79 cols
[2022-05-16 16:35:27] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:27] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:27] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 0 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 19 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 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:27] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 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 18 ms returned sat
[2022-05-16 16:35:27] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-05-16 16:35:27] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2022-05-16 16:35:27] [INFO ] Computed and/alt/rep : 70/399/70 causal constraints (skipped 9 transitions) in 3 ms.
[2022-05-16 16:35:27] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2022-05-16 16:35:27] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2022-05-16 16:35:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2022-05-16 16:35:27] [INFO ] Added : 29 causal constraints over 8 iterations in 141 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 5000 steps, including 717 resets, run finished after 9 ms. (steps per millisecond=555 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 80/80 transitions.
Starting structural reductions, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 79 cols
[2022-05-16 16:35:27] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 16:35:27] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 80 rows 79 cols
[2022-05-16 16:35:27] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:27] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-05-16 16:35:27] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2022-05-16 16:35:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 79 cols
[2022-05-16 16:35:27] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:27] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 80/80 transitions.
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-00 in 2247 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-01
// Phase 1: matrix 88 rows 88 cols
[2022-05-16 16:35:27] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1230 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 88 rows 88 cols
[2022-05-16 16:35:27] [INFO ] Computed 13 place invariants in 6 ms
[2022-05-16 16:35:27] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:27] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 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 22 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 7 positive place invariants in 3 ms returned sat
[2022-05-16 16:35:27] [INFO ] [Nat]Absence check using 7 positive and 6 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 25 ms returned sat
[2022-05-16 16:35:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 16:35:27] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:27] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2022-05-16 16:35:27] [INFO ] Deduced a trap composed of 31 places in 18 ms of which 0 ms to minimize.
[2022-05-16 16:35:27] [INFO ] Deduced a trap composed of 29 places in 18 ms of which 0 ms to minimize.
[2022-05-16 16:35:27] [INFO ] Deduced a trap composed of 31 places in 18 ms of which 0 ms to minimize.
[2022-05-16 16:35:27] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:35:27] [INFO ] Deduced a trap composed of 37 places in 23 ms of which 0 ms to minimize.
[2022-05-16 16:35:27] [INFO ] Deduced a trap composed of 33 places in 23 ms of which 0 ms to minimize.
[2022-05-16 16:35:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 176 ms
[2022-05-16 16:35:28] [INFO ] Computed and/alt/rep : 83/410/83 causal constraints (skipped 4 transitions) in 6 ms.
[2022-05-16 16:35:28] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:35:28] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2022-05-16 16:35:28] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2022-05-16 16:35:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 94 ms
[2022-05-16 16:35:28] [INFO ] Added : 77 causal constraints over 16 iterations in 296 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 49900 steps, including 7133 resets, run finished after 35 ms. (steps per millisecond=1425 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 88/88 transitions.
Graph (complete) has 322 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
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 87 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 86 transition count 86
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 82 transition count 82
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 80 transition count 82
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 80 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 78 transition count 80
Applied a total of 20 rules in 9 ms. Remains 78 /88 variables (removed 10) and now considering 80/88 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 78/88 places, 80/88 transitions.
// Phase 1: matrix 80 rows 78 cols
[2022-05-16 16:35:28] [INFO ] Computed 13 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 156326 resets, run finished after 603 ms. (steps per millisecond=1658 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95980 resets, run finished after 414 ms. (steps per millisecond=2415 ) properties (out of 1) seen :0
// Phase 1: matrix 80 rows 78 cols
[2022-05-16 16:35:29] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 16:35:29] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:29] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:29] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:35:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:29] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:29] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-16 16:35:29] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-16 16:35:29] [INFO ] [Nat]Added 17 Read/Feed constraints in 3 ms returned sat
[2022-05-16 16:35:29] [INFO ] Computed and/alt/rep : 70/415/70 causal constraints (skipped 9 transitions) in 4 ms.
[2022-05-16 16:35:29] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2022-05-16 16:35:29] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 0 ms to minimize.
[2022-05-16 16:35:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2022-05-16 16:35:29] [INFO ] Added : 48 causal constraints over 10 iterations in 183 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 94200 steps, including 17558 resets, run finished after 67 ms. (steps per millisecond=1405 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 78/78 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 78/78 places, 80/80 transitions.
Starting structural reductions, iteration 0 : 78/78 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 78 cols
[2022-05-16 16:35:29] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 16:35:29] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 80 rows 78 cols
[2022-05-16 16:35:29] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:29] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-16 16:35:29] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2022-05-16 16:35:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 78 cols
[2022-05-16 16:35:29] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:30] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 78/78 places, 80/80 transitions.
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-01 in 2300 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-04
// Phase 1: matrix 88 rows 88 cols
[2022-05-16 16:35:30] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1248 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 88 rows 88 cols
[2022-05-16 16:35:30] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:30] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:30] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:30] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-16 16:35:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:30] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 0 ms returned sat
[2022-05-16 16:35:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:30] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-16 16:35:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 16:35:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 7 ms returned sat
[2022-05-16 16:35:30] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2022-05-16 16:35:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-05-16 16:35:30] [INFO ] Computed and/alt/rep : 83/410/83 causal constraints (skipped 4 transitions) in 3 ms.
[2022-05-16 16:35:30] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2022-05-16 16:35:30] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2022-05-16 16:35:30] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 0 ms to minimize.
[2022-05-16 16:35:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 123 ms
[2022-05-16 16:35:30] [INFO ] Added : 80 causal constraints over 16 iterations in 323 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 13600 steps, including 2019 resets, run finished after 17 ms. (steps per millisecond=800 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 88/88 transitions.
Graph (complete) has 322 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 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 87 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 86 transition count 86
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 10 place count 83 transition count 83
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 12 place count 82 transition count 83
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 82 transition count 80
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 18 place count 79 transition count 80
Applied a total of 18 rules in 12 ms. Remains 79 /88 variables (removed 9) and now considering 80/88 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/88 places, 80/88 transitions.
// Phase 1: matrix 80 rows 79 cols
[2022-05-16 16:35:30] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156176 resets, run finished after 590 ms. (steps per millisecond=1694 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95731 resets, run finished after 425 ms. (steps per millisecond=2352 ) properties (out of 1) seen :0
// Phase 1: matrix 80 rows 79 cols
[2022-05-16 16:35:31] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 16:35:31] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:31] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:31] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 16:35:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:31] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:31] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-16 16:35:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 16:35:31] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2022-05-16 16:35:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2022-05-16 16:35:31] [INFO ] Deduced a trap composed of 24 places in 17 ms of which 0 ms to minimize.
[2022-05-16 16:35:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 53 ms
[2022-05-16 16:35:31] [INFO ] Computed and/alt/rep : 72/412/72 causal constraints (skipped 7 transitions) in 4 ms.
[2022-05-16 16:35:31] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:35:31] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 1 ms to minimize.
[2022-05-16 16:35:31] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2022-05-16 16:35:32] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:35:32] [INFO ] Deduced a trap composed of 33 places in 20 ms of which 1 ms to minimize.
[2022-05-16 16:35:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 146 ms
[2022-05-16 16:35:32] [INFO ] Added : 72 causal constraints over 15 iterations in 325 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 7900 steps, including 941 resets, run finished after 11 ms. (steps per millisecond=718 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 80/80 transitions.
Starting structural reductions, iteration 0 : 79/79 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 79 cols
[2022-05-16 16:35:32] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 16:35:32] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 80 rows 79 cols
[2022-05-16 16:35:32] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 16:35:32] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2022-05-16 16:35:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 79 cols
[2022-05-16 16:35:32] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 16:35:32] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 80/80 transitions.
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-04 in 2291 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-05
// Phase 1: matrix 88 rows 88 cols
[2022-05-16 16:35:32] [INFO ] Computed 13 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1247 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 836 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 88 rows 88 cols
[2022-05-16 16:35:32] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 16:35:32] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-16 16:35:32] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:32] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-16 16:35:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:32] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:32] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-05-16 16:35:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 16:35:32] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:32] [INFO ] Computed and/alt/rep : 83/410/83 causal constraints (skipped 4 transitions) in 6 ms.
[2022-05-16 16:35:32] [INFO ] Added : 82 causal constraints over 17 iterations in 234 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 38200 steps, including 5467 resets, run finished after 30 ms. (steps per millisecond=1273 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 88/88 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 88 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 87 transition count 87
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 83 transition count 83
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 14 place count 81 transition count 83
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 81 transition count 80
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 20 place count 78 transition count 80
Applied a total of 20 rules in 9 ms. Remains 78 /88 variables (removed 10) and now considering 80/88 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 78/88 places, 80/88 transitions.
// Phase 1: matrix 80 rows 78 cols
[2022-05-16 16:35:32] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156285 resets, run finished after 596 ms. (steps per millisecond=1677 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96091 resets, run finished after 429 ms. (steps per millisecond=2331 ) properties (out of 1) seen :0
// Phase 1: matrix 80 rows 78 cols
[2022-05-16 16:35:33] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-16 16:35:33] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:33] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:33] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-16 16:35:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-16 16:35:33] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:33] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-05-16 16:35:33] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-16 16:35:33] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:33] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 0 ms to minimize.
[2022-05-16 16:35:33] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2022-05-16 16:35:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 46 ms
[2022-05-16 16:35:33] [INFO ] Computed and/alt/rep : 69/420/69 causal constraints (skipped 10 transitions) in 4 ms.
[2022-05-16 16:35:34] [INFO ] Added : 58 causal constraints over 12 iterations in 144 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 74400 steps, including 13864 resets, run finished after 53 ms. (steps per millisecond=1403 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 78/78 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 78/78 places, 80/80 transitions.
Starting structural reductions, iteration 0 : 78/78 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 78 cols
[2022-05-16 16:35:34] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:34] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 80 rows 78 cols
[2022-05-16 16:35:34] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:34] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-16 16:35:34] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2022-05-16 16:35:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 78 cols
[2022-05-16 16:35:34] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 16:35:34] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 78/78 places, 80/80 transitions.
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-05 in 2078 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-10
// Phase 1: matrix 88 rows 88 cols
[2022-05-16 16:35:34] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1232 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 807 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
// Phase 1: matrix 88 rows 88 cols
[2022-05-16 16:35:34] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:34] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-16 16:35:34] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:34] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-16 16:35:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-16 16:35:34] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:34] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-16 16:35:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 16:35:34] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2022-05-16 16:35:34] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2022-05-16 16:35:34] [INFO ] Deduced a trap composed of 35 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:35:34] [INFO ] Deduced a trap composed of 28 places in 19 ms of which 1 ms to minimize.
[2022-05-16 16:35:34] [INFO ] Deduced a trap composed of 32 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:35:34] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 0 ms to minimize.
[2022-05-16 16:35:34] [INFO ] Deduced a trap composed of 41 places in 24 ms of which 0 ms to minimize.
[2022-05-16 16:35:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 163 ms
[2022-05-16 16:35:34] [INFO ] Computed and/alt/rep : 83/410/83 causal constraints (skipped 4 transitions) in 5 ms.
[2022-05-16 16:35:34] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:35:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2022-05-16 16:35:34] [INFO ] Added : 80 causal constraints over 16 iterations in 244 ms. Result :sat
Minimization took 134 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 38800 steps, including 5797 resets, run finished after 29 ms. (steps per millisecond=1337 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 88/88 transitions.
Graph (complete) has 322 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 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 87 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 86 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 84 transition count 84
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 12 place count 82 transition count 84
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 82 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 18 place count 79 transition count 81
Applied a total of 18 rules in 9 ms. Remains 79 /88 variables (removed 9) and now considering 81/88 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/88 places, 81/88 transitions.
// Phase 1: matrix 81 rows 79 cols
[2022-05-16 16:35:35] [INFO ] Computed 13 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 156187 resets, run finished after 589 ms. (steps per millisecond=1697 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 95682 resets, run finished after 421 ms. (steps per millisecond=2375 ) properties (out of 1) seen :3
// Phase 1: matrix 81 rows 79 cols
[2022-05-16 16:35:36] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-16 16:35:36] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:36] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:36] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 16:35:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:36] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:36] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-05-16 16:35:36] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 16:35:36] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2022-05-16 16:35:36] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2022-05-16 16:35:36] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2022-05-16 16:35:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2022-05-16 16:35:36] [INFO ] Computed and/alt/rep : 70/414/70 causal constraints (skipped 10 transitions) in 4 ms.
[2022-05-16 16:35:36] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2022-05-16 16:35:36] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 1 ms to minimize.
[2022-05-16 16:35:36] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2022-05-16 16:35:36] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2022-05-16 16:35:36] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2022-05-16 16:35:36] [INFO ] Deduced a trap composed of 9 places in 9 ms of which 1 ms to minimize.
[2022-05-16 16:35:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 186 ms
[2022-05-16 16:35:36] [INFO ] Added : 60 causal constraints over 12 iterations in 348 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 29600 steps, including 4935 resets, run finished after 21 ms. (steps per millisecond=1409 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 81/81 transitions.
Starting structural reductions, iteration 0 : 79/79 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 79 cols
[2022-05-16 16:35:36] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 16:35:36] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 81 rows 79 cols
[2022-05-16 16:35:36] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:36] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 16:35:36] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2022-05-16 16:35:36] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 81 rows 79 cols
[2022-05-16 16:35:36] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:36] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 81/81 transitions.
// Phase 1: matrix 81 rows 79 cols
[2022-05-16 16:35:36] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156043 resets, run finished after 599 ms. (steps per millisecond=1669 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 95784 resets, run finished after 416 ms. (steps per millisecond=2403 ) properties (out of 1) seen :4
// Phase 1: matrix 81 rows 79 cols
[2022-05-16 16:35:37] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 16:35:37] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:37] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:37] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:35:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:37] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:37] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:35:37] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 16:35:37] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2022-05-16 16:35:38] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2022-05-16 16:35:38] [INFO ] Deduced a trap composed of 27 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:35:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 50 ms
[2022-05-16 16:35:38] [INFO ] Computed and/alt/rep : 70/414/70 causal constraints (skipped 10 transitions) in 4 ms.
[2022-05-16 16:35:38] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2022-05-16 16:35:38] [INFO ] Deduced a trap composed of 26 places in 20 ms of which 0 ms to minimize.
[2022-05-16 16:35:38] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2022-05-16 16:35:38] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2022-05-16 16:35:38] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2022-05-16 16:35:38] [INFO ] Deduced a trap composed of 9 places in 9 ms of which 1 ms to minimize.
[2022-05-16 16:35:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 198 ms
[2022-05-16 16:35:38] [INFO ] Added : 60 causal constraints over 12 iterations in 358 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 29600 steps, including 4969 resets, run finished after 23 ms. (steps per millisecond=1286 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 81/81 transitions.
Starting structural reductions, iteration 0 : 79/79 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 79 cols
[2022-05-16 16:35:38] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 16:35:38] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 81 rows 79 cols
[2022-05-16 16:35:38] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:38] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 16:35:38] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2022-05-16 16:35:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 81 rows 79 cols
[2022-05-16 16:35:38] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 16:35:38] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 81/81 transitions.
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-10 in 4277 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-14
// Phase 1: matrix 88 rows 88 cols
[2022-05-16 16:35:38] [INFO ] Computed 13 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1210 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 88 rows 88 cols
[2022-05-16 16:35:38] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:38] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:38] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:38] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-16 16:35:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:38] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:38] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-16 16:35:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 16:35:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:38] [INFO ] Computed and/alt/rep : 83/410/83 causal constraints (skipped 4 transitions) in 5 ms.
[2022-05-16 16:35:38] [INFO ] Added : 74 causal constraints over 15 iterations in 164 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 118500 steps, including 17525 resets, run finished after 76 ms. (steps per millisecond=1559 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 88/88 transitions.
Graph (complete) has 322 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
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 87 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 86 transition count 86
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 10 place count 83 transition count 83
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 14 place count 81 transition count 83
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 81 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 80 transition count 82
Applied a total of 16 rules in 8 ms. Remains 80 /88 variables (removed 8) and now considering 82/88 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/88 places, 82/88 transitions.
// Phase 1: matrix 82 rows 80 cols
[2022-05-16 16:35:39] [INFO ] Computed 13 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 156283 resets, run finished after 592 ms. (steps per millisecond=1689 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96138 resets, run finished after 431 ms. (steps per millisecond=2320 ) properties (out of 1) seen :0
// Phase 1: matrix 82 rows 80 cols
[2022-05-16 16:35:40] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 16:35:40] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:40] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:40] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-16 16:35:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:40] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:40] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-16 16:35:40] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-16 16:35:40] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:40] [INFO ] Computed and/alt/rep : 72/424/72 causal constraints (skipped 9 transitions) in 4 ms.
[2022-05-16 16:35:40] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2022-05-16 16:35:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-05-16 16:35:40] [INFO ] Added : 62 causal constraints over 13 iterations in 203 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 65200 steps, including 12057 resets, run finished after 45 ms. (steps per millisecond=1448 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 82/82 transitions.
Starting structural reductions, iteration 0 : 80/80 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 82/82 (removed 0) transitions.
// Phase 1: matrix 82 rows 80 cols
[2022-05-16 16:35:40] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:40] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 82 rows 80 cols
[2022-05-16 16:35:40] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:40] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-16 16:35:40] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2022-05-16 16:35:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 82 rows 80 cols
[2022-05-16 16:35:40] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 16:35:40] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 82/82 transitions.
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-14 in 2021 ms.
[2022-05-16 16:35:40] [INFO ] Flatten gal took : 55 ms
[2022-05-16 16:35:40] [INFO ] Applying decomposition
[2022-05-16 16:35:40] [INFO ] Flatten gal took : 19 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/graph1984412493691138046.txt, -o, /tmp/graph1984412493691138046.bin, -w, /tmp/graph1984412493691138046.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/graph1984412493691138046.bin, -l, -1, -v, -w, /tmp/graph1984412493691138046.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 16:35:40] [INFO ] Decomposing Gal with order
[2022-05-16 16:35:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:35:41] [INFO ] Removed a total of 31 redundant transitions.
[2022-05-16 16:35:41] [INFO ] Flatten gal took : 48 ms
[2022-05-16 16:35:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 9 ms.
[2022-05-16 16:35:41] [INFO ] Time to serialize gal into /tmp/UpperBounds16494351959785838847.gal : 12 ms
[2022-05-16 16:35:41] [INFO ] Time to serialize properties into /tmp/UpperBounds9454701906527911065.prop : 0 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/UpperBounds16494351959785838847.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds9454701906527911065.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/UpperBounds16494351959785838847.gal -t CGAL -reachable-file /tmp/UpperBounds9454701906527911065.prop --nowitness
Loading property file /tmp/UpperBounds9454701906527911065.prop.
Detected timeout of ITS tools.
[2022-05-16 16:55:56] [INFO ] Flatten gal took : 11 ms
[2022-05-16 16:55:56] [INFO ] Time to serialize gal into /tmp/UpperBounds1644039795206820871.gal : 6 ms
[2022-05-16 16:55:56] [INFO ] Time to serialize properties into /tmp/UpperBounds13393888175145641531.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/UpperBounds1644039795206820871.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds13393888175145641531.prop, --nowitness, --gen-order, FOLLOW], 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/UpperBounds1644039795206820871.gal -t CGAL -reachable-file /tmp/UpperBounds13393888175145641531.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds13393888175145641531.prop.
Detected timeout of ITS tools.
[2022-05-16 17:16:11] [INFO ] Flatten gal took : 16 ms
[2022-05-16 17:16:11] [INFO ] Input system was already deterministic with 88 transitions.
[2022-05-16 17:16:11] [INFO ] Transformed 88 places.
[2022-05-16 17:16:11] [INFO ] Transformed 88 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 17:16:11] [INFO ] Time to serialize gal into /tmp/UpperBounds4667130505485310149.gal : 3 ms
[2022-05-16 17:16:11] [INFO ] Time to serialize properties into /tmp/UpperBounds15458231644161550128.prop : 0 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/UpperBounds4667130505485310149.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15458231644161550128.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], 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/UpperBounds4667130505485310149.gal -t CGAL -reachable-file /tmp/UpperBounds15458231644161550128.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds15458231644161550128.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
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-004"
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-004, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r089-tall-165260117600070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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