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 |
| 375.439 | 56482.00 | 68824.00 | 979.50 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r083-tall-162048875400411.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DoubleExponent-PT-003, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875400411
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 50K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-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 1620584402124
Running Version 0
[2021-05-09 18:20:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 18:20:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 18:20:04] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2021-05-09 18:20:04] [INFO ] Transformed 163 places.
[2021-05-09 18:20:04] [INFO ] Transformed 148 transitions.
[2021-05-09 18:20:04] [INFO ] Parsed PT model containing 163 places and 148 transitions in 77 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 148 rows 163 cols
[2021-05-09 18:20:04] [INFO ] Computed 19 place invariants in 16 ms
Incomplete random walk after 10000 steps, including 336 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :7
FORMULA DoubleExponent-PT-003-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 296 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 271 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10000 steps, including 262 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10000 steps, including 274 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10000 steps, including 306 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :1
// Phase 1: matrix 148 rows 163 cols
[2021-05-09 18:20:04] [INFO ] Computed 19 place invariants in 22 ms
[2021-05-09 18:20:04] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2021-05-09 18:20:04] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:04] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-09 18:20:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-09 18:20:04] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:04] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-09 18:20:04] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-09 18:20:05] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 3 ms to minimize.
[2021-05-09 18:20:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2021-05-09 18:20:05] [INFO ] Added : 139 causal constraints over 28 iterations in 490 ms. Result :sat
Minimization took 58 ms.
[2021-05-09 18:20:05] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:20:05] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:05] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-09 18:20:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:20:05] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:05] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-09 18:20:05] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 1 ms to minimize.
[2021-05-09 18:20:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2021-05-09 18:20:05] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-09 18:20:06] [INFO ] Added : 108 causal constraints over 23 iterations in 289 ms. Result :sat
Minimization took 55 ms.
[2021-05-09 18:20:06] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:20:06] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2021-05-09 18:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:06] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2021-05-09 18:20:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:20:06] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:06] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-09 18:20:06] [INFO ] Deduced a trap composed of 45 places in 22 ms of which 1 ms to minimize.
[2021-05-09 18:20:06] [INFO ] Deduced a trap composed of 42 places in 22 ms of which 1 ms to minimize.
[2021-05-09 18:20:06] [INFO ] Deduced a trap composed of 48 places in 29 ms of which 1 ms to minimize.
[2021-05-09 18:20:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 100 ms
[2021-05-09 18:20:06] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-09 18:20:06] [INFO ] Added : 111 causal constraints over 23 iterations in 297 ms. Result :sat
Minimization took 52 ms.
[2021-05-09 18:20:06] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-09 18:20:06] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:06] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-09 18:20:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:20:06] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:06] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-09 18:20:06] [INFO ] Deduced a trap composed of 73 places in 34 ms of which 1 ms to minimize.
[2021-05-09 18:20:06] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 1 ms to minimize.
[2021-05-09 18:20:06] [INFO ] Deduced a trap composed of 84 places in 33 ms of which 1 ms to minimize.
[2021-05-09 18:20:07] [INFO ] Deduced a trap composed of 82 places in 32 ms of which 0 ms to minimize.
[2021-05-09 18:20:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 165 ms
[2021-05-09 18:20:07] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-09 18:20:07] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2021-05-09 18:20:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2021-05-09 18:20:07] [INFO ] Added : 86 causal constraints over 18 iterations in 268 ms. Result :sat
Minimization took 40 ms.
[2021-05-09 18:20:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:20:07] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:07] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-09 18:20:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:20:07] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:07] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-09 18:20:07] [INFO ] Deduced a trap composed of 74 places in 34 ms of which 0 ms to minimize.
[2021-05-09 18:20:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2021-05-09 18:20:07] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:20:07] [INFO ] Added : 134 causal constraints over 27 iterations in 313 ms. Result :sat
Minimization took 46 ms.
[2021-05-09 18:20:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:20:07] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:07] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-09 18:20:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:20:08] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2021-05-09 18:20:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:08] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-09 18:20:08] [INFO ] Deduced a trap composed of 48 places in 29 ms of which 1 ms to minimize.
[2021-05-09 18:20:08] [INFO ] Deduced a trap composed of 66 places in 29 ms of which 1 ms to minimize.
[2021-05-09 18:20:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2021-05-09 18:20:08] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-09 18:20:08] [INFO ] Added : 139 causal constraints over 28 iterations in 318 ms. Result :sat
Minimization took 59 ms.
[2021-05-09 18:20:08] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:20:08] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:08] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-09 18:20:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:20:08] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:08] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-09 18:20:08] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:20:09] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2021-05-09 18:20:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2021-05-09 18:20:09] [INFO ] Added : 139 causal constraints over 28 iterations in 384 ms. Result :sat
Minimization took 58 ms.
[2021-05-09 18:20:09] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:20:09] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:09] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-09 18:20:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:09] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:09] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2021-05-09 18:20:09] [INFO ] Deduced a trap composed of 62 places in 30 ms of which 0 ms to minimize.
[2021-05-09 18:20:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2021-05-09 18:20:09] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-09 18:20:09] [INFO ] Deduced a trap composed of 75 places in 34 ms of which 1 ms to minimize.
[2021-05-09 18:20:09] [INFO ] Deduced a trap composed of 65 places in 32 ms of which 0 ms to minimize.
[2021-05-09 18:20:09] [INFO ] Deduced a trap composed of 37 places in 19 ms of which 0 ms to minimize.
[2021-05-09 18:20:09] [INFO ] Deduced a trap composed of 73 places in 32 ms of which 0 ms to minimize.
[2021-05-09 18:20:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 171 ms
[2021-05-09 18:20:09] [INFO ] Added : 129 causal constraints over 27 iterations in 473 ms. Result :sat
Minimization took 54 ms.
[2021-05-09 18:20:09] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:20:09] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2021-05-09 18:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:09] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2021-05-09 18:20:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:20:09] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:09] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2021-05-09 18:20:10] [INFO ] Deduced a trap composed of 68 places in 37 ms of which 0 ms to minimize.
[2021-05-09 18:20:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2021-05-09 18:20:10] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-09 18:20:10] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2021-05-09 18:20:10] [INFO ] Deduced a trap composed of 79 places in 33 ms of which 0 ms to minimize.
[2021-05-09 18:20:10] [INFO ] Deduced a trap composed of 80 places in 38 ms of which 0 ms to minimize.
[2021-05-09 18:20:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 151 ms
[2021-05-09 18:20:10] [INFO ] Added : 112 causal constraints over 24 iterations in 425 ms. Result :sat
Minimization took 87 ms.
[2021-05-09 18:20:10] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:10] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 1 ms returned unsat
[2021-05-09 18:20:10] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:20:10] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned unsat
[2021-05-09 18:20:10] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 18:20:10] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1]
FORMULA DoubleExponent-PT-003-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 50300 steps, including 1759 resets, run finished after 134 ms. (steps per millisecond=375 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 87800 steps, including 3319 resets, run finished after 155 ms. (steps per millisecond=566 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 79800 steps, including 2800 resets, run finished after 150 ms. (steps per millisecond=532 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 34300 steps, including 1355 resets, run finished after 68 ms. (steps per millisecond=504 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 80900 steps, including 2854 resets, run finished after 258 ms. (steps per millisecond=313 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 13000 steps, including 453 resets, run finished after 36 ms. (steps per millisecond=361 ) properties (out of 9) seen :1 could not realise parikh vector
FORMULA DoubleExponent-PT-003-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 109000 steps, including 3979 resets, run finished after 180 ms. (steps per millisecond=605 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 64700 steps, including 2488 resets, run finished after 101 ms. (steps per millisecond=640 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 79800 steps, including 2799 resets, run finished after 125 ms. (steps per millisecond=638 ) properties (out of 8) seen :0 could not realise parikh vector
Support contains 7 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 148/148 transitions.
Graph (complete) has 269 edges and 163 vertex of which 157 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 156 transition count 118
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 128 transition count 116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 126 transition count 116
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 64 place count 126 transition count 108
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 80 place count 118 transition count 108
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 140 place count 88 transition count 78
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 148 place count 84 transition count 78
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 159 place count 84 transition count 67
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 170 place count 73 transition count 67
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 180 place count 73 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 181 place count 72 transition count 66
Applied a total of 181 rules in 44 ms. Remains 72 /163 variables (removed 91) and now considering 66/148 (removed 82) transitions.
Finished structural reductions, in 1 iterations. Remains : 72/163 places, 66/148 transitions.
// Phase 1: matrix 66 rows 72 cols
[2021-05-09 18:20:11] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 128110 resets, run finished after 1653 ms. (steps per millisecond=604 ) properties (out of 8) seen :3
FORMULA DoubleExponent-PT-003-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 84596 resets, run finished after 1081 ms. (steps per millisecond=925 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84619 resets, run finished after 1072 ms. (steps per millisecond=932 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84467 resets, run finished after 1074 ms. (steps per millisecond=931 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84817 resets, run finished after 1071 ms. (steps per millisecond=933 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84240 resets, run finished after 1068 ms. (steps per millisecond=936 ) properties (out of 5) seen :0
// Phase 1: matrix 66 rows 72 cols
[2021-05-09 18:20:18] [INFO ] Computed 15 place invariants in 4 ms
[2021-05-09 18:20:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:18] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 2 ms returned sat
[2021-05-09 18:20:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:18] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-09 18:20:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:18] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:18] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-09 18:20:18] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-05-09 18:20:18] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:20:18] [INFO ] Deduced a trap composed of 8 places in 7 ms of which 0 ms to minimize.
[2021-05-09 18:20:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2021-05-09 18:20:18] [INFO ] Computed and/alt/rep : 61/277/61 causal constraints (skipped 4 transitions) in 8 ms.
[2021-05-09 18:20:19] [INFO ] Added : 60 causal constraints over 13 iterations in 106 ms. Result :sat
Minimization took 40 ms.
[2021-05-09 18:20:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 2 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:19] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-09 18:20:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:19] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:20:19] [INFO ] Computed and/alt/rep : 61/277/61 causal constraints (skipped 4 transitions) in 4 ms.
[2021-05-09 18:20:19] [INFO ] Added : 35 causal constraints over 7 iterations in 59 ms. Result :sat
Minimization took 20 ms.
[2021-05-09 18:20:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:19] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-09 18:20:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 2 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:19] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:20:19] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
[2021-05-09 18:20:19] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2021-05-09 18:20:19] [INFO ] Deduced a trap composed of 5 places in 8 ms of which 0 ms to minimize.
[2021-05-09 18:20:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 58 ms
[2021-05-09 18:20:19] [INFO ] Computed and/alt/rep : 61/277/61 causal constraints (skipped 4 transitions) in 4 ms.
[2021-05-09 18:20:19] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2021-05-09 18:20:19] [INFO ] Deduced a trap composed of 31 places in 18 ms of which 0 ms to minimize.
[2021-05-09 18:20:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2021-05-09 18:20:19] [INFO ] Added : 56 causal constraints over 12 iterations in 152 ms. Result :sat
Minimization took 34 ms.
[2021-05-09 18:20:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 2 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:19] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-09 18:20:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 2 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:19] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:20:19] [INFO ] Deduced a trap composed of 8 places in 7 ms of which 0 ms to minimize.
[2021-05-09 18:20:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-09 18:20:19] [INFO ] Computed and/alt/rep : 61/277/61 causal constraints (skipped 4 transitions) in 4 ms.
[2021-05-09 18:20:19] [INFO ] Added : 60 causal constraints over 13 iterations in 108 ms. Result :sat
Minimization took 40 ms.
[2021-05-09 18:20:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:19] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-09 18:20:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 2 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:19] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-09 18:20:19] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2021-05-09 18:20:19] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
[2021-05-09 18:20:19] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 0 ms to minimize.
[2021-05-09 18:20:19] [INFO ] Deduced a trap composed of 30 places in 17 ms of which 0 ms to minimize.
[2021-05-09 18:20:19] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 1 ms to minimize.
[2021-05-09 18:20:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 75 ms
[2021-05-09 18:20:19] [INFO ] Computed and/alt/rep : 61/277/61 causal constraints (skipped 4 transitions) in 3 ms.
[2021-05-09 18:20:20] [INFO ] Added : 61 causal constraints over 13 iterations in 112 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 7700 steps, including 1207 resets, run finished after 24 ms. (steps per millisecond=320 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 29200 steps, including 4516 resets, run finished after 86 ms. (steps per millisecond=339 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 18100 steps, including 2798 resets, run finished after 55 ms. (steps per millisecond=329 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 26500 steps, including 4142 resets, run finished after 51 ms. (steps per millisecond=519 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 29200 steps, including 4507 resets, run finished after 50 ms. (steps per millisecond=584 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 66/66 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 70 transition count 64
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 70 transition count 64
Applied a total of 5 rules in 8 ms. Remains 70 /72 variables (removed 2) and now considering 64/66 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 70/72 places, 64/66 transitions.
// Phase 1: matrix 64 rows 70 cols
[2021-05-09 18:20:20] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 127910 resets, run finished after 1604 ms. (steps per millisecond=623 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84421 resets, run finished after 1089 ms. (steps per millisecond=918 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84568 resets, run finished after 1088 ms. (steps per millisecond=919 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84661 resets, run finished after 1080 ms. (steps per millisecond=925 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84761 resets, run finished after 1080 ms. (steps per millisecond=925 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84613 resets, run finished after 1078 ms. (steps per millisecond=927 ) properties (out of 5) seen :0
// Phase 1: matrix 64 rows 70 cols
[2021-05-09 18:20:27] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-09 18:20:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:27] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2021-05-09 18:20:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:27] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-09 18:20:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:27] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 4 ms returned sat
[2021-05-09 18:20:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:27] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-09 18:20:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 18:20:27] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2021-05-09 18:20:27] [INFO ] Deduced a trap composed of 8 places in 12 ms of which 4 ms to minimize.
[2021-05-09 18:20:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2021-05-09 18:20:27] [INFO ] Computed and/alt/rep : 59/282/59 causal constraints (skipped 4 transitions) in 4 ms.
[2021-05-09 18:20:27] [INFO ] Deduced a trap composed of 15 places in 15 ms of which 0 ms to minimize.
[2021-05-09 18:20:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2021-05-09 18:20:27] [INFO ] Added : 52 causal constraints over 11 iterations in 123 ms. Result :sat
Minimization took 33 ms.
[2021-05-09 18:20:27] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:27] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2021-05-09 18:20:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:27] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-09 18:20:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:27] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2021-05-09 18:20:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:27] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-09 18:20:27] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2021-05-09 18:20:27] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2021-05-09 18:20:27] [INFO ] Deduced a trap composed of 8 places in 13 ms of which 1 ms to minimize.
[2021-05-09 18:20:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 42 ms
[2021-05-09 18:20:27] [INFO ] Computed and/alt/rep : 59/282/59 causal constraints (skipped 4 transitions) in 4 ms.
[2021-05-09 18:20:27] [INFO ] Added : 59 causal constraints over 13 iterations in 119 ms. Result :sat
Minimization took 55 ms.
[2021-05-09 18:20:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:27] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2021-05-09 18:20:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:27] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-09 18:20:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:27] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:28] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-09 18:20:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:20:28] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2021-05-09 18:20:28] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
[2021-05-09 18:20:28] [INFO ] Deduced a trap composed of 23 places in 17 ms of which 0 ms to minimize.
[2021-05-09 18:20:28] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
[2021-05-09 18:20:28] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 1 ms to minimize.
[2021-05-09 18:20:28] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2021-05-09 18:20:28] [INFO ] Deduced a trap composed of 24 places in 17 ms of which 0 ms to minimize.
[2021-05-09 18:20:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 145 ms
[2021-05-09 18:20:28] [INFO ] Computed and/alt/rep : 59/282/59 causal constraints (skipped 4 transitions) in 4 ms.
[2021-05-09 18:20:28] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2021-05-09 18:20:28] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 1 ms to minimize.
[2021-05-09 18:20:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 32 ms
[2021-05-09 18:20:28] [INFO ] Added : 57 causal constraints over 14 iterations in 143 ms. Result :sat
Minimization took 58 ms.
[2021-05-09 18:20:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:28] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 3 ms returned sat
[2021-05-09 18:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:28] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-09 18:20:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:28] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2021-05-09 18:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:28] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-09 18:20:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:20:28] [INFO ] Deduced a trap composed of 8 places in 7 ms of which 0 ms to minimize.
[2021-05-09 18:20:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2021-05-09 18:20:28] [INFO ] Computed and/alt/rep : 59/282/59 causal constraints (skipped 4 transitions) in 4 ms.
[2021-05-09 18:20:28] [INFO ] Deduced a trap composed of 15 places in 15 ms of which 0 ms to minimize.
[2021-05-09 18:20:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2021-05-09 18:20:28] [INFO ] Added : 52 causal constraints over 11 iterations in 118 ms. Result :sat
Minimization took 33 ms.
[2021-05-09 18:20:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:28] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2021-05-09 18:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:28] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-09 18:20:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:28] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2021-05-09 18:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:28] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-09 18:20:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:20:28] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 0 ms to minimize.
[2021-05-09 18:20:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2021-05-09 18:20:28] [INFO ] Computed and/alt/rep : 59/282/59 causal constraints (skipped 4 transitions) in 3 ms.
[2021-05-09 18:20:28] [INFO ] Added : 59 causal constraints over 13 iterations in 124 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 18100 steps, including 2800 resets, run finished after 31 ms. (steps per millisecond=583 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 34600 steps, including 5349 resets, run finished after 57 ms. (steps per millisecond=607 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 49400 steps, including 7766 resets, run finished after 82 ms. (steps per millisecond=602 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 42900 steps, including 6707 resets, run finished after 70 ms. (steps per millisecond=612 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 34600 steps, including 5390 resets, run finished after 57 ms. (steps per millisecond=607 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 64/64 transitions.
Applied a total of 0 rules in 7 ms. Remains 70 /70 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 70/70 places, 64/64 transitions.
Starting structural reductions, iteration 0 : 70/70 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 70 cols
[2021-05-09 18:20:29] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-09 18:20:29] [INFO ] Implicit Places using invariants in 50 ms returned [14, 20, 37, 42, 60, 67]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 52 ms to find 6 implicit places.
[2021-05-09 18:20:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 64 cols
[2021-05-09 18:20:29] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:29] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 64/70 places, 64/64 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 63 transition count 63
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 63 transition count 60
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 8 place count 60 transition count 60
Applied a total of 8 rules in 6 ms. Remains 60 /64 variables (removed 4) and now considering 60/64 (removed 4) transitions.
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 18:20:29] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:29] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 18:20:29] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-09 18:20:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 18:20:29] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 60/70 places, 60/64 transitions.
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 18:20:29] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144137 resets, run finished after 1530 ms. (steps per millisecond=653 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91270 resets, run finished after 1028 ms. (steps per millisecond=972 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91805 resets, run finished after 1024 ms. (steps per millisecond=976 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91496 resets, run finished after 1023 ms. (steps per millisecond=977 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91335 resets, run finished after 1022 ms. (steps per millisecond=978 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91510 resets, run finished after 1023 ms. (steps per millisecond=977 ) properties (out of 5) seen :0
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 18:20:35] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:36] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:36] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-09 18:20:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:36] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-09 18:20:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 18:20:36] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2021-05-09 18:20:36] [INFO ] Computed and/alt/rep : 58/292/58 causal constraints (skipped 1 transitions) in 8 ms.
[2021-05-09 18:20:36] [INFO ] Added : 49 causal constraints over 11 iterations in 84 ms. Result :sat
Minimization took 27 ms.
[2021-05-09 18:20:36] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:36] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-09 18:20:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:36] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:20:36] [INFO ] Deduced a trap composed of 11 places in 14 ms of which 1 ms to minimize.
[2021-05-09 18:20:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2021-05-09 18:20:36] [INFO ] Computed and/alt/rep : 58/292/58 causal constraints (skipped 1 transitions) in 3 ms.
[2021-05-09 18:20:36] [INFO ] Deduced a trap composed of 8 places in 12 ms of which 1 ms to minimize.
[2021-05-09 18:20:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2021-05-09 18:20:36] [INFO ] Added : 58 causal constraints over 13 iterations in 149 ms. Result :sat
Minimization took 31 ms.
[2021-05-09 18:20:36] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:36] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-09 18:20:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:36] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:20:36] [INFO ] Deduced a trap composed of 18 places in 15 ms of which 0 ms to minimize.
[2021-05-09 18:20:36] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 0 ms to minimize.
[2021-05-09 18:20:36] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2021-05-09 18:20:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 55 ms
[2021-05-09 18:20:36] [INFO ] Computed and/alt/rep : 58/292/58 causal constraints (skipped 1 transitions) in 3 ms.
[2021-05-09 18:20:36] [INFO ] Added : 57 causal constraints over 13 iterations in 105 ms. Result :sat
Minimization took 53 ms.
[2021-05-09 18:20:36] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:36] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-09 18:20:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:36] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2021-05-09 18:20:36] [INFO ] Computed and/alt/rep : 58/292/58 causal constraints (skipped 1 transitions) in 4 ms.
[2021-05-09 18:20:36] [INFO ] Added : 49 causal constraints over 11 iterations in 79 ms. Result :sat
Minimization took 27 ms.
[2021-05-09 18:20:36] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 5 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:36] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-09 18:20:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:36] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-09 18:20:36] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:20:36] [INFO ] Deduced a trap composed of 20 places in 15 ms of which 0 ms to minimize.
[2021-05-09 18:20:36] [INFO ] Deduced a trap composed of 20 places in 14 ms of which 0 ms to minimize.
[2021-05-09 18:20:37] [INFO ] Deduced a trap composed of 20 places in 15 ms of which 0 ms to minimize.
[2021-05-09 18:20:37] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2021-05-09 18:20:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 76 ms
[2021-05-09 18:20:37] [INFO ] Computed and/alt/rep : 58/292/58 causal constraints (skipped 1 transitions) in 3 ms.
[2021-05-09 18:20:37] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 1 ms to minimize.
[2021-05-09 18:20:37] [INFO ] Deduced a trap composed of 8 places in 10 ms of which 0 ms to minimize.
[2021-05-09 18:20:37] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
[2021-05-09 18:20:37] [INFO ] Deduced a trap composed of 16 places in 15 ms of which 0 ms to minimize.
[2021-05-09 18:20:37] [INFO ] Deduced a trap composed of 16 places in 14 ms of which 0 ms to minimize.
[2021-05-09 18:20:37] [INFO ] Deduced a trap composed of 20 places in 15 ms of which 0 ms to minimize.
[2021-05-09 18:20:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 121 ms
[2021-05-09 18:20:37] [INFO ] Added : 57 causal constraints over 12 iterations in 220 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 29100 steps, including 4837 resets, run finished after 50 ms. (steps per millisecond=582 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 18000 steps, including 2998 resets, run finished after 30 ms. (steps per millisecond=600 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 14900 steps, including 2517 resets, run finished after 25 ms. (steps per millisecond=596 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 7500 steps, including 1292 resets, run finished after 13 ms. (steps per millisecond=576 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 18000 steps, including 3017 resets, run finished after 30 ms. (steps per millisecond=600 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 60/60 transitions.
Starting structural reductions, iteration 0 : 60/60 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 18:20:37] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:37] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 18:20:37] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:37] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 18:20:37] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2021-05-09 18:20:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 18:20:37] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:37] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 60/60 transitions.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-02
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 18:20:37] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1438 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 18:20:37] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:37] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:37] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:37] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-09 18:20:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:37] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-09 18:20:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:37] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-09 18:20:37] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 18:20:37] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:20:37] [INFO ] Computed and/alt/rep : 58/292/58 causal constraints (skipped 1 transitions) in 3 ms.
[2021-05-09 18:20:37] [INFO ] Added : 49 causal constraints over 11 iterations in 82 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 18000 steps, including 3024 resets, run finished after 30 ms. (steps per millisecond=600 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 60/60 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 59 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 58 transition count 58
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 58 transition count 58
Applied a total of 5 rules in 6 ms. Remains 58 /60 variables (removed 2) and now considering 58/60 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/60 places, 58/60 transitions.
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:37] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 144172 resets, run finished after 1493 ms. (steps per millisecond=669 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91379 resets, run finished after 1002 ms. (steps per millisecond=998 ) properties (out of 1) seen :0
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:40] [INFO ] Computed 10 place invariants in 5 ms
[2021-05-09 18:20:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:40] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:40] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-09 18:20:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:40] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:40] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-09 18:20:40] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 18:20:40] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:20:40] [INFO ] Deduced a trap composed of 8 places in 12 ms of which 0 ms to minimize.
[2021-05-09 18:20:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-09 18:20:40] [INFO ] Computed and/alt/rep : 56/298/56 causal constraints (skipped 1 transitions) in 4 ms.
[2021-05-09 18:20:40] [INFO ] Added : 56 causal constraints over 13 iterations in 123 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 20900 steps, including 3704 resets, run finished after 33 ms. (steps per millisecond=633 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 58/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 58/58 transitions.
Starting structural reductions, iteration 0 : 58/58 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 58/58 (removed 0) transitions.
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:40] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:40] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:40] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-09 18:20:40] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 18:20:40] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2021-05-09 18:20:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:40] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:40] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 58/58 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-02 in 3143 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-04
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 18:20:40] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1435 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 872 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 18:20:40] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:40] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:40] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-09 18:20:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:40] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:40] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-09 18:20:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 18:20:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:20:40] [INFO ] Deduced a trap composed of 11 places in 14 ms of which 2 ms to minimize.
[2021-05-09 18:20:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2021-05-09 18:20:40] [INFO ] Computed and/alt/rep : 58/292/58 causal constraints (skipped 1 transitions) in 4 ms.
[2021-05-09 18:20:40] [INFO ] Deduced a trap composed of 8 places in 12 ms of which 1 ms to minimize.
[2021-05-09 18:20:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2021-05-09 18:20:40] [INFO ] Added : 58 causal constraints over 13 iterations in 161 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 7500 steps, including 1300 resets, run finished after 13 ms. (steps per millisecond=576 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 60/60 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 58 transition count 58
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 58 transition count 58
Applied a total of 5 rules in 5 ms. Remains 58 /60 variables (removed 2) and now considering 58/60 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/60 places, 58/60 transitions.
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:41] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 144443 resets, run finished after 1481 ms. (steps per millisecond=675 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91447 resets, run finished after 999 ms. (steps per millisecond=1001 ) properties (out of 1) seen :0
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:43] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:43] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-09 18:20:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:43] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-09 18:20:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:43] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:43] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-09 18:20:43] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 18:20:43] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:20:43] [INFO ] Deduced a trap composed of 10 places in 10 ms of which 0 ms to minimize.
[2021-05-09 18:20:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-09 18:20:43] [INFO ] Computed and/alt/rep : 54/288/54 causal constraints (skipped 3 transitions) in 4 ms.
[2021-05-09 18:20:43] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 1 ms to minimize.
[2021-05-09 18:20:43] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-09 18:20:43] [INFO ] Deduced a trap composed of 15 places in 12 ms of which 0 ms to minimize.
[2021-05-09 18:20:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 59 ms
[2021-05-09 18:20:43] [INFO ] Added : 37 causal constraints over 8 iterations in 122 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 13400 steps, including 2245 resets, run finished after 22 ms. (steps per millisecond=609 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 58/58 transitions.
Starting structural reductions, iteration 0 : 58/58 places, 58/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 58/58 (removed 0) transitions.
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:43] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:43] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:43] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:43] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 18:20:43] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2021-05-09 18:20:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:43] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:43] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 58/58 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-04 in 3174 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-07
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 18:20:43] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1425 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 907 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 18:20:43] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:43] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-09 18:20:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:43] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-09 18:20:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:43] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:43] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-09 18:20:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 18:20:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2021-05-09 18:20:44] [INFO ] Deduced a trap composed of 18 places in 15 ms of which 0 ms to minimize.
[2021-05-09 18:20:44] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 0 ms to minimize.
[2021-05-09 18:20:44] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2021-05-09 18:20:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 53 ms
[2021-05-09 18:20:44] [INFO ] Computed and/alt/rep : 58/292/58 causal constraints (skipped 1 transitions) in 4 ms.
[2021-05-09 18:20:44] [INFO ] Added : 57 causal constraints over 13 iterations in 107 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 14900 steps, including 2475 resets, run finished after 25 ms. (steps per millisecond=596 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 60/60 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 59 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 58 transition count 58
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 58 transition count 58
Applied a total of 5 rules in 6 ms. Remains 58 /60 variables (removed 2) and now considering 58/60 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/60 places, 58/60 transitions.
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:44] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144112 resets, run finished after 1501 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91077 resets, run finished after 1015 ms. (steps per millisecond=985 ) properties (out of 1) seen :0
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:46] [INFO ] Computed 10 place invariants in 13 ms
[2021-05-09 18:20:46] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:46] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:46] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-09 18:20:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:46] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:46] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-09 18:20:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2021-05-09 18:20:46] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:20:46] [INFO ] Deduced a trap composed of 19 places in 15 ms of which 1 ms to minimize.
[2021-05-09 18:20:46] [INFO ] Deduced a trap composed of 16 places in 15 ms of which 0 ms to minimize.
[2021-05-09 18:20:46] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-09 18:20:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 47 ms
[2021-05-09 18:20:46] [INFO ] Computed and/alt/rep : 56/293/56 causal constraints (skipped 1 transitions) in 3 ms.
[2021-05-09 18:20:46] [INFO ] Deduced a trap composed of 12 places in 15 ms of which 0 ms to minimize.
[2021-05-09 18:20:47] [INFO ] Deduced a trap composed of 20 places in 15 ms of which 0 ms to minimize.
[2021-05-09 18:20:47] [INFO ] Deduced a trap composed of 18 places in 13 ms of which 0 ms to minimize.
[2021-05-09 18:20:47] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2021-05-09 18:20:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 92 ms
[2021-05-09 18:20:47] [INFO ] Added : 55 causal constraints over 11 iterations in 200 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 11100 steps, including 1877 resets, run finished after 19 ms. (steps per millisecond=584 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 58/58 transitions.
Starting structural reductions, iteration 0 : 58/58 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 58/58 (removed 0) transitions.
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:47] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:47] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:47] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-09 18:20:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2021-05-09 18:20:47] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2021-05-09 18:20:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:47] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:47] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 58/58 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-07 in 3353 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-09
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 18:20:47] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 929 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 18:20:47] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:47] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:47] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:47] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-09 18:20:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:47] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:47] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-09 18:20:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 18:20:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2021-05-09 18:20:47] [INFO ] Computed and/alt/rep : 58/292/58 causal constraints (skipped 1 transitions) in 4 ms.
[2021-05-09 18:20:47] [INFO ] Added : 49 causal constraints over 11 iterations in 79 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 18000 steps, including 3005 resets, run finished after 29 ms. (steps per millisecond=620 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 60/60 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 59 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 58 transition count 58
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 58 transition count 58
Applied a total of 5 rules in 6 ms. Remains 58 /60 variables (removed 2) and now considering 58/60 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/60 places, 58/60 transitions.
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:47] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 144263 resets, run finished after 1497 ms. (steps per millisecond=668 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91278 resets, run finished after 1009 ms. (steps per millisecond=991 ) properties (out of 1) seen :0
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:49] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-09 18:20:50] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:50] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-09 18:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:50] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-09 18:20:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:50] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-09 18:20:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:50] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-09 18:20:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 18:20:50] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:20:50] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2021-05-09 18:20:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2021-05-09 18:20:50] [INFO ] Computed and/alt/rep : 56/298/56 causal constraints (skipped 1 transitions) in 3 ms.
[2021-05-09 18:20:50] [INFO ] Added : 56 causal constraints over 13 iterations in 147 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 20900 steps, including 3715 resets, run finished after 35 ms. (steps per millisecond=597 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 58/58 transitions.
Applied a total of 0 rules in 6 ms. Remains 58 /58 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 58/58 transitions.
Starting structural reductions, iteration 0 : 58/58 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 58/58 (removed 0) transitions.
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:50] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:50] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:50] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-09 18:20:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 18:20:50] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2021-05-09 18:20:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 58 rows 58 cols
[2021-05-09 18:20:50] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:50] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 58/58 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-09 in 3180 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-10
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 18:20:50] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1428 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 871 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 18:20:50] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:50] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:50] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-09 18:20:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-09 18:20:50] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:50] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-09 18:20:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 18:20:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2021-05-09 18:20:50] [INFO ] Deduced a trap composed of 20 places in 15 ms of which 0 ms to minimize.
[2021-05-09 18:20:50] [INFO ] Deduced a trap composed of 20 places in 14 ms of which 1 ms to minimize.
[2021-05-09 18:20:50] [INFO ] Deduced a trap composed of 20 places in 16 ms of which 0 ms to minimize.
[2021-05-09 18:20:50] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2021-05-09 18:20:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 71 ms
[2021-05-09 18:20:50] [INFO ] Computed and/alt/rep : 58/292/58 causal constraints (skipped 1 transitions) in 3 ms.
[2021-05-09 18:20:50] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
[2021-05-09 18:20:50] [INFO ] Deduced a trap composed of 8 places in 12 ms of which 0 ms to minimize.
[2021-05-09 18:20:50] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2021-05-09 18:20:50] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2021-05-09 18:20:50] [INFO ] Deduced a trap composed of 16 places in 14 ms of which 0 ms to minimize.
[2021-05-09 18:20:50] [INFO ] Deduced a trap composed of 20 places in 14 ms of which 0 ms to minimize.
[2021-05-09 18:20:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 131 ms
[2021-05-09 18:20:50] [INFO ] Added : 57 causal constraints over 12 iterations in 237 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 29100 steps, including 4851 resets, run finished after 48 ms. (steps per millisecond=606 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 60/60 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 59 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 57 transition count 57
Applied a total of 6 rules in 4 ms. Remains 57 /60 variables (removed 3) and now considering 57/60 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/60 places, 57/60 transitions.
// Phase 1: matrix 57 rows 57 cols
[2021-05-09 18:20:50] [INFO ] Computed 10 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 144194 resets, run finished after 1491 ms. (steps per millisecond=670 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91810 resets, run finished after 1009 ms. (steps per millisecond=991 ) properties (out of 1) seen :0
// Phase 1: matrix 57 rows 57 cols
[2021-05-09 18:20:53] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-09 18:20:53] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:53] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-09 18:20:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:53] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-09 18:20:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:20:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-09 18:20:53] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 18:20:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:20:53] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-09 18:20:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2021-05-09 18:20:53] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2021-05-09 18:20:53] [INFO ] Deduced a trap composed of 15 places in 16 ms of which 0 ms to minimize.
[2021-05-09 18:20:53] [INFO ] Deduced a trap composed of 16 places in 14 ms of which 1 ms to minimize.
[2021-05-09 18:20:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 37 ms
[2021-05-09 18:20:53] [INFO ] Computed and/alt/rep : 55/294/55 causal constraints (skipped 1 transitions) in 3 ms.
[2021-05-09 18:20:53] [INFO ] Deduced a trap composed of 9 places in 9 ms of which 0 ms to minimize.
[2021-05-09 18:20:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2021-05-09 18:20:53] [INFO ] Added : 52 causal constraints over 11 iterations in 117 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 9300 steps, including 1563 resets, run finished after 16 ms. (steps per millisecond=581 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 57/57 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 57/57 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 57/57 transitions.
Starting structural reductions, iteration 0 : 57/57 places, 57/57 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 57/57 (removed 0) transitions.
// Phase 1: matrix 57 rows 57 cols
[2021-05-09 18:20:53] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:53] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 57 rows 57 cols
[2021-05-09 18:20:53] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-09 18:20:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2021-05-09 18:20:53] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2021-05-09 18:20:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 57 rows 57 cols
[2021-05-09 18:20:53] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 18:20:53] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 57/57 transitions.
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-10 in 3374 ms.
[2021-05-09 18:20:53] [INFO ] Flatten gal took : 33 ms
[2021-05-09 18:20:53] [INFO ] Applying decomposition
[2021-05-09 18:20:53] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9552790399668251091.txt, -o, /tmp/graph9552790399668251091.bin, -w, /tmp/graph9552790399668251091.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9552790399668251091.bin, -l, -1, -v, -w, /tmp/graph9552790399668251091.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 18:20:54] [INFO ] Decomposing Gal with order
[2021-05-09 18:20:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 18:20:54] [INFO ] Removed a total of 33 redundant transitions.
[2021-05-09 18:20:54] [INFO ] Flatten gal took : 32 ms
[2021-05-09 18:20:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 6 ms.
[2021-05-09 18:20:54] [INFO ] Time to serialize gal into /tmp/UpperBounds8691207267233523116.gal : 4 ms
[2021-05-09 18:20:54] [INFO ] Time to serialize properties into /tmp/UpperBounds2515199730465651261.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds8691207267233523116.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds2515199730465651261.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds8691207267233523116.gal -t CGAL -reachable-file /tmp/UpperBounds2515199730465651261.prop --nowitness
Loading property file /tmp/UpperBounds2515199730465651261.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,737455,3.02328,69400,2457,1135,96350,7518,313,189689,93,50189,0
Total reachable state count : 737455
Verifying 5 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-02 :0 <= i3.u3.p144 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-02,0,3.11566,69400,1,0,96350,7518,402,189689,110,50189,1535
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-04 :0 <= i5.u13.p88 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-04,0,3.12448,69400,1,0,96350,7518,423,189689,117,50189,1844
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-07 :0 <= i2.u4.p156 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-07,0,3.12871,69400,1,0,96350,7518,439,189689,124,50189,2409
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-09 :0 <= i3.u3.p144 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-09,0,3.12886,69400,1,0,96350,7518,439,189689,124,50189,2409
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-003-UpperBounds-10 :0 <= i2.u4.p152 <= 1
FORMULA DoubleExponent-PT-003-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-UpperBounds-10,0,3.1329,69400,1,0,96350,7518,453,189689,128,50189,2973
BK_STOP 1620584458606
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-003"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-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 r083-tall-162048875400411"
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 ;