fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of Smart+red for DES-PT-20b

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11324.936 2207569.00 2247113.00 3148.20 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r107-tall-167814484200437.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-20b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484200437
=====================================================================

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

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678369821160

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-20b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 13:50:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 13:50:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 13:50:22] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-09 13:50:22] [INFO ] Transformed 360 places.
[2023-03-09 13:50:22] [INFO ] Transformed 311 transitions.
[2023-03-09 13:50:22] [INFO ] Found NUPN structural information;
[2023-03-09 13:50:22] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 371 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 311 rows 360 cols
[2023-03-09 13:50:23] [INFO ] Computed 65 place invariants in 31 ms
Incomplete random walk after 10000 steps, including 84 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :13
FORMULA DES-PT-20b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
[2023-03-09 13:50:23] [INFO ] Invariant cache hit.
[2023-03-09 13:50:23] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2023-03-09 13:50:23] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-09 13:50:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:23] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2023-03-09 13:50:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:50:23] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2023-03-09 13:50:23] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 43 ms returned sat
[2023-03-09 13:50:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:23] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-09 13:50:24] [INFO ] Deduced a trap composed of 17 places in 352 ms of which 3 ms to minimize.
[2023-03-09 13:50:24] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2023-03-09 13:50:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 571 ms
[2023-03-09 13:50:24] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 20 ms.
[2023-03-09 13:50:26] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2023-03-09 13:50:26] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2023-03-09 13:50:26] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2023-03-09 13:50:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 303 ms
[2023-03-09 13:50:26] [INFO ] Added : 276 causal constraints over 56 iterations in 2175 ms. Result :sat
Minimization took 142 ms.
[2023-03-09 13:50:26] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-09 13:50:26] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-09 13:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:27] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2023-03-09 13:50:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:50:27] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-09 13:50:27] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 9 ms returned sat
[2023-03-09 13:50:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:27] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-09 13:50:27] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-09 13:50:27] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2023-03-09 13:50:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 151 ms
[2023-03-09 13:50:27] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 19 ms.
[2023-03-09 13:50:28] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 3 ms to minimize.
[2023-03-09 13:50:28] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2023-03-09 13:50:28] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2023-03-09 13:50:29] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2023-03-09 13:50:29] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2023-03-09 13:50:29] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-09 13:50:29] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2023-03-09 13:50:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 650 ms
[2023-03-09 13:50:29] [INFO ] Added : 235 causal constraints over 48 iterations in 1969 ms. Result :sat
Minimization took 181 ms.
[2023-03-09 13:50:29] [INFO ] [Real]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-09 13:50:29] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-09 13:50:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:29] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-09 13:50:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:50:29] [INFO ] [Nat]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-09 13:50:29] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 22 ms returned sat
[2023-03-09 13:50:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:30] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2023-03-09 13:50:30] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
[2023-03-09 13:50:30] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2023-03-09 13:50:30] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2023-03-09 13:50:30] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 0 ms to minimize.
[2023-03-09 13:50:30] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2023-03-09 13:50:30] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2023-03-09 13:50:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 576 ms
[2023-03-09 13:50:30] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 21 ms.
[2023-03-09 13:50:32] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2023-03-09 13:50:32] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2023-03-09 13:50:32] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 0 ms to minimize.
[2023-03-09 13:50:32] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2023-03-09 13:50:32] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2023-03-09 13:50:33] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2023-03-09 13:50:33] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2023-03-09 13:50:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 734 ms
[2023-03-09 13:50:33] [INFO ] Added : 286 causal constraints over 58 iterations in 2573 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 311/311 transitions.
Graph (complete) has 741 edges and 360 vertex of which 349 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 349 transition count 283
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 328 transition count 283
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 328 transition count 274
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 319 transition count 274
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 300 transition count 255
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 300 transition count 255
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 300 transition count 254
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 299 transition count 254
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 284 transition count 239
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 284 transition count 239
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 284 transition count 224
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 282 transition count 223
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 282 transition count 220
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 279 transition count 220
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 202 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 200 transition count 145
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 200 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 199 transition count 144
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 199 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 198 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 197 transition count 143
Applied a total of 320 rules in 136 ms. Remains 197 /360 variables (removed 163) and now considering 143/311 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 197/360 places, 143/311 transitions.
// Phase 1: matrix 143 rows 197 cols
[2023-03-09 13:50:35] [INFO ] Computed 60 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 47576 resets, run finished after 1801 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9130 resets, run finished after 839 ms. (steps per millisecond=1191 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9185 resets, run finished after 785 ms. (steps per millisecond=1273 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9152 resets, run finished after 844 ms. (steps per millisecond=1184 ) properties (out of 3) seen :0
[2023-03-09 13:50:39] [INFO ] Invariant cache hit.
[2023-03-09 13:50:39] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-09 13:50:39] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-09 13:50:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:39] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-09 13:50:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:50:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 13:50:39] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 235 ms returned sat
[2023-03-09 13:50:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:39] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-09 13:50:39] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-09 13:50:40] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2023-03-09 13:50:40] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2023-03-09 13:50:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2023-03-09 13:50:40] [INFO ] Added : 116 causal constraints over 24 iterations in 400 ms. Result :sat
Minimization took 39 ms.
[2023-03-09 13:50:40] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:50:40] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 13:50:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:40] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-09 13:50:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:50:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:50:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 72 ms returned sat
[2023-03-09 13:50:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:40] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-09 13:50:40] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-09 13:50:40] [INFO ] Added : 101 causal constraints over 21 iterations in 227 ms. Result :sat
Minimization took 41 ms.
[2023-03-09 13:50:40] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:50:40] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 13:50:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:40] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-09 13:50:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:50:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:50:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 52 ms returned sat
[2023-03-09 13:50:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:41] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-09 13:50:41] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-09 13:50:41] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2023-03-09 13:50:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-09 13:50:41] [INFO ] Added : 119 causal constraints over 24 iterations in 336 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 7 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 7 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2023-03-09 13:50:41] [INFO ] Invariant cache hit.
[2023-03-09 13:50:42] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-09 13:50:42] [INFO ] Invariant cache hit.
[2023-03-09 13:50:42] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2023-03-09 13:50:42] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 13:50:42] [INFO ] Invariant cache hit.
[2023-03-09 13:50:42] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 424 ms. Remains : 197/197 places, 143/143 transitions.
Starting property specific reduction for DES-PT-20b-UpperBounds-00
[2023-03-09 13:50:42] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 482 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-09 13:50:42] [INFO ] Invariant cache hit.
[2023-03-09 13:50:42] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 13:50:42] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 13:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:42] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-09 13:50:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:50:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:50:42] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 234 ms returned sat
[2023-03-09 13:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:42] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-09 13:50:42] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 7 ms.
[2023-03-09 13:50:43] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2023-03-09 13:50:43] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2023-03-09 13:50:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 124 ms
[2023-03-09 13:50:43] [INFO ] Added : 116 causal constraints over 24 iterations in 395 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 17 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 197/197 places, 143/143 transitions.
[2023-03-09 13:50:43] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47763 resets, run finished after 1679 ms. (steps per millisecond=595 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9245 resets, run finished after 822 ms. (steps per millisecond=1216 ) properties (out of 1) seen :0
[2023-03-09 13:50:45] [INFO ] Invariant cache hit.
[2023-03-09 13:50:46] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 13:50:46] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-09 13:50:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:46] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-09 13:50:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:50:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 25 ms returned sat
[2023-03-09 13:50:46] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 233 ms returned sat
[2023-03-09 13:50:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:46] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-09 13:50:46] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-09 13:50:46] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2023-03-09 13:50:46] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2023-03-09 13:50:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2023-03-09 13:50:46] [INFO ] Added : 116 causal constraints over 24 iterations in 382 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 6 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2023-03-09 13:50:47] [INFO ] Invariant cache hit.
[2023-03-09 13:50:47] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-09 13:50:47] [INFO ] Invariant cache hit.
[2023-03-09 13:50:47] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2023-03-09 13:50:47] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 13:50:47] [INFO ] Invariant cache hit.
[2023-03-09 13:50:47] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 503 ms. Remains : 197/197 places, 143/143 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-00 in 5152 ms.
Starting property specific reduction for DES-PT-20b-UpperBounds-04
[2023-03-09 13:50:47] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 492 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-09 13:50:47] [INFO ] Invariant cache hit.
[2023-03-09 13:50:47] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:50:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-09 13:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:47] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-09 13:50:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:50:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:50:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 70 ms returned sat
[2023-03-09 13:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:47] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-09 13:50:47] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-09 13:50:48] [INFO ] Added : 101 causal constraints over 21 iterations in 261 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 197/197 places, 143/143 transitions.
[2023-03-09 13:50:48] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47903 resets, run finished after 1680 ms. (steps per millisecond=595 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9125 resets, run finished after 819 ms. (steps per millisecond=1221 ) properties (out of 1) seen :0
[2023-03-09 13:50:50] [INFO ] Invariant cache hit.
[2023-03-09 13:50:50] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:50:50] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 13:50:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:50] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-09 13:50:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:50:51] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:50:51] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 70 ms returned sat
[2023-03-09 13:50:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:51] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-09 13:50:51] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-09 13:50:51] [INFO ] Added : 101 causal constraints over 21 iterations in 264 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2023-03-09 13:50:51] [INFO ] Invariant cache hit.
[2023-03-09 13:50:51] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-09 13:50:51] [INFO ] Invariant cache hit.
[2023-03-09 13:50:51] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-09 13:50:52] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 13:50:52] [INFO ] Invariant cache hit.
[2023-03-09 13:50:52] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 455 ms. Remains : 197/197 places, 143/143 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-04 in 4543 ms.
Starting property specific reduction for DES-PT-20b-UpperBounds-11
[2023-03-09 13:50:52] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 500 resets, run finished after 17 ms. (steps per millisecond=588 ) 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 13:50:52] [INFO ] Invariant cache hit.
[2023-03-09 13:50:52] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:50:52] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 13:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:52] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-09 13:50:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:50:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:50:52] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 55 ms returned sat
[2023-03-09 13:50:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:52] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-09 13:50:52] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 24 ms.
[2023-03-09 13:50:53] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 6 ms to minimize.
[2023-03-09 13:50:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-09 13:50:53] [INFO ] Added : 119 causal constraints over 24 iterations in 663 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 197/197 places, 143/143 transitions.
[2023-03-09 13:50:53] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47900 resets, run finished after 1676 ms. (steps per millisecond=596 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9227 resets, run finished after 823 ms. (steps per millisecond=1215 ) properties (out of 1) seen :0
[2023-03-09 13:50:55] [INFO ] Invariant cache hit.
[2023-03-09 13:50:55] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:50:55] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 13:50:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:56] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-09 13:50:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:50:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:50:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 51 ms returned sat
[2023-03-09 13:50:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:50:56] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2023-03-09 13:50:56] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-09 13:50:56] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2023-03-09 13:50:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-09 13:50:56] [INFO ] Added : 119 causal constraints over 24 iterations in 327 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2023-03-09 13:50:56] [INFO ] Invariant cache hit.
[2023-03-09 13:50:56] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-09 13:50:56] [INFO ] Invariant cache hit.
[2023-03-09 13:50:57] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-09 13:50:57] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 13:50:57] [INFO ] Invariant cache hit.
[2023-03-09 13:50:57] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 453 ms. Remains : 197/197 places, 143/143 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-11 in 5147 ms.
[2023-03-09 13:50:57] [INFO ] Flatten gal took : 88 ms
[2023-03-09 13:50:57] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2023-03-09 13:50:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 197 places, 143 transitions and 711 arcs took 2 ms.
Total runtime 34909 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 20b
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: 197 places, 143 transitions, 711 arcs.
Final Score: 2464.78
Took : 7 seconds
Bounds file is: UpperBounds.xml
FORMULA DES-PT-20b-UpperBounds-00 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-20b-UpperBounds-04 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-20b-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678372028729

--------------------
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:
++ 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
++ sed s/.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-20b"
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-20b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r107-tall-167814484200437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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