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.r111-smll-174867015900079.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 HealthRecord-PT-12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-smll-174867015900079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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.7K 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 71K 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 HealthRecord-PT-12-UpperBounds-00
FORMULA_NAME HealthRecord-PT-12-UpperBounds-01
FORMULA_NAME HealthRecord-PT-12-UpperBounds-02
FORMULA_NAME HealthRecord-PT-12-UpperBounds-03
FORMULA_NAME HealthRecord-PT-12-UpperBounds-04
FORMULA_NAME HealthRecord-PT-12-UpperBounds-05
FORMULA_NAME HealthRecord-PT-12-UpperBounds-06
FORMULA_NAME HealthRecord-PT-12-UpperBounds-07
FORMULA_NAME HealthRecord-PT-12-UpperBounds-08
FORMULA_NAME HealthRecord-PT-12-UpperBounds-09
FORMULA_NAME HealthRecord-PT-12-UpperBounds-10
FORMULA_NAME HealthRecord-PT-12-UpperBounds-11
FORMULA_NAME HealthRecord-PT-12-UpperBounds-12
FORMULA_NAME HealthRecord-PT-12-UpperBounds-13
FORMULA_NAME HealthRecord-PT-12-UpperBounds-14
FORMULA_NAME HealthRecord-PT-12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748785714013

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 13:48:36] [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-01 13:48:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 13:48:37] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2025-06-01 13:48:37] [INFO ] Transformed 160 places.
[2025-06-01 13:48:37] [INFO ] Transformed 340 transitions.
[2025-06-01 13:48:37] [INFO ] Found NUPN structural information;
[2025-06-01 13:48:37] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 428 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 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]
[2025-06-01 13:48:37] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
// Phase 1: matrix 300 rows 160 cols
[2025-06-01 13:48:37] [INFO ] Computed 18 invariants in 33 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 (712 resets) in 100 ms. (99 steps per ms)
FORMULA HealthRecord-PT-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (443 resets) in 92 ms. (537 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-06-01 13:48:37] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
[2025-06-01 13:48:37] [INFO ] Invariant cache hit.
[2025-06-01 13:48:37] [INFO ] [Real]Absence check using 10 positive place invariants in 25 ms returned sat
[2025-06-01 13:48:37] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 22 ms returned sat
[2025-06-01 13:48:38] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2025-06-01 13:48:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 13:48:38] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2025-06-01 13:48:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:48:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-01 13:48:38] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2025-06-01 13:48:38] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2025-06-01 13:48:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:48:38] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 79 ms.
[2025-06-01 13:48:39] [INFO ] Added : 17 causal constraints over 5 iterations in 321 ms. Result :sat
Minimization took 275 ms.
[2025-06-01 13:48:39] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-01 13:48:39] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2025-06-01 13:48:39] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2025-06-01 13:48:39] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 13:48:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:48:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-06-01 13:48:39] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-01 13:48:39] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2025-06-01 13:48:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 25 ms returned sat
[2025-06-01 13:48:40] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 56 ms.
[2025-06-01 13:48:40] [INFO ] Added : 13 causal constraints over 3 iterations in 190 ms. Result :sat
Minimization took 309 ms.
[2025-06-01 13:48:40] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-06-01 13:48:40] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-01 13:48:40] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2025-06-01 13:48:40] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2025-06-01 13:48:40] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 51 ms.
[2025-06-01 13:48:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:48:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-01 13:48:41] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-01 13:48:41] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2025-06-01 13:48:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-01 13:48:41] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 50 ms.
[2025-06-01 13:48:41] [INFO ] Added : 21 causal constraints over 5 iterations in 218 ms. Result :sat
Minimization took 293 ms.
[2025-06-01 13:48:41] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-01 13:48:41] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-01 13:48:42] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2025-06-01 13:48:42] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-01 13:48:42] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 37 ms.
[2025-06-01 13:48:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:48:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-06-01 13:48:42] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2025-06-01 13:48:42] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2025-06-01 13:48:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-01 13:48:42] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 47 ms.
[2025-06-01 13:48:42] [INFO ] Added : 24 causal constraints over 6 iterations in 203 ms. Result :sat
Minimization took 203 ms.
[2025-06-01 13:48:43] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-06-01 13:48:43] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2025-06-01 13:48:43] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2025-06-01 13:48:43] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-01 13:48:43] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 48 ms.
[2025-06-01 13:48:43] [INFO ] Added : 16 causal constraints over 4 iterations in 171 ms. Result :sat
Minimization took 288 ms.
[2025-06-01 13:48:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:48:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-06-01 13:48:43] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2025-06-01 13:48:43] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-06-01 13:48:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:48:43] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 42 ms.
[2025-06-01 13:48:44] [INFO ] Added : 17 causal constraints over 4 iterations in 160 ms. Result :sat
Minimization took 280 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 312/312 transitions.
Graph (trivial) has 236 edges and 160 vertex of which 4 / 160 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 682 edges and 158 vertex of which 148 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.4 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 148 transition count 293
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 5 rules applied. Total rules applied 9 place count 146 transition count 290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 145 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 145 transition count 289
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 144 transition count 289
Discarding 82 places :
Symmetric choice reduction at 3 with 82 rule applications. Total rules 94 place count 62 transition count 125
Iterating global reduction 3 with 82 rules applied. Total rules applied 176 place count 62 transition count 125
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 185 place count 53 transition count 107
Iterating global reduction 3 with 9 rules applied. Total rules applied 194 place count 53 transition count 107
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 203 place count 53 transition count 98
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 205 place count 51 transition count 92
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 51 transition count 92
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 209 place count 49 transition count 88
Iterating global reduction 4 with 2 rules applied. Total rules applied 211 place count 49 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 217 place count 49 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 219 place count 48 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 220 place count 48 transition count 80
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 230 place count 43 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 231 place count 43 transition count 115
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 235 place count 43 transition count 111
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 239 place count 39 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 241 place count 39 transition count 109
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 242 place count 39 transition count 225
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 244 place count 38 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 247 place count 38 transition count 221
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 248 place count 37 transition count 180
Iterating global reduction 8 with 1 rules applied. Total rules applied 249 place count 37 transition count 180
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 250 place count 36 transition count 178
Iterating global reduction 8 with 1 rules applied. Total rules applied 251 place count 36 transition count 178
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 266 place count 36 transition count 163
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 269 place count 36 transition count 163
Applied a total of 269 rules in 226 ms. Remains 36 /160 variables (removed 124) and now considering 163/312 (removed 149) transitions.
Running 147 sub problems to find dead transitions.
[2025-06-01 13:48:44] [INFO ] Flow matrix only has 121 transitions (discarded 42 similar events)
// Phase 1: matrix 121 rows 36 cols
[2025-06-01 13:48:44] [INFO ] Computed 8 invariants in 10 ms
[2025-06-01 13:48:44] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Problem TDEAD162 is UNSAT
At refinement iteration 3 (OVERLAPS) 121/157 variables, 36/44 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 27/71 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/157 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 71 constraints, problems are : Problem set: 1 solved, 146 unsolved in 4439 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 36/36 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 121/157 variables, 36/44 constraints. Problems are: Problem set: 1 solved, 146 unsolved
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 27/71 constraints. Problems are: Problem set: 4 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 143/214 constraints. Problems are: Problem set: 4 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/214 constraints. Problems are: Problem set: 4 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/157 variables, 0/214 constraints. Problems are: Problem set: 4 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 214 constraints, problems are : Problem set: 4 solved, 143 unsolved in 4846 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 36/36 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 143/147 constraints, Known Traps: 0/0 constraints]
After SMT, in 9715ms problems are : Problem set: 4 solved, 143 unsolved
Search for dead transitions found 4 dead transitions in 9738ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 36/160 places, 159/312 transitions.
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 36 transition count 159
Applied a total of 10 rules in 16 ms. Remains 36 /36 variables (removed 0) and now considering 159/159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10012 ms. Remains : 36/160 places, 159/312 transitions.
[2025-06-01 13:48:54] [INFO ] Flow matrix only has 117 transitions (discarded 42 similar events)
// Phase 1: matrix 117 rows 36 cols
[2025-06-01 13:48:54] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA HealthRecord-PT-12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (98097 resets) in 2412 ms. (414 steps per ms)
FORMULA HealthRecord-PT-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (17998 resets) in 682 ms. (1464 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 13:48:58] [INFO ] Flatten gal took : 94 ms
[2025-06-01 13:48:58] [INFO ] Flatten gal took : 27 ms
[2025-06-01 13:48:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1350098441078379740.gal : 17 ms
[2025-06-01 13:48:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8448550881086679562.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/ReachabilityCardinality1350098441078379740.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8448550881086679562.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 21778 ms.

BK_STOP 1748785738502

--------------------
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="HealthRecord-PT-12"
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 HealthRecord-PT-12, 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 r111-smll-174867015900079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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