Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008200645.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is HealthRecord-PT-14, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008200645
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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 25K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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 72K 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-14-UpperBounds-00
FORMULA_NAME HealthRecord-PT-14-UpperBounds-01
FORMULA_NAME HealthRecord-PT-14-UpperBounds-02
FORMULA_NAME HealthRecord-PT-14-UpperBounds-03
FORMULA_NAME HealthRecord-PT-14-UpperBounds-04
FORMULA_NAME HealthRecord-PT-14-UpperBounds-05
FORMULA_NAME HealthRecord-PT-14-UpperBounds-06
FORMULA_NAME HealthRecord-PT-14-UpperBounds-07
FORMULA_NAME HealthRecord-PT-14-UpperBounds-08
FORMULA_NAME HealthRecord-PT-14-UpperBounds-09
FORMULA_NAME HealthRecord-PT-14-UpperBounds-10
FORMULA_NAME HealthRecord-PT-14-UpperBounds-11
FORMULA_NAME HealthRecord-PT-14-UpperBounds-12
FORMULA_NAME HealthRecord-PT-14-UpperBounds-13
FORMULA_NAME HealthRecord-PT-14-UpperBounds-14
FORMULA_NAME HealthRecord-PT-14-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749005224754

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-04 02:47:07] [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-04 02:47:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 02:47:08] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2025-06-04 02:47:08] [INFO ] Transformed 162 places.
[2025-06-04 02:47:08] [INFO ] Transformed 347 transitions.
[2025-06-04 02:47:08] [INFO ] Found NUPN structural information;
[2025-06-04 02:47:08] [INFO ] Parsed PT model containing 162 places and 347 transitions and 915 arcs in 406 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 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-04 02:47:08] [INFO ] Flow matrix only has 306 transitions (discarded 12 similar events)
// Phase 1: matrix 306 rows 162 cols
[2025-06-04 02:47:08] [INFO ] Computed 18 invariants in 27 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 (845 resets) in 110 ms. (90 steps per ms)
FORMULA HealthRecord-PT-14-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-14-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-14-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-14-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-14-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-14-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-14-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-14-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-14-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-14-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-14-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-14-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (393 resets) in 65 ms. (606 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-04 02:47:08] [INFO ] Flow matrix only has 306 transitions (discarded 12 similar events)
[2025-06-04 02:47:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:47:08] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned sat
[2025-06-04 02:47:08] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2025-06-04 02:47:09] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2025-06-04 02:47:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:47:09] [INFO ] [Real]Added 1 Read/Feed constraints in 10 ms returned sat
[2025-06-04 02:47:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:47:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 19 ms returned sat
[2025-06-04 02:47:09] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2025-06-04 02:47:09] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2025-06-04 02:47:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2025-06-04 02:47:09] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 85 ms.
[2025-06-04 02:47:10] [INFO ] Added : 14 causal constraints over 3 iterations in 292 ms. Result :sat
Minimization took 266 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:47:10] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-06-04 02:47:10] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-04 02:47:10] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2025-06-04 02:47:10] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-04 02:47:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:47:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2025-06-04 02:47:10] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-04 02:47:10] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2025-06-04 02:47:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-04 02:47:10] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 34 ms.
[2025-06-04 02:47:11] [INFO ] Added : 19 causal constraints over 4 iterations in 262 ms. Result :sat
Minimization took 223 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:47:11] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-04 02:47:11] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2025-06-04 02:47:11] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2025-06-04 02:47:11] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-04 02:47:11] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 46 ms.
[2025-06-04 02:47:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:47:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 20 ms returned sat
[2025-06-04 02:47:12] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2025-06-04 02:47:12] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2025-06-04 02:47:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-04 02:47:12] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 55 ms.
[2025-06-04 02:47:12] [INFO ] Added : 25 causal constraints over 6 iterations in 277 ms. Result :sat
Minimization took 263 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:47:12] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-04 02:47:12] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2025-06-04 02:47:13] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2025-06-04 02:47:13] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-04 02:47:13] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 49 ms.
[2025-06-04 02:47:13] [INFO ] Added : 16 causal constraints over 4 iterations in 225 ms. Result :sat
Minimization took 213 ms.
[2025-06-04 02:47:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:47:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-06-04 02:47:13] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2025-06-04 02:47:13] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2025-06-04 02:47:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:47:14] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 17 ms to minimize.
[2025-06-04 02:47:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2025-06-04 02:47:14] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 44 ms.
[2025-06-04 02:47:14] [INFO ] Added : 15 causal constraints over 3 iterations in 175 ms. Result :sat
Minimization took 292 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA HealthRecord-PT-14-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-14-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-14-UpperBounds-05 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 162 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p92) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 317/317 transitions.
Graph (trivial) has 248 edges and 162 vertex of which 6 / 162 are part of one of the 3 SCC in 5 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 692 edges and 159 vertex of which 150 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 150 transition count 296
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 8 rules applied. Total rules applied 13 place count 147 transition count 291
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 145 transition count 290
Discarding 86 places :
Symmetric choice reduction at 3 with 86 rule applications. Total rules 102 place count 59 transition count 118
Iterating global reduction 3 with 86 rules applied. Total rules applied 188 place count 59 transition count 118
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 198 place count 49 transition count 98
Iterating global reduction 3 with 10 rules applied. Total rules applied 208 place count 49 transition count 98
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 217 place count 49 transition count 89
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 220 place count 46 transition count 80
Iterating global reduction 4 with 3 rules applied. Total rules applied 223 place count 46 transition count 80
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 226 place count 43 transition count 74
Iterating global reduction 4 with 3 rules applied. Total rules applied 229 place count 43 transition count 74
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 238 place count 43 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 240 place count 42 transition count 64
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 250 place count 37 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 251 place count 37 transition count 94
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 258 place count 37 transition count 87
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 265 place count 30 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 267 place count 30 transition count 85
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 269 place count 30 transition count 157
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 272 place count 28 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 275 place count 28 transition count 153
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 276 place count 27 transition count 114
Iterating global reduction 7 with 1 rules applied. Total rules applied 277 place count 27 transition count 114
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 278 place count 26 transition count 112
Iterating global reduction 7 with 1 rules applied. Total rules applied 279 place count 26 transition count 112
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 289 place count 26 transition count 102
Applied a total of 289 rules in 162 ms. Remains 26 /162 variables (removed 136) and now considering 102/317 (removed 215) transitions.
Running 86 sub problems to find dead transitions.
[2025-06-04 02:47:15] [INFO ] Flow matrix only has 72 transitions (discarded 30 similar events)
// Phase 1: matrix 72 rows 26 cols
[2025-06-04 02:47:15] [INFO ] Computed 9 invariants in 2 ms
[2025-06-04 02:47:15] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 2/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Problem TDEAD35 is UNSAT
At refinement iteration 4 (OVERLAPS) 72/98 variables, 26/35 constraints. Problems are: Problem set: 1 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 20/55 constraints. Problems are: Problem set: 1 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:47:17] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 4 ms to minimize.
Problem TDEAD36 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 1/56 constraints. Problems are: Problem set: 2 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 56 constraints, problems are : Problem set: 2 solved, 84 unsolved in 3661 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 84 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 8/9 constraints. Problems are: Problem set: 2 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 72/98 variables, 26/36 constraints. Problems are: Problem set: 2 solved, 84 unsolved
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 20/56 constraints. Problems are: Problem set: 4 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 82/138 constraints. Problems are: Problem set: 4 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/138 constraints. Problems are: Problem set: 4 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/98 variables, 0/138 constraints. Problems are: Problem set: 4 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 138 constraints, problems are : Problem set: 4 solved, 82 unsolved in 5576 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 82/86 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9512ms problems are : Problem set: 4 solved, 82 unsolved
Search for dead transitions found 4 dead transitions in 9530ms
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 : 26/162 places, 98/317 transitions.
Graph (complete) has 108 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 25 transition count 91
Applied a total of 8 rules in 8 ms. Remains 25 /26 variables (removed 1) and now considering 91/98 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9721 ms. Remains : 25/162 places, 91/317 transitions.
[2025-06-04 02:47:24] [INFO ] Flow matrix only has 61 transitions (discarded 30 similar events)
// Phase 1: matrix 61 rows 25 cols
[2025-06-04 02:47:24] [INFO ] Computed 10 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (156617 resets) in 2952 ms. (338 steps per ms)
FORMULA HealthRecord-PT-14-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (23357 resets) in 769 ms. (1298 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-04 02:47:28] [INFO ] Flatten gal took : 53 ms
[2025-06-04 02:47:28] [INFO ] Flatten gal took : 19 ms
[2025-06-04 02:47:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5340375104011881990.gal : 13 ms
[2025-06-04 02:47:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4332080353432243285.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5340375104011881990.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4332080353432243285.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 20977 ms.

BK_STOP 1749005248776

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-14"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-14, 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 r100-smll-174867008200645"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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