About the Execution of ITS-Tools for DoubleExponent-PT-003
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 652.287 | 57455.00 | 84190.00 | 277.30 | 1 1 1 1 1 16 1 2 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/mcc2024-input.r136-tall-171631132900541.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DoubleExponent-PT-003, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132900541
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 12 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 50K May 18 16:42 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 1716385505204
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-22 13:45:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 13:45:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:45:06] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-05-22 13:45:06] [INFO ] Transformed 163 places.
[2024-05-22 13:45:06] [INFO ] Transformed 148 transitions.
[2024-05-22 13:45:06] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 148 rows 163 cols
[2024-05-22 13:45:06] [INFO ] Computed 19 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, 1, 2, 3, 1, 1, 3, 1, 1, 1, 12]
RANDOM walk for 10000 steps (338 resets) in 30 ms. (322 steps per ms)
FORMULA DoubleExponent-PT-003-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110002 steps (3085 resets) in 220 ms. (497 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 3, 3, 1, 1, 12]
[2024-05-22 13:45:06] [INFO ] Invariant cache hit.
[2024-05-22 13:45:07] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-05-22 13:45:07] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2024-05-22 13:45:07] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-22 13:45:07] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 9 ms to minimize.
[2024-05-22 13:45:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-22 13:45:07] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-22 13:45:07] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-22 13:45:07] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 1 ms to minimize.
[2024-05-22 13:45:07] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 2 ms to minimize.
[2024-05-22 13:45:07] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 2 ms to minimize.
[2024-05-22 13:45:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 216 ms
[2024-05-22 13:45:07] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-22 13:45:08] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:45:08] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 1 ms to minimize.
[2024-05-22 13:45:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2024-05-22 13:45:08] [INFO ] Added : 142 causal constraints over 29 iterations in 651 ms. Result :sat
Minimization took 154 ms.
[2024-05-22 13:45:08] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-22 13:45:08] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-22 13:45:08] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-22 13:45:08] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 1 ms to minimize.
[2024-05-22 13:45:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-22 13:45:08] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2024-05-22 13:45:08] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-22 13:45:08] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:45:08] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2024-05-22 13:45:08] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-05-22 13:45:08] [INFO ] Deduced a trap composed of 69 places in 47 ms of which 1 ms to minimize.
[2024-05-22 13:45:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 243 ms
[2024-05-22 13:45:09] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-22 13:45:09] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 1 ms to minimize.
[2024-05-22 13:45:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-22 13:45:09] [INFO ] Added : 108 causal constraints over 22 iterations in 421 ms. Result :sat
Minimization took 130 ms.
[2024-05-22 13:45:09] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 13:45:09] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2024-05-22 13:45:09] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-22 13:45:09] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 13:45:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 13:45:09] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2024-05-22 13:45:09] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-22 13:45:09] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:45:09] [INFO ] Deduced a trap composed of 49 places in 35 ms of which 1 ms to minimize.
[2024-05-22 13:45:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2024-05-22 13:45:09] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-22 13:45:10] [INFO ] Added : 97 causal constraints over 20 iterations in 253 ms. Result :sat
Minimization took 127 ms.
[2024-05-22 13:45:10] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 13:45:10] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-22 13:45:10] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-22 13:45:10] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-05-22 13:45:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 13:45:10] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2024-05-22 13:45:10] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-22 13:45:10] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 0 ms to minimize.
[2024-05-22 13:45:10] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 0 ms to minimize.
[2024-05-22 13:45:10] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-22 13:45:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 146 ms
[2024-05-22 13:45:10] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-22 13:45:10] [INFO ] Added : 106 causal constraints over 22 iterations in 289 ms. Result :sat
Minimization took 131 ms.
[2024-05-22 13:45:11] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 13:45:11] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-22 13:45:11] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-22 13:45:11] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 1 ms to minimize.
[2024-05-22 13:45:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 13:45:11] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-22 13:45:11] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-22 13:45:11] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:45:11] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-05-22 13:45:11] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-05-22 13:45:11] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-05-22 13:45:11] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-05-22 13:45:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 307 ms
[2024-05-22 13:45:11] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-22 13:45:12] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-05-22 13:45:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-05-22 13:45:12] [INFO ] Added : 135 causal constraints over 27 iterations in 486 ms. Result :sat
Minimization took 151 ms.
[2024-05-22 13:45:12] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:12] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2024-05-22 13:45:12] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-22 13:45:12] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:45:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:12] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-22 13:45:12] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-22 13:45:12] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-22 13:45:12] [INFO ] Deduced a trap composed of 42 places in 27 ms of which 1 ms to minimize.
[2024-05-22 13:45:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2024-05-22 13:45:12] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-22 13:45:13] [INFO ] Added : 141 causal constraints over 29 iterations in 409 ms. Result :sat
Minimization took 141 ms.
[2024-05-22 13:45:13] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 13:45:13] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned unsat
[2024-05-22 13:45:13] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 13:45:13] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned unsat
[2024-05-22 13:45:13] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 13:45:13] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2024-05-22 13:45:13] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-22 13:45:13] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 1 ms to minimize.
[2024-05-22 13:45:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:13] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2024-05-22 13:45:13] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-22 13:45:13] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 0 ms to minimize.
[2024-05-22 13:45:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-22 13:45:13] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-22 13:45:13] [INFO ] Added : 138 causal constraints over 28 iterations in 391 ms. Result :sat
Minimization took 137 ms.
[2024-05-22 13:45:14] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:14] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-22 13:45:14] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-22 13:45:14] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-22 13:45:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 13:45:14] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-22 13:45:14] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-22 13:45:14] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 13:45:14] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-22 13:45:14] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 4 ms to minimize.
[2024-05-22 13:45:14] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 2 ms to minimize.
[2024-05-22 13:45:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 251 ms
[2024-05-22 13:45:14] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-22 13:45:14] [INFO ] Added : 136 causal constraints over 28 iterations in 374 ms. Result :sat
Minimization took 158 ms.
[2024-05-22 13:45:15] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 13:45:15] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-22 13:45:15] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-22 13:45:15] [INFO ] Deduced a trap composed of 67 places in 55 ms of which 1 ms to minimize.
[2024-05-22 13:45:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 13:45:15] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-22 13:45:15] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-22 13:45:15] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 2 ms to minimize.
[2024-05-22 13:45:15] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2024-05-22 13:45:15] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
[2024-05-22 13:45:15] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 2 ms to minimize.
[2024-05-22 13:45:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 232 ms
[2024-05-22 13:45:15] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-22 13:45:16] [INFO ] Added : 145 causal constraints over 29 iterations in 399 ms. Result :sat
Minimization took 135 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 1, 1, 12]
FORMULA DoubleExponent-PT-003-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 12]
Support contains 9 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 148/148 transitions.
Graph (complete) has 269 edges and 163 vertex of which 157 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 156 transition count 116
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 126 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 124 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 124 transition count 107
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 82 place count 117 transition count 107
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 140 place count 88 transition count 78
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 146 place count 85 transition count 78
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 157 place count 85 transition count 67
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 168 place count 74 transition count 67
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 177 place count 74 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 73 transition count 66
Applied a total of 178 rules in 55 ms. Remains 73 /163 variables (removed 90) and now considering 66/148 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 73/163 places, 66/148 transitions.
Found an invariant !
This invariant on transitions {11=1, 12=1, 13=1, 27=1, 28=1, 36=1, 45=1, 58=1, 62=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {11=1, 12=1, 13=1, 27=1, 28=1, 36=1, 45=1, 58=1, 62=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1308 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 12]
// Phase 1: matrix 66 rows 73 cols
[2024-05-22 13:45:17] [INFO ] Computed 15 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
RANDOM walk for 1000000 steps (128088 resets) in 905 ms. (1103 steps per ms)
BEST_FIRST walk for 9000002 steps (761996 resets) in 4698 ms. (1915 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
[2024-05-22 13:45:22] [INFO ] Invariant cache hit.
[2024-05-22 13:45:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:22] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-22 13:45:22] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-22 13:45:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-22 13:45:22] [INFO ] [Real]Added 7 Read/Feed constraints in 6 ms returned sat
[2024-05-22 13:45:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:22] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-22 13:45:22] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-22 13:45:22] [INFO ] [Nat]Added 7 Read/Feed constraints in 5 ms returned sat
[2024-05-22 13:45:22] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-22 13:45:23] [INFO ] Added : 58 causal constraints over 13 iterations in 115 ms. Result :sat
Minimization took 47 ms.
[2024-05-22 13:45:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:45:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Nat]Added 7 Read/Feed constraints in 6 ms returned sat
[2024-05-22 13:45:23] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 13:45:23] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-22 13:45:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-22 13:45:23] [INFO ] Added : 44 causal constraints over 9 iterations in 138 ms. Result :sat
Minimization took 37 ms.
[2024-05-22 13:45:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 4 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Real]Added 7 Read/Feed constraints in 9 ms returned sat
[2024-05-22 13:45:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 5 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Nat]Added 7 Read/Feed constraints in 6 ms returned sat
[2024-05-22 13:45:23] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-22 13:45:23] [INFO ] Added : 37 causal constraints over 8 iterations in 66 ms. Result :sat
Minimization took 38 ms.
[2024-05-22 13:45:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Real]Added 7 Read/Feed constraints in 5 ms returned sat
[2024-05-22 13:45:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Nat]Added 7 Read/Feed constraints in 6 ms returned sat
[2024-05-22 13:45:23] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-22 13:45:23] [INFO ] Added : 40 causal constraints over 8 iterations in 66 ms. Result :sat
Minimization took 34 ms.
[2024-05-22 13:45:23] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-22 13:45:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 4 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-22 13:45:23] [INFO ] [Nat]Added 7 Read/Feed constraints in 9 ms returned sat
[2024-05-22 13:45:24] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-22 13:45:24] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-22 13:45:24] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-22 13:45:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 113 ms
[2024-05-22 13:45:24] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 13:45:24] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-22 13:45:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-22 13:45:24] [INFO ] Added : 65 causal constraints over 15 iterations in 182 ms. Result :sat
Minimization took 46 ms.
[2024-05-22 13:45:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:24] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-22 13:45:24] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-22 13:45:24] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:45:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:24] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-22 13:45:24] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-22 13:45:24] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-22 13:45:24] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-22 13:45:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-22 13:45:24] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 13:45:24] [INFO ] Added : 63 causal constraints over 13 iterations in 125 ms. Result :sat
Minimization took 52 ms.
[2024-05-22 13:45:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:24] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-22 13:45:24] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-22 13:45:24] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:45:24] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 13:45:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:24] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-22 13:45:24] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-22 13:45:24] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:45:24] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 13:45:24] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-22 13:45:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-22 13:45:24] [INFO ] Added : 63 causal constraints over 13 iterations in 169 ms. Result :sat
Minimization took 50 ms.
[2024-05-22 13:45:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:25] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-22 13:45:25] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-22 13:45:25] [INFO ] [Real]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-22 13:45:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:25] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-22 13:45:25] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-22 13:45:25] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-22 13:45:25] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:45:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-22 13:45:25] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 13:45:25] [INFO ] Added : 63 causal constraints over 13 iterations in 125 ms. Result :sat
Minimization took 43 ms.
[2024-05-22 13:45:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:25] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-22 13:45:25] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-22 13:45:25] [INFO ] [Real]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-22 13:45:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:25] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-22 13:45:25] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-22 13:45:25] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:45:25] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 13:45:25] [INFO ] Added : 65 causal constraints over 13 iterations in 130 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
Support contains 9 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 66/66 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 73/73 places, 66/66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 66/66 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-22 13:45:25] [INFO ] Invariant cache hit.
[2024-05-22 13:45:25] [INFO ] Implicit Places using invariants in 78 ms returned [14, 21, 39, 44, 63]
[2024-05-22 13:45:25] [INFO ] Actually due to overlaps returned [39, 44, 14]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 89 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 70/73 places, 66/66 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 69 transition count 65
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 69 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 68 transition count 64
Applied a total of 4 rules in 11 ms. Remains 68 /70 variables (removed 2) and now considering 64/66 (removed 2) transitions.
// Phase 1: matrix 64 rows 68 cols
[2024-05-22 13:45:25] [INFO ] Computed 12 invariants in 1 ms
[2024-05-22 13:45:25] [INFO ] Implicit Places using invariants in 48 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 67/73 places, 64/66 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 64
Applied a total of 1 rules in 8 ms. Remains 67 /67 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 67 cols
[2024-05-22 13:45:25] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 13:45:26] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 13:45:26] [INFO ] Invariant cache hit.
[2024-05-22 13:45:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-22 13:45:26] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 67/73 places, 64/66 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 324 ms. Remains : 67/73 places, 64/66 transitions.
Found an invariant !
This invariant on transitions {9=1, 10=1, 24=1, 30=1, 39=1, 52=1, 56=1, 61=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {9=1, 10=1, 24=1, 30=1, 39=1, 52=1, 56=1, 61=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1407 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
[2024-05-22 13:45:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
RANDOM walk for 1000000 steps (144345 resets) in 652 ms. (1531 steps per ms)
BEST_FIRST walk for 9000002 steps (823384 resets) in 4230 ms. (2127 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
[2024-05-22 13:45:32] [INFO ] Invariant cache hit.
[2024-05-22 13:45:32] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-22 13:45:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-22 13:45:32] [INFO ] [Real]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-22 13:45:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-05-22 13:45:32] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 13:45:32] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-22 13:45:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-22 13:45:32] [INFO ] Added : 60 causal constraints over 13 iterations in 151 ms. Result :sat
Minimization took 48 ms.
[2024-05-22 13:45:32] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Real]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-05-22 13:45:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-22 13:45:32] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 13:45:32] [INFO ] Added : 63 causal constraints over 13 iterations in 112 ms. Result :sat
Minimization took 51 ms.
[2024-05-22 13:45:32] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:45:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:45:32] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 13:45:32] [INFO ] Added : 54 causal constraints over 11 iterations in 89 ms. Result :sat
Minimization took 37 ms.
[2024-05-22 13:45:32] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-22 13:45:32] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:45:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:45:33] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 13:45:33] [INFO ] Added : 54 causal constraints over 11 iterations in 98 ms. Result :sat
Minimization took 41 ms.
[2024-05-22 13:45:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Real]Added 7 Read/Feed constraints in 6 ms returned sat
[2024-05-22 13:45:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-22 13:45:33] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 13:45:33] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:45:33] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-22 13:45:33] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-05-22 13:45:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 135 ms
[2024-05-22 13:45:33] [INFO ] Added : 59 causal constraints over 13 iterations in 264 ms. Result :sat
Minimization took 41 ms.
[2024-05-22 13:45:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Real]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-22 13:45:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-05-22 13:45:33] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:45:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-22 13:45:33] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-22 13:45:33] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-05-22 13:45:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2024-05-22 13:45:33] [INFO ] Added : 51 causal constraints over 11 iterations in 122 ms. Result :sat
Minimization took 36 ms.
[2024-05-22 13:45:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:45:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-22 13:45:33] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-05-22 13:45:33] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 13:45:34] [INFO ] Added : 53 causal constraints over 11 iterations in 102 ms. Result :sat
Minimization took 43 ms.
[2024-05-22 13:45:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:34] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:34] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-22 13:45:34] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:45:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:34] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:34] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-22 13:45:34] [INFO ] [Nat]Added 7 Read/Feed constraints in 7 ms returned sat
[2024-05-22 13:45:34] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 8 ms to minimize.
[2024-05-22 13:45:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-22 13:45:34] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-22 13:45:34] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-22 13:45:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-22 13:45:34] [INFO ] Added : 47 causal constraints over 10 iterations in 113 ms. Result :sat
Minimization took 35 ms.
[2024-05-22 13:45:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:34] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:34] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-22 13:45:34] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:45:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:34] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:34] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-22 13:45:34] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-22 13:45:34] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-22 13:45:34] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-22 13:45:34] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 13:45:34] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 1 ms to minimize.
[2024-05-22 13:45:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 152 ms
[2024-05-22 13:45:34] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-22 13:45:34] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-22 13:45:34] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-22 13:45:34] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:45:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 126 ms
[2024-05-22 13:45:35] [INFO ] Added : 63 causal constraints over 13 iterations in 243 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
Support contains 9 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 67/67 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 67 /67 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-22 13:45:35] [INFO ] Invariant cache hit.
[2024-05-22 13:45:35] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 13:45:35] [INFO ] Invariant cache hit.
[2024-05-22 13:45:35] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-22 13:45:35] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-22 13:45:35] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-22 13:45:35] [INFO ] Invariant cache hit.
[2024-05-22 13:45:35] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 64/131 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 63 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-22 13:45:36] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 1 ms to minimize.
[2024-05-22 13:45:36] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
[2024-05-22 13:45:36] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-22 13:45:36] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/131 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 89 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1518 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 67/67 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/131 variables, 67/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 63/152 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-22 13:45:37] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 153 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1727 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 67/67 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 5/5 constraints]
After SMT, in 3289ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 3305ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3485 ms. Remains : 67/67 places, 64/64 transitions.
Found an invariant !
This invariant on transitions {9=1, 10=1, 24=1, 30=1, 39=1, 52=1, 56=1, 61=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {9=1, 10=1, 24=1, 30=1, 39=1, 52=1, 56=1, 61=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1465 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
RANDOM walk for 40000 steps (5800 resets) in 1444 ms. (27 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (355 resets) in 34 ms. (114 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (365 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (380 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
[2024-05-22 13:45:40] [INFO ] Flatten gal took : 29 ms
BEST_FIRST walk for 4001 steps (366 resets) in 114 ms. (34 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (365 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (345 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
[2024-05-22 13:45:40] [INFO ] Flatten gal took : 49 ms
BEST_FIRST walk for 4001 steps (381 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (365 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
[2024-05-22 13:45:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11346225193690557597.gal : 14 ms
BEST_FIRST walk for 4001 steps (368 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
[2024-05-22 13:45:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6772848968033263389.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11346225193690557597.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6772848968033263389.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4000 steps (363 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (391 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (364 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (371 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (354 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (339 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (354 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (364 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6772848968033263389.prop.
SDD proceeding with computation,17 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,17 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,17 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,17 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,17 properties remain. new max is 64
SDD size :14 after 25
SDD proceeding with computation,17 properties remain. new max is 128
SDD size :25 after 42
SDD proceeding with computation,17 properties remain. new max is 256
SDD size :42 after 130
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :130 after 454
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :454 after 908
Invariant property MIN7 does not hold.
Reachability property MAX7 is true.
Invariant property MIN4 does not hold.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :908 after 2530
Invariant property MIN8 does not hold.
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :2530 after 9722
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :9722 after 20011
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :20011 after 44691
Invariant property MIN6 does not hold.
Reachability property MAX6 is true.
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :135400 after 136577
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :225821 after 254140
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :458442 after 474266
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,759985,1.33086,39152,2,8370,33,130146,7,0,335,144181,0
Total reachable state count : 759985
Verifying 17 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,15,1.33177,39152,2,97,33,130146,8,0,338,144181,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,15,1.3322,39152,2,97,33,130146,9,0,339,144181,0
Reachability property MAX1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,9,1.3326,39152,2,130,33,130146,10,0,341,144181,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,9,1.3329,39152,2,130,33,130146,11,0,342,144181,0
Reachability property MAX2 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,1,1.33321,39152,2,68,33,130146,12,0,344,144181,0
Invariant property MIN2 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,1,1.33342,39152,2,68,33,130146,13,0,345,144181,0
Reachability property MAX3 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,1,1.33382,39152,2,68,33,130146,14,0,347,144181,0
Invariant property MIN3 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,1,1.33408,39152,2,68,33,130146,15,0,348,144181,0
Invariant property MIN4 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,903,1.33449,39152,2,686,33,130146,16,0,350,144181,0
Reachability property MAX5 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX5,15,1.33468,39152,2,110,33,130146,17,0,352,144181,0
Invariant property MIN5 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,15,1.33486,39152,2,110,33,130146,18,0,353,144181,0
Reachability property MAX6 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX6,136,1.33504,39152,2,173,33,130146,19,0,355,144181,0
Invariant property MIN6 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN6,136,1.33522,39152,2,173,33,130146,20,0,356,144181,0
Reachability property MAX7 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX7,2176,1.33565,39152,2,1043,33,130146,21,0,358,144181,0
Invariant property MIN7 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN7,2176,1.33607,39152,2,1043,33,130146,22,0,359,144181,0
Reachability property MAX8 does not hold.
No reachable states exhibit your property : MAX8
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX8,0,1.33794,39152,1,0,33,130146,22,0,359,144181,0
Invariant property MIN8 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN8,227,1.33858,39152,2,486,33,130146,23,0,361,144181,0
ITS tools runner thread asked to quit. Dying gracefully.
Probabilistic random walk after 1000000 steps, saw 500119 distinct states, run finished after 2614 ms. (steps per millisecond=382 ) properties seen :16
FORMULA DoubleExponent-PT-003-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 7 queries.) : Max Seen:[0, 0] Max Struct:[+inf, 6]
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 13:45:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1446 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10000 steps (905 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 13:45:43] [INFO ] Invariant cache hit.
[2024-05-22 13:45:43] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:43] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:43] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-22 13:45:43] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-22 13:45:43] [INFO ] [Real]Added 7 Read/Feed constraints in 12 ms returned sat
[2024-05-22 13:45:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 23 ms returned sat
[2024-05-22 13:45:43] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:43] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-22 13:45:43] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:45:43] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 13:45:43] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 3 ms to minimize.
[2024-05-22 13:45:43] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-22 13:45:43] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 1 ms to minimize.
[2024-05-22 13:45:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 148 ms
[2024-05-22 13:45:43] [INFO ] Added : 59 causal constraints over 13 iterations in 285 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 64/64 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 67 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 65 transition count 62
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 65 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 64 transition count 61
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 64 transition count 59
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 10 place count 62 transition count 59
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 12 place count 62 transition count 59
Applied a total of 12 rules in 18 ms. Remains 62 /67 variables (removed 5) and now considering 59/64 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 62/67 places, 59/64 transitions.
Found an invariant !
This invariant on transitions {7=1, 8=1, 17=1, 23=1, 30=1, 42=1, 46=1, 50=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {7=1, 8=1, 17=1, 23=1, 30=1, 42=1, 46=1, 50=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1409 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 59 rows 62 cols
[2024-05-22 13:45:44] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144260 resets) in 588 ms. (1697 steps per ms)
BEST_FIRST walk for 1000001 steps (91599 resets) in 428 ms. (2331 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 13:45:45] [INFO ] Invariant cache hit.
[2024-05-22 13:45:45] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-22 13:45:45] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:45] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-22 13:45:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 13:45:45] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-22 13:45:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:45] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:45] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-22 13:45:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-22 13:45:45] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-22 13:45:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-22 13:45:45] [INFO ] Computed and/alt/rep : 56/283/56 causal constraints (skipped 2 transitions) in 3 ms.
[2024-05-22 13:45:45] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-22 13:45:45] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-22 13:45:45] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:45:45] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-22 13:45:45] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-22 13:45:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 170 ms
[2024-05-22 13:45:45] [INFO ] Added : 45 causal constraints over 9 iterations in 230 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 62/62 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-22 13:45:45] [INFO ] Invariant cache hit.
[2024-05-22 13:45:45] [INFO ] Implicit Places using invariants in 54 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/62 places, 59/59 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 58
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 58
Applied a total of 2 rules in 7 ms. Remains 60 /61 variables (removed 1) and now considering 58/59 (removed 1) transitions.
// Phase 1: matrix 58 rows 60 cols
[2024-05-22 13:45:45] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 13:45:45] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 13:45:45] [INFO ] Invariant cache hit.
[2024-05-22 13:45:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 13:45:45] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 60/62 places, 58/59 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 210 ms. Remains : 60/62 places, 58/59 transitions.
Found an invariant !
This invariant on transitions {7=1, 8=1, 16=1, 22=1, 29=1, 40=1, 44=1, 48=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {7=1, 8=1, 16=1, 22=1, 29=1, 40=1, 44=1, 48=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1468 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 13:45:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144218 resets) in 584 ms. (1709 steps per ms)
BEST_FIRST walk for 1000000 steps (91802 resets) in 424 ms. (2352 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 13:45:46] [INFO ] Invariant cache hit.
[2024-05-22 13:45:46] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:46] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:46] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-22 13:45:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 13:45:46] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:45:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:46] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:47] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-22 13:45:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-22 13:45:47] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-22 13:45:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-22 13:45:47] [INFO ] Computed and/alt/rep : 56/289/56 causal constraints (skipped 1 transitions) in 3 ms.
[2024-05-22 13:45:47] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-22 13:45:47] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-22 13:45:47] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-22 13:45:47] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-22 13:45:47] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-22 13:45:47] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-22 13:45:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 202 ms
[2024-05-22 13:45:47] [INFO ] Added : 54 causal constraints over 15 iterations in 321 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 58/58 transitions.
Applied a total of 0 rules in 9 ms. Remains 60 /60 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 60/60 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 58/58 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2024-05-22 13:45:47] [INFO ] Invariant cache hit.
[2024-05-22 13:45:47] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 13:45:47] [INFO ] Invariant cache hit.
[2024-05-22 13:45:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 13:45:47] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-05-22 13:45:47] [INFO ] Redundant transitions in 0 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-22 13:45:47] [INFO ] Invariant cache hit.
[2024-05-22 13:45:47] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/118 variables, 60/70 constraints. Problems are: Problem set: 0 solved, 57 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 78 constraints, problems are : Problem set: 0 solved, 57 unsolved in 693 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/118 variables, 60/70 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 57/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-22 13:45:48] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-22 13:45:48] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-22 13:45:48] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-22 13:45:49] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (OVERLAPS) 0/118 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 139 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1786 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 4/4 constraints]
After SMT, in 2496ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 2497ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2657 ms. Remains : 60/60 places, 58/58 transitions.
Found an invariant !
This invariant on transitions {7=1, 8=1, 16=1, 22=1, 29=1, 40=1, 44=1, 48=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {7=1, 8=1, 16=1, 22=1, 29=1, 40=1, 44=1, 48=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1459 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 40000 steps (5743 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
[2024-05-22 13:45:50] [INFO ] Flatten gal took : 30 ms
[2024-05-22 13:45:50] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:45:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7437269678402117287.gal : 3 ms
[2024-05-22 13:45:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5792203496027066303.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7437269678402117287.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5792203496027066303.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (3639 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2058 steps, run visited all 1 properties in 6 ms. (steps per millisecond=343 )
Probabilistic random walk after 2058 steps, saw 1044 distinct states, run finished after 10 ms. (steps per millisecond=205 ) properties seen :1
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5792203496027066303.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
ITS runner timed out or was interrupted.
SDD size :2 after 6
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-05 in 7080 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 64 rows 67 cols
[2024-05-22 13:45:50] [INFO ] Computed 11 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (1451 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10000 steps (894 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-22 13:45:50] [INFO ] Invariant cache hit.
[2024-05-22 13:45:50] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:50] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:50] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-22 13:45:50] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-22 13:45:50] [INFO ] [Real]Added 7 Read/Feed constraints in 7 ms returned sat
[2024-05-22 13:45:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:50] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:50] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-22 13:45:50] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-22 13:45:50] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-22 13:45:50] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
[2024-05-22 13:45:50] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-22 13:45:50] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-22 13:45:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 124 ms
[2024-05-22 13:45:50] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-22 13:45:50] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-22 13:45:50] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 0 ms to minimize.
[2024-05-22 13:45:50] [INFO ] Deduced a trap composed of 35 places in 25 ms of which 1 ms to minimize.
[2024-05-22 13:45:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 122 ms
[2024-05-22 13:45:50] [INFO ] Added : 63 causal constraints over 13 iterations in 244 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 64/64 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 67 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 65 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 63 transition count 60
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 63 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 62 transition count 59
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 62 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 61 transition count 58
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 13 place count 61 transition count 58
Applied a total of 13 rules in 11 ms. Remains 61 /67 variables (removed 6) and now considering 58/64 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 61/67 places, 58/64 transitions.
// Phase 1: matrix 58 rows 61 cols
[2024-05-22 13:45:50] [INFO ] Computed 11 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (144473 resets) in 581 ms. (1718 steps per ms)
BEST_FIRST walk for 1000001 steps (91384 resets) in 419 ms. (2380 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2024-05-22 13:45:51] [INFO ] Invariant cache hit.
[2024-05-22 13:45:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:51] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-22 13:45:51] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-22 13:45:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 13:45:51] [INFO ] [Real]Added 10 Read/Feed constraints in 6 ms returned sat
[2024-05-22 13:45:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:52] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:52] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-22 13:45:52] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:45:52] [INFO ] Computed and/alt/rep : 57/294/57 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 13:45:52] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-22 13:45:52] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-22 13:45:52] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-22 13:45:52] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:45:52] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:45:52] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-22 13:45:52] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-22 13:45:52] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-22 13:45:52] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-22 13:45:52] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-05-22 13:45:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 370 ms
[2024-05-22 13:45:52] [INFO ] Added : 49 causal constraints over 10 iterations in 451 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 58/58 transitions.
Applied a total of 0 rules in 8 ms. Remains 61 /61 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 61/61 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 58/58 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2024-05-22 13:45:52] [INFO ] Invariant cache hit.
[2024-05-22 13:45:52] [INFO ] Implicit Places using invariants in 44 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/61 places, 58/58 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 57
Applied a total of 2 rules in 4 ms. Remains 59 /60 variables (removed 1) and now considering 57/58 (removed 1) transitions.
// Phase 1: matrix 57 rows 59 cols
[2024-05-22 13:45:52] [INFO ] Computed 10 invariants in 16 ms
[2024-05-22 13:45:52] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 13:45:52] [INFO ] Invariant cache hit.
[2024-05-22 13:45:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 13:45:52] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 59/61 places, 57/58 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 212 ms. Remains : 59/61 places, 57/58 transitions.
[2024-05-22 13:45:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144197 resets) in 586 ms. (1703 steps per ms)
BEST_FIRST walk for 1000000 steps (91376 resets) in 423 ms. (2358 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 13:45:53] [INFO ] Invariant cache hit.
[2024-05-22 13:45:53] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:53] [INFO ] [Real]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:53] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-22 13:45:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 13:45:53] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-05-22 13:45:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:53] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 0 ms returned sat
[2024-05-22 13:45:53] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-22 13:45:53] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:45:53] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-22 13:45:53] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-22 13:45:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
[2024-05-22 13:45:53] [INFO ] Computed and/alt/rep : 56/291/56 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 13:45:54] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-22 13:45:54] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-22 13:45:54] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-22 13:45:54] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-22 13:45:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 170 ms
[2024-05-22 13:45:54] [INFO ] Added : 49 causal constraints over 10 iterations in 254 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 59 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p159) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 55/55 transitions.
Reduce places removed 1 places and 2 transitions.
Graph (complete) has 208 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 53
Reduce places removed 2 places and 3 transitions.
Graph (complete) has 195 edges and 55 vertex of which 54 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 54 transition count 50
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 54 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 53 transition count 49
Applied a total of 7 rules in 6 ms. Remains 53 /59 variables (removed 6) and now considering 49/55 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 53/59 places, 49/55 transitions.
// Phase 1: matrix 49 rows 53 cols
[2024-05-22 13:45:54] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144286 resets) in 560 ms. (1782 steps per ms)
BEST_FIRST walk for 1000000 steps (91124 resets) in 424 ms. (2352 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 13:45:55] [INFO ] Invariant cache hit.
[2024-05-22 13:45:55] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:55] [INFO ] [Real]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:55] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-22 13:45:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 13:45:55] [INFO ] [Real]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-22 13:45:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:55] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:55] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-22 13:45:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:45:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-22 13:45:55] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-22 13:45:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2024-05-22 13:45:55] [INFO ] Computed and/alt/rep : 48/241/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-22 13:45:55] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-22 13:45:55] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-22 13:45:55] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-22 13:45:55] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-22 13:45:55] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-22 13:45:55] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-22 13:45:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 209 ms
[2024-05-22 13:45:55] [INFO ] Added : 42 causal constraints over 9 iterations in 268 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 49/49 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 53/53 places, 49/49 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 49/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2024-05-22 13:45:55] [INFO ] Invariant cache hit.
[2024-05-22 13:45:55] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 13:45:55] [INFO ] Invariant cache hit.
[2024-05-22 13:45:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 13:45:55] [INFO ] Implicit Places using invariants and state equation in 78 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 128 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 52/53 places, 49/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 131 ms. Remains : 52/53 places, 49/49 transitions.
// Phase 1: matrix 49 rows 52 cols
[2024-05-22 13:45:55] [INFO ] Computed 9 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (143985 resets) in 569 ms. (1754 steps per ms)
BEST_FIRST walk for 1000000 steps (91150 resets) in 418 ms. (2386 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 13:45:56] [INFO ] Invariant cache hit.
[2024-05-22 13:45:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:45:56] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-22 13:45:56] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-22 13:45:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 13:45:56] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-22 13:45:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:45:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 13:45:57] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-22 13:45:57] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-22 13:45:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-22 13:45:57] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-22 13:45:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-22 13:45:57] [INFO ] Computed and/alt/rep : 48/239/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-22 13:45:57] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-22 13:45:57] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
[2024-05-22 13:45:57] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-22 13:45:57] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-22 13:45:57] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-22 13:45:57] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-22 13:45:57] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-22 13:45:57] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-22 13:45:57] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 262 ms
[2024-05-22 13:45:57] [INFO ] Added : 45 causal constraints over 10 iterations in 326 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 49/49 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 52/52 places, 49/49 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 49/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2024-05-22 13:45:57] [INFO ] Invariant cache hit.
[2024-05-22 13:45:57] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 13:45:57] [INFO ] Invariant cache hit.
[2024-05-22 13:45:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 13:45:57] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-22 13:45:57] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-22 13:45:57] [INFO ] Invariant cache hit.
[2024-05-22 13:45:57] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/52 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 49/101 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/101 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 69 constraints, problems are : Problem set: 0 solved, 48 unsolved in 737 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 52/52 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/52 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 49/101 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 48/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-22 13:45:58] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-22 13:45:58] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-22 13:45:58] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/101 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 120 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 52/52 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 3/3 constraints]
After SMT, in 1916ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1917ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2029 ms. Remains : 52/52 places, 49/49 transitions.
[2024-05-22 13:45:59] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:45:59] [INFO ] Flatten gal took : 17 ms
[2024-05-22 13:45:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4292820704795886179.gal : 2 ms
[2024-05-22 13:45:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4083601583313210302.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4292820704795886179.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4083601583313210302.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (5819 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4083601583313210302.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :27 after 51
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :51 after 148
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :148 after 577
BEST_FIRST walk for 40002 steps (3646 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1202 after 2352
BEST_FIRST walk for 40000 steps (3769 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
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,18140,0.06625,6036,2,1802,16,12041,6,0,256,9478,0
Total reachable state count : 18140
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,11,0.066716,6036,2,126,16,12041,7,0,259,9478,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,11,0.067078,6300,2,126,16,12041,8,0,260,9478,0
Finished probabilistic random walk after 3424 steps, run visited all 2 properties in 15 ms. (steps per millisecond=228 )
Probabilistic random walk after 3424 steps, saw 1729 distinct states, run finished after 15 ms. (steps per millisecond=228 ) properties seen :2
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA DoubleExponent-PT-003-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-15 in 9303 ms.
[2024-05-22 13:45:59] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:45:59] [INFO ] Applying decomposition
[2024-05-22 13:45:59] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11349806058401835153.txt' '-o' '/tmp/graph11349806058401835153.bin' '-w' '/tmp/graph11349806058401835153.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11349806058401835153.bin' '-l' '-1' '-v' '-w' '/tmp/graph11349806058401835153.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:45:59] [INFO ] Decomposing Gal with order
[2024-05-22 13:45:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:45:59] [INFO ] Removed a total of 29 redundant transitions.
[2024-05-22 13:45:59] [INFO ] Flatten gal took : 53 ms
[2024-05-22 13:45:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 5 ms.
[2024-05-22 13:45:59] [INFO ] Time to serialize gal into /tmp/UpperBounds12979817464111392884.gal : 3 ms
[2024-05-22 13:45:59] [INFO ] Time to serialize properties into /tmp/UpperBounds13759556471803239686.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12979817464111392884.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13759556471803239686.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds13759556471803239686.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,759985,2.70676,78988,1665,704,121651,4733,301,127472,104,17542,0
Total reachable state count : 759985
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 16
Bounds property DoubleExponent-PT-003-UpperBounds-05 :0 <= i1.u2.p113 <= 16
FORMULA DoubleExponent-PT-003-UpperBounds-05 16 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-05,0,2.76138,78988,1,0,121651,4733,396,127472,140,28712,1063
Total runtime 56224 ms.
BK_STOP 1716385562659
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-003"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-003, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631132900541"
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 '
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 ;