About the Execution of 2023-gold for MedleyA-PT-07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 606.432 | 22798.00 | 38772.00 | 723.30 | 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/mcc2024-input.r597-smll-171734926400031.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is MedleyA-PT-07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926400031
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 82K Jun 2 16:33 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 MedleyA-PT-07-UpperBounds-00
FORMULA_NAME MedleyA-PT-07-UpperBounds-01
FORMULA_NAME MedleyA-PT-07-UpperBounds-02
FORMULA_NAME MedleyA-PT-07-UpperBounds-03
FORMULA_NAME MedleyA-PT-07-UpperBounds-04
FORMULA_NAME MedleyA-PT-07-UpperBounds-05
FORMULA_NAME MedleyA-PT-07-UpperBounds-06
FORMULA_NAME MedleyA-PT-07-UpperBounds-07
FORMULA_NAME MedleyA-PT-07-UpperBounds-08
FORMULA_NAME MedleyA-PT-07-UpperBounds-09
FORMULA_NAME MedleyA-PT-07-UpperBounds-10
FORMULA_NAME MedleyA-PT-07-UpperBounds-11
FORMULA_NAME MedleyA-PT-07-UpperBounds-12
FORMULA_NAME MedleyA-PT-07-UpperBounds-13
FORMULA_NAME MedleyA-PT-07-UpperBounds-14
FORMULA_NAME MedleyA-PT-07-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717361821826
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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-07
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 20:57:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 20:57:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:57:05] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-06-02 20:57:05] [INFO ] Transformed 145 places.
[2024-06-02 20:57:05] [INFO ] Transformed 287 transitions.
[2024-06-02 20:57:05] [INFO ] Found NUPN structural information;
[2024-06-02 20:57:05] [INFO ] Parsed PT model containing 145 places and 287 transitions and 1240 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 transitions.
// Phase 1: matrix 285 rows 143 cols
[2024-06-02 20:57:05] [INFO ] Computed 11 invariants in 36 ms
Incomplete random walk after 10000 steps, including 347 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :7
FORMULA MedleyA-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :2
FORMULA MedleyA-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
[2024-06-02 20:57:05] [INFO ] Invariant cache hit.
[2024-06-02 20:57:05] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2024-06-02 20:57:05] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:57:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:05] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-06-02 20:57:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:57:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 20:57:06] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:57:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:06] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-06-02 20:57:06] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 57 ms.
[2024-06-02 20:57:06] [INFO ] Added : 104 causal constraints over 21 iterations in 766 ms. Result :sat
Minimization took 99 ms.
[2024-06-02 20:57:07] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 20:57:07] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:57:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:07] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2024-06-02 20:57:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:57:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 20:57:07] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:57:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:07] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-06-02 20:57:07] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 40 ms.
[2024-06-02 20:57:08] [INFO ] Added : 101 causal constraints over 21 iterations in 644 ms. Result :sat
Minimization took 150 ms.
[2024-06-02 20:57:08] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 20:57:08] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:57:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:08] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-06-02 20:57:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:57:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 20:57:08] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 7 ms returned sat
[2024-06-02 20:57:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:08] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2024-06-02 20:57:08] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 37 ms.
[2024-06-02 20:57:09] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 7 ms to minimize.
[2024-06-02 20:57:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2024-06-02 20:57:09] [INFO ] Added : 98 causal constraints over 21 iterations in 726 ms. Result :sat
Minimization took 92 ms.
[2024-06-02 20:57:09] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 20:57:09] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 20:57:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:09] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-06-02 20:57:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:57:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 20:57:09] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 20:57:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:09] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-06-02 20:57:09] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 31 ms.
[2024-06-02 20:57:10] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-06-02 20:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2024-06-02 20:57:10] [INFO ] Added : 97 causal constraints over 21 iterations in 681 ms. Result :sat
Minimization took 94 ms.
[2024-06-02 20:57:10] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 20:57:10] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 20:57:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:10] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-06-02 20:57:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:57:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 20:57:10] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 20:57:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:11] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-06-02 20:57:11] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 26 ms.
[2024-06-02 20:57:11] [INFO ] Added : 109 causal constraints over 22 iterations in 633 ms. Result :sat
Minimization took 102 ms.
[2024-06-02 20:57:11] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2024-06-02 20:57:11] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:57:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:12] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2024-06-02 20:57:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:57:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 20:57:12] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:57:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:12] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-06-02 20:57:12] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2024-06-02 20:57:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2024-06-02 20:57:12] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 34 ms.
[2024-06-02 20:57:12] [INFO ] Added : 89 causal constraints over 18 iterations in 464 ms. Result :sat
Minimization took 93 ms.
[2024-06-02 20:57:12] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 20:57:12] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 20:57:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:13] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2024-06-02 20:57:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:57:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 20:57:13] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:57:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:13] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-06-02 20:57:13] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 23 ms.
[2024-06-02 20:57:14] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-06-02 20:57:14] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 2 ms to minimize.
[2024-06-02 20:57:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2024-06-02 20:57:14] [INFO ] Added : 95 causal constraints over 20 iterations in 1601 ms. Result :sat
Minimization took 92 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA MedleyA-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 285/285 transitions.
Graph (complete) has 445 edges and 143 vertex of which 136 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 136 transition count 242
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 32 rules applied. Total rules applied 73 place count 108 transition count 238
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 77 place count 106 transition count 236
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 77 place count 106 transition count 231
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 87 place count 101 transition count 231
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 116 place count 72 transition count 194
Iterating global reduction 3 with 29 rules applied. Total rules applied 145 place count 72 transition count 194
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 145 place count 72 transition count 192
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 70 transition count 192
Performed 19 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 187 place count 51 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 189 place count 51 transition count 170
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 197 place count 47 transition count 178
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 206 place count 47 transition count 169
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 206 place count 47 transition count 168
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 46 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
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 212 place count 44 transition count 191
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 217 place count 44 transition count 186
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 222 place count 39 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 39 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 226 place count 37 transition count 184
Applied a total of 226 rules in 143 ms. Remains 37 /143 variables (removed 106) and now considering 184/285 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 37/143 places, 184/285 transitions.
Normalized transition count is 148 out of 184 initially.
// Phase 1: matrix 148 rows 37 cols
[2024-06-02 20:57:15] [INFO ] Computed 11 invariants in 9 ms
Incomplete random walk after 1000000 steps, including 23 resets, run finished after 939 ms. (steps per millisecond=1064 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 34 resets, run finished after 537 ms. (steps per millisecond=1862 ) properties (out of 2) seen :1
FORMULA MedleyA-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-02 20:57:16] [INFO ] Flow matrix only has 148 transitions (discarded 36 similar events)
// Phase 1: matrix 148 rows 37 cols
[2024-06-02 20:57:16] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 20:57:16] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 20:57:16] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:57:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:17] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-02 20:57:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:57:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 20:57:17] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:57:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:17] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 20:57:17] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-06-02 20:57:17] [INFO ] [Nat]Added 80 Read/Feed constraints in 15 ms returned sat
[2024-06-02 20:57:17] [INFO ] Computed and/alt/rep : 5/27/5 causal constraints (skipped 139 transitions) in 18 ms.
[2024-06-02 20:57:17] [INFO ] Added : 0 causal constraints over 0 iterations in 34 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 184/184 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 37 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 36 transition count 183
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 36 transition count 181
Applied a total of 4 rules in 28 ms. Remains 36 /37 variables (removed 1) and now considering 181/184 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 36/37 places, 181/184 transitions.
Normalized transition count is 146 out of 181 initially.
// Phase 1: matrix 146 rows 36 cols
[2024-06-02 20:57:17] [INFO ] Computed 11 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 10 resets, run finished after 772 ms. (steps per millisecond=1295 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5 resets, run finished after 520 ms. (steps per millisecond=1923 ) properties (out of 1) seen :0
[2024-06-02 20:57:18] [INFO ] Flow matrix only has 146 transitions (discarded 35 similar events)
// Phase 1: matrix 146 rows 36 cols
[2024-06-02 20:57:18] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 20:57:18] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 20:57:18] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:57:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:18] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-02 20:57:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:57:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 20:57:18] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:57:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:18] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 20:57:18] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:57:18] [INFO ] [Nat]Added 79 Read/Feed constraints in 13 ms returned sat
[2024-06-02 20:57:18] [INFO ] Computed and/alt/rep : 5/27/5 causal constraints (skipped 137 transitions) in 16 ms.
[2024-06-02 20:57:18] [INFO ] Added : 0 causal constraints over 0 iterations in 32 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 36 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 181/181 transitions.
Applied a total of 0 rules in 8 ms. Remains 36 /36 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 36/36 places, 181/181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 181/181 transitions.
Applied a total of 0 rules in 5 ms. Remains 36 /36 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2024-06-02 20:57:18] [INFO ] Flow matrix only has 146 transitions (discarded 35 similar events)
[2024-06-02 20:57:18] [INFO ] Invariant cache hit.
[2024-06-02 20:57:18] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 20:57:18] [INFO ] Flow matrix only has 146 transitions (discarded 35 similar events)
[2024-06-02 20:57:18] [INFO ] Invariant cache hit.
[2024-06-02 20:57:18] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:57:19] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-06-02 20:57:19] [INFO ] Redundant transitions in 8 ms returned []
[2024-06-02 20:57:19] [INFO ] Flow matrix only has 146 transitions (discarded 35 similar events)
[2024-06-02 20:57:19] [INFO ] Invariant cache hit.
[2024-06-02 20:57:19] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 47 transitions.
Found 47 dead transitions using SMT.
Drop transitions removed 47 transitions
Dead transitions reduction (with SMT) removed 47 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 36/36 places, 134/181 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 35 transition count 134
Applied a total of 1 rules in 6 ms. Remains 35 /36 variables (removed 1) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 35 cols
[2024-06-02 20:57:19] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:57:19] [INFO ] Implicit Places using invariants in 63 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 34/36 places, 134/181 transitions.
Applied a total of 0 rules in 4 ms. Remains 34 /34 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 458 ms. Remains : 34/36 places, 134/181 transitions.
// Phase 1: matrix 134 rows 34 cols
[2024-06-02 20:57:19] [INFO ] Computed 9 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 6 resets, run finished after 588 ms. (steps per millisecond=1700 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 35 resets, run finished after 434 ms. (steps per millisecond=2304 ) properties (out of 1) seen :0
[2024-06-02 20:57:20] [INFO ] Invariant cache hit.
[2024-06-02 20:57:20] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:57:20] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-02 20:57:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:20] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-02 20:57:20] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-02 20:57:20] [INFO ] [Real]Added 67 Read/Feed constraints in 10 ms returned sat
[2024-06-02 20:57:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:57:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:57:20] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 20:57:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:20] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-06-02 20:57:20] [INFO ] [Nat]Added 67 Read/Feed constraints in 12 ms returned sat
[2024-06-02 20:57:20] [INFO ] Computed and/alt/rep : 7/30/7 causal constraints (skipped 123 transitions) in 13 ms.
[2024-06-02 20:57:20] [INFO ] Added : 0 causal constraints over 0 iterations in 28 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 34 /34 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 34/34 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 34 /34 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-06-02 20:57:20] [INFO ] Invariant cache hit.
[2024-06-02 20:57:20] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 20:57:20] [INFO ] Invariant cache hit.
[2024-06-02 20:57:20] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-02 20:57:20] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-06-02 20:57:20] [INFO ] Redundant transitions in 5 ms returned []
[2024-06-02 20:57:20] [INFO ] Invariant cache hit.
[2024-06-02 20:57:20] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 34/34 places, 134/134 transitions.
Starting property specific reduction for MedleyA-PT-07-UpperBounds-07
[2024-06-02 20:57:20] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2024-06-02 20:57:20] [INFO ] Invariant cache hit.
[2024-06-02 20:57:20] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:57:20] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 20:57:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:20] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-06-02 20:57:21] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-02 20:57:21] [INFO ] [Real]Added 67 Read/Feed constraints in 10 ms returned sat
[2024-06-02 20:57:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:57:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:57:21] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 20:57:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:21] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-06-02 20:57:21] [INFO ] [Nat]Added 67 Read/Feed constraints in 13 ms returned sat
[2024-06-02 20:57:21] [INFO ] Computed and/alt/rep : 7/30/7 causal constraints (skipped 123 transitions) in 14 ms.
[2024-06-02 20:57:21] [INFO ] Added : 0 causal constraints over 0 iterations in 31 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 34 /34 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 34/34 places, 134/134 transitions.
[2024-06-02 20:57:21] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 38 resets, run finished after 579 ms. (steps per millisecond=1727 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 8 resets, run finished after 385 ms. (steps per millisecond=2597 ) properties (out of 1) seen :0
[2024-06-02 20:57:22] [INFO ] Invariant cache hit.
[2024-06-02 20:57:22] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:57:22] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 20:57:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:22] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-02 20:57:22] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-02 20:57:22] [INFO ] [Real]Added 67 Read/Feed constraints in 9 ms returned sat
[2024-06-02 20:57:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:57:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:57:22] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 20:57:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:57:22] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-06-02 20:57:22] [INFO ] [Nat]Added 67 Read/Feed constraints in 14 ms returned sat
[2024-06-02 20:57:22] [INFO ] Computed and/alt/rep : 7/30/7 causal constraints (skipped 123 transitions) in 14 ms.
[2024-06-02 20:57:22] [INFO ] Added : 0 causal constraints over 0 iterations in 29 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 34 /34 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 34/34 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 134/134 transitions.
Applied a total of 0 rules in 3 ms. Remains 34 /34 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-06-02 20:57:22] [INFO ] Invariant cache hit.
[2024-06-02 20:57:22] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 20:57:22] [INFO ] Invariant cache hit.
[2024-06-02 20:57:22] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-02 20:57:22] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-06-02 20:57:22] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 20:57:22] [INFO ] Invariant cache hit.
[2024-06-02 20:57:22] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 316 ms. Remains : 34/34 places, 134/134 transitions.
Ending property specific reduction for MedleyA-PT-07-UpperBounds-07 in 1795 ms.
[2024-06-02 20:57:23] [INFO ] Flatten gal took : 74 ms
[2024-06-02 20:57:23] [INFO ] Applying decomposition
[2024-06-02 20:57:23] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15358948536079751854.txt' '-o' '/tmp/graph15358948536079751854.bin' '-w' '/tmp/graph15358948536079751854.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15358948536079751854.bin' '-l' '-1' '-v' '-w' '/tmp/graph15358948536079751854.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:57:23] [INFO ] Decomposing Gal with order
[2024-06-02 20:57:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:57:23] [INFO ] Removed a total of 262 redundant transitions.
[2024-06-02 20:57:23] [INFO ] Flatten gal took : 79 ms
[2024-06-02 20:57:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 9 ms.
[2024-06-02 20:57:23] [INFO ] Time to serialize gal into /tmp/UpperBounds6890082356839310875.gal : 4 ms
[2024-06-02 20:57:23] [INFO ] Time to serialize properties into /tmp/UpperBounds6516916399611164681.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6890082356839310875.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6516916399611164681.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds6516916399611164681.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,13721,0.053777,4536,79,31,1735,160,146,3589,64,559,0
Total reachable state count : 13721
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property MedleyA-PT-07-UpperBounds-07 :0 <= i2.u0.p23 <= 1
FORMULA MedleyA-PT-07-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-07-UpperBounds-07,0,0.055246,4536,1,0,1735,160,208,3589,78,559,158
Total runtime 18699 ms.
BK_STOP 1717361844624
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="MedleyA-PT-07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is MedleyA-PT-07, 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 r597-smll-171734926400031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-07.tgz
mv MedleyA-PT-07 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;