MCC'2023- Execution of r159-smll-167819445200058

About the Execution of 2022-gold for DoubleExponent-PT-003

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
453.539	75599.00	95707.00	312.20	2 1 256 1 1 1 1 1 1 1 1 1 1 1 1 1	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 50K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678465826567

Running Version 202205111006
[2023-03-10 16:30:28] [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]
[2023-03-10 16:30:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:30:29] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2023-03-10 16:30:29] [INFO ] Transformed 163 places.
[2023-03-10 16:30:29] [INFO ] Transformed 148 transitions.
[2023-03-10 16:30:29] [INFO ] Parsed PT model containing 163 places and 148 transitions in 324 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 148 rows 163 cols
[2023-03-10 16:30:29] [INFO ] Computed 19 place invariants in 41 ms
Incomplete random walk after 10000 steps, including 330 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :8
FORMULA DoubleExponent-PT-003-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :2
FORMULA DoubleExponent-PT-003-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 299 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 267 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :2
FORMULA DoubleExponent-PT-003-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :1
// Phase 1: matrix 148 rows 163 cols
[2023-03-10 16:30:29] [INFO ] Computed 19 place invariants in 9 ms
[2023-03-10 16:30:29] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2023-03-10 16:30:29] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2023-03-10 16:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:30] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-10 16:30:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-10 16:30:30] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2023-03-10 16:30:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:30] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-10 16:30:30] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 30 ms to minimize.
[2023-03-10 16:30:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-10 16:30:30] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-10 16:30:31] [INFO ] Added : 99 causal constraints over 20 iterations in 555 ms. Result :sat
Minimization took 74 ms.
[2023-03-10 16:30:31] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-10 16:30:31] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2023-03-10 16:30:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:31] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-03-10 16:30:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 16:30:31] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2023-03-10 16:30:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:31] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-10 16:30:31] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 28 ms.
[2023-03-10 16:30:32] [INFO ] Added : 117 causal constraints over 24 iterations in 553 ms. Result :sat
Minimization took 97 ms.
[2023-03-10 16:30:32] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-10 16:30:32] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2023-03-10 16:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:32] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2023-03-10 16:30:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-10 16:30:32] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 22 ms returned sat
[2023-03-10 16:30:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:32] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-10 16:30:32] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 3 ms to minimize.
[2023-03-10 16:30:32] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 2 ms to minimize.
[2023-03-10 16:30:32] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2023-03-10 16:30:33] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 1 ms to minimize.
[2023-03-10 16:30:33] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 1 ms to minimize.
[2023-03-10 16:30:33] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2023-03-10 16:30:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 628 ms
[2023-03-10 16:30:33] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-10 16:30:33] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2023-03-10 16:30:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-10 16:30:34] [INFO ] Added : 112 causal constraints over 23 iterations in 744 ms. Result :sat
Minimization took 97 ms.
[2023-03-10 16:30:34] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-10 16:30:34] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned unsat
[2023-03-10 16:30:34] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-10 16:30:34] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-10 16:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:34] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2023-03-10 16:30:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-10 16:30:34] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2023-03-10 16:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:34] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-03-10 16:30:34] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-10 16:30:35] [INFO ] Added : 137 causal constraints over 28 iterations in 599 ms. Result :sat
Minimization took 72 ms.
[2023-03-10 16:30:35] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-10 16:30:35] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2023-03-10 16:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:35] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2023-03-10 16:30:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-10 16:30:35] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-10 16:30:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:35] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-10 16:30:35] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2023-03-10 16:30:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-10 16:30:35] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-10 16:30:36] [INFO ] Added : 143 causal constraints over 30 iterations in 769 ms. Result :sat
Minimization took 121 ms.
[2023-03-10 16:30:36] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-10 16:30:36] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2023-03-10 16:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:36] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2023-03-10 16:30:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-10 16:30:36] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2023-03-10 16:30:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:36] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-10 16:30:37] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 0 ms to minimize.
[2023-03-10 16:30:37] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2023-03-10 16:30:37] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2023-03-10 16:30:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 230 ms
[2023-03-10 16:30:37] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 19 ms.
[2023-03-10 16:30:37] [INFO ] Added : 111 causal constraints over 23 iterations in 544 ms. Result :sat
Minimization took 107 ms.
[2023-03-10 16:30:37] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-10 16:30:37] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2023-03-10 16:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:38] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2023-03-10 16:30:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-10 16:30:38] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2023-03-10 16:30:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:38] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-03-10 16:30:38] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
[2023-03-10 16:30:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-10 16:30:38] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-10 16:30:38] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 4 ms to minimize.
[2023-03-10 16:30:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-03-10 16:30:38] [INFO ] Added : 133 causal constraints over 27 iterations in 692 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [1, -1, 44, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 1, 0, 0, 0, 0]
FORMULA DoubleExponent-PT-003-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 163 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 163/163 places, 148/148 transitions.
Graph (complete) has 269 edges and 163 vertex of which 158 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 157 transition count 115
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 67 place count 126 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 125 transition count 114
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 68 place count 125 transition count 107
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 82 place count 118 transition count 107
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 142 place count 88 transition count 77
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 150 place count 84 transition count 77
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 155 place count 84 transition count 72
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 160 place count 79 transition count 72
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 172 place count 79 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 173 place count 78 transition count 71
Applied a total of 173 rules in 111 ms. Remains 78 /163 variables (removed 85) and now considering 71/148 (removed 77) transitions.
Finished structural reductions, in 1 iterations. Remains : 78/163 places, 71/148 transitions.
// Phase 1: matrix 71 rows 78 cols
[2023-03-10 16:30:40] [INFO ] Computed 15 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 128025 resets, run finished after 1754 ms. (steps per millisecond=570 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84739 resets, run finished after 762 ms. (steps per millisecond=1312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84266 resets, run finished after 761 ms. (steps per millisecond=1314 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84658 resets, run finished after 761 ms. (steps per millisecond=1314 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84619 resets, run finished after 778 ms. (steps per millisecond=1285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84528 resets, run finished after 774 ms. (steps per millisecond=1291 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84772 resets, run finished after 766 ms. (steps per millisecond=1305 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84751 resets, run finished after 781 ms. (steps per millisecond=1280 ) properties (out of 7) seen :0
// Phase 1: matrix 71 rows 78 cols
[2023-03-10 16:30:47] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-10 16:30:47] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:30:47] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-10 16:30:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:47] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-10 16:30:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:30:47] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-10 16:30:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:47] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-10 16:30:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 16:30:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-10 16:30:47] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 11 ms.
[2023-03-10 16:30:47] [INFO ] Added : 62 causal constraints over 13 iterations in 226 ms. Result :sat
Minimization took 54 ms.
[2023-03-10 16:30:47] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 16:30:47] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 27 ms returned sat
[2023-03-10 16:30:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:47] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-10 16:30:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:30:47] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-10 16:30:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:47] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-10 16:30:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-10 16:30:47] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 11 ms.
[2023-03-10 16:30:48] [INFO ] Added : 44 causal constraints over 10 iterations in 157 ms. Result :sat
Minimization took 40 ms.
[2023-03-10 16:30:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:30:48] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-10 16:30:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:48] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-10 16:30:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 16:30:48] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-10 16:30:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:48] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-10 16:30:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-10 16:30:48] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 6 ms.
[2023-03-10 16:30:48] [INFO ] Added : 48 causal constraints over 10 iterations in 114 ms. Result :sat
Minimization took 34 ms.
[2023-03-10 16:30:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 16:30:48] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-10 16:30:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:48] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-10 16:30:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 16:30:48] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 11 ms returned sat
[2023-03-10 16:30:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:48] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-10 16:30:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2023-03-10 16:30:48] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 7 ms.
[2023-03-10 16:30:48] [INFO ] Added : 63 causal constraints over 14 iterations in 171 ms. Result :sat
Minimization took 42 ms.
[2023-03-10 16:30:48] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 16:30:48] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-10 16:30:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:49] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-10 16:30:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:30:49] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-10 16:30:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:49] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-10 16:30:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-10 16:30:49] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 6 ms.
[2023-03-10 16:30:49] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2023-03-10 16:30:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-10 16:30:49] [INFO ] Added : 53 causal constraints over 11 iterations in 206 ms. Result :sat
Minimization took 53 ms.
[2023-03-10 16:30:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 16:30:49] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 7 ms returned sat
[2023-03-10 16:30:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:49] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-10 16:30:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:30:49] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-10 16:30:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:49] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-10 16:30:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-10 16:30:49] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2023-03-10 16:30:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-10 16:30:49] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 7 ms.
[2023-03-10 16:30:49] [INFO ] Added : 38 causal constraints over 8 iterations in 115 ms. Result :sat
Minimization took 56 ms.
[2023-03-10 16:30:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:30:49] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-10 16:30:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:49] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-10 16:30:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:30:49] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-10 16:30:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:49] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-10 16:30:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2023-03-10 16:30:50] [INFO ] Computed and/alt/rep : 68/294/68 causal constraints (skipped 2 transitions) in 8 ms.
[2023-03-10 16:30:50] [INFO ] Added : 68 causal constraints over 16 iterations in 323 ms. Result :sat
Minimization took 137 ms.
Current structural bounds on expressions (after SMT) : [1, -1, 44, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 78 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 78/78 places, 71/71 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 78/78 places, 71/71 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 78/78 places, 71/71 transitions.
Applied a total of 0 rules in 5 ms. Remains 78 /78 variables (removed 0) and now considering 71/71 (removed 0) transitions.
// Phase 1: matrix 71 rows 78 cols
[2023-03-10 16:30:50] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-10 16:30:50] [INFO ] Implicit Places using invariants in 111 ms returned [23, 43, 48]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 114 ms to find 3 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 75/78 places, 71/71 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 73 transition count 69
Applied a total of 4 rules in 8 ms. Remains 73 /75 variables (removed 2) and now considering 69/71 (removed 2) transitions.
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:30:50] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-10 16:30:50] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:30:50] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-10 16:30:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 16:30:51] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 73/78 places, 69/71 transitions.
Finished structural reductions, in 2 iterations. Remains : 73/78 places, 69/71 transitions.
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:30:51] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144228 resets, run finished after 978 ms. (steps per millisecond=1022 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91384 resets, run finished after 681 ms. (steps per millisecond=1468 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91205 resets, run finished after 681 ms. (steps per millisecond=1468 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91290 resets, run finished after 678 ms. (steps per millisecond=1474 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91605 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91573 resets, run finished after 684 ms. (steps per millisecond=1461 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91260 resets, run finished after 680 ms. (steps per millisecond=1470 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91242 resets, run finished after 682 ms. (steps per millisecond=1466 ) properties (out of 7) seen :0
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:30:56] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-10 16:30:56] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 16:30:56] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:30:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:56] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-10 16:30:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 16:30:57] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:30:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:57] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-10 16:30:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 16:30:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-10 16:30:57] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 8 ms.
[2023-03-10 16:30:57] [INFO ] Added : 31 causal constraints over 7 iterations in 119 ms. Result :sat
Minimization took 48 ms.
[2023-03-10 16:30:57] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 16:30:57] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:30:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:57] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-10 16:30:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 16:30:57] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 16:30:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:57] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-10 16:30:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-10 16:30:57] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 7 ms.
[2023-03-10 16:30:57] [INFO ] Added : 46 causal constraints over 10 iterations in 120 ms. Result :sat
Minimization took 48 ms.
[2023-03-10 16:30:57] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-10 16:30:57] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:30:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:57] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-10 16:30:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 16:30:57] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 6 ms returned sat
[2023-03-10 16:30:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:57] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-10 16:30:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-10 16:30:57] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 7 ms.
[2023-03-10 16:30:57] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2023-03-10 16:30:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-10 16:30:57] [INFO ] Added : 39 causal constraints over 8 iterations in 160 ms. Result :sat
Minimization took 30 ms.
[2023-03-10 16:30:58] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 16:30:58] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 16:30:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:58] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-10 16:30:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 16:30:58] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-10 16:30:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:58] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-10 16:30:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2023-03-10 16:30:58] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 10 ms.
[2023-03-10 16:30:58] [INFO ] Added : 48 causal constraints over 10 iterations in 140 ms. Result :sat
Minimization took 35 ms.
[2023-03-10 16:30:58] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 16:30:58] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:30:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:58] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-10 16:30:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 16:30:58] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 16:30:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:58] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-10 16:30:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-10 16:30:58] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 12 ms.
[2023-03-10 16:30:58] [INFO ] Added : 52 causal constraints over 11 iterations in 149 ms. Result :sat
Minimization took 40 ms.
[2023-03-10 16:30:58] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 16:30:58] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 16:30:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:58] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-10 16:30:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 16:30:58] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 16:30:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:58] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-10 16:30:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2023-03-10 16:30:58] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 9 ms.
[2023-03-10 16:30:59] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2023-03-10 16:30:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-10 16:30:59] [INFO ] Added : 31 causal constraints over 7 iterations in 165 ms. Result :sat
Minimization took 26 ms.
[2023-03-10 16:30:59] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-10 16:30:59] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:30:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:59] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-10 16:30:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:30:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 16:30:59] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:30:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:30:59] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-10 16:30:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-10 16:30:59] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 10 ms.
[2023-03-10 16:30:59] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2023-03-10 16:30:59] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 2 ms to minimize.
[2023-03-10 16:30:59] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2023-03-10 16:30:59] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2023-03-10 16:30:59] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2023-03-10 16:30:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 276 ms
[2023-03-10 16:30:59] [INFO ] Added : 64 causal constraints over 13 iterations in 475 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [1, -1, 44, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 73 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 73/73 places, 69/69 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 69/69 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 73/73 places, 69/69 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 69/69 (removed 0) transitions.
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:31:00] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-10 16:31:00] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:31:00] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-10 16:31:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 16:31:00] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2023-03-10 16:31:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:31:00] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-10 16:31:00] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 69/69 transitions.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-01
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:31:00] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1436 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 919 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:31:00] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-10 16:31:00] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 16:31:00] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 16:31:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:00] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-10 16:31:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 16:31:00] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:31:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:00] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-10 16:31:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 16:31:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-10 16:31:00] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 7 ms.
[2023-03-10 16:31:01] [INFO ] Added : 31 causal constraints over 7 iterations in 105 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 73/73 places, 69/69 transitions.
Graph (complete) has 231 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 72 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 70 transition count 67
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 70 transition count 65
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 68 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 67 transition count 64
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 67 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 66 transition count 63
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 66 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 65 transition count 62
Applied a total of 15 rules in 18 ms. Remains 65 /73 variables (removed 8) and now considering 62/69 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/73 places, 62/69 transitions.
// Phase 1: matrix 62 rows 65 cols
[2023-03-10 16:31:01] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 144306 resets, run finished after 881 ms. (steps per millisecond=1135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91370 resets, run finished after 630 ms. (steps per millisecond=1587 ) properties (out of 1) seen :0
// Phase 1: matrix 62 rows 65 cols
[2023-03-10 16:31:02] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-10 16:31:02] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 16:31:02] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 16:31:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:02] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-10 16:31:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 16:31:02] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:31:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:02] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-10 16:31:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 16:31:02] [INFO ] [Nat]Added 10 Read/Feed constraints in 11 ms returned sat
[2023-03-10 16:31:02] [INFO ] Computed and/alt/rep : 60/300/60 causal constraints (skipped 1 transitions) in 7 ms.
[2023-03-10 16:31:03] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2023-03-10 16:31:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-10 16:31:03] [INFO ] Added : 54 causal constraints over 11 iterations in 266 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 62/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 62/62 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 65 cols
[2023-03-10 16:31:03] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-10 16:31:03] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 62 rows 65 cols
[2023-03-10 16:31:03] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-10 16:31:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 16:31:03] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2023-03-10 16:31:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 65 cols
[2023-03-10 16:31:03] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-10 16:31:03] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 62/62 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-01 in 2949 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-02
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:31:03] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1426 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:31:03] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-10 16:31:03] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-10 16:31:03] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 16:31:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:03] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-10 16:31:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 16:31:03] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:31:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:03] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-10 16:31:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 16:31:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 17 ms returned sat
[2023-03-10 16:31:03] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 7 ms.
[2023-03-10 16:31:04] [INFO ] Added : 46 causal constraints over 10 iterations in 176 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 73/73 places, 69/69 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 71 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 71 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 70 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 69 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 69 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 68 transition count 64
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 68 transition count 60
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 18 place count 64 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 19 place count 64 transition count 60
Applied a total of 19 rules in 20 ms. Remains 64 /73 variables (removed 9) and now considering 60/69 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/73 places, 60/69 transitions.
// Phase 1: matrix 60 rows 64 cols
[2023-03-10 16:31:04] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 144160 resets, run finished after 873 ms. (steps per millisecond=1145 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91637 resets, run finished after 621 ms. (steps per millisecond=1610 ) properties (out of 1) seen :0
// Phase 1: matrix 60 rows 64 cols
[2023-03-10 16:31:05] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-10 16:31:05] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 16:31:05] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:31:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:05] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-10 16:31:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-10 16:31:05] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:31:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:05] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-10 16:31:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 16:31:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 7 ms returned sat
[2023-03-10 16:31:05] [INFO ] Computed and/alt/rep : 55/282/55 causal constraints (skipped 4 transitions) in 7 ms.
[2023-03-10 16:31:06] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2023-03-10 16:31:06] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2023-03-10 16:31:06] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2023-03-10 16:31:06] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2023-03-10 16:31:06] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2023-03-10 16:31:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 272 ms
[2023-03-10 16:31:06] [INFO ] Added : 48 causal constraints over 11 iterations in 485 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 60/60 transitions.
Applied a total of 0 rules in 6 ms. Remains 64 /64 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 60/60 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 60/60 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 64 cols
[2023-03-10 16:31:06] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-10 16:31:06] [INFO ] Implicit Places using invariants in 85 ms returned [55, 61]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 86 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 62/64 places, 60/60 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 59
Applied a total of 2 rules in 11 ms. Remains 61 /62 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 61 cols
[2023-03-10 16:31:06] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-10 16:31:06] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 59 rows 61 cols
[2023-03-10 16:31:06] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-10 16:31:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 16:31:06] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 61/64 places, 59/60 transitions.
Finished structural reductions, in 2 iterations. Remains : 61/64 places, 59/60 transitions.
// Phase 1: matrix 59 rows 61 cols
[2023-03-10 16:31:06] [INFO ] Computed 10 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 144450 resets, run finished after 1064 ms. (steps per millisecond=939 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91437 resets, run finished after 608 ms. (steps per millisecond=1644 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 61 cols
[2023-03-10 16:31:08] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:08] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-10 16:31:08] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-10 16:31:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:08] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-10 16:31:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-10 16:31:08] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-10 16:31:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:08] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-10 16:31:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 16:31:08] [INFO ] [Nat]Added 10 Read/Feed constraints in 10 ms returned sat
[2023-03-10 16:31:08] [INFO ] Computed and/alt/rep : 56/297/56 causal constraints (skipped 2 transitions) in 6 ms.
[2023-03-10 16:31:08] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2023-03-10 16:31:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-10 16:31:08] [INFO ] Added : 47 causal constraints over 11 iterations in 233 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 59/59 transitions.
Applied a total of 0 rules in 5 ms. Remains 61 /61 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 59/59 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 61 cols
[2023-03-10 16:31:09] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:09] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 59 rows 61 cols
[2023-03-10 16:31:09] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 16:31:09] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2023-03-10 16:31:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 59 rows 61 cols
[2023-03-10 16:31:09] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:09] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 59/59 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-02 in 5875 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-03
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:31:09] [INFO ] Computed 12 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1466 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 914 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:31:09] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-10 16:31:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 16:31:09] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:31:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:09] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-10 16:31:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 16:31:09] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:31:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:09] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-10 16:31:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 16:31:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-10 16:31:09] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 8 ms.
[2023-03-10 16:31:09] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2023-03-10 16:31:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-10 16:31:09] [INFO ] Added : 39 causal constraints over 8 iterations in 179 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 73/73 places, 69/69 transitions.
Graph (complete) has 231 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 72 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 70 transition count 67
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 70 transition count 65
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 68 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 68 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 67 transition count 64
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 14 place count 67 transition count 61
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 17 place count 64 transition count 61
Applied a total of 17 rules in 23 ms. Remains 64 /73 variables (removed 9) and now considering 61/69 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/73 places, 61/69 transitions.
// Phase 1: matrix 61 rows 64 cols
[2023-03-10 16:31:10] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 143983 resets, run finished after 1060 ms. (steps per millisecond=943 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91690 resets, run finished after 631 ms. (steps per millisecond=1584 ) properties (out of 1) seen :0
// Phase 1: matrix 61 rows 64 cols
[2023-03-10 16:31:11] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-10 16:31:11] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 16:31:11] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-10 16:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:11] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-10 16:31:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 16:31:11] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:11] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-10 16:31:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 16:31:11] [INFO ] [Nat]Added 10 Read/Feed constraints in 10 ms returned sat
[2023-03-10 16:31:11] [INFO ] Computed and/alt/rep : 58/291/58 causal constraints (skipped 2 transitions) in 7 ms.
[2023-03-10 16:31:12] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2023-03-10 16:31:12] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-10 16:31:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2023-03-10 16:31:12] [INFO ] Added : 38 causal constraints over 8 iterations in 218 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 61/61 transitions.
Applied a total of 0 rules in 7 ms. Remains 64 /64 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 61/61 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 64 cols
[2023-03-10 16:31:12] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-10 16:31:12] [INFO ] Implicit Places using invariants in 114 ms returned [55, 61]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 115 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 62/64 places, 61/61 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 60
Applied a total of 2 rules in 5 ms. Remains 61 /62 variables (removed 1) and now considering 60/61 (removed 1) transitions.
// Phase 1: matrix 60 rows 61 cols
[2023-03-10 16:31:12] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:12] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 60 rows 61 cols
[2023-03-10 16:31:12] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 16:31:12] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 61/64 places, 60/61 transitions.
Finished structural reductions, in 2 iterations. Remains : 61/64 places, 60/61 transitions.
// Phase 1: matrix 60 rows 61 cols
[2023-03-10 16:31:12] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144324 resets, run finished after 857 ms. (steps per millisecond=1166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91296 resets, run finished after 616 ms. (steps per millisecond=1623 ) properties (out of 1) seen :0
// Phase 1: matrix 60 rows 61 cols
[2023-03-10 16:31:14] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:14] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-10 16:31:14] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-10 16:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:14] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-10 16:31:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-10 16:31:14] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-10 16:31:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:14] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-10 16:31:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 16:31:14] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2023-03-10 16:31:14] [INFO ] Computed and/alt/rep : 58/296/58 causal constraints (skipped 1 transitions) in 10 ms.
[2023-03-10 16:31:14] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
[2023-03-10 16:31:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-10 16:31:14] [INFO ] Added : 35 causal constraints over 7 iterations in 180 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 60/60 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 61 cols
[2023-03-10 16:31:14] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:14] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 60 rows 61 cols
[2023-03-10 16:31:14] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 16:31:14] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2023-03-10 16:31:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 60 rows 61 cols
[2023-03-10 16:31:14] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-10 16:31:14] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 60/60 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-03 in 5353 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-09
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:31:14] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1416 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 933 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:31:14] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-10 16:31:14] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 16:31:14] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-10 16:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:15] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-10 16:31:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 16:31:15] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:31:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:15] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-10 16:31:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 16:31:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2023-03-10 16:31:15] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 10 ms.
[2023-03-10 16:31:15] [INFO ] Added : 48 causal constraints over 10 iterations in 141 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 73/73 places, 69/69 transitions.
Graph (complete) has 231 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 68
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 71 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 70 transition count 67
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 5 place count 70 transition count 65
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9 place count 68 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 67 transition count 64
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 67 transition count 60
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 19 place count 63 transition count 60
Applied a total of 19 rules in 19 ms. Remains 63 /73 variables (removed 10) and now considering 60/69 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/73 places, 60/69 transitions.
// Phase 1: matrix 60 rows 63 cols
[2023-03-10 16:31:15] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144253 resets, run finished after 1151 ms. (steps per millisecond=868 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91688 resets, run finished after 775 ms. (steps per millisecond=1290 ) properties (out of 1) seen :0
// Phase 1: matrix 60 rows 63 cols
[2023-03-10 16:31:17] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-10 16:31:17] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 16:31:17] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 16:31:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:17] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-10 16:31:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 16:31:17] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 16:31:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:17] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-10 16:31:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 16:31:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2023-03-10 16:31:17] [INFO ] Computed and/alt/rep : 56/295/56 causal constraints (skipped 3 transitions) in 10 ms.
[2023-03-10 16:31:17] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2023-03-10 16:31:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-10 16:31:17] [INFO ] Added : 54 causal constraints over 12 iterations in 299 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 60/60 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 63 cols
[2023-03-10 16:31:17] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-10 16:31:17] [INFO ] Implicit Places using invariants in 118 ms returned [54, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 128 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 61/63 places, 60/60 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 59
Applied a total of 2 rules in 8 ms. Remains 60 /61 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:17] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:18] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:18] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 16:31:18] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 60/63 places, 59/60 transitions.
Finished structural reductions, in 2 iterations. Remains : 60/63 places, 59/60 transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:18] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144396 resets, run finished after 1092 ms. (steps per millisecond=915 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91473 resets, run finished after 608 ms. (steps per millisecond=1644 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:20] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:20] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-10 16:31:20] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-10 16:31:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:20] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-10 16:31:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-10 16:31:20] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-10 16:31:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:20] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-10 16:31:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 16:31:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 9 ms returned sat
[2023-03-10 16:31:20] [INFO ] Computed and/alt/rep : 57/309/57 causal constraints (skipped 1 transitions) in 6 ms.
[2023-03-10 16:31:20] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2023-03-10 16:31:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-10 16:31:20] [INFO ] Added : 54 causal constraints over 13 iterations in 238 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 59/59 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:20] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-10 16:31:20] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:20] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-10 16:31:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 16:31:20] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2023-03-10 16:31:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:20] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:20] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 59/59 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-09 in 6047 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-10
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:31:20] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 902 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:31:20] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-10 16:31:21] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-10 16:31:21] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:31:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:21] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-10 16:31:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 16:31:21] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 16:31:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:21] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-10 16:31:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 16:31:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-10 16:31:21] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 10 ms.
[2023-03-10 16:31:21] [INFO ] Added : 52 causal constraints over 11 iterations in 149 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 73/73 places, 69/69 transitions.
Graph (complete) has 231 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 71 transition count 68
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 71 transition count 66
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 69 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 68 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 68 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 67 transition count 64
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 67 transition count 60
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 19 place count 63 transition count 60
Applied a total of 19 rules in 14 ms. Remains 63 /73 variables (removed 10) and now considering 60/69 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/73 places, 60/69 transitions.
// Phase 1: matrix 60 rows 63 cols
[2023-03-10 16:31:21] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 143956 resets, run finished after 923 ms. (steps per millisecond=1083 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91403 resets, run finished after 619 ms. (steps per millisecond=1615 ) properties (out of 1) seen :0
// Phase 1: matrix 60 rows 63 cols
[2023-03-10 16:31:22] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-10 16:31:23] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 16:31:23] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 16:31:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:23] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-10 16:31:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 16:31:23] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:31:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:23] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-10 16:31:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-10 16:31:23] [INFO ] [Nat]Added 9 Read/Feed constraints in 11 ms returned sat
[2023-03-10 16:31:23] [INFO ] Computed and/alt/rep : 55/284/55 causal constraints (skipped 4 transitions) in 7 ms.
[2023-03-10 16:31:23] [INFO ] Added : 42 causal constraints over 10 iterations in 164 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 60/60 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 63 cols
[2023-03-10 16:31:23] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-10 16:31:23] [INFO ] Implicit Places using invariants in 131 ms returned [54, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 137 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 61/63 places, 60/60 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 59
Applied a total of 2 rules in 7 ms. Remains 60 /61 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:23] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:23] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:23] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-10 16:31:23] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 60/63 places, 59/60 transitions.
Finished structural reductions, in 2 iterations. Remains : 60/63 places, 59/60 transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:23] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 144571 resets, run finished after 1141 ms. (steps per millisecond=876 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91394 resets, run finished after 794 ms. (steps per millisecond=1259 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:25] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:25] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-10 16:31:25] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-10 16:31:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:25] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-10 16:31:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-10 16:31:25] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-10 16:31:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:25] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-10 16:31:25] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-10 16:31:25] [INFO ] [Nat]Added 9 Read/Feed constraints in 5 ms returned sat
[2023-03-10 16:31:25] [INFO ] Computed and/alt/rep : 55/290/55 causal constraints (skipped 3 transitions) in 10 ms.
[2023-03-10 16:31:26] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2023-03-10 16:31:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-10 16:31:26] [INFO ] Added : 41 causal constraints over 9 iterations in 166 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 59/59 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:26] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:26] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:26] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:26] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-10 16:31:26] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2023-03-10 16:31:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:26] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:26] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 59/59 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-10 in 5525 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-13
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:31:26] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1451 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 908 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:31:26] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-10 16:31:26] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 16:31:26] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 16:31:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:26] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-10 16:31:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 16:31:26] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:31:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:26] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-10 16:31:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 16:31:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-10 16:31:26] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 9 ms.
[2023-03-10 16:31:26] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2023-03-10 16:31:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-10 16:31:26] [INFO ] Added : 31 causal constraints over 7 iterations in 160 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 73/73 places, 69/69 transitions.
Graph (complete) has 231 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 71 transition count 68
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 71 transition count 66
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 69 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 68 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 68 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 67 transition count 64
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 67 transition count 60
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 19 place count 63 transition count 60
Applied a total of 19 rules in 13 ms. Remains 63 /73 variables (removed 10) and now considering 60/69 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/73 places, 60/69 transitions.
// Phase 1: matrix 60 rows 63 cols
[2023-03-10 16:31:26] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144484 resets, run finished after 1071 ms. (steps per millisecond=933 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91239 resets, run finished after 621 ms. (steps per millisecond=1610 ) properties (out of 1) seen :0
// Phase 1: matrix 60 rows 63 cols
[2023-03-10 16:31:28] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-10 16:31:28] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 16:31:28] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-10 16:31:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:28] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-10 16:31:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-10 16:31:28] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 16:31:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:28] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-10 16:31:28] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-10 16:31:28] [INFO ] [Nat]Added 9 Read/Feed constraints in 11 ms returned sat
[2023-03-10 16:31:28] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2023-03-10 16:31:28] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2023-03-10 16:31:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2023-03-10 16:31:28] [INFO ] Computed and/alt/rep : 53/269/53 causal constraints (skipped 6 transitions) in 4 ms.
[2023-03-10 16:31:28] [INFO ] Added : 52 causal constraints over 11 iterations in 149 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 60/60 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 63 cols
[2023-03-10 16:31:29] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-10 16:31:29] [INFO ] Implicit Places using invariants in 104 ms returned [53, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 105 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 61/63 places, 60/60 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 59
Applied a total of 2 rules in 5 ms. Remains 60 /61 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:29] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-10 16:31:29] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:29] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-10 16:31:29] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-10 16:31:29] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 60/63 places, 59/60 transitions.
Finished structural reductions, in 2 iterations. Remains : 60/63 places, 59/60 transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:29] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 143875 resets, run finished after 970 ms. (steps per millisecond=1030 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91654 resets, run finished after 610 ms. (steps per millisecond=1639 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:31] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-10 16:31:31] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-10 16:31:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:31] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-10 16:31:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-10 16:31:31] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-10 16:31:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:31] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-10 16:31:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-10 16:31:31] [INFO ] [Nat]Added 9 Read/Feed constraints in 7 ms returned sat
[2023-03-10 16:31:31] [INFO ] Computed and/alt/rep : 54/284/54 causal constraints (skipped 4 transitions) in 8 ms.
[2023-03-10 16:31:31] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2023-03-10 16:31:31] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2023-03-10 16:31:31] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2023-03-10 16:31:31] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2023-03-10 16:31:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 207 ms
[2023-03-10 16:31:31] [INFO ] Added : 54 causal constraints over 13 iterations in 478 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 17 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 59/59 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:31] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-10 16:31:31] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:31] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-10 16:31:32] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-10 16:31:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:32] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-10 16:31:32] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 59/59 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-13 in 5692 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-14
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:31:32] [INFO ] Computed 12 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1455 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 69 rows 73 cols
[2023-03-10 16:31:32] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-10 16:31:32] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 16:31:32] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 16:31:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:32] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-10 16:31:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-10 16:31:32] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-10 16:31:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:32] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-10 16:31:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 16:31:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-10 16:31:32] [INFO ] Computed and/alt/rep : 65/279/65 causal constraints (skipped 3 transitions) in 14 ms.
[2023-03-10 16:31:32] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2023-03-10 16:31:32] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
[2023-03-10 16:31:32] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2023-03-10 16:31:32] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2023-03-10 16:31:32] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2023-03-10 16:31:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 249 ms
[2023-03-10 16:31:32] [INFO ] Added : 64 causal constraints over 13 iterations in 506 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 73/73 places, 69/69 transitions.
Graph (complete) has 231 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 72 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 70 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 70 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 69 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 68 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 68 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 67 transition count 64
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 67 transition count 60
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 19 place count 63 transition count 60
Applied a total of 19 rules in 15 ms. Remains 63 /73 variables (removed 10) and now considering 60/69 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/73 places, 60/69 transitions.
// Phase 1: matrix 60 rows 63 cols
[2023-03-10 16:31:33] [INFO ] Computed 12 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 144097 resets, run finished after 866 ms. (steps per millisecond=1154 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91199 resets, run finished after 612 ms. (steps per millisecond=1633 ) properties (out of 1) seen :0
// Phase 1: matrix 60 rows 63 cols
[2023-03-10 16:31:34] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-10 16:31:34] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 16:31:34] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-10 16:31:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:34] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-10 16:31:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 16:31:34] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 16:31:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:34] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-10 16:31:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 16:31:34] [INFO ] [Nat]Added 10 Read/Feed constraints in 16 ms returned sat
[2023-03-10 16:31:34] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2023-03-10 16:31:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-10 16:31:34] [INFO ] Computed and/alt/rep : 55/278/55 causal constraints (skipped 4 transitions) in 7 ms.
[2023-03-10 16:31:34] [INFO ] Added : 41 causal constraints over 9 iterations in 146 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 60/60 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 63 cols
[2023-03-10 16:31:34] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-10 16:31:35] [INFO ] Implicit Places using invariants in 74 ms returned [54, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 74 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 61/63 places, 60/60 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 59
Applied a total of 2 rules in 3 ms. Remains 60 /61 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:35] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:35] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:35] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 16:31:35] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 60/63 places, 59/60 transitions.
Finished structural reductions, in 2 iterations. Remains : 60/63 places, 59/60 transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:35] [INFO ] Computed 10 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 144064 resets, run finished after 850 ms. (steps per millisecond=1176 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91399 resets, run finished after 609 ms. (steps per millisecond=1642 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:36] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-10 16:31:36] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-10 16:31:36] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-10 16:31:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:36] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-10 16:31:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:31:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-10 16:31:36] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-10 16:31:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:31:36] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-10 16:31:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 16:31:36] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
[2023-03-10 16:31:36] [INFO ] Computed and/alt/rep : 56/293/56 causal constraints (skipped 2 transitions) in 5 ms.
[2023-03-10 16:31:37] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 2 ms to minimize.
[2023-03-10 16:31:37] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2023-03-10 16:31:37] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2023-03-10 16:31:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 143 ms
[2023-03-10 16:31:37] [INFO ] Added : 56 causal constraints over 12 iterations in 338 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 59/59 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 59/59 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:37] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-10 16:31:37] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:37] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 16:31:37] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2023-03-10 16:31:37] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 59 rows 60 cols
[2023-03-10 16:31:37] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:31:37] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 59/59 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-14 in 5647 ms.
[2023-03-10 16:31:38] [INFO ] Flatten gal took : 77 ms
[2023-03-10 16:31:38] [INFO ] Applying decomposition
[2023-03-10 16:31:38] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18213478826052084234.txt' '-o' '/tmp/graph18213478826052084234.bin' '-w' '/tmp/graph18213478826052084234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18213478826052084234.bin' '-l' '-1' '-v' '-w' '/tmp/graph18213478826052084234.weights' '-q' '0' '-e' '0.001'
[2023-03-10 16:31:38] [INFO ] Decomposing Gal with order
[2023-03-10 16:31:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 16:31:38] [INFO ] Removed a total of 35 redundant transitions.
[2023-03-10 16:31:38] [INFO ] Flatten gal took : 106 ms
[2023-03-10 16:31:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 13 ms.
[2023-03-10 16:31:38] [INFO ] Time to serialize gal into /tmp/UpperBounds14636678175048246051.gal : 14 ms
[2023-03-10 16:31:38] [INFO ] Time to serialize properties into /tmp/UpperBounds14552373555954222197.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14636678175048246051.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14552373555954222197.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds14552373555954222197.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,804813,2.22506,48004,3119,1416,94800,7493,337,75057,92,35739,0
Total reachable state count : 804813

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

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-01,0,3.21057,48264,1,0,94800,8290,447,174645,106,115364,1412
Min sum of variable value : 0
Maximum sum along a path : 256
Bounds property DoubleExponent-PT-003-UpperBounds-02 :0 <= i0.u9.p163 <= 256
FORMULA DoubleExponent-PT-003-UpperBounds-02 256 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-02,0,3.21569,48264,1,0,94800,8581,477,175095,361,116008,1663
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-03 :0 <= i0.u3.p122 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-03,0,3.216,48264,1,0,94800,8581,492,175100,363,116017,1685
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-09 :0 <= i1.u5.p140 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-09,0,3.21866,48264,1,0,94800,8600,505,175426,363,116214,1986
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-10 :0 <= i1.u6.p141 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-10,0,3.22163,48264,1,0,94800,8621,521,175796,370,116479,2435
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-13 :0 <= i4.i0.u12.p88 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-13,0,3.24521,48264,1,0,94800,8688,538,178225,370,117236,2539
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-14 :0 <= i2.u7.p155 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-14,0,3.39918,48264,1,0,94800,9573,552,191542,372,125443,2902
Total runtime 73110 ms.

BK_STOP 1678465902166

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-003"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is DoubleExponent-PT-003, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r159-smll-167819445200058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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