Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860068100765.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is EisenbergMcGuire-PT-04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860068100765
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 255K May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748835646991

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 03:40:48] [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]
[2025-06-02 03:40:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:40:48] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2025-06-02 03:40:48] [INFO ] Transformed 196 places.
[2025-06-02 03:40:48] [INFO ] Transformed 448 transitions.
[2025-06-02 03:40:48] [INFO ] Found NUPN structural information;
[2025-06-02 03:40:48] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-02 03:40:48] [INFO ] Flow matrix only has 284 transitions (discarded 164 similar events)
// Phase 1: matrix 284 rows 196 cols
[2025-06-02 03:40:48] [INFO ] Computed 13 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 37 ms. (263 steps per ms)
FORMULA EisenbergMcGuire-PT-04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 34 ms. (571 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-02 03:40:48] [INFO ] Flow matrix only has 284 transitions (discarded 164 similar events)
[2025-06-02 03:40:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 03:40:48] [INFO ] [Real]Absence check using 9 positive place invariants in 11 ms returned sat
[2025-06-02 03:40:48] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-02 03:40:48] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-06-02 03:40:48] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 03:40:48] [INFO ] [Real]Added 112 Read/Feed constraints in 26 ms returned sat
[2025-06-02 03:40:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 03:40:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2025-06-02 03:40:49] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-02 03:40:49] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-06-02 03:40:49] [INFO ] [Nat]Added 112 Read/Feed constraints in 11 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:49] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 8 ms to minimize.
[2025-06-02 03:40:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2025-06-02 03:40:49] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 21 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:50] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:50] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:50] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 3 ms to minimize.
[2025-06-02 03:40:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 282 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:50] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:50] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 9 ms to minimize.
[2025-06-02 03:40:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 270 ms
[2025-06-02 03:40:50] [INFO ] Added : 190 causal constraints over 39 iterations in 1725 ms. Result :sat
Minimization took 112 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 03:40:51] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-06-02 03:40:51] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 03:40:51] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2025-06-02 03:40:51] [INFO ] [Real]Added 112 Read/Feed constraints in 10 ms returned sat
[2025-06-02 03:40:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 03:40:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2025-06-02 03:40:51] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 03:40:51] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2025-06-02 03:40:51] [INFO ] [Nat]Added 112 Read/Feed constraints in 12 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:51] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:51] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:51] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 4 ms to minimize.
[2025-06-02 03:40:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 223 ms
[2025-06-02 03:40:51] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 18 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:52] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:52] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 18 ms to minimize.
[2025-06-02 03:40:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 321 ms
[2025-06-02 03:40:53] [INFO ] Added : 189 causal constraints over 39 iterations in 1499 ms. Result :sat
Minimization took 102 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[1, 1]
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 448/448 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 196 transition count 444
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 192 transition count 444
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 192 transition count 392
Deduced a syphon composed of 52 places in 2 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 140 transition count 392
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 124 place count 128 transition count 344
Iterating global reduction 2 with 12 rules applied. Total rules applied 136 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 160 place count 116 transition count 332
Applied a total of 160 rules in 66 ms. Remains 116 /196 variables (removed 80) and now considering 332/448 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 116/196 places, 332/448 transitions.
[2025-06-02 03:40:53] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
// Phase 1: matrix 168 rows 116 cols
[2025-06-02 03:40:53] [INFO ] Computed 13 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA EisenbergMcGuire-PT-04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1178 ms. (848 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 353 ms. (2824 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 03:40:54] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2025-06-02 03:40:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 03:40:55] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 03:40:55] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 03:40:55] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2025-06-02 03:40:55] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-06-02 03:40:55] [INFO ] [Real]Added 76 Read/Feed constraints in 8 ms returned sat
[2025-06-02 03:40:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 03:40:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2025-06-02 03:40:55] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 03:40:55] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-06-02 03:40:55] [INFO ] [Nat]Added 76 Read/Feed constraints in 10 ms returned sat
[2025-06-02 03:40:55] [INFO ] Computed and/alt/rep : 165/496/129 causal constraints (skipped 35 transitions) in 15 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:55] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:55] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:55] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:55] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:55] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 6 ms to minimize.
[2025-06-02 03:40:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 374 ms
[2025-06-02 03:40:55] [INFO ] Added : 56 causal constraints over 12 iterations in 551 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 116 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p37_3_1) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 331/331 transitions.
Applied a total of 0 rules in 13 ms. Remains 116 /116 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 116/116 places, 331/331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 331/331 transitions.
Applied a total of 0 rules in 9 ms. Remains 116 /116 variables (removed 0) and now considering 331/331 (removed 0) transitions.
[2025-06-02 03:40:55] [INFO ] Flow matrix only has 167 transitions (discarded 164 similar events)
// Phase 1: matrix 167 rows 116 cols
[2025-06-02 03:40:55] [INFO ] Computed 13 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:55] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-02 03:40:55] [INFO ] Flow matrix only has 167 transitions (discarded 164 similar events)
[2025-06-02 03:40:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:55] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-06-02 03:40:56] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:40:56] [INFO ] Redundant transitions in 19 ms returned []
Running 327 sub problems to find dead transitions.
[2025-06-02 03:40:56] [INFO ] Flow matrix only has 167 transitions (discarded 164 similar events)
[2025-06-02 03:40:56] [INFO ] Invariant cache hit.
[2025-06-02 03:40:56] [INFO ] State equation strengthened by 76 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:57] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:57] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:57] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:57] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:57] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:57] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:40:58] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 1/116 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:00] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:01] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:01] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:01] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:01] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:01] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:01] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:01] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:02] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:02] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:02] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:03] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:03] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:04] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:04] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:04] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:04] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:04] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:05] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:05] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:05] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:05] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:05] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:05] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:05] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:06] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:06] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:06] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:07] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:07] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:09] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:09] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:09] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:10] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:11] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:11] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:11] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:12] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/116 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 14 (OVERLAPS) 167/283 variables, 116/175 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 76/251 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:20] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:20] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 6 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/283 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/283 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/283 variables, and 253 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 1/116 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:28] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:28] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:29] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:29] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:29] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:30] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:30] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:41:30] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 10 (OVERLAPS) 167/283 variables, 116/185 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 76/261 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 327/588 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 14 (OVERLAPS) 0/283 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 588 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60588 ms. Remains : 116/116 places, 331/331 transitions.
[2025-06-02 03:41:56] [INFO ] Flow matrix only has 167 transitions (discarded 164 similar events)
[2025-06-02 03:41:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA EisenbergMcGuire-PT-04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 944 ms. (1058 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-02 03:41:57] [INFO ] Flatten gal took : 57 ms
[2025-06-02 03:41:57] [INFO ] Flatten gal took : 20 ms
[2025-06-02 03:41:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11443864617614467369.gal : 13 ms
[2025-06-02 03:41:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8318578945720038785.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11443864617614467369.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8318578945720038785.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 69430 ms.

BK_STOP 1748835717688

--------------------
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
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="EisenbergMcGuire-PT-04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-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 r072-tall-174860068100765"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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