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.r064-tall-162038396700107.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 DES-PT-30b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038396700107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 127K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K 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 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 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 103K 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 DES-PT-30b-UpperBounds-00
FORMULA_NAME DES-PT-30b-UpperBounds-01
FORMULA_NAME DES-PT-30b-UpperBounds-02
FORMULA_NAME DES-PT-30b-UpperBounds-03
FORMULA_NAME DES-PT-30b-UpperBounds-04
FORMULA_NAME DES-PT-30b-UpperBounds-05
FORMULA_NAME DES-PT-30b-UpperBounds-06
FORMULA_NAME DES-PT-30b-UpperBounds-07
FORMULA_NAME DES-PT-30b-UpperBounds-08
FORMULA_NAME DES-PT-30b-UpperBounds-09
FORMULA_NAME DES-PT-30b-UpperBounds-10
FORMULA_NAME DES-PT-30b-UpperBounds-11
FORMULA_NAME DES-PT-30b-UpperBounds-12
FORMULA_NAME DES-PT-30b-UpperBounds-13
FORMULA_NAME DES-PT-30b-UpperBounds-14
FORMULA_NAME DES-PT-30b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620473682073

Running Version 0
[2021-05-08 11:34:43] [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-08 11:34:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 11:34:43] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2021-05-08 11:34:43] [INFO ] Transformed 399 places.
[2021-05-08 11:34:43] [INFO ] Transformed 350 transitions.
[2021-05-08 11:34:43] [INFO ] Found NUPN structural information;
[2021-05-08 11:34:43] [INFO ] Parsed PT model containing 399 places and 350 transitions in 116 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 350 rows 399 cols
[2021-05-08 11:34:43] [INFO ] Computed 65 place invariants in 31 ms
Incomplete random walk after 10000 steps, including 89 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :12
FORMULA DES-PT-30b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :1
FORMULA DES-PT-30b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 350 rows 399 cols
[2021-05-08 11:34:44] [INFO ] Computed 65 place invariants in 13 ms
[2021-05-08 11:34:44] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2021-05-08 11:34:44] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 15 ms returned sat
[2021-05-08 11:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:34:44] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2021-05-08 11:34:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:34:44] [INFO ] [Nat]Absence check using 39 positive place invariants in 20 ms returned sat
[2021-05-08 11:34:44] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 23 ms returned sat
[2021-05-08 11:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:34:44] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2021-05-08 11:34:44] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 3 ms to minimize.
[2021-05-08 11:34:45] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 2 ms to minimize.
[2021-05-08 11:34:45] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2021-05-08 11:34:45] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2021-05-08 11:34:45] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2021-05-08 11:34:45] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2021-05-08 11:34:45] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 13 ms to minimize.
[2021-05-08 11:34:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1139 ms
[2021-05-08 11:34:45] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 18 ms.
[2021-05-08 11:34:47] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 1 ms to minimize.
[2021-05-08 11:34:47] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 0 ms to minimize.
[2021-05-08 11:34:47] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2021-05-08 11:34:48] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 1 ms to minimize.
[2021-05-08 11:34:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 543 ms
[2021-05-08 11:34:48] [INFO ] Added : 286 causal constraints over 58 iterations in 2331 ms. Result :sat
Minimization took 164 ms.
[2021-05-08 11:34:48] [INFO ] [Real]Absence check using 39 positive place invariants in 17 ms returned sat
[2021-05-08 11:34:48] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2021-05-08 11:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:34:48] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2021-05-08 11:34:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:34:48] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2021-05-08 11:34:48] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned sat
[2021-05-08 11:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:34:48] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2021-05-08 11:34:48] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2021-05-08 11:34:48] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2021-05-08 11:34:49] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2021-05-08 11:34:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 225 ms
[2021-05-08 11:34:49] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 23 ms.
[2021-05-08 11:34:50] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 1 ms to minimize.
[2021-05-08 11:34:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2021-05-08 11:34:50] [INFO ] Added : 255 causal constraints over 51 iterations in 1487 ms. Result :sat
Minimization took 171 ms.
[2021-05-08 11:34:50] [INFO ] [Real]Absence check using 39 positive place invariants in 13 ms returned sat
[2021-05-08 11:34:50] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2021-05-08 11:34:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:34:50] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-08 11:34:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:34:51] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2021-05-08 11:34:51] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2021-05-08 11:34:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:34:51] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2021-05-08 11:34:51] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2021-05-08 11:34:51] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2021-05-08 11:34:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2021-05-08 11:34:51] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 23 ms.
[2021-05-08 11:34:53] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2021-05-08 11:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2021-05-08 11:34:53] [INFO ] Added : 260 causal constraints over 53 iterations in 2505 ms. Result :sat
Minimization took 150 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 94500 steps, including 1361 resets, run finished after 323 ms. (steps per millisecond=292 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 180000 steps, including 1963 resets, run finished after 523 ms. (steps per millisecond=344 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 309400 steps, including 3430 resets, run finished after 905 ms. (steps per millisecond=341 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 399 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 399/399 places, 350/350 transitions.
Graph (complete) has 858 edges and 399 vertex of which 388 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 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 388 transition count 322
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 367 transition count 322
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 367 transition count 313
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 358 transition count 313
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 339 transition count 294
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 339 transition count 294
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 339 transition count 293
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 338 transition count 293
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 323 transition count 278
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 323 transition count 278
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 323 transition count 263
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 321 transition count 262
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 321 transition count 259
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 318 transition count 259
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 241 transition count 182
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 239 transition count 184
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 239 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 238 transition count 183
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 238 transition count 183
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 237 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 236 transition count 182
Applied a total of 320 rules in 171 ms. Remains 236 /399 variables (removed 163) and now considering 182/350 (removed 168) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/399 places, 182/350 transitions.
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:34:56] [INFO ] Computed 60 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 47854 resets, run finished after 2881 ms. (steps per millisecond=347 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9139 resets, run finished after 1070 ms. (steps per millisecond=934 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9125 resets, run finished after 1053 ms. (steps per millisecond=949 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 8977 resets, run finished after 1043 ms. (steps per millisecond=958 ) properties (out of 3) seen :0
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:02] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 11:35:02] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 11:35:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-08 11:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:02] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2021-05-08 11:35:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:35:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 11:35:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 44 ms returned sat
[2021-05-08 11:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:02] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-08 11:35:02] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 19 ms.
[2021-05-08 11:35:02] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2021-05-08 11:35:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2021-05-08 11:35:03] [INFO ] Added : 155 causal constraints over 31 iterations in 536 ms. Result :sat
Minimization took 61 ms.
[2021-05-08 11:35:03] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 11:35:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-08 11:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:03] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2021-05-08 11:35:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:35:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 11:35:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 88 ms returned sat
[2021-05-08 11:35:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:03] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2021-05-08 11:35:03] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 10 ms.
[2021-05-08 11:35:03] [INFO ] Added : 98 causal constraints over 20 iterations in 259 ms. Result :sat
Minimization took 57 ms.
[2021-05-08 11:35:03] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 11:35:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-08 11:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:03] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2021-05-08 11:35:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:35:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 11:35:04] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 81 ms returned sat
[2021-05-08 11:35:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:04] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2021-05-08 11:35:04] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 13 ms.
[2021-05-08 11:35:04] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2021-05-08 11:35:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2021-05-08 11:35:04] [INFO ] Added : 69 causal constraints over 14 iterations in 237 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 25300 steps, including 1368 resets, run finished after 96 ms. (steps per millisecond=263 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 58300 steps, including 3882 resets, run finished after 185 ms. (steps per millisecond=315 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 131400 steps, including 6671 resets, run finished after 385 ms. (steps per millisecond=341 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 8 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 8 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:05] [INFO ] Computed 60 place invariants in 5 ms
[2021-05-08 11:35:05] [INFO ] Implicit Places using invariants in 162 ms returned []
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:05] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 11:35:05] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2021-05-08 11:35:05] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:05] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 11:35:05] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
Starting property specific reduction for DES-PT-30b-UpperBounds-10
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:05] [INFO ] Computed 60 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 459 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:05] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 11:35:05] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 11:35:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-08 11:35:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:05] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-08 11:35:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:35:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 11:35:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 43 ms returned sat
[2021-05-08 11:35:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:06] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2021-05-08 11:35:06] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 12 ms.
[2021-05-08 11:35:06] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2021-05-08 11:35:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2021-05-08 11:35:06] [INFO ] Added : 155 causal constraints over 31 iterations in 504 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 131400 steps, including 6644 resets, run finished after 379 ms. (steps per millisecond=346 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 7 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:07] [INFO ] Computed 60 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 47741 resets, run finished after 2785 ms. (steps per millisecond=359 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9143 resets, run finished after 1042 ms. (steps per millisecond=959 ) properties (out of 1) seen :0
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:10] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 11:35:10] [INFO ] [Real]Absence check using 36 positive place invariants in 33 ms returned sat
[2021-05-08 11:35:10] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2021-05-08 11:35:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:11] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2021-05-08 11:35:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:35:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-08 11:35:11] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 54 ms returned sat
[2021-05-08 11:35:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:11] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-08 11:35:11] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 10 ms.
[2021-05-08 11:35:11] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2021-05-08 11:35:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2021-05-08 11:35:11] [INFO ] Added : 155 causal constraints over 31 iterations in 508 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 131400 steps, including 6643 resets, run finished after 378 ms. (steps per millisecond=347 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 8 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 7 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:12] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 11:35:12] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:12] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 11:35:12] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2021-05-08 11:35:12] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:12] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 11:35:12] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-10 in 7099 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-11
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:12] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 473 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:12] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 11:35:12] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 11:35:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-08 11:35:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:12] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2021-05-08 11:35:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:35:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 11:35:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 90 ms returned sat
[2021-05-08 11:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:13] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2021-05-08 11:35:13] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 11 ms.
[2021-05-08 11:35:13] [INFO ] Added : 98 causal constraints over 20 iterations in 266 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 58300 steps, including 3887 resets, run finished after 161 ms. (steps per millisecond=362 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 7 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:13] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 48059 resets, run finished after 2723 ms. (steps per millisecond=367 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9126 resets, run finished after 1056 ms. (steps per millisecond=946 ) properties (out of 1) seen :0
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:17] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 11:35:17] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 11:35:17] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-08 11:35:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:17] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-08 11:35:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:35:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 11:35:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 100 ms returned sat
[2021-05-08 11:35:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:18] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2021-05-08 11:35:18] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 10 ms.
[2021-05-08 11:35:18] [INFO ] Added : 98 causal constraints over 20 iterations in 265 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 58300 steps, including 3934 resets, run finished after 165 ms. (steps per millisecond=353 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:18] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 11:35:18] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:18] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 11:35:18] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2021-05-08 11:35:18] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:18] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 11:35:19] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-11 in 6260 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-12
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:19] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 492 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:19] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 11:35:19] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 11:35:19] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-08 11:35:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:19] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-08 11:35:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:35:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 11:35:19] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 81 ms returned sat
[2021-05-08 11:35:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:19] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2021-05-08 11:35:19] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 11 ms.
[2021-05-08 11:35:19] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2021-05-08 11:35:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2021-05-08 11:35:19] [INFO ] Added : 69 causal constraints over 14 iterations in 262 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 25300 steps, including 1384 resets, run finished after 73 ms. (steps per millisecond=346 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 7 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:19] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 47979 resets, run finished after 2739 ms. (steps per millisecond=365 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8991 resets, run finished after 1050 ms. (steps per millisecond=952 ) properties (out of 1) seen :0
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:23] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 11:35:23] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 11:35:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-08 11:35:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:23] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2021-05-08 11:35:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:35:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2021-05-08 11:35:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 81 ms returned sat
[2021-05-08 11:35:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:23] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2021-05-08 11:35:23] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 9 ms.
[2021-05-08 11:35:24] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2021-05-08 11:35:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2021-05-08 11:35:24] [INFO ] Added : 69 causal constraints over 14 iterations in 269 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 25300 steps, including 1393 resets, run finished after 74 ms. (steps per millisecond=341 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:24] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 11:35:24] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:24] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 11:35:24] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2021-05-08 11:35:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 182 rows 236 cols
[2021-05-08 11:35:24] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 11:35:24] [INFO ] Dead Transitions using invariants and state equation in 120 ms returned []
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-12 in 5873 ms.
[2021-05-08 11:35:25] [INFO ] Flatten gal took : 58 ms
[2021-05-08 11:35:25] [INFO ] Applying decomposition
[2021-05-08 11:35:25] [INFO ] Flatten gal took : 20 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/graph10478809327208014202.txt, -o, /tmp/graph10478809327208014202.bin, -w, /tmp/graph10478809327208014202.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/graph10478809327208014202.bin, -l, -1, -v, -w, /tmp/graph10478809327208014202.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:35:25] [INFO ] Decomposing Gal with order
[2021-05-08 11:35:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:35:25] [INFO ] Removed a total of 68 redundant transitions.
[2021-05-08 11:35:25] [INFO ] Flatten gal took : 48 ms
[2021-05-08 11:35:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 7 ms.
[2021-05-08 11:35:25] [INFO ] Time to serialize gal into /tmp/UpperBounds8911562851633507453.gal : 6 ms
[2021-05-08 11:35:25] [INFO ] Time to serialize properties into /tmp/UpperBounds12755298214074721325.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/UpperBounds8911562851633507453.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds12755298214074721325.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/UpperBounds8911562851633507453.gal -t CGAL -reachable-file /tmp/UpperBounds12755298214074721325.prop --nowitness
Loading property file /tmp/UpperBounds12755298214074721325.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,2.32787e+13,4.75071,109108,16344,2836,247127,6609,341,259809,301,40786,0
Total reachable state count : 23278662811432

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-30b-UpperBounds-10 :0 <= u2.p105 <= 1
FORMULA DES-PT-30b-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
DES-PT-30b-UpperBounds-10,0,5.66974,109376,1,0,247127,28867,535,259809,393,136076,2674
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-30b-UpperBounds-11 :0 <= u50.p54 <= 1
FORMULA DES-PT-30b-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-30b-UpperBounds-11,0,6.02333,109640,1,0,247127,32901,576,259809,424,164776,3545
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-30b-UpperBounds-12 :0 <= i3.u16.p30 <= 1
FORMULA DES-PT-30b-UpperBounds-12 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-30b-UpperBounds-12,0,6.03351,109640,1,0,247127,33566,599,259809,433,167606,3806

BK_STOP 1620473732375

--------------------
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="DES-PT-30b"
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 DES-PT-30b, 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 r064-tall-162038396700107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30b.tgz
mv DES-PT-30b 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 ;