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-174876533100003.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-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-174876533100003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K 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 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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-06-UpperBounds-00
FORMULA_NAME Medical-PT-06-UpperBounds-01
FORMULA_NAME Medical-PT-06-UpperBounds-02
FORMULA_NAME Medical-PT-06-UpperBounds-03
FORMULA_NAME Medical-PT-06-UpperBounds-04
FORMULA_NAME Medical-PT-06-UpperBounds-05
FORMULA_NAME Medical-PT-06-UpperBounds-06
FORMULA_NAME Medical-PT-06-UpperBounds-07
FORMULA_NAME Medical-PT-06-UpperBounds-08
FORMULA_NAME Medical-PT-06-UpperBounds-09
FORMULA_NAME Medical-PT-06-UpperBounds-10
FORMULA_NAME Medical-PT-06-UpperBounds-11
FORMULA_NAME Medical-PT-06-UpperBounds-12
FORMULA_NAME Medical-PT-06-UpperBounds-13
FORMULA_NAME Medical-PT-06-UpperBounds-14
FORMULA_NAME Medical-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748895091791

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-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:11: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:11:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:11:35] [INFO ] Load time of PNML (sax parser for PT used): 905 ms
[2025-06-02 20:11:35] [INFO ] Transformed 312 places.
[2025-06-02 20:11:35] [INFO ] Transformed 5431 transitions.
[2025-06-02 20:11:35] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 1194 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 242 places in 46 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 20:11:35] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 69 cols
[2025-06-02 20:11:35] [INFO ] Computed 10 invariants in 29 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, +inf]
RANDOM walk for 10000 steps (55 resets) in 58 ms. (169 steps per ms)
FORMULA Medical-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Medical-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (42 resets) in 95 ms. (416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 10, 0, 16] Max Struct:[1, +inf, +inf, +inf]
[2025-06-02 20:11:36] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2025-06-02 20:11:36] [INFO ] Invariant cache hit.
[2025-06-02 20:11:36] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2025-06-02 20:11:36] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2025-06-02 20:11:36] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-02 20:11:36] [INFO ] [Real]Added 56 Read/Feed constraints in 28 ms returned sat
[2025-06-02 20:11:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:11:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-02 20:11:36] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2025-06-02 20:11:36] [INFO ] [Nat]Added 56 Read/Feed constraints in 37 ms returned sat
[2025-06-02 20:11:37] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 25 ms to minimize.
[2025-06-02 20:11:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2025-06-02 20:11:37] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 58 ms.
[2025-06-02 20:11:37] [INFO ] Added : 19 causal constraints over 5 iterations in 258 ms. Result :sat
Minimization took 100 ms.
[2025-06-02 20:11:37] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-02 20:11:37] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2025-06-02 20:11:37] [INFO ] [Real]Added 56 Read/Feed constraints in 23 ms returned sat
[2025-06-02 20:11:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:11:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-02 20:11:38] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2025-06-02 20:11:38] [INFO ] [Nat]Added 56 Read/Feed constraints in 23 ms returned sat
[2025-06-02 20:11:38] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-06-02 20:11:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2025-06-02 20:11:38] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 46 ms.
[2025-06-02 20:11:38] [INFO ] Added : 54 causal constraints over 12 iterations in 364 ms. Result :sat
Minimization took 121 ms.
[2025-06-02 20:11:38] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-02 20:11:38] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2025-06-02 20:11:38] [INFO ] [Real]Added 56 Read/Feed constraints in 22 ms returned sat
[2025-06-02 20:11:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:11:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-02 20:11:38] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2025-06-02 20:11:38] [INFO ] [Nat]Added 56 Read/Feed constraints in 20 ms returned sat
[2025-06-02 20:11:39] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
[2025-06-02 20:11:39] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 2 ms to minimize.
[2025-06-02 20:11:39] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 2 ms to minimize.
[2025-06-02 20:11:39] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2025-06-02 20:11:39] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2025-06-02 20:11:39] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
[2025-06-02 20:11:39] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2025-06-02 20:11:39] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2025-06-02 20:11:39] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2025-06-02 20:11:40] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2025-06-02 20:11:40] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2025-06-02 20:11:40] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2025-06-02 20:11:40] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2025-06-02 20:11:40] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2025-06-02 20:11:40] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 4 ms to minimize.
[2025-06-02 20:11:40] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 5 ms to minimize.
[2025-06-02 20:11:40] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 5 ms to minimize.
[2025-06-02 20:11:40] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2025-06-02 20:11:41] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2025-06-02 20:11:41] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2025-06-02 20:11:41] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-06-02 20:11:41] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2025-06-02 20:11:41] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2025-06-02 20:11:41] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2025-06-02 20:11:41] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2025-06-02 20:11:41] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2884 ms
[2025-06-02 20:11:41] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 37 ms.
[2025-06-02 20:11:42] [INFO ] Added : 40 causal constraints over 9 iterations in 221 ms. Result :sat
Minimization took 72 ms.
[2025-06-02 20:11:42] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-06-02 20:11:42] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2025-06-02 20:11:42] [INFO ] [Real]Added 56 Read/Feed constraints in 13 ms returned sat
[2025-06-02 20:11:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:11:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-06-02 20:11:42] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-06-02 20:11:42] [INFO ] [Nat]Added 56 Read/Feed constraints in 14 ms returned sat
[2025-06-02 20:11:42] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2025-06-02 20:11:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2025-06-02 20:11:42] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 37 ms.
[2025-06-02 20:11:42] [INFO ] Added : 23 causal constraints over 6 iterations in 181 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 10, 0, 16] Max Struct:[1, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 10, 0, 16] Max Struct:[1, +inf, +inf, +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.4 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 106 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 128 ms. Remains : 61/69 places, 222/227 transitions.
[2025-06-02 20:11:43] [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 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :[0, 1, 0, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 10, 0, 16] Max Struct:[1, +inf, +inf, +inf]
[2025-06-02 20:11:43] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2025-06-02 20:11:43] [INFO ] Computed 8 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 10, 0, 16] Max Struct:[1, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 916 ms. (1090 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 2781 ms. (1437 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 10, 0, 16] Max Struct:[1, +inf, +inf, +inf]
[2025-06-02 20:11:47] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:11:47] [INFO ] Invariant cache hit.
[2025-06-02 20:11:47] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:11:47] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-06-02 20:11:47] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-02 20:11:47] [INFO ] [Real]Added 57 Read/Feed constraints in 11 ms returned sat
[2025-06-02 20:11:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:11:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:11:47] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2025-06-02 20:11:47] [INFO ] [Nat]Added 57 Read/Feed constraints in 13 ms returned sat
[2025-06-02 20:11:47] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 35 ms.
[2025-06-02 20:11:47] [INFO ] Added : 42 causal constraints over 9 iterations in 212 ms. Result :sat
Minimization took 60 ms.
[2025-06-02 20:11:47] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:11:47] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2025-06-02 20:11:48] [INFO ] [Real]Added 57 Read/Feed constraints in 15 ms returned sat
[2025-06-02 20:11:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:11:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 20:11:48] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2025-06-02 20:11:48] [INFO ] [Nat]Added 57 Read/Feed constraints in 22 ms returned sat
[2025-06-02 20:11:48] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 33 ms.
[2025-06-02 20:11:48] [INFO ] Added : 46 causal constraints over 10 iterations in 257 ms. Result :sat
Minimization took 92 ms.
[2025-06-02 20:11:48] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 20:11:48] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-06-02 20:11:48] [INFO ] [Real]Added 57 Read/Feed constraints in 17 ms returned sat
[2025-06-02 20:11:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:11:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:11:48] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2025-06-02 20:11:48] [INFO ] [Nat]Added 57 Read/Feed constraints in 15 ms returned sat
[2025-06-02 20:11:48] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 30 ms.
[2025-06-02 20:11:48] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-06-02 20:11:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2025-06-02 20:11:49] [INFO ] Added : 21 causal constraints over 5 iterations in 198 ms. Result :sat
Minimization took 47 ms.
[2025-06-02 20:11:49] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:11:49] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-06-02 20:11:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:11:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:11:49] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2025-06-02 20:11:49] [INFO ] [Nat]Added 57 Read/Feed constraints in 13 ms returned sat
[2025-06-02 20:11:49] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2025-06-02 20:11:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2025-06-02 20:11:49] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 18 ms.
[2025-06-02 20:11:49] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2025-06-02 20:11:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2025-06-02 20:11:49] [INFO ] Added : 32 causal constraints over 7 iterations in 180 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 10, 0, 16] Max Struct:[1, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 10, 0, 16] Max Struct:[1, +inf, +inf, +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 10 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 10 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 10 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2025-06-02 20:11:49] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:11:49] [INFO ] Invariant cache hit.
[2025-06-02 20:11:49] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-02 20:11:49] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:11:49] [INFO ] Invariant cache hit.
[2025-06-02 20:11:49] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-02 20:11:49] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2025-06-02 20:11:49] [INFO ] Redundant transitions in 10 ms returned []
Running 221 sub problems to find dead transitions.
[2025-06-02 20:11:49] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:11:49] [INFO ] Invariant cache hit.
[2025-06-02 20:11:49] [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:11:51] [INFO ] Deduced a trap composed of 6 places in 38 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
[2025-06-02 20:11:55] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2025-06-02 20:11:55] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
[2025-06-02 20:11:55] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 9 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/237 variables, 3/130 constraints. Problems are: Problem set: 3 solved, 218 unsolved
[2025-06-02 20:11:57] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2025-06-02 20:11:57] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD56 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 2/132 constraints. Problems are: Problem set: 7 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/132 constraints. Problems are: Problem set: 7 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/132 constraints. Problems are: Problem set: 7 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 132 constraints, problems are : Problem set: 7 solved, 214 unsolved in 11343 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: 6/6 constraints]
Escalating to Integer solving :Problem set: 7 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 7 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 6/14 constraints. Problems are: Problem set: 7 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 176/237 variables, 61/75 constraints. Problems are: Problem set: 7 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 57/132 constraints. Problems are: Problem set: 7 solved, 214 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 TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 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 TDEAD88 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 214/346 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2025-06-02 20:12:05] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2025-06-02 20:12:05] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 2/348 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2025-06-02 20:12:08] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD89 is UNSAT
[2025-06-02 20:12:09] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 2/350 constraints. Problems are: Problem set: 44 solved, 177 unsolved
[2025-06-02 20:12:12] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 1/351 constraints. Problems are: Problem set: 44 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/351 constraints. Problems are: Problem set: 44 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/237 variables, 0/351 constraints. Problems are: Problem set: 44 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 351 constraints, problems are : Problem set: 44 solved, 177 unsolved in 18708 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 214/221 constraints, Known Traps: 11/11 constraints]
After SMT, in 30412ms problems are : Problem set: 44 solved, 177 unsolved
Search for dead transitions found 44 dead transitions in 30430ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/61 places, 178/222 transitions.
Reduce places removed 9 places and 64 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 52 transition count 114
Reduce places removed 7 places and 31 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 45 transition count 83
Reduce places removed 2 places and 11 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 43 transition count 72
Reduce places removed 3 places and 12 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 21 place count 40 transition count 60
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 22 place count 39 transition count 56
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 22 rules in 7 ms. Remains 39 /61 variables (removed 22) and now considering 56/178 (removed 122) transitions.
[2025-06-02 20:12:20] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 39 cols
[2025-06-02 20:12:20] [INFO ] Computed 10 invariants in 1 ms
[2025-06-02 20:12:20] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-02 20:12:20] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:20] [INFO ] Invariant cache hit.
[2025-06-02 20:12:20] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:12:20] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 39/61 places, 56/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 30930 ms. Remains : 39/61 places, 56/222 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
FORMULA Medical-PT-06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 20:12:20] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
Found an invariant !
This invariant on transitions {0=1, 41=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 41=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :[2, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 10, 0, 16] Max Struct:[1, +inf, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 0
[2025-06-02 20:12:20] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 37 cols
[2025-06-02 20:12:20] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 10, 0, 16] Max Struct:[1, +inf, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 0
RANDOM walk for 1000002 steps (2 resets) in 776 ms. (1287 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1519 ms. (1315 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9, 10, 0, 16] Max Struct:[1, +inf, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 0
[2025-06-02 20:12:22] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:22] [INFO ] Invariant cache hit.
[2025-06-02 20:12:23] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:12:23] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 20:12:23] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:12:23] [INFO ] [Real]Added 27 Read/Feed constraints in 8 ms returned sat
[2025-06-02 20:12:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:12:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:12:23] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 20:12:23] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-06-02 20:12:23] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 5 ms.
[2025-06-02 20:12:23] [INFO ] Added : 12 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 15 ms.
[2025-06-02 20:12:23] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-02 20:12:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 20:12:23] [INFO ] [Real]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-06-02 20:12:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:12:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:12:23] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 20:12:23] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2025-06-02 20:12:23] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 4 ms.
[2025-06-02 20:12:23] [INFO ] Added : 17 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9, 10, 0, 16] Max Struct:[1, +inf, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 0
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9, 10, 0, 16] Max Struct:[1, +inf, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 0
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 37/37 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2025-06-02 20:12:23] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:23] [INFO ] Invariant cache hit.
[2025-06-02 20:12:23] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-02 20:12:23] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:23] [INFO ] Invariant cache hit.
[2025-06-02 20:12:23] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:12:23] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2025-06-02 20:12:23] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 20:12:23] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:23] [INFO ] Invariant cache hit.
[2025-06-02 20:12:23] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/87 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 72 constraints, problems are : Problem set: 0 solved, 55 unsolved in 629 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/87 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 55/127 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-02 20:12:24] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2025-06-02 20:12:24] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 129 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 2/2 constraints]
After SMT, in 1957ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1959ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2101 ms. Remains : 37/37 places, 56/56 transitions.
[2025-06-02 20:12:25] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
Found an invariant !
This invariant on transitions {0=1, 41=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 41=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :[1, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[9, 10, 0, 16] Max Struct:[1, +inf, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 0
[2025-06-02 20:12:25] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[9, 10, 0, 16] Max Struct:[1, +inf, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 0
RANDOM walk for 1000000 steps (2 resets) in 790 ms. (1264 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 863 ms. (2314 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9, 10, 0, 16] Max Struct:[1, +inf, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 0
[2025-06-02 20:12:27] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:27] [INFO ] Invariant cache hit.
[2025-06-02 20:12:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:12:27] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-02 20:12:27] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:12:27] [INFO ] [Real]Added 27 Read/Feed constraints in 9 ms returned sat
[2025-06-02 20:12:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:12:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:12:27] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-02 20:12:27] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2025-06-02 20:12:27] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 4 ms.
[2025-06-02 20:12:27] [INFO ] Added : 12 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 14 ms.
[2025-06-02 20:12:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:12:27] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-02 20:12:27] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2025-06-02 20:12:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:12:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 20:12:27] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 20:12:27] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-06-02 20:12:27] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 5 ms.
[2025-06-02 20:12:27] [INFO ] Added : 17 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9, 10, 0, 16] Max Struct:[1, +inf, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 0
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9, 10, 0, 16] Max Struct:[1, +inf, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 0
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 6 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 37/37 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2025-06-02 20:12:27] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:27] [INFO ] Invariant cache hit.
[2025-06-02 20:12:27] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-02 20:12:27] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:27] [INFO ] Invariant cache hit.
[2025-06-02 20:12:27] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:12:27] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2025-06-02 20:12:27] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 20:12:27] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:27] [INFO ] Invariant cache hit.
[2025-06-02 20:12:27] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/87 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 72 constraints, problems are : Problem set: 0 solved, 55 unsolved in 896 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/87 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 55/127 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-02 20:12:29] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2025-06-02 20:12:29] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 129 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1599 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 2/2 constraints]
After SMT, in 2519ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2520ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2698 ms. Remains : 37/37 places, 56/56 transitions.
[2025-06-02 20:12:30] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
Found an invariant !
This invariant on transitions {0=1, 41=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 41=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :[1, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[9, 10, 0, 16] Max Struct:[1, +inf, +inf, +inf]
Inconsistency detected : max struct is less than max seen for bound index 0
RANDOM walk for 40011 steps (8 resets) in 973 ms. (41 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 322 ms. (123 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 252 ms. (158 steps per ms) remains 2/2 properties
[2025-06-02 20:12:30] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:30] [INFO ] Invariant cache hit.
[2025-06-02 20:12:30] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/48 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/49 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 30/79 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 20:12:30] [INFO ] Flatten gal took : 57 ms
At refinement iteration 13 (INCLUDED_ONLY) 0/79 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/79 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/87 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/87 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/87 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 72 constraints, problems are : Problem set: 0 solved, 2 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
[2025-06-02 20:12:31] [INFO ] Flatten gal took : 33 ms
[2025-06-02 20:12:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8259743836632382079.gal : 8 ms
[2025-06-02 20:12:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8526752185131344449.prop : 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8259743836632382079.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8526752185131344449.prop' '--nowitness' '--gen-order' 'FOLLOW'
At refinement iteration 1 (OVERLAPS) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved

At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/48 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/49 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Loading property file /tmp/ReachabilityCardinality8526752185131344449.prop.
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 222
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :222 after 915
At refinement iteration 11 (OVERLAPS) 30/79 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/79 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/79 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :915 after 2280
[2025-06-02 20:12:31] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/79 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 8/87 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/87 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/87 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/87 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/87 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 75 constraints, problems are : Problem set: 0 solved, 2 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 357ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2280 after 4989
Parikh walk visited 0 properties in 209 ms.
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 37/37 places, 56/56 transitions.
RANDOM walk for 40006 steps (8 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 1/2 properties
BEST_FIRST walk for 38507 steps (8 resets) in 167 ms. (229 steps per ms) remains 0/1 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA Medical-PT-06-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[10, 0, 16] Max Struct:[+inf, +inf, +inf]
Starting property specific reduction for Medical-PT-06-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 20:12:31] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10003 steps (2 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[+inf]
[2025-06-02 20:12:31] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:31] [INFO ] Invariant cache hit.
[2025-06-02 20:12:31] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:12:31] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 20:12:31] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:12:31] [INFO ] [Real]Added 27 Read/Feed constraints in 9 ms returned sat
[2025-06-02 20:12:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:12:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:12:31] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-06-02 20:12:31] [INFO ] [Nat]Added 27 Read/Feed constraints in 8 ms returned sat
[2025-06-02 20:12:31] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2025-06-02 20:12:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2025-06-02 20:12:31] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 8 ms.
[2025-06-02 20:12:32] [INFO ] Added : 17 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[+inf]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 37/37 places, 56/56 transitions.
[2025-06-02 20:12:32] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
Found an invariant !
This invariant on transitions {0=1, 41=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 41=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[6] Max Struct:[+inf]
[2025-06-02 20:12:32] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[+inf]
RANDOM walk for 1000005 steps (2 resets) in 460 ms. (2169 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 409 ms. (2439 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[+inf]
[2025-06-02 20:12:32] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:32] [INFO ] Invariant cache hit.
[2025-06-02 20:12:32] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:12:33] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 20:12:33] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:12:33] [INFO ] [Real]Added 27 Read/Feed constraints in 8 ms returned sat
[2025-06-02 20:12:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:12:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 20:12:33] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-02 20:12:33] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-06-02 20:12:33] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 4 ms.
[2025-06-02 20:12:33] [INFO ] Added : 16 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[+inf]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 37/37 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2025-06-02 20:12:33] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:33] [INFO ] Invariant cache hit.
[2025-06-02 20:12:33] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-02 20:12:33] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:33] [INFO ] Invariant cache hit.
[2025-06-02 20:12:33] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:12:33] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2025-06-02 20:12:33] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 20:12:33] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:33] [INFO ] Invariant cache hit.
[2025-06-02 20:12:33] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/87 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 72 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/87 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 55/127 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-02 20:12:34] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2025-06-02 20:12:34] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 129 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1069 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 2/2 constraints]
After SMT, in 2106ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2107ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2253 ms. Remains : 37/37 places, 56/56 transitions.
[2025-06-02 20:12:35] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
Found an invariant !
This invariant on transitions {0=1, 41=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 41=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
[2025-06-02 20:12:35] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 657 ms. (1519 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 398 ms. (2506 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[+inf]
[2025-06-02 20:12:36] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:36] [INFO ] Invariant cache hit.
[2025-06-02 20:12:36] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:12:36] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-02 20:12:36] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:12:36] [INFO ] [Real]Added 27 Read/Feed constraints in 8 ms returned sat
[2025-06-02 20:12:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:12:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:12:36] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-02 20:12:36] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-06-02 20:12:36] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 5 ms.
[2025-06-02 20:12:36] [INFO ] Added : 16 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[+inf]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 37/37 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2025-06-02 20:12:36] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:36] [INFO ] Invariant cache hit.
[2025-06-02 20:12:36] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-02 20:12:36] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:36] [INFO ] Invariant cache hit.
[2025-06-02 20:12:36] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:12:36] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2025-06-02 20:12:36] [INFO ] Redundant transitions in 0 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 20:12:36] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:36] [INFO ] Invariant cache hit.
[2025-06-02 20:12:36] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/87 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 72 constraints, problems are : Problem set: 0 solved, 55 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/87 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 55/127 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-02 20:12:38] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2025-06-02 20:12:38] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 129 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1604 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 2/2 constraints]
After SMT, in 2474ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2476ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2608 ms. Remains : 37/37 places, 56/56 transitions.
[2025-06-02 20:12:39] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
Found an invariant !
This invariant on transitions {0=1, 41=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 41=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2025-06-02 20:12:39] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:12:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 714 ms. (1398 steps per ms)
FORMULA Medical-PT-06-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 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-02 20:12:40] [INFO ] Flatten gal took : 18 ms
[2025-06-02 20:12:40] [INFO ] Flatten gal took : 14 ms
[2025-06-02 20:12:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14829295516810999730.gal : 3 ms
[2025-06-02 20:12:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8065013806623632036.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14829295516810999730.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8065013806623632036.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8065013806623632036.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5,0.010817,4100,2,44,5,140,6,0,197,55,0
Total reachable state count : 5

ITS runner timed out or was interrupted.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Medical-PT-06-UpperBounds-13 in 8465 ms.
[2025-06-02 20:12:40] [INFO ] Flatten gal took : 14 ms
Total runtime 65741 ms.

BK_STOP 1748895160284

--------------------
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-06"
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-06, 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-174876533100003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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