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.r069-smll-174854075800038.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 DES-PT-20a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075800038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 57K 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 DES-PT-20a-UpperBounds-00
FORMULA_NAME DES-PT-20a-UpperBounds-01
FORMULA_NAME DES-PT-20a-UpperBounds-02
FORMULA_NAME DES-PT-20a-UpperBounds-03
FORMULA_NAME DES-PT-20a-UpperBounds-04
FORMULA_NAME DES-PT-20a-UpperBounds-05
FORMULA_NAME DES-PT-20a-UpperBounds-06
FORMULA_NAME DES-PT-20a-UpperBounds-07
FORMULA_NAME DES-PT-20a-UpperBounds-08
FORMULA_NAME DES-PT-20a-UpperBounds-09
FORMULA_NAME DES-PT-20a-UpperBounds-10
FORMULA_NAME DES-PT-20a-UpperBounds-11
FORMULA_NAME DES-PT-20a-UpperBounds-12
FORMULA_NAME DES-PT-20a-UpperBounds-13
FORMULA_NAME DES-PT-20a-UpperBounds-14
FORMULA_NAME DES-PT-20a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748603560138

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 11:12:42] [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-05-30 11:12:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:12:42] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2025-05-30 11:12:42] [INFO ] Transformed 195 places.
[2025-05-30 11:12:42] [INFO ] Transformed 152 transitions.
[2025-05-30 11:12:42] [INFO ] Found NUPN structural information;
[2025-05-30 11:12:42] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 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 138 rows 195 cols
[2025-05-30 11:12:42] [INFO ] Computed 59 invariants in 46 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 (219 resets) in 101 ms. (98 steps per ms)
FORMULA DES-PT-20a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (180 resets) in 181 ms. (219 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-30 11:12:43] [INFO ] Invariant cache hit.
[2025-05-30 11:12:43] [INFO ] [Real]Absence check using 34 positive place invariants in 21 ms returned sat
[2025-05-30 11:12:43] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 54 ms returned sat
[2025-05-30 11:12:43] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2025-05-30 11:12:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:12:43] [INFO ] [Nat]Absence check using 34 positive place invariants in 32 ms returned sat
[2025-05-30 11:12:43] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2025-05-30 11:12:44] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2025-05-30 11:12:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 11:12:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-05-30 11:12:44] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 32 ms.
[2025-05-30 11:12:44] [INFO ] Added : 78 causal constraints over 16 iterations in 511 ms. Result :sat
Minimization took 98 ms.
[2025-05-30 11:12:44] [INFO ] [Real]Absence check using 34 positive place invariants in 26 ms returned sat
[2025-05-30 11:12:44] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2025-05-30 11:12:45] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2025-05-30 11:12:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:12:45] [INFO ] [Nat]Absence check using 34 positive place invariants in 20 ms returned sat
[2025-05-30 11:12:45] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2025-05-30 11:12:45] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2025-05-30 11:12:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 30 ms returned sat
[2025-05-30 11:12:45] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 27 ms to minimize.
[2025-05-30 11:12:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2025-05-30 11:12:45] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 36 ms.
[2025-05-30 11:12:45] [INFO ] Added : 78 causal constraints over 16 iterations in 407 ms. Result :sat
Minimization took 97 ms.
[2025-05-30 11:12:46] [INFO ] [Real]Absence check using 34 positive place invariants in 19 ms returned sat
[2025-05-30 11:12:46] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2025-05-30 11:12:46] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2025-05-30 11:12:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:12:46] [INFO ] [Nat]Absence check using 34 positive place invariants in 24 ms returned sat
[2025-05-30 11:12:46] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2025-05-30 11:12:46] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2025-05-30 11:12:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2025-05-30 11:12:46] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 25 ms.
[2025-05-30 11:12:47] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 4 ms to minimize.
[2025-05-30 11:12:47] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
[2025-05-30 11:12:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 261 ms
[2025-05-30 11:12:47] [INFO ] Added : 64 causal constraints over 13 iterations in 736 ms. Result :sat
Minimization took 73 ms.
[2025-05-30 11:12:47] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2025-05-30 11:12:47] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2025-05-30 11:12:47] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2025-05-30 11:12:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:12:47] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2025-05-30 11:12:47] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2025-05-30 11:12:48] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2025-05-30 11:12:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 35 ms returned sat
[2025-05-30 11:12:48] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 22 ms.
[2025-05-30 11:12:48] [INFO ] Added : 99 causal constraints over 21 iterations in 572 ms. Result :sat
Minimization took 137 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 138/138 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 195 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 194 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 194 transition count 135
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 194 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 193 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 192 transition count 134
Applied a total of 12 rules in 108 ms. Remains 192 /195 variables (removed 3) and now considering 134/138 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 192/195 places, 134/138 transitions.
// Phase 1: matrix 134 rows 192 cols
[2025-05-30 11:12:49] [INFO ] Computed 60 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (13571 resets) in 2146 ms. (465 steps per ms)
FORMULA DES-PT-20a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000002 steps (6770 resets) in 2959 ms. (1013 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-30 11:12:54] [INFO ] Invariant cache hit.
[2025-05-30 11:12:54] [INFO ] [Real]Absence check using 35 positive place invariants in 30 ms returned sat
[2025-05-30 11:12:54] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2025-05-30 11:12:54] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2025-05-30 11:12:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:12:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2025-05-30 11:12:55] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2025-05-30 11:12:55] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2025-05-30 11:12:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 11:12:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2025-05-30 11:12:55] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 13 ms.
[2025-05-30 11:12:55] [INFO ] Added : 79 causal constraints over 16 iterations in 310 ms. Result :sat
Minimization took 70 ms.
[2025-05-30 11:12:55] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2025-05-30 11:12:55] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2025-05-30 11:12:55] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2025-05-30 11:12:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:12:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2025-05-30 11:12:55] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2025-05-30 11:12:56] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2025-05-30 11:12:56] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2025-05-30 11:12:56] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 21 ms.
[2025-05-30 11:12:56] [INFO ] Added : 86 causal constraints over 18 iterations in 342 ms. Result :sat
Minimization took 65 ms.
[2025-05-30 11:12:56] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2025-05-30 11:12:56] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2025-05-30 11:12:56] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2025-05-30 11:12:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:12:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2025-05-30 11:12:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2025-05-30 11:12:56] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2025-05-30 11:12:56] [INFO ] [Nat]Added 2 Read/Feed constraints in 12 ms returned sat
[2025-05-30 11:12:56] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 16 ms.
[2025-05-30 11:12:57] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
[2025-05-30 11:12:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2025-05-30 11:12:57] [INFO ] Added : 103 causal constraints over 21 iterations in 519 ms. Result :sat
Minimization took 121 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 9 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 192/192 places, 134/134 transitions.
[2025-05-30 11:12:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (13628 resets) in 2042 ms. (489 steps per ms)
BEST_FIRST walk for 3000003 steps (6881 resets) in 2905 ms. (1032 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-30 11:13:02] [INFO ] Invariant cache hit.
[2025-05-30 11:13:02] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2025-05-30 11:13:02] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2025-05-30 11:13:03] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2025-05-30 11:13:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:13:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2025-05-30 11:13:03] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2025-05-30 11:13:03] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2025-05-30 11:13:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 11:13:03] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2025-05-30 11:13:03] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 13 ms.
[2025-05-30 11:13:03] [INFO ] Added : 79 causal constraints over 16 iterations in 358 ms. Result :sat
Minimization took 124 ms.
[2025-05-30 11:13:03] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2025-05-30 11:13:03] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2025-05-30 11:13:04] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2025-05-30 11:13:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:13:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2025-05-30 11:13:04] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2025-05-30 11:13:04] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2025-05-30 11:13:04] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2025-05-30 11:13:04] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 14 ms.
[2025-05-30 11:13:04] [INFO ] Added : 86 causal constraints over 18 iterations in 383 ms. Result :sat
Minimization took 114 ms.
[2025-05-30 11:13:04] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2025-05-30 11:13:04] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2025-05-30 11:13:04] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2025-05-30 11:13:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:13:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2025-05-30 11:13:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2025-05-30 11:13:05] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2025-05-30 11:13:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 11 ms returned sat
[2025-05-30 11:13:05] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 14 ms.
[2025-05-30 11:13:05] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
[2025-05-30 11:13:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2025-05-30 11:13:05] [INFO ] Added : 103 causal constraints over 21 iterations in 514 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 9 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 8 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2025-05-30 11:13:06] [INFO ] Invariant cache hit.
[2025-05-30 11:13:06] [INFO ] Implicit Places using invariants in 226 ms returned []
[2025-05-30 11:13:06] [INFO ] Invariant cache hit.
[2025-05-30 11:13:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 11:13:06] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2025-05-30 11:13:06] [INFO ] Redundant transitions in 4 ms returned []
Running 131 sub problems to find dead transitions.
[2025-05-30 11:13:06] [INFO ] Invariant cache hit.
[2025-05-30 11:13:06] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-30 11:13:10] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 1/326 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-30 11:13:12] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2025-05-30 11:13:12] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2025-05-30 11:13:12] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2025-05-30 11:13:12] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2025-05-30 11:13:13] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2025-05-30 11:13:13] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 0/326 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 261 constraints, problems are : Problem set: 0 solved, 131 unsolved in 9934 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/257 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/390 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 1/326 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2025-05-30 11:13:39] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2025-05-30 11:13:39] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 2 ms to minimize.
[2025-05-30 11:13:41] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 395 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 10/10 constraints]
After SMT, in 40144ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 40178ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40853 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (532 resets) in 1425 ms. (28 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (92 resets) in 404 ms. (98 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (93 resets) in 315 ms. (126 steps per ms) remains 6/6 properties
[2025-05-30 11:13:47] [INFO ] Flatten gal took : 235 ms
BEST_FIRST walk for 40004 steps (92 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
[2025-05-30 11:13:48] [INFO ] Flatten gal took : 97 ms
BEST_FIRST walk for 40003 steps (93 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (88 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
[2025-05-30 11:13:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2968667526821929014.gal : 34 ms
BEST_FIRST walk for 40003 steps (98 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
[2025-05-30 11:13:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5726030585626072348.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/ReachabilityCardinality2968667526821929014.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5726030585626072348.prop' '--nowitness' '--gen-order' 'FOLLOW'

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
Loading property file /tmp/ReachabilityCardinality5726030585626072348.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 22
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :22 after 28
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :28 after 636
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :636 after 666
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :666 after 818
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :818 after 35952
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :35952 after 82924
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :82924 after 415672
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :4.51269e+08 after 6.76855e+08
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :7.06975e+08 after 7.07545e+08
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :5.58062e+09 after 7.96424e+09
Interrupted probabilistic random walk after 598118 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :0 out of 6
Probabilistic random walk after 598118 steps, saw 86081 distinct states, run finished after 3006 ms. (steps per millisecond=198 ) properties seen :0
[2025-05-30 11:13:51] [INFO ] Invariant cache hit.
[2025-05-30 11:13:51] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 93/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/129 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 12/284 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 22/307 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/307 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 19/326 variables, 19/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 6 unsolved in 842 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 93/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 32768
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/129 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD size :8.25738e+09 after 9.28829e+09
[2025-05-30 11:13:52] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 25/154 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 7/161 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 111/272 variables, 161/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 12/284 variables, 8/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 1/285 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/285 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 22/307 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/307 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/307 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 19/326 variables, 19/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 261 constraints, problems are : Problem set: 0 solved, 6 unsolved in 889 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1739ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 705 steps, including 1 resets, run visited all 2 properties in 11 ms. (steps per millisecond=64 )
Parikh walk visited 6 properties in 1959 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA DES-PT-20a-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-20a-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-20a-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 72654 ms.

BK_STOP 1748603634936

--------------------
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="DES-PT-20a"
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 DES-PT-20a, 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 r069-smll-174854075800038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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