Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r139-smll-174876533100019.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 gold2024
Input is MedleyA-PT-07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-174876533100019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 82K 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 MedleyA-PT-07-UpperBounds-00
FORMULA_NAME MedleyA-PT-07-UpperBounds-01
FORMULA_NAME MedleyA-PT-07-UpperBounds-02
FORMULA_NAME MedleyA-PT-07-UpperBounds-03
FORMULA_NAME MedleyA-PT-07-UpperBounds-04
FORMULA_NAME MedleyA-PT-07-UpperBounds-05
FORMULA_NAME MedleyA-PT-07-UpperBounds-06
FORMULA_NAME MedleyA-PT-07-UpperBounds-07
FORMULA_NAME MedleyA-PT-07-UpperBounds-08
FORMULA_NAME MedleyA-PT-07-UpperBounds-09
FORMULA_NAME MedleyA-PT-07-UpperBounds-10
FORMULA_NAME MedleyA-PT-07-UpperBounds-11
FORMULA_NAME MedleyA-PT-07-UpperBounds-12
FORMULA_NAME MedleyA-PT-07-UpperBounds-13
FORMULA_NAME MedleyA-PT-07-UpperBounds-14
FORMULA_NAME MedleyA-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748895697968

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:21:40] [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 20:21:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:21:40] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2025-06-02 20:21:40] [INFO ] Transformed 145 places.
[2025-06-02 20:21:40] [INFO ] Transformed 287 transitions.
[2025-06-02 20:21:40] [INFO ] Found NUPN structural information;
[2025-06-02 20:21:40] [INFO ] Parsed PT model containing 145 places and 287 transitions and 1240 arcs in 407 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 22 ms.
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 2 transitions.
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]
// Phase 1: matrix 285 rows 143 cols
[2025-06-02 20:21:41] [INFO ] Computed 11 invariants in 25 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 (353 resets) in 50 ms. (196 steps per ms)
FORMULA MedleyA-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (632 resets) in 108 ms. (734 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-02 20:21:41] [INFO ] Invariant cache hit.
[2025-06-02 20:21:41] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2025-06-02 20:21:41] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 16 ms returned sat
[2025-06-02 20:21:41] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2025-06-02 20:21:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:21:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-02 20:21:41] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:21:42] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2025-06-02 20:21:42] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 13 ms to minimize.
[2025-06-02 20:21:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2025-06-02 20:21:42] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 82 ms.
[2025-06-02 20:21:43] [INFO ] Added : 90 causal constraints over 18 iterations in 793 ms. Result :sat
Minimization took 227 ms.
[2025-06-02 20:21:43] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2025-06-02 20:21:43] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:21:43] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2025-06-02 20:21:43] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 55 ms.
[2025-06-02 20:21:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:21:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2025-06-02 20:21:43] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2025-06-02 20:21:43] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2025-06-02 20:21:44] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 58 ms.
[2025-06-02 20:21:44] [INFO ] Added : 85 causal constraints over 17 iterations in 641 ms. Result :sat
Minimization took 212 ms.
[2025-06-02 20:21:44] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2025-06-02 20:21:44] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:21:45] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2025-06-02 20:21:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:21:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2025-06-02 20:21:45] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 9 ms returned sat
[2025-06-02 20:21:45] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2025-06-02 20:21:45] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 3 ms to minimize.
[2025-06-02 20:21:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2025-06-02 20:21:45] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 44 ms.
[2025-06-02 20:21:46] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2025-06-02 20:21:46] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2025-06-02 20:21:46] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2025-06-02 20:21:46] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2025-06-02 20:21:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 573 ms
[2025-06-02 20:21:46] [INFO ] Added : 94 causal constraints over 20 iterations in 1272 ms. Result :sat
Minimization took 218 ms.
[2025-06-02 20:21:47] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2025-06-02 20:21:47] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2025-06-02 20:21:47] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2025-06-02 20:21:47] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2025-06-02 20:21:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:21:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2025-06-02 20:21:47] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 20:21:47] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2025-06-02 20:21:47] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2025-06-02 20:21:47] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2025-06-02 20:21:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2025-06-02 20:21:47] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 42 ms.
[2025-06-02 20:21:48] [INFO ] Added : 91 causal constraints over 19 iterations in 633 ms. Result :sat
Minimization took 145 ms.
[2025-06-02 20:21:48] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-02 20:21:48] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-02 20:21:48] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2025-06-02 20:21:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:21:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-02 20:21:48] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-02 20:21:49] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2025-06-02 20:21:49] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2025-06-02 20:21:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2025-06-02 20:21:49] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 38 ms.
[2025-06-02 20:21:49] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 2 ms to minimize.
[2025-06-02 20:21:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2025-06-02 20:21:49] [INFO ] Added : 92 causal constraints over 20 iterations in 515 ms. Result :sat
Minimization took 137 ms.
[2025-06-02 20:21:49] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2025-06-02 20:21:49] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 20:21:49] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2025-06-02 20:21:49] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 24 ms.
[2025-06-02 20:21:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:21:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-02 20:21:50] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-02 20:21:50] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2025-06-02 20:21:50] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 26 ms.
[2025-06-02 20:21:50] [INFO ] Added : 90 causal constraints over 18 iterations in 419 ms. Result :sat
Minimization took 139 ms.
[2025-06-02 20:21:50] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-02 20:21:50] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-02 20:21:50] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2025-06-02 20:21:50] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 33 ms.
[2025-06-02 20:21:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:21:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-02 20:21:51] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-02 20:21:51] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2025-06-02 20:21:51] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 22 ms.
[2025-06-02 20:21:51] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2025-06-02 20:21:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2025-06-02 20:21:51] [INFO ] Added : 96 causal constraints over 20 iterations in 542 ms. Result :sat
Minimization took 150 ms.
[2025-06-02 20:21:51] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-02 20:21:51] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-02 20:21:52] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-06-02 20:21:52] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 23 ms.
[2025-06-02 20:21:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:21:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-02 20:21:52] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-02 20:21:52] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2025-06-02 20:21:52] [INFO ] Computed and/alt/rep : 144/505/144 causal constraints (skipped 140 transitions) in 25 ms.
[2025-06-02 20:21:52] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
[2025-06-02 20:21:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2025-06-02 20:21:52] [INFO ] Added : 94 causal constraints over 19 iterations in 636 ms. Result :sat
Minimization took 226 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 143 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p88) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 284/284 transitions.
Graph (complete) has 444 edges and 143 vertex of which 136 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 136 transition count 242
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 69 place count 109 transition count 240
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 108 transition count 239
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 71 place count 108 transition count 234
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 81 place count 103 transition count 234
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 111 place count 73 transition count 196
Iterating global reduction 3 with 30 rules applied. Total rules applied 141 place count 73 transition count 196
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 141 place count 73 transition count 194
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 145 place count 71 transition count 194
Performed 19 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 183 place count 52 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 185 place count 52 transition count 171
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 193 place count 48 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 202 place count 48 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 202 place count 48 transition count 169
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 204 place count 47 transition count 169
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 208 place count 45 transition count 192
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 214 place count 45 transition count 186
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 220 place count 39 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 222 place count 39 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 39 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 226 place count 37 transition count 182
Applied a total of 226 rules in 144 ms. Remains 37 /143 variables (removed 106) and now considering 182/284 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 37/143 places, 182/284 transitions.
[2025-06-02 20:21:54] [INFO ] Flow matrix only has 147 transitions (discarded 35 similar events)
// Phase 1: matrix 147 rows 37 cols
[2025-06-02 20:21:54] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (20 resets) in 949 ms. (1052 steps per ms)
BEST_FIRST walk for 1000000 steps (30 resets) in 449 ms. (2222 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 20:21:55] [INFO ] Flow matrix only has 147 transitions (discarded 35 similar events)
[2025-06-02 20:21:55] [INFO ] Invariant cache hit.
[2025-06-02 20:21:55] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-02 20:21:55] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-02 20:21:55] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-06-02 20:21:55] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-06-02 20:21:55] [INFO ] [Real]Added 81 Read/Feed constraints in 12 ms returned sat
[2025-06-02 20:21:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:21:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-02 20:21:55] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 20:21:55] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-06-02 20:21:55] [INFO ] [Nat]Added 81 Read/Feed constraints in 10 ms returned sat
[2025-06-02 20:21:55] [INFO ] Computed and/alt/rep : 4/18/4 causal constraints (skipped 139 transitions) in 15 ms.
[2025-06-02 20:21:55] [INFO ] Added : 0 causal constraints over 0 iterations in 28 ms. Result :sat
Minimization took 53 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:[0] Max Struct:[1]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 182/182 transitions.
Applied a total of 0 rules in 8 ms. Remains 37 /37 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 37/37 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 182/182 transitions.
Applied a total of 0 rules in 7 ms. Remains 37 /37 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2025-06-02 20:21:55] [INFO ] Flow matrix only has 147 transitions (discarded 35 similar events)
[2025-06-02 20:21:55] [INFO ] Invariant cache hit.
[2025-06-02 20:21:55] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-02 20:21:55] [INFO ] Flow matrix only has 147 transitions (discarded 35 similar events)
[2025-06-02 20:21:55] [INFO ] Invariant cache hit.
[2025-06-02 20:21:55] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-06-02 20:21:56] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2025-06-02 20:21:56] [INFO ] Redundant transitions in 12 ms returned []
Running 178 sub problems to find dead transitions.
[2025-06-02 20:21:56] [INFO ] Flow matrix only has 147 transitions (discarded 35 similar events)
[2025-06-02 20:21:56] [INFO ] Invariant cache hit.
[2025-06-02 20:21:56] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/36 variables, 6/10 constraints. Problems are: Problem set: 47 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 47 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 1/37 variables, 1/11 constraints. Problems are: Problem set: 47 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 47 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 147/184 variables, 37/48 constraints. Problems are: Problem set: 47 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 81/129 constraints. Problems are: Problem set: 47 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/129 constraints. Problems are: Problem set: 47 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/184 variables, 0/129 constraints. Problems are: Problem set: 47 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 129 constraints, problems are : Problem set: 47 solved, 131 unsolved in 4363 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 47 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 47 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 47 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/36 variables, 6/10 constraints. Problems are: Problem set: 47 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 47 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 1/37 variables, 1/11 constraints. Problems are: Problem set: 47 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 47 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 147/184 variables, 37/48 constraints. Problems are: Problem set: 47 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 81/129 constraints. Problems are: Problem set: 47 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 131/260 constraints. Problems are: Problem set: 47 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/260 constraints. Problems are: Problem set: 47 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/184 variables, 0/260 constraints. Problems are: Problem set: 47 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 260 constraints, problems are : Problem set: 47 solved, 131 unsolved in 7639 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 131/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 12635ms problems are : Problem set: 47 solved, 131 unsolved
Search for dead transitions found 47 dead transitions in 12659ms
Found 47 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 47 transitions
Dead transitions reduction (with SMT) removed 47 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 37/37 places, 135/182 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 135
Applied a total of 2 rules in 10 ms. Remains 35 /37 variables (removed 2) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 35 cols
[2025-06-02 20:22:08] [INFO ] Computed 9 invariants in 8 ms
[2025-06-02 20:22:08] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-02 20:22:08] [INFO ] Invariant cache hit.
[2025-06-02 20:22:08] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-06-02 20:22:09] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 35/37 places, 135/182 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 13178 ms. Remains : 35/37 places, 135/182 transitions.
[2025-06-02 20:22:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (45 resets) in 746 ms. (1338 steps per ms)
BEST_FIRST walk for 1000000 steps (40 resets) in 496 ms. (2012 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 20:22:10] [INFO ] Invariant cache hit.
[2025-06-02 20:22:10] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:22:10] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 20:22:10] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-06-02 20:22:10] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-06-02 20:22:10] [INFO ] [Real]Added 69 Read/Feed constraints in 11 ms returned sat
[2025-06-02 20:22:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:22:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:22:10] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 20:22:10] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-06-02 20:22:10] [INFO ] [Nat]Added 69 Read/Feed constraints in 12 ms returned sat
[2025-06-02 20:22:10] [INFO ] Computed and/alt/rep : 6/24/6 causal constraints (skipped 125 transitions) in 17 ms.
[2025-06-02 20:22:10] [INFO ] Added : 0 causal constraints over 0 iterations in 34 ms. Result :sat
Minimization took 66 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:[0] Max Struct:[1]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 35 /35 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 35/35 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 135/135 transitions.
Applied a total of 0 rules in 5 ms. Remains 35 /35 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2025-06-02 20:22:10] [INFO ] Invariant cache hit.
[2025-06-02 20:22:10] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-02 20:22:10] [INFO ] Invariant cache hit.
[2025-06-02 20:22:10] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-06-02 20:22:10] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2025-06-02 20:22:10] [INFO ] Redundant transitions in 6 ms returned []
Running 131 sub problems to find dead transitions.
[2025-06-02 20:22:10] [INFO ] Invariant cache hit.
[2025-06-02 20:22:10] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 2/35 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 135/170 variables, 35/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 69/113 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/170 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 113 constraints, problems are : Problem set: 0 solved, 131 unsolved in 3634 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 2/35 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 135/170 variables, 35/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 69/113 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 131/244 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/170 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 244 constraints, problems are : Problem set: 0 solved, 131 unsolved in 5827 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
After SMT, in 9712ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 9716ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9980 ms. Remains : 35/35 places, 135/135 transitions.
RANDOM walk for 40000 steps (98 resets) in 805 ms. (49 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (25 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (71 resets) in 290 ms. (137 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 4044 steps, run visited all 2 properties in 71 ms. (steps per millisecond=56 )
Probabilistic random walk after 4044 steps, saw 1030 distinct states, run finished after 88 ms. (steps per millisecond=45 ) properties seen :2
[2025-06-02 20:22:21] [INFO ] Flatten gal took : 87 ms
[2025-06-02 20:22:21] [INFO ] Flatten gal took : 44 ms
[2025-06-02 20:22:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4983616889970663132.gal : 15 ms
[2025-06-02 20:22:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9891735399860838072.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4983616889970663132.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9891735399860838072.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA MedleyA-PT-07-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 40810 ms.

BK_STOP 1748895741365

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is MedleyA-PT-07, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r139-smll-174876533100019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.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 ;