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.r107-tall-167814484200469.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 smartxred
Input is DES-PT-40b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484200469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K 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.7K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 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 115K 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-40b-UpperBounds-00
FORMULA_NAME DES-PT-40b-UpperBounds-01
FORMULA_NAME DES-PT-40b-UpperBounds-02
FORMULA_NAME DES-PT-40b-UpperBounds-03
FORMULA_NAME DES-PT-40b-UpperBounds-04
FORMULA_NAME DES-PT-40b-UpperBounds-05
FORMULA_NAME DES-PT-40b-UpperBounds-06
FORMULA_NAME DES-PT-40b-UpperBounds-07
FORMULA_NAME DES-PT-40b-UpperBounds-08
FORMULA_NAME DES-PT-40b-UpperBounds-09
FORMULA_NAME DES-PT-40b-UpperBounds-10
FORMULA_NAME DES-PT-40b-UpperBounds-11
FORMULA_NAME DES-PT-40b-UpperBounds-12
FORMULA_NAME DES-PT-40b-UpperBounds-13
FORMULA_NAME DES-PT-40b-UpperBounds-14
FORMULA_NAME DES-PT-40b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678375299192

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 15:21:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 15:21:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 15:21:40] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-09 15:21:40] [INFO ] Transformed 439 places.
[2023-03-09 15:21:40] [INFO ] Transformed 390 transitions.
[2023-03-09 15:21:40] [INFO ] Found NUPN structural information;
[2023-03-09 15:21:40] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 390 rows 439 cols
[2023-03-09 15:21:40] [INFO ] Computed 65 place invariants in 34 ms
Incomplete random walk after 10000 steps, including 86 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :11
FORMULA DES-PT-40b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
[2023-03-09 15:21:40] [INFO ] Invariant cache hit.
[2023-03-09 15:21:41] [INFO ] [Real]Absence check using 39 positive place invariants in 23 ms returned sat
[2023-03-09 15:21:41] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 17 ms returned sat
[2023-03-09 15:21:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:21:41] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2023-03-09 15:21:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:21:41] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2023-03-09 15:21:41] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 128 ms returned sat
[2023-03-09 15:21:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:21:42] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2023-03-09 15:21:42] [INFO ] Deduced a trap composed of 8 places in 300 ms of which 6 ms to minimize.
[2023-03-09 15:21:42] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 1 ms to minimize.
[2023-03-09 15:21:42] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2023-03-09 15:21:42] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 4 ms to minimize.
[2023-03-09 15:21:43] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 1 ms to minimize.
[2023-03-09 15:21:43] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2023-03-09 15:21:43] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2023-03-09 15:21:43] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2023-03-09 15:21:43] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2023-03-09 15:21:43] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2023-03-09 15:21:43] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2023-03-09 15:21:43] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1527 ms
[2023-03-09 15:21:43] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 32 ms.
[2023-03-09 15:21:46] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 0 ms to minimize.
[2023-03-09 15:21:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-09 15:21:46] [INFO ] Added : 286 causal constraints over 58 iterations in 2925 ms. Result :unknown
[2023-03-09 15:21:46] [INFO ] [Real]Absence check using 39 positive place invariants in 19 ms returned sat
[2023-03-09 15:21:46] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-09 15:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:21:46] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2023-03-09 15:21:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:21:46] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-09 15:21:46] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 41 ms returned sat
[2023-03-09 15:21:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:21:47] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2023-03-09 15:21:47] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2023-03-09 15:21:47] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2023-03-09 15:21:47] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 0 ms to minimize.
[2023-03-09 15:21:47] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 2 ms to minimize.
[2023-03-09 15:21:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 476 ms
[2023-03-09 15:21:47] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 21 ms.
[2023-03-09 15:21:50] [INFO ] Added : 362 causal constraints over 73 iterations in 2843 ms. Result :sat
Minimization took 298 ms.
[2023-03-09 15:21:50] [INFO ] [Real]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-09 15:21:50] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-09 15:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:21:51] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2023-03-09 15:21:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:21:51] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-09 15:21:51] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 88 ms returned sat
[2023-03-09 15:21:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:21:51] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2023-03-09 15:21:51] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2023-03-09 15:21:51] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2023-03-09 15:21:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2023-03-09 15:21:51] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 21 ms.
[2023-03-09 15:21:53] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 0 ms to minimize.
[2023-03-09 15:21:54] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2023-03-09 15:21:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2023-03-09 15:21:54] [INFO ] Added : 275 causal constraints over 56 iterations in 2494 ms. Result :sat
Minimization took 274 ms.
[2023-03-09 15:21:54] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-09 15:21:54] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-09 15:21:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:21:54] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-03-09 15:21:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:21:54] [INFO ] [Nat]Absence check using 39 positive place invariants in 15 ms returned sat
[2023-03-09 15:21:54] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 129 ms returned sat
[2023-03-09 15:21:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:21:55] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2023-03-09 15:21:55] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2023-03-09 15:21:55] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 0 ms to minimize.
[2023-03-09 15:21:55] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2023-03-09 15:21:55] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2023-03-09 15:21:55] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2023-03-09 15:21:55] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2023-03-09 15:21:55] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 0 ms to minimize.
[2023-03-09 15:21:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 764 ms
[2023-03-09 15:21:55] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 21 ms.
[2023-03-09 15:21:57] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 0 ms to minimize.
[2023-03-09 15:21:57] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 0 ms to minimize.
[2023-03-09 15:21:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 233 ms
[2023-03-09 15:21:57] [INFO ] Added : 241 causal constraints over 49 iterations in 1943 ms. Result :sat
Minimization took 275 ms.
[2023-03-09 15:21:58] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-09 15:21:58] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-09 15:21:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:21:58] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-03-09 15:21:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:21:58] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-09 15:21:58] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 88 ms returned sat
[2023-03-09 15:21:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:21:58] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 0 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 4 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 0 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 0 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 0 ms to minimize.
[2023-03-09 15:21:59] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 875 ms
[2023-03-09 15:21:59] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 18 ms.
[2023-03-09 15:22:01] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 0 ms to minimize.
[2023-03-09 15:22:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-09 15:22:02] [INFO ] Added : 296 causal constraints over 60 iterations in 2263 ms. Result :sat
Minimization took 339 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 390/390 transitions.
Graph (complete) has 978 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 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 432 transition count 363
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 411 transition count 363
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 411 transition count 354
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 402 transition count 354
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 383 transition count 335
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 383 transition count 335
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 383 transition count 334
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 382 transition count 334
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 367 transition count 319
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 367 transition count 319
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 367 transition count 304
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 365 transition count 303
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 365 transition count 300
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 362 transition count 300
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 285 transition count 223
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 283 transition count 225
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 283 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 282 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 281 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 280 transition count 223
Applied a total of 319 rules in 173 ms. Remains 280 /439 variables (removed 159) and now considering 223/390 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 280/439 places, 223/390 transitions.
// Phase 1: matrix 223 rows 280 cols
[2023-03-09 15:22:05] [INFO ] Computed 63 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 47746 resets, run finished after 1840 ms. (steps per millisecond=543 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9132 resets, run finished after 792 ms. (steps per millisecond=1262 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9143 resets, run finished after 763 ms. (steps per millisecond=1310 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9125 resets, run finished after 814 ms. (steps per millisecond=1228 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9115 resets, run finished after 811 ms. (steps per millisecond=1233 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9169 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 5) seen :0
[2023-03-09 15:22:11] [INFO ] Invariant cache hit.
[2023-03-09 15:22:11] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 15:22:11] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-09 15:22:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:11] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-09 15:22:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:22:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-09 15:22:11] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 41 ms returned sat
[2023-03-09 15:22:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:11] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2023-03-09 15:22:11] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2023-03-09 15:22:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-09 15:22:11] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 13 ms.
[2023-03-09 15:22:12] [INFO ] Added : 114 causal constraints over 23 iterations in 425 ms. Result :sat
Minimization took 47 ms.
[2023-03-09 15:22:12] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 15:22:12] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 20 ms returned sat
[2023-03-09 15:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:12] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-09 15:22:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:22:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 15:22:12] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 27 ms returned sat
[2023-03-09 15:22:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:12] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-09 15:22:12] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 13 ms.
[2023-03-09 15:22:13] [INFO ] Added : 170 causal constraints over 34 iterations in 569 ms. Result :sat
Minimization took 60 ms.
[2023-03-09 15:22:13] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 15:22:13] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 13 ms returned sat
[2023-03-09 15:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:13] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-09 15:22:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:22:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2023-03-09 15:22:13] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-09 15:22:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:13] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-09 15:22:13] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 13 ms.
[2023-03-09 15:22:14] [INFO ] Added : 106 causal constraints over 22 iterations in 350 ms. Result :sat
Minimization took 51 ms.
[2023-03-09 15:22:14] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 15:22:14] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 13 ms returned sat
[2023-03-09 15:22:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:14] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-09 15:22:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:22:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 15:22:14] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 40 ms returned sat
[2023-03-09 15:22:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:14] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2023-03-09 15:22:14] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2023-03-09 15:22:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-09 15:22:14] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-09 15:22:14] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2023-03-09 15:22:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-09 15:22:14] [INFO ] Added : 64 causal constraints over 13 iterations in 341 ms. Result :sat
Minimization took 37 ms.
[2023-03-09 15:22:15] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 15:22:15] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 13 ms returned sat
[2023-03-09 15:22:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:15] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-09 15:22:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:22:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-09 15:22:15] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 26 ms returned sat
[2023-03-09 15:22:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:15] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2023-03-09 15:22:15] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2023-03-09 15:22:15] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2023-03-09 15:22:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2023-03-09 15:22:15] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-09 15:22:15] [INFO ] Added : 123 causal constraints over 25 iterations in 409 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 223/223 transitions.
Applied a total of 0 rules in 9 ms. Remains 280 /280 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 280/280 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 223/223 transitions.
Applied a total of 0 rules in 12 ms. Remains 280 /280 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-09 15:22:16] [INFO ] Invariant cache hit.
[2023-03-09 15:22:17] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-09 15:22:17] [INFO ] Invariant cache hit.
[2023-03-09 15:22:17] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2023-03-09 15:22:17] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-09 15:22:17] [INFO ] Invariant cache hit.
[2023-03-09 15:22:17] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 663 ms. Remains : 280/280 places, 223/223 transitions.
Starting property specific reduction for DES-PT-40b-UpperBounds-02
[2023-03-09 15:22:17] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 442 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 92 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 15:22:17] [INFO ] Invariant cache hit.
[2023-03-09 15:22:17] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 15:22:17] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-09 15:22:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:17] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-09 15:22:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:22:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 15:22:17] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 40 ms returned sat
[2023-03-09 15:22:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:18] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-09 15:22:18] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2023-03-09 15:22:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-09 15:22:18] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-09 15:22:18] [INFO ] Added : 114 causal constraints over 23 iterations in 411 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 223/223 transitions.
Graph (complete) has 953 edges and 280 vertex of which 276 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 276 transition count 222
Applied a total of 2 rules in 20 ms. Remains 276 /280 variables (removed 4) and now considering 222/223 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 276/280 places, 222/223 transitions.
// Phase 1: matrix 222 rows 276 cols
[2023-03-09 15:22:18] [INFO ] Computed 60 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 47898 resets, run finished after 1727 ms. (steps per millisecond=579 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9094 resets, run finished after 766 ms. (steps per millisecond=1305 ) properties (out of 1) seen :0
[2023-03-09 15:22:21] [INFO ] Invariant cache hit.
[2023-03-09 15:22:21] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 15:22:21] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-09 15:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:21] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-09 15:22:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:22:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 15:22:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 35 ms returned sat
[2023-03-09 15:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:21] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2023-03-09 15:22:21] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2023-03-09 15:22:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-09 15:22:21] [INFO ] Computed and/alt/rep : 208/380/208 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-09 15:22:22] [INFO ] Added : 144 causal constraints over 29 iterations in 498 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 7 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 276/276 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 7 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 15:22:22] [INFO ] Invariant cache hit.
[2023-03-09 15:22:22] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-09 15:22:22] [INFO ] Invariant cache hit.
[2023-03-09 15:22:23] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2023-03-09 15:22:23] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-09 15:22:23] [INFO ] Invariant cache hit.
[2023-03-09 15:22:23] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 568 ms. Remains : 276/276 places, 222/222 transitions.
Ending property specific reduction for DES-PT-40b-UpperBounds-02 in 5582 ms.
Starting property specific reduction for DES-PT-40b-UpperBounds-05
// Phase 1: matrix 223 rows 280 cols
[2023-03-09 15:22:23] [INFO ] Computed 63 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 471 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 94 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2023-03-09 15:22:23] [INFO ] Invariant cache hit.
[2023-03-09 15:22:23] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 15:22:23] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 13 ms returned sat
[2023-03-09 15:22:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:23] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-03-09 15:22:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:22:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 15:22:23] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 27 ms returned sat
[2023-03-09 15:22:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:23] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-09 15:22:23] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-09 15:22:24] [INFO ] Added : 170 causal constraints over 34 iterations in 556 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 280/280 places, 223/223 transitions.
[2023-03-09 15:22:24] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47919 resets, run finished after 1739 ms. (steps per millisecond=575 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9090 resets, run finished after 796 ms. (steps per millisecond=1256 ) properties (out of 1) seen :0
[2023-03-09 15:22:27] [INFO ] Invariant cache hit.
[2023-03-09 15:22:27] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 15:22:27] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-09 15:22:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:27] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-03-09 15:22:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:22:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 15:22:27] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 26 ms returned sat
[2023-03-09 15:22:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:27] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-09 15:22:27] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-09 15:22:27] [INFO ] Added : 170 causal constraints over 34 iterations in 560 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 280/280 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-09 15:22:28] [INFO ] Invariant cache hit.
[2023-03-09 15:22:28] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-09 15:22:28] [INFO ] Invariant cache hit.
[2023-03-09 15:22:28] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-03-09 15:22:28] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 15:22:28] [INFO ] Invariant cache hit.
[2023-03-09 15:22:28] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 593 ms. Remains : 280/280 places, 223/223 transitions.
Ending property specific reduction for DES-PT-40b-UpperBounds-05 in 5811 ms.
Starting property specific reduction for DES-PT-40b-UpperBounds-06
[2023-03-09 15:22:29] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 480 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 102 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 15:22:29] [INFO ] Invariant cache hit.
[2023-03-09 15:22:29] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 15:22:29] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-09 15:22:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:29] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-09 15:22:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:22:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 15:22:29] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 12 ms returned sat
[2023-03-09 15:22:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:29] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-09 15:22:29] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-09 15:22:29] [INFO ] Added : 106 causal constraints over 22 iterations in 344 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 223/223 transitions.
Graph (complete) has 953 edges and 280 vertex of which 276 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 276 transition count 222
Applied a total of 2 rules in 13 ms. Remains 276 /280 variables (removed 4) and now considering 222/223 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 276/280 places, 222/223 transitions.
// Phase 1: matrix 222 rows 276 cols
[2023-03-09 15:22:29] [INFO ] Computed 60 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 47670 resets, run finished after 1721 ms. (steps per millisecond=581 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9134 resets, run finished after 778 ms. (steps per millisecond=1285 ) properties (out of 1) seen :0
[2023-03-09 15:22:32] [INFO ] Invariant cache hit.
[2023-03-09 15:22:32] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 15:22:32] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-09 15:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:32] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-09 15:22:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:22:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 15:22:32] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 80 ms returned sat
[2023-03-09 15:22:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:32] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2023-03-09 15:22:32] [INFO ] Computed and/alt/rep : 208/380/208 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-09 15:22:33] [INFO ] Added : 127 causal constraints over 26 iterations in 466 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 15 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 276/276 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 14 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 15:22:33] [INFO ] Invariant cache hit.
[2023-03-09 15:22:33] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-09 15:22:33] [INFO ] Invariant cache hit.
[2023-03-09 15:22:34] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2023-03-09 15:22:34] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 15:22:34] [INFO ] Invariant cache hit.
[2023-03-09 15:22:34] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 559 ms. Remains : 276/276 places, 222/222 transitions.
Ending property specific reduction for DES-PT-40b-UpperBounds-06 in 5222 ms.
Starting property specific reduction for DES-PT-40b-UpperBounds-08
// Phase 1: matrix 223 rows 280 cols
[2023-03-09 15:22:34] [INFO ] Computed 63 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 497 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 15:22:34] [INFO ] Invariant cache hit.
[2023-03-09 15:22:34] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 15:22:34] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-09 15:22:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:34] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-09 15:22:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:22:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 15:22:34] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 47 ms returned sat
[2023-03-09 15:22:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:34] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2023-03-09 15:22:34] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2023-03-09 15:22:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-09 15:22:34] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-09 15:22:34] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2023-03-09 15:22:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-09 15:22:35] [INFO ] Added : 64 causal constraints over 13 iterations in 323 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 223/223 transitions.
Graph (complete) has 953 edges and 280 vertex of which 276 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 276 transition count 222
Applied a total of 2 rules in 12 ms. Remains 276 /280 variables (removed 4) and now considering 222/223 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 276/280 places, 222/223 transitions.
// Phase 1: matrix 222 rows 276 cols
[2023-03-09 15:22:35] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 47657 resets, run finished after 1715 ms. (steps per millisecond=583 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9181 resets, run finished after 784 ms. (steps per millisecond=1275 ) properties (out of 1) seen :0
[2023-03-09 15:22:37] [INFO ] Invariant cache hit.
[2023-03-09 15:22:37] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 15:22:37] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-09 15:22:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:37] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-09 15:22:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:22:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 15:22:37] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 77 ms returned sat
[2023-03-09 15:22:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:38] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-09 15:22:38] [INFO ] Computed and/alt/rep : 208/380/208 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-09 15:22:38] [INFO ] Added : 78 causal constraints over 16 iterations in 304 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 276/276 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 15:22:38] [INFO ] Invariant cache hit.
[2023-03-09 15:22:38] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-09 15:22:38] [INFO ] Invariant cache hit.
[2023-03-09 15:22:38] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2023-03-09 15:22:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:22:38] [INFO ] Invariant cache hit.
[2023-03-09 15:22:39] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 558 ms. Remains : 276/276 places, 222/222 transitions.
Ending property specific reduction for DES-PT-40b-UpperBounds-08 in 4807 ms.
Starting property specific reduction for DES-PT-40b-UpperBounds-10
// Phase 1: matrix 223 rows 280 cols
[2023-03-09 15:22:39] [INFO ] Computed 63 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 464 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 79 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 15:22:39] [INFO ] Invariant cache hit.
[2023-03-09 15:22:39] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 15:22:39] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 13 ms returned sat
[2023-03-09 15:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:39] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2023-03-09 15:22:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:22:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 15:22:39] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 32 ms returned sat
[2023-03-09 15:22:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:39] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2023-03-09 15:22:39] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2023-03-09 15:22:39] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2023-03-09 15:22:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2023-03-09 15:22:39] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-09 15:22:39] [INFO ] Added : 123 causal constraints over 25 iterations in 390 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 223/223 transitions.
Graph (complete) has 953 edges and 280 vertex of which 276 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 276 transition count 222
Applied a total of 2 rules in 11 ms. Remains 276 /280 variables (removed 4) and now considering 222/223 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 276/280 places, 222/223 transitions.
// Phase 1: matrix 222 rows 276 cols
[2023-03-09 15:22:40] [INFO ] Computed 60 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 47687 resets, run finished after 1703 ms. (steps per millisecond=587 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9087 resets, run finished after 776 ms. (steps per millisecond=1288 ) properties (out of 1) seen :0
[2023-03-09 15:22:42] [INFO ] Invariant cache hit.
[2023-03-09 15:22:42] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 15:22:42] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-09 15:22:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:42] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-09 15:22:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:22:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-09 15:22:43] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 68 ms returned sat
[2023-03-09 15:22:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:22:43] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2023-03-09 15:22:43] [INFO ] Computed and/alt/rep : 208/380/208 causal constraints (skipped 11 transitions) in 13 ms.
[2023-03-09 15:22:43] [INFO ] Added : 150 causal constraints over 30 iterations in 538 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 276/276 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 15:22:44] [INFO ] Invariant cache hit.
[2023-03-09 15:22:44] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-09 15:22:44] [INFO ] Invariant cache hit.
[2023-03-09 15:22:44] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2023-03-09 15:22:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 15:22:44] [INFO ] Invariant cache hit.
[2023-03-09 15:22:44] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 550 ms. Remains : 276/276 places, 222/222 transitions.
Ending property specific reduction for DES-PT-40b-UpperBounds-10 in 5562 ms.
[2023-03-09 15:22:44] [INFO ] Flatten gal took : 55 ms
[2023-03-09 15:22:44] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2023-03-09 15:22:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 280 places, 223 transitions and 1091 arcs took 3 ms.
Total runtime 64218 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 40b
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 280 places, 223 transitions, 1091 arcs.
Final Score: 4838.175
Took : 13 seconds
Bounds file is: UpperBounds.xml
FORMULA DES-PT-40b-UpperBounds-02 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-40b-UpperBounds-05 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-40b-UpperBounds-06 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-40b-UpperBounds-08 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-40b-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678377490387

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-40b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is DES-PT-40b, 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 r107-tall-167814484200469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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