fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r127-tall-167814504300055
Last Updated
May 14, 2023

About the Execution of 2022-gold for DES-PT-20b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
623.699 43037.00 59614.00 178.20 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/mcc2023-input.r127-tall-167814504300055.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is DES-PT-20b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-tall-167814504300055
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.6K Feb 26 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 15:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 91K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678174679452

Running Version 202205111006
[2023-03-07 07:38:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-07 07:38:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 07:38:00] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2023-03-07 07:38:00] [INFO ] Transformed 360 places.
[2023-03-07 07:38:00] [INFO ] Transformed 311 transitions.
[2023-03-07 07:38:00] [INFO ] Found NUPN structural information;
[2023-03-07 07:38:00] [INFO ] Parsed PT model containing 360 places and 311 transitions in 306 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 311 rows 360 cols
[2023-03-07 07:38:00] [INFO ] Computed 65 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 86 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :12
FORMULA DES-PT-20b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
// Phase 1: matrix 311 rows 360 cols
[2023-03-07 07:38:01] [INFO ] Computed 65 place invariants in 9 ms
[2023-03-07 07:38:01] [INFO ] [Real]Absence check using 39 positive place invariants in 21 ms returned sat
[2023-03-07 07:38:01] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 16 ms returned sat
[2023-03-07 07:38:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:01] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2023-03-07 07:38:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:01] [INFO ] [Nat]Absence check using 39 positive place invariants in 20 ms returned sat
[2023-03-07 07:38:01] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-07 07:38:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:01] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2023-03-07 07:38:01] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 7 ms to minimize.
[2023-03-07 07:38:02] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2023-03-07 07:38:02] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2023-03-07 07:38:02] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2023-03-07 07:38:02] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 14 ms to minimize.
[2023-03-07 07:38:02] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2023-03-07 07:38:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 922 ms
[2023-03-07 07:38:02] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 33 ms.
[2023-03-07 07:38:04] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2023-03-07 07:38:04] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2023-03-07 07:38:04] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2023-03-07 07:38:04] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2023-03-07 07:38:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 299 ms
[2023-03-07 07:38:04] [INFO ] Added : 271 causal constraints over 55 iterations in 2196 ms. Result :sat
Minimization took 129 ms.
[2023-03-07 07:38:05] [INFO ] [Real]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-07 07:38:05] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-07 07:38:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:05] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2023-03-07 07:38:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:05] [INFO ] [Nat]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-07 07:38:05] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 16 ms returned sat
[2023-03-07 07:38:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:05] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2023-03-07 07:38:05] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2023-03-07 07:38:05] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2023-03-07 07:38:05] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2023-03-07 07:38:05] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2023-03-07 07:38:05] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 0 ms to minimize.
[2023-03-07 07:38:06] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2023-03-07 07:38:06] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 0 ms to minimize.
[2023-03-07 07:38:06] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 0 ms to minimize.
[2023-03-07 07:38:06] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2023-03-07 07:38:06] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 1 ms to minimize.
[2023-03-07 07:38:06] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 3 ms to minimize.
[2023-03-07 07:38:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1228 ms
[2023-03-07 07:38:06] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 18 ms.
[2023-03-07 07:38:08] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
[2023-03-07 07:38:08] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2023-03-07 07:38:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 246 ms
[2023-03-07 07:38:08] [INFO ] Added : 241 causal constraints over 49 iterations in 1832 ms. Result :sat
Minimization took 114 ms.
[2023-03-07 07:38:08] [INFO ] [Real]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-07 07:38:08] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-07 07:38:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:08] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2023-03-07 07:38:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:08] [INFO ] [Nat]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-07 07:38:08] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-07 07:38:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:09] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-03-07 07:38:09] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 0 ms to minimize.
[2023-03-07 07:38:09] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2023-03-07 07:38:09] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 0 ms to minimize.
[2023-03-07 07:38:09] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 0 ms to minimize.
[2023-03-07 07:38:09] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2023-03-07 07:38:09] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2023-03-07 07:38:09] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2023-03-07 07:38:09] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2023-03-07 07:38:09] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2023-03-07 07:38:10] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2023-03-07 07:38:10] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2023-03-07 07:38:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1087 ms
[2023-03-07 07:38:10] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 16 ms.
[2023-03-07 07:38:11] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 4 ms to minimize.
[2023-03-07 07:38:12] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2023-03-07 07:38:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2023-03-07 07:38:12] [INFO ] Added : 288 causal constraints over 58 iterations in 1992 ms. Result :sat
Minimization took 152 ms.
[2023-03-07 07:38:12] [INFO ] [Real]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-07 07:38:12] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-07 07:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:12] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2023-03-07 07:38:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:12] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2023-03-07 07:38:12] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 9 ms returned sat
[2023-03-07 07:38:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:12] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-03-07 07:38:12] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2023-03-07 07:38:12] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-03-07 07:38:13] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2023-03-07 07:38:13] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2023-03-07 07:38:13] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2023-03-07 07:38:13] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2023-03-07 07:38:13] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2023-03-07 07:38:13] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2023-03-07 07:38:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 690 ms
[2023-03-07 07:38:13] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 16 ms.
[2023-03-07 07:38:14] [INFO ] Added : 175 causal constraints over 35 iterations in 945 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA DES-PT-20b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 360/360 places, 311/311 transitions.
Graph (complete) has 741 edges and 360 vertex of which 349 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.5 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 349 transition count 283
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 328 transition count 283
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 328 transition count 274
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 319 transition count 274
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 300 transition count 255
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 300 transition count 255
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 300 transition count 254
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 299 transition count 254
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 284 transition count 239
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 284 transition count 239
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 284 transition count 224
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 282 transition count 223
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 282 transition count 220
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 279 transition count 220
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 202 transition count 143
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 4 with 4 rules applied. Total rules applied 315 place count 200 transition count 145
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 200 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 199 transition count 144
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 199 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 198 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 197 transition count 143
Applied a total of 320 rules in 153 ms. Remains 197 /360 variables (removed 163) and now considering 143/311 (removed 168) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/360 places, 143/311 transitions.
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:15] [INFO ] Computed 60 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 47885 resets, run finished after 1803 ms. (steps per millisecond=554 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9016 resets, run finished after 858 ms. (steps per millisecond=1165 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9195 resets, run finished after 850 ms. (steps per millisecond=1176 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9170 resets, run finished after 843 ms. (steps per millisecond=1186 ) properties (out of 3) seen :0
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:20] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-07 07:38:20] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:20] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-07 07:38:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:20] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-07 07:38:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:20] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 96 ms returned sat
[2023-03-07 07:38:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:20] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-07 07:38:20] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-07 07:38:21] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2023-03-07 07:38:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-07 07:38:21] [INFO ] Added : 122 causal constraints over 25 iterations in 360 ms. Result :sat
Minimization took 42 ms.
[2023-03-07 07:38:21] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:21] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-07 07:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:21] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-07 07:38:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 32 ms returned sat
[2023-03-07 07:38:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:21] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-07 07:38:21] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-07 07:38:21] [INFO ] Added : 121 causal constraints over 25 iterations in 330 ms. Result :sat
Minimization took 51 ms.
[2023-03-07 07:38:21] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:21] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-07 07:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:21] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-07 07:38:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-07 07:38:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2023-03-07 07:38:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:21] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-07 07:38:22] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2023-03-07 07:38:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-07 07:38:22] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-07 07:38:22] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2023-03-07 07:38:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-07 07:38:22] [INFO ] Added : 117 causal constraints over 24 iterations in 370 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 6 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 9 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:22] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-07 07:38:23] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:23] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-07 07:38:23] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-07 07:38:23] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:23] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-07 07:38:23] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Starting property specific reduction for DES-PT-20b-UpperBounds-00
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:23] [INFO ] Computed 60 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 477 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:23] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-07 07:38:23] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-07 07:38:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:23] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-07 07:38:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2023-03-07 07:38:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 102 ms returned sat
[2023-03-07 07:38:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:23] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-07 07:38:23] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-07 07:38:24] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2023-03-07 07:38:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-07 07:38:24] [INFO ] Added : 122 causal constraints over 25 iterations in 358 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 7 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:24] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47780 resets, run finished after 1731 ms. (steps per millisecond=577 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9077 resets, run finished after 839 ms. (steps per millisecond=1191 ) properties (out of 1) seen :0
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:26] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-07 07:38:26] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2023-03-07 07:38:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-07 07:38:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:26] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-07 07:38:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 96 ms returned sat
[2023-03-07 07:38:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:27] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-07 07:38:27] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-07 07:38:27] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2023-03-07 07:38:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-07 07:38:27] [INFO ] Added : 122 causal constraints over 25 iterations in 343 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 6 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 6 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:27] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-07 07:38:27] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:27] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-07 07:38:28] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-07 07:38:28] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:28] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-07 07:38:28] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-00 in 4852 ms.
Starting property specific reduction for DES-PT-20b-UpperBounds-04
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:28] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 518 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:28] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-07 07:38:28] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-07 07:38:28] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-07 07:38:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:28] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-07 07:38:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:28] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 32 ms returned sat
[2023-03-07 07:38:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:28] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-07 07:38:28] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 7 ms.
[2023-03-07 07:38:28] [INFO ] Added : 121 causal constraints over 25 iterations in 326 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 6 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:29] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47680 resets, run finished after 1734 ms. (steps per millisecond=576 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9120 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 1) seen :0
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:31] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-07 07:38:31] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:31] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-07 07:38:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:31] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-07 07:38:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:31] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 32 ms returned sat
[2023-03-07 07:38:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:31] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-07 07:38:31] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-07 07:38:32] [INFO ] Added : 121 causal constraints over 25 iterations in 322 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 7 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:32] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-07 07:38:32] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:32] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-07 07:38:32] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-07 07:38:32] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:32] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-07 07:38:32] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-04 in 4693 ms.
Starting property specific reduction for DES-PT-20b-UpperBounds-11
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:32] [INFO ] Computed 60 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 482 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:32] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-07 07:38:32] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:32] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-07 07:38:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:33] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-07 07:38:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-07 07:38:33] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2023-03-07 07:38:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:33] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-07 07:38:33] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2023-03-07 07:38:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-07 07:38:33] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-07 07:38:33] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2023-03-07 07:38:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-07 07:38:33] [INFO ] Added : 117 causal constraints over 24 iterations in 361 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:33] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 47657 resets, run finished after 1722 ms. (steps per millisecond=580 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9080 resets, run finished after 845 ms. (steps per millisecond=1183 ) properties (out of 1) seen :0
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:36] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-07 07:38:36] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-07 07:38:36] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-07 07:38:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:36] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-07 07:38:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-07 07:38:36] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2023-03-07 07:38:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:36] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-07 07:38:36] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2023-03-07 07:38:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-07 07:38:36] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-07 07:38:37] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2023-03-07 07:38:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-07 07:38:37] [INFO ] Added : 117 causal constraints over 24 iterations in 389 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:37] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-07 07:38:37] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:37] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-07 07:38:37] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-07 07:38:37] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2023-03-07 07:38:37] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-07 07:38:37] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-11 in 4849 ms.
[2023-03-07 07:38:37] [INFO ] Flatten gal took : 49 ms
[2023-03-07 07:38:37] [INFO ] Applying decomposition
[2023-03-07 07:38:37] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11893816405547937824.txt' '-o' '/tmp/graph11893816405547937824.bin' '-w' '/tmp/graph11893816405547937824.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11893816405547937824.bin' '-l' '-1' '-v' '-w' '/tmp/graph11893816405547937824.weights' '-q' '0' '-e' '0.001'
[2023-03-07 07:38:38] [INFO ] Decomposing Gal with order
[2023-03-07 07:38:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-07 07:38:38] [INFO ] Removed a total of 46 redundant transitions.
[2023-03-07 07:38:38] [INFO ] Flatten gal took : 48 ms
[2023-03-07 07:38:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 7 ms.
[2023-03-07 07:38:38] [INFO ] Time to serialize gal into /tmp/UpperBounds6978365014872544330.gal : 6 ms
[2023-03-07 07:38:38] [INFO ] Time to serialize properties into /tmp/UpperBounds15460490995034881933.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6978365014872544330.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15460490995034881933.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds15460490995034881933.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,9.63856e+12,3.65697,140092,30661,1833,431251,3450,301,254686,218,15509,0
Total reachable state count : 9638559829248

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-20b-UpperBounds-00 :0 <= u14.p10 <= 1
FORMULA DES-PT-20b-UpperBounds-00 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
DES-PT-20b-UpperBounds-00,0,4.08009,140092,1,0,431251,19410,483,254686,292,70282,2427
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-20b-UpperBounds-04 :0 <= u13.p50 <= 1
FORMULA DES-PT-20b-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
DES-PT-20b-UpperBounds-04,0,4.23679,140092,1,0,431251,29217,515,254686,337,94699,2839
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-20b-UpperBounds-11 :0 <= u2.p72 <= 1
FORMULA DES-PT-20b-UpperBounds-11 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
DES-PT-20b-UpperBounds-11,0,4.24151,140092,1,0,431251,29217,552,254686,337,94700,2868
Total runtime 41841 ms.

BK_STOP 1678174722489

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is DES-PT-20b, 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 r127-tall-167814504300055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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