Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K 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 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 4.0K 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 3.1M 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 Medical-PT-20-UpperBounds-00
FORMULA_NAME Medical-PT-20-UpperBounds-01
FORMULA_NAME Medical-PT-20-UpperBounds-02
FORMULA_NAME Medical-PT-20-UpperBounds-03
FORMULA_NAME Medical-PT-20-UpperBounds-04
FORMULA_NAME Medical-PT-20-UpperBounds-05
FORMULA_NAME Medical-PT-20-UpperBounds-06
FORMULA_NAME Medical-PT-20-UpperBounds-07
FORMULA_NAME Medical-PT-20-UpperBounds-08
FORMULA_NAME Medical-PT-20-UpperBounds-09
FORMULA_NAME Medical-PT-20-UpperBounds-10
FORMULA_NAME Medical-PT-20-UpperBounds-11
FORMULA_NAME Medical-PT-20-UpperBounds-12
FORMULA_NAME Medical-PT-20-UpperBounds-13
FORMULA_NAME Medical-PT-20-UpperBounds-14
FORMULA_NAME Medical-PT-20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748895393033

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:16:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 20:16:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:16:36] [INFO ] Load time of PNML (sax parser for PT used): 994 ms
[2025-06-02 20:16:36] [INFO ] Transformed 312 places.
[2025-06-02 20:16:36] [INFO ] Transformed 5431 transitions.
[2025-06-02 20:16:36] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 1275 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Deduced a syphon composed of 242 places in 29 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-20-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-06-02 20:16:36] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 69 cols
[2025-06-02 20:16:36] [INFO ] Computed 10 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf]
RANDOM walk for 10000 steps (34 resets) in 40 ms. (243 steps per ms)
FORMULA Medical-PT-20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (36 resets) in 58 ms. (678 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf]
[2025-06-02 20:16:36] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2025-06-02 20:16:36] [INFO ] Invariant cache hit.
[2025-06-02 20:16:36] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-02 20:16:36] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2025-06-02 20:16:37] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-02 20:16:37] [INFO ] [Real]Added 56 Read/Feed constraints in 18 ms returned sat
[2025-06-02 20:16:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:16:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-02 20:16:37] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2025-06-02 20:16:37] [INFO ] [Nat]Added 56 Read/Feed constraints in 30 ms returned sat
[2025-06-02 20:16:37] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 15 ms to minimize.
[2025-06-02 20:16:37] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 4 ms to minimize.
[2025-06-02 20:16:37] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2025-06-02 20:16:37] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2025-06-02 20:16:37] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2025-06-02 20:16:38] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2025-06-02 20:16:38] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 2 ms to minimize.
[2025-06-02 20:16:38] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2025-06-02 20:16:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1055 ms
[2025-06-02 20:16:38] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 30 ms.
[2025-06-02 20:16:38] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2025-06-02 20:16:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2025-06-02 20:16:38] [INFO ] Added : 22 causal constraints over 5 iterations in 322 ms. Result :sat
Minimization took 92 ms.
[2025-06-02 20:16:38] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-02 20:16:38] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-06-02 20:16:38] [INFO ] [Real]Added 56 Read/Feed constraints in 14 ms returned sat
[2025-06-02 20:16:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:16:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-06-02 20:16:39] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2025-06-02 20:16:39] [INFO ] [Nat]Added 56 Read/Feed constraints in 18 ms returned sat
[2025-06-02 20:16:39] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 2 ms to minimize.
[2025-06-02 20:16:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2025-06-02 20:16:39] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 40 ms.
[2025-06-02 20:16:39] [INFO ] Added : 19 causal constraints over 5 iterations in 170 ms. Result :sat
Minimization took 93 ms.
[2025-06-02 20:16:39] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-02 20:16:39] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2025-06-02 20:16:39] [INFO ] [Real]Added 56 Read/Feed constraints in 19 ms returned sat
[2025-06-02 20:16:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:16:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-02 20:16:39] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-06-02 20:16:39] [INFO ] [Nat]Added 56 Read/Feed constraints in 16 ms returned sat
[2025-06-02 20:16:39] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2025-06-02 20:16:40] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 3 ms to minimize.
[2025-06-02 20:16:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 282 ms
[2025-06-02 20:16:40] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 36 ms.
[2025-06-02 20:16:40] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 2 ms to minimize.
[2025-06-02 20:16:40] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2025-06-02 20:16:40] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 2 ms to minimize.
[2025-06-02 20:16:40] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 2 ms to minimize.
[2025-06-02 20:16:40] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2025-06-02 20:16:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 633 ms
[2025-06-02 20:16:40] [INFO ] Added : 15 causal constraints over 5 iterations in 811 ms. Result :sat
Minimization took 86 ms.
[2025-06-02 20:16:41] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-02 20:16:41] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-06-02 20:16:41] [INFO ] [Real]Added 56 Read/Feed constraints in 19 ms returned sat
[2025-06-02 20:16:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:16:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-02 20:16:41] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2025-06-02 20:16:41] [INFO ] [Nat]Added 56 Read/Feed constraints in 20 ms returned sat
[2025-06-02 20:16:41] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2025-06-02 20:16:41] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 4 ms to minimize.
[2025-06-02 20:16:41] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2025-06-02 20:16:41] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2025-06-02 20:16:41] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2025-06-02 20:16:41] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2025-06-02 20:16:42] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2025-06-02 20:16:42] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2025-06-02 20:16:42] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2025-06-02 20:16:42] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2025-06-02 20:16:42] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2025-06-02 20:16:42] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 3 ms to minimize.
[2025-06-02 20:16:42] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2025-06-02 20:16:42] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2025-06-02 20:16:43] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2025-06-02 20:16:43] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2025-06-02 20:16:43] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 3 ms to minimize.
[2025-06-02 20:16:43] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 6 ms to minimize.
[2025-06-02 20:16:43] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2025-06-02 20:16:43] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2025-06-02 20:16:43] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2025-06-02 20:16:43] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 2 ms to minimize.
[2025-06-02 20:16:43] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2025-06-02 20:16:43] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2605 ms
[2025-06-02 20:16:43] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 35 ms.
[2025-06-02 20:16:44] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2025-06-02 20:16:44] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2025-06-02 20:16:44] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2025-06-02 20:16:44] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2025-06-02 20:16:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 485 ms
[2025-06-02 20:16:44] [INFO ] Added : 53 causal constraints over 11 iterations in 809 ms. Result :sat
Minimization took 150 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf]
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 227/227 transitions.
Graph (complete) has 347 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 67 transition count 224
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 64 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 63 transition count 224
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 63 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 13 place count 61 transition count 222
Applied a total of 13 rules in 70 ms. Remains 61 /69 variables (removed 8) and now considering 222/227 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 61/69 places, 222/227 transitions.
[2025-06-02 20:16:45] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
Found an invariant !
This invariant on transitions {1=1, 151=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {3=1, 151=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :[0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf]
[2025-06-02 20:16:45] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2025-06-02 20:16:45] [INFO ] Computed 8 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf]
RANDOM walk for 1000016 steps (2 resets) in 673 ms. (1483 steps per ms)
BEST_FIRST walk for 4000003 steps (8 resets) in 2396 ms. (1668 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf]
[2025-06-02 20:16:48] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:16:48] [INFO ] Invariant cache hit.
[2025-06-02 20:16:48] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:16:48] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-06-02 20:16:48] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-02 20:16:48] [INFO ] [Real]Added 57 Read/Feed constraints in 11 ms returned sat
[2025-06-02 20:16:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:16:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:16:48] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-06-02 20:16:48] [INFO ] [Nat]Added 57 Read/Feed constraints in 13 ms returned sat
[2025-06-02 20:16:48] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2025-06-02 20:16:48] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 3 ms to minimize.
[2025-06-02 20:16:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2025-06-02 20:16:49] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 21 ms.
[2025-06-02 20:16:49] [INFO ] Added : 46 causal constraints over 10 iterations in 261 ms. Result :sat
Minimization took 98 ms.
[2025-06-02 20:16:49] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 20:16:49] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-06-02 20:16:49] [INFO ] [Real]Added 57 Read/Feed constraints in 17 ms returned sat
[2025-06-02 20:16:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:16:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 20:16:49] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-06-02 20:16:49] [INFO ] [Nat]Added 57 Read/Feed constraints in 12 ms returned sat
[2025-06-02 20:16:49] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 21 ms.
[2025-06-02 20:16:49] [INFO ] Added : 41 causal constraints over 9 iterations in 169 ms. Result :sat
Minimization took 60 ms.
[2025-06-02 20:16:49] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:16:49] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2025-06-02 20:16:50] [INFO ] [Real]Added 57 Read/Feed constraints in 22 ms returned sat
[2025-06-02 20:16:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:16:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:16:50] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2025-06-02 20:16:50] [INFO ] [Nat]Added 57 Read/Feed constraints in 15 ms returned sat
[2025-06-02 20:16:50] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 21 ms.
[2025-06-02 20:16:50] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2025-06-02 20:16:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2025-06-02 20:16:50] [INFO ] Added : 42 causal constraints over 9 iterations in 275 ms. Result :sat
Minimization took 62 ms.
[2025-06-02 20:16:50] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 20:16:50] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2025-06-02 20:16:50] [INFO ] [Real]Added 57 Read/Feed constraints in 21 ms returned sat
[2025-06-02 20:16:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:16:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 20:16:50] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2025-06-02 20:16:50] [INFO ] [Nat]Added 57 Read/Feed constraints in 22 ms returned sat
[2025-06-02 20:16:50] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 29 ms.
[2025-06-02 20:16:50] [INFO ] Added : 29 causal constraints over 6 iterations in 165 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf]
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 17 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 61/61 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 16 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2025-06-02 20:16:51] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:16:51] [INFO ] Invariant cache hit.
[2025-06-02 20:16:51] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-02 20:16:51] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:16:51] [INFO ] Invariant cache hit.
[2025-06-02 20:16:51] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-02 20:16:51] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2025-06-02 20:16:51] [INFO ] Redundant transitions in 10 ms returned []
Running 221 sub problems to find dead transitions.
[2025-06-02 20:16:51] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:16:51] [INFO ] Invariant cache hit.
[2025-06-02 20:16:51] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2025-06-02 20:16:52] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 176/237 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 57/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 127 constraints, problems are : Problem set: 0 solved, 221 unsolved in 7845 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 176/237 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 57/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 221/348 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2025-06-02 20:17:03] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2025-06-02 20:17:03] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 2/350 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2025-06-02 20:17:05] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/351 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2025-06-02 20:17:07] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2025-06-02 20:17:07] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 2/353 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2025-06-02 20:17:09] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 1/354 constraints. Problems are: Problem set: 43 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/354 constraints. Problems are: Problem set: 43 solved, 178 unsolved
At refinement iteration 11 (OVERLAPS) 0/237 variables, 0/354 constraints. Problems are: Problem set: 43 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 354 constraints, problems are : Problem set: 43 solved, 178 unsolved in 15858 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 7/7 constraints]
After SMT, in 24112ms problems are : Problem set: 43 solved, 178 unsolved
Search for dead transitions found 43 dead transitions in 24129ms
Found 43 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 43 transitions
Dead transitions reduction (with SMT) removed 43 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/61 places, 179/222 transitions.
Reduce places removed 8 places and 65 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 53 transition count 114
Reduce places removed 7 places and 31 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 46 transition count 83
Reduce places removed 2 places and 11 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 44 transition count 72
Reduce places removed 2 places and 12 transitions.
Graph (complete) has 127 edges and 42 vertex of which 4 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 60 output transitions
Drop transitions (Output transitions of discarded places.) removed 60 transitions
Iterating post reduction 3 with 3 rules applied. Total rules applied 20 place count 4 transition count 0
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 20 rules in 10 ms. Remains 4 /61 variables (removed 57) and now considering 0/179 (removed 179) transitions.
[2025-06-02 20:17:15] [INFO ] Computed 0 invariants in 0 ms
[2025-06-02 20:17:15] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-02 20:17:15] [INFO ] Invariant cache hit.
[2025-06-02 20:17:15] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 4/61 places, 0/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 24524 ms. Remains : 4/61 places, 0/222 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
FORMULA Medical-PT-20-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-20-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 40595 ms.

BK_STOP 1748895435643

--------------------
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="Medical-PT-20"
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 Medical-PT-20, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r139-smll-174876533100010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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