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-171734926300016.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-04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926300016
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 28K 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-04-UpperBounds-00
FORMULA_NAME MedleyA-PT-04-UpperBounds-01
FORMULA_NAME MedleyA-PT-04-UpperBounds-02
FORMULA_NAME MedleyA-PT-04-UpperBounds-03
FORMULA_NAME MedleyA-PT-04-UpperBounds-04
FORMULA_NAME MedleyA-PT-04-UpperBounds-05
FORMULA_NAME MedleyA-PT-04-UpperBounds-06
FORMULA_NAME MedleyA-PT-04-UpperBounds-07
FORMULA_NAME MedleyA-PT-04-UpperBounds-08
FORMULA_NAME MedleyA-PT-04-UpperBounds-09
FORMULA_NAME MedleyA-PT-04-UpperBounds-10
FORMULA_NAME MedleyA-PT-04-UpperBounds-11
FORMULA_NAME MedleyA-PT-04-UpperBounds-12
FORMULA_NAME MedleyA-PT-04-UpperBounds-13
FORMULA_NAME MedleyA-PT-04-UpperBounds-14
FORMULA_NAME MedleyA-PT-04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717361574591

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-04
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 20:52:57] [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:52:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:52:57] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-06-02 20:52:57] [INFO ] Transformed 115 places.
[2024-06-02 20:52:57] [INFO ] Transformed 107 transitions.
[2024-06-02 20:52:57] [INFO ] Found NUPN structural information;
[2024-06-02 20:52:57] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 107 rows 115 cols
[2024-06-02 20:52:57] [INFO ] Computed 9 invariants in 14 ms
Incomplete random walk after 10000 steps, including 283 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :11
FORMULA MedleyA-PT-04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
[2024-06-02 20:52:58] [INFO ] Invariant cache hit.
[2024-06-02 20:52:58] [INFO ] [Real]Absence check using 9 positive place invariants in 16 ms returned sat
[2024-06-02 20:52:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:52:58] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-06-02 20:52:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:52:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2024-06-02 20:52:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:52:58] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2024-06-02 20:52:59] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 4 ms to minimize.
[2024-06-02 20:52:59] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:52:59] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-06-02 20:52:59] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2024-06-02 20:52:59] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2024-06-02 20:52:59] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:52:59] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:52:59] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:52:59] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:52:59] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 735 ms
[2024-06-02 20:52:59] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 19 ms.
[2024-06-02 20:53:00] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2024-06-02 20:53:00] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2024-06-02 20:53:00] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2024-06-02 20:53:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 232 ms
[2024-06-02 20:53:00] [INFO ] Added : 81 causal constraints over 17 iterations in 520 ms. Result :sat
Minimization took 52 ms.
[2024-06-02 20:53:00] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 20:53:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:00] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-06-02 20:53:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:53:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned sat
[2024-06-02 20:53:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:00] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-02 20:53:00] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 14 ms.
[2024-06-02 20:53:00] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2024-06-02 20:53:00] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:53:01] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2024-06-02 20:53:01] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-06-02 20:53:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 268 ms
[2024-06-02 20:53:01] [INFO ] Added : 95 causal constraints over 19 iterations in 551 ms. Result :sat
Minimization took 40 ms.
[2024-06-02 20:53:01] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-02 20:53:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:01] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-06-02 20:53:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:53:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 20:53:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:01] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-06-02 20:53:01] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2024-06-02 20:53:01] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2024-06-02 20:53:01] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:53:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 180 ms
[2024-06-02 20:53:01] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 11 ms.
[2024-06-02 20:53:01] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2024-06-02 20:53:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-06-02 20:53:01] [INFO ] Added : 77 causal constraints over 16 iterations in 289 ms. Result :sat
Minimization took 45 ms.
[2024-06-02 20:53:01] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-02 20:53:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:02] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-02 20:53:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:53:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 20:53:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:02] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-02 20:53:02] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-06-02 20:53:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-06-02 20:53:02] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 14 ms.
[2024-06-02 20:53:02] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:53:02] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-06-02 20:53:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2024-06-02 20:53:02] [INFO ] Added : 67 causal constraints over 14 iterations in 301 ms. Result :sat
Minimization took 39 ms.
[2024-06-02 20:53:02] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-02 20:53:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:02] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-02 20:53:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:53:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 20:53:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:02] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-06-02 20:53:02] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 12 ms.
[2024-06-02 20:53:03] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-02 20:53:03] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:53:03] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-06-02 20:53:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 185 ms
[2024-06-02 20:53:03] [INFO ] Added : 104 causal constraints over 22 iterations in 493 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA MedleyA-PT-04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 107/107 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 115 transition count 83
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 91 transition count 83
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 48 place count 91 transition count 77
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 60 place count 85 transition count 77
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 78 transition count 70
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 78 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 74 place count 78 transition count 69
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 77 transition count 69
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 118 place count 56 transition count 48
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 56 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 55 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 54 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 53 transition count 46
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 53 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 124 place count 52 transition count 45
Applied a total of 124 rules in 73 ms. Remains 52 /115 variables (removed 63) and now considering 45/107 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 52/115 places, 45/107 transitions.
// Phase 1: matrix 45 rows 52 cols
[2024-06-02 20:53:03] [INFO ] Computed 8 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 109010 resets, run finished after 933 ms. (steps per millisecond=1071 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 52040 resets, run finished after 536 ms. (steps per millisecond=1865 ) properties (out of 3) seen :1
FORMULA MedleyA-PT-04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 51938 resets, run finished after 483 ms. (steps per millisecond=2070 ) properties (out of 2) seen :0
[2024-06-02 20:53:05] [INFO ] Invariant cache hit.
[2024-06-02 20:53:05] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:53:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:05] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-06-02 20:53:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:53:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 20:53:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:05] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-02 20:53:05] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:53:05] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:53:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2024-06-02 20:53:05] [INFO ] Computed and/alt/rep : 42/59/42 causal constraints (skipped 2 transitions) in 5 ms.
[2024-06-02 20:53:05] [INFO ] Added : 33 causal constraints over 7 iterations in 51 ms. Result :sat
Minimization took 14 ms.
[2024-06-02 20:53:05] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:53:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:05] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-02 20:53:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:53:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:53:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:06] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-06-02 20:53:06] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:53:06] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-02 20:53:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2024-06-02 20:53:06] [INFO ] Computed and/alt/rep : 42/59/42 causal constraints (skipped 2 transitions) in 5 ms.
[2024-06-02 20:53:06] [INFO ] Added : 42 causal constraints over 9 iterations in 68 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 52/52 places, 45/45 transitions.
[2024-06-02 20:53:06] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 109130 resets, run finished after 853 ms. (steps per millisecond=1172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 51994 resets, run finished after 493 ms. (steps per millisecond=2028 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 51974 resets, run finished after 489 ms. (steps per millisecond=2044 ) properties (out of 2) seen :0
[2024-06-02 20:53:08] [INFO ] Invariant cache hit.
[2024-06-02 20:53:08] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:53:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:08] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-02 20:53:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:53:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:53:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:08] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-06-02 20:53:08] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-06-02 20:53:08] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-02 20:53:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2024-06-02 20:53:08] [INFO ] Computed and/alt/rep : 42/59/42 causal constraints (skipped 2 transitions) in 6 ms.
[2024-06-02 20:53:08] [INFO ] Added : 33 causal constraints over 7 iterations in 57 ms. Result :sat
Minimization took 18 ms.
[2024-06-02 20:53:08] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:53:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:08] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-06-02 20:53:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:53:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:53:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:08] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-02 20:53:08] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-02 20:53:08] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-02 20:53:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 55 ms
[2024-06-02 20:53:08] [INFO ] Computed and/alt/rep : 42/59/42 causal constraints (skipped 2 transitions) in 5 ms.
[2024-06-02 20:53:08] [INFO ] Added : 42 causal constraints over 9 iterations in 71 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 52/52 places, 45/45 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 45/45 transitions.
Applied a total of 0 rules in 8 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-06-02 20:53:08] [INFO ] Invariant cache hit.
[2024-06-02 20:53:08] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 20:53:08] [INFO ] Invariant cache hit.
[2024-06-02 20:53:08] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-06-02 20:53:08] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 20:53:08] [INFO ] Invariant cache hit.
[2024-06-02 20:53:08] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 52/52 places, 45/45 transitions.
Starting property specific reduction for MedleyA-PT-04-UpperBounds-07
[2024-06-02 20:53:08] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1060 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 536 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-06-02 20:53:09] [INFO ] Invariant cache hit.
[2024-06-02 20:53:09] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:53:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:09] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-02 20:53:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:53:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:53:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:09] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-02 20:53:09] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 5 ms to minimize.
[2024-06-02 20:53:09] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-02 20:53:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
[2024-06-02 20:53:09] [INFO ] Computed and/alt/rep : 42/59/42 causal constraints (skipped 2 transitions) in 5 ms.
[2024-06-02 20:53:09] [INFO ] Added : 33 causal constraints over 7 iterations in 51 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 45/45 transitions.
Graph (complete) has 137 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 51 /52 variables (removed 1) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 51/52 places, 45/45 transitions.
// Phase 1: matrix 45 rows 51 cols
[2024-06-02 20:53:09] [INFO ] Computed 7 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 108983 resets, run finished after 812 ms. (steps per millisecond=1231 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 52014 resets, run finished after 475 ms. (steps per millisecond=2105 ) properties (out of 1) seen :0
[2024-06-02 20:53:10] [INFO ] Invariant cache hit.
[2024-06-02 20:53:10] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 20:53:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:10] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-06-02 20:53:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:53:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 20:53:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:10] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-06-02 20:53:10] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:53:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-06-02 20:53:10] [INFO ] Computed and/alt/rep : 42/59/42 causal constraints (skipped 2 transitions) in 4 ms.
[2024-06-02 20:53:10] [INFO ] Added : 33 causal constraints over 7 iterations in 48 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 51/51 places, 45/45 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 51 /51 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-06-02 20:53:10] [INFO ] Invariant cache hit.
[2024-06-02 20:53:10] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 20:53:10] [INFO ] Invariant cache hit.
[2024-06-02 20:53:11] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-06-02 20:53:11] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 20:53:11] [INFO ] Invariant cache hit.
[2024-06-02 20:53:11] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 51/51 places, 45/45 transitions.
Ending property specific reduction for MedleyA-PT-04-UpperBounds-07 in 2112 ms.
Starting property specific reduction for MedleyA-PT-04-UpperBounds-12
// Phase 1: matrix 45 rows 52 cols
[2024-06-02 20:53:11] [INFO ] Computed 8 invariants in 1 ms
Incomplete random walk after 10000 steps, including 1100 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 538 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-06-02 20:53:11] [INFO ] Invariant cache hit.
[2024-06-02 20:53:11] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 20:53:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:11] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-06-02 20:53:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:53:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:53:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:11] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-02 20:53:11] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-02 20:53:11] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-02 20:53:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 57 ms
[2024-06-02 20:53:11] [INFO ] Computed and/alt/rep : 42/59/42 causal constraints (skipped 2 transitions) in 4 ms.
[2024-06-02 20:53:11] [INFO ] Added : 42 causal constraints over 9 iterations in 65 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 52/52 places, 45/45 transitions.
[2024-06-02 20:53:11] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 108945 resets, run finished after 790 ms. (steps per millisecond=1265 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 52231 resets, run finished after 476 ms. (steps per millisecond=2100 ) properties (out of 1) seen :0
[2024-06-02 20:53:12] [INFO ] Invariant cache hit.
[2024-06-02 20:53:12] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:53:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:12] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-06-02 20:53:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:53:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:53:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:12] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-06-02 20:53:12] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-02 20:53:12] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-02 20:53:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2024-06-02 20:53:12] [INFO ] Computed and/alt/rep : 42/59/42 causal constraints (skipped 2 transitions) in 4 ms.
[2024-06-02 20:53:12] [INFO ] Added : 42 causal constraints over 9 iterations in 70 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 52/52 places, 45/45 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-06-02 20:53:12] [INFO ] Invariant cache hit.
[2024-06-02 20:53:13] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 20:53:13] [INFO ] Invariant cache hit.
[2024-06-02 20:53:13] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-06-02 20:53:13] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 20:53:13] [INFO ] Invariant cache hit.
[2024-06-02 20:53:13] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 52/52 places, 45/45 transitions.
Ending property specific reduction for MedleyA-PT-04-UpperBounds-12 in 2103 ms.
[2024-06-02 20:53:13] [INFO ] Flatten gal took : 44 ms
[2024-06-02 20:53:13] [INFO ] Applying decomposition
[2024-06-02 20:53:13] [INFO ] Flatten gal took : 12 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/graph9765424873485640851.txt' '-o' '/tmp/graph9765424873485640851.bin' '-w' '/tmp/graph9765424873485640851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9765424873485640851.bin' '-l' '-1' '-v' '-w' '/tmp/graph9765424873485640851.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:53:13] [INFO ] Decomposing Gal with order
[2024-06-02 20:53:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:53:13] [INFO ] Removed a total of 26 redundant transitions.
[2024-06-02 20:53:13] [INFO ] Flatten gal took : 48 ms
[2024-06-02 20:53:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2024-06-02 20:53:13] [INFO ] Time to serialize gal into /tmp/UpperBounds7097619990845753431.gal : 5 ms
[2024-06-02 20:53:13] [INFO ] Time to serialize properties into /tmp/UpperBounds13116048157352257604.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/UpperBounds7097619990845753431.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13116048157352257604.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 ...284
Loading property file /tmp/UpperBounds13116048157352257604.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,38050,0.059499,4756,258,31,2841,120,174,4389,36,230,0
Total reachable state count : 38050

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property MedleyA-PT-04-UpperBounds-07 :0 <= i2.u13.p98 <= 1
FORMULA MedleyA-PT-04-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-04-UpperBounds-07,0,0.062538,4756,1,0,2841,120,287,4389,49,230,309
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property MedleyA-PT-04-UpperBounds-12 :0 <= i2.u9.p89 <= 1
FORMULA MedleyA-PT-04-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-04-UpperBounds-12,0,0.06302,4756,1,0,2841,120,318,4389,51,230,347
Total runtime 16320 ms.

BK_STOP 1717361595300

--------------------
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-04"
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-04, 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-171734926300016"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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