Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K 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-18-UpperBounds-00
FORMULA_NAME Medical-PT-18-UpperBounds-01
FORMULA_NAME Medical-PT-18-UpperBounds-02
FORMULA_NAME Medical-PT-18-UpperBounds-03
FORMULA_NAME Medical-PT-18-UpperBounds-04
FORMULA_NAME Medical-PT-18-UpperBounds-05
FORMULA_NAME Medical-PT-18-UpperBounds-06
FORMULA_NAME Medical-PT-18-UpperBounds-07
FORMULA_NAME Medical-PT-18-UpperBounds-08
FORMULA_NAME Medical-PT-18-UpperBounds-09
FORMULA_NAME Medical-PT-18-UpperBounds-10
FORMULA_NAME Medical-PT-18-UpperBounds-11
FORMULA_NAME Medical-PT-18-UpperBounds-12
FORMULA_NAME Medical-PT-18-UpperBounds-13
FORMULA_NAME Medical-PT-18-UpperBounds-14
FORMULA_NAME Medical-PT-18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748819224296

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-01 23:07:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 23:07:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 23:07:07] [INFO ] Load time of PNML (sax parser for PT used): 834 ms
[2025-06-01 23:07:07] [INFO ] Transformed 312 places.
[2025-06-01 23:07:07] [INFO ] Transformed 5431 transitions.
[2025-06-01 23:07:07] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 1053 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 242 places in 54 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-18-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-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-01 23:07:07] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 69 cols
[2025-06-01 23:07:07] [INFO ] Computed 10 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
RANDOM walk for 10000 steps (35 resets) in 49 ms. (200 steps per ms)
BEST_FIRST walk for 50004 steps (33 resets) in 90 ms. (549 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15, 0, 16, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
[2025-06-01 23:07:07] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2025-06-01 23:07:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 23:07:07] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-06-01 23:07:08] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2025-06-01 23:07:08] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-01 23:07:08] [INFO ] [Real]Added 56 Read/Feed constraints in 39 ms returned sat
[2025-06-01 23:07:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 23:07:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-01 23:07:08] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2025-06-01 23:07:08] [INFO ] [Nat]Added 56 Read/Feed constraints in 23 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:08] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:08] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:08] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 6 ms to minimize.
[2025-06-01 23:07:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 331 ms
[2025-06-01 23:07:08] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 36 ms.
[2025-06-01 23:07:09] [INFO ] Added : 56 causal constraints over 12 iterations in 357 ms. Result :sat
Minimization took 72 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 23:07:09] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-01 23:07:09] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2025-06-01 23:07:09] [INFO ] [Real]Added 56 Read/Feed constraints in 20 ms returned sat
[2025-06-01 23:07:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 23:07:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-06-01 23:07:09] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-06-01 23:07:09] [INFO ] [Nat]Added 56 Read/Feed constraints in 18 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:09] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:09] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 4 ms to minimize.
[2025-06-01 23:07:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2025-06-01 23:07:09] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 40 ms.
[2025-06-01 23:07:09] [INFO ] Added : 27 causal constraints over 6 iterations in 203 ms. Result :sat
Minimization took 92 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 23:07:10] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-01 23:07:10] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2025-06-01 23:07:10] [INFO ] [Real]Added 56 Read/Feed constraints in 23 ms returned sat
[2025-06-01 23:07:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 23:07:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-01 23:07:10] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2025-06-01 23:07:10] [INFO ] [Nat]Added 56 Read/Feed constraints in 27 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:10] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:10] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:10] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:10] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 6 ms to minimize.
[2025-06-01 23:07:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 526 ms
[2025-06-01 23:07:11] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 40 ms.
[2025-06-01 23:07:11] [INFO ] Added : 54 causal constraints over 12 iterations in 339 ms. Result :sat
Minimization took 109 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 23:07:11] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-06-01 23:07:11] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-06-01 23:07:11] [INFO ] [Real]Added 56 Read/Feed constraints in 10 ms returned sat
[2025-06-01 23:07:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 23:07:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-06-01 23:07:11] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2025-06-01 23:07:11] [INFO ] [Nat]Added 56 Read/Feed constraints in 12 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:11] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:11] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 8 ms to minimize.
[2025-06-01 23:07:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 199 ms
[2025-06-01 23:07:11] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 35 ms.
[2025-06-01 23:07:11] [INFO ] Added : 14 causal constraints over 4 iterations in 127 ms. Result :sat
Minimization took 80 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 23:07:12] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-06-01 23:07:12] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2025-06-01 23:07:12] [INFO ] [Real]Added 56 Read/Feed constraints in 12 ms returned sat
[2025-06-01 23:07:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 23:07:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 23:07:12] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2025-06-01 23:07:12] [INFO ] [Nat]Added 56 Read/Feed constraints in 15 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:12] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:12] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
[2025-06-01 23:07:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2025-06-01 23:07:12] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 30 ms.
[2025-06-01 23:07:12] [INFO ] Added : 44 causal constraints over 10 iterations in 242 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15, 0, 16, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15, 0, 16, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Support contains 5 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 83 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 97 ms. Remains : 61/69 places, 222/227 transitions.
[2025-06-01 23:07:13] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 151=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 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 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :[2, 0, 2, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[15, 0, 16, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
[2025-06-01 23:07:13] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2025-06-01 23:07:13] [INFO ] Computed 8 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[15, 0, 16, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
RANDOM walk for 1000004 steps (2 resets) in 551 ms. (1811 steps per ms)
BEST_FIRST walk for 5000000 steps (10 resets) in 3119 ms. (1602 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15, 0, 16, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
[2025-06-01 23:07:17] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-01 23:07:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 23:07:17] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-01 23:07:17] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2025-06-01 23:07:17] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-01 23:07:17] [INFO ] [Real]Added 57 Read/Feed constraints in 18 ms returned sat
[2025-06-01 23:07:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 23:07:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-01 23:07:17] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2025-06-01 23:07:17] [INFO ] [Nat]Added 57 Read/Feed constraints in 11 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:17] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 7 ms to minimize.
[2025-06-01 23:07:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2025-06-01 23:07:17] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 27 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:17] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 4 ms to minimize.
[2025-06-01 23:07:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2025-06-01 23:07:18] [INFO ] Added : 60 causal constraints over 12 iterations in 383 ms. Result :sat
Minimization took 109 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 23:07:18] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-01 23:07:18] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-06-01 23:07:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 23:07:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-01 23:07:18] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2025-06-01 23:07:18] [INFO ] [Nat]Added 57 Read/Feed constraints in 24 ms returned sat
[2025-06-01 23:07:18] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 27 ms.
[2025-06-01 23:07:18] [INFO ] Added : 11 causal constraints over 3 iterations in 121 ms. Result :sat
Minimization took 81 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 23:07:18] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-01 23:07:18] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-06-01 23:07:18] [INFO ] [Real]Added 57 Read/Feed constraints in 20 ms returned sat
[2025-06-01 23:07:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 23:07:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-01 23:07:18] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2025-06-01 23:07:18] [INFO ] [Nat]Added 57 Read/Feed constraints in 26 ms returned sat
[2025-06-01 23:07:18] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 31 ms.
[2025-06-01 23:07:19] [INFO ] Added : 15 causal constraints over 3 iterations in 101 ms. Result :sat
Minimization took 42 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 23:07:19] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-01 23:07:19] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-06-01 23:07:19] [INFO ] [Real]Added 57 Read/Feed constraints in 15 ms returned sat
[2025-06-01 23:07:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 23:07:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-01 23:07:19] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-06-01 23:07:19] [INFO ] [Nat]Added 57 Read/Feed constraints in 16 ms returned sat
[2025-06-01 23:07:19] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 25 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:19] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 6 ms to minimize.
[2025-06-01 23:07:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2025-06-01 23:07:19] [INFO ] Added : 15 causal constraints over 4 iterations in 236 ms. Result :sat
Minimization took 45 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 23:07:19] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-01 23:07:19] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2025-06-01 23:07:19] [INFO ] [Real]Added 57 Read/Feed constraints in 18 ms returned sat
[2025-06-01 23:07:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 23:07:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-01 23:07:19] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2025-06-01 23:07:19] [INFO ] [Nat]Added 57 Read/Feed constraints in 23 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:20] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
[2025-06-01 23:07:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2025-06-01 23:07:20] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 24 ms.
[2025-06-01 23:07:20] [INFO ] Added : 8 causal constraints over 2 iterations in 77 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15, 0, 16, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15, 0, 16, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Support contains 5 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 20 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 20 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-01 23:07:20] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-01 23:07:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:07:20] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-01 23:07:20] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-01 23:07:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:07:20] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-01 23:07:20] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 23:07:20] [INFO ] Redundant transitions in 19 ms returned []
Running 221 sub problems to find dead transitions.
[2025-06-01 23:07:20] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-01 23:07:20] [INFO ] Invariant cache hit.
[2025-06-01 23:07:20] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:22] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 3 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 7002 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:32] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:32] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:32] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 3/351 constraints. Problems are: Problem set: 43 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:34] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/352 constraints. Problems are: Problem set: 43 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:37] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 1/353 constraints. Problems are: Problem set: 43 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:39] [INFO ] Deduced a trap along path composed of 6 places in 32 ms of which 7 ms to minimize.
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:40] [INFO ] Deduced a trap along path composed of 5 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:40] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:40] [INFO ] Deduced a trap along path composed of 4 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:40] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 5/358 constraints. Problems are: Problem set: 54 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:44] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:44] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:44] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:44] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 4/362 constraints. Problems are: Problem set: 54 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:48] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 1/363 constraints. Problems are: Problem set: 54 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:51] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:51] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 2/365 constraints. Problems are: Problem set: 54 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:56] [INFO ] Deduced a trap along path composed of 4 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:07:57] [INFO ] Deduced a trap along path composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 237/237 variables, and 367 constraints, problems are : Problem set: 55 solved, 166 unsolved in 30025 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: 13/13 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 37371ms problems are : Problem set: 55 solved, 166 unsolved
Search for dead transitions found 55 dead transitions in 37389ms
Found 55 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 55 transitions
Dead transitions reduction (with SMT) removed 55 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/61 places, 167/222 transitions.
Reduce places removed 11 places and 58 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 50 transition count 109
Reduce places removed 6 places and 31 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 44 transition count 78
Reduce places removed 1 places and 10 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 43 transition count 68
Reduce places removed 2 places and 11 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 41 transition count 57
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 21 place count 40 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 21 rules in 7 ms. Remains 40 /61 variables (removed 21) and now considering 53/167 (removed 114) transitions.
[2025-06-01 23:07:58] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
// Phase 1: matrix 47 rows 40 cols
[2025-06-01 23:07:58] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:07:58] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-01 23:07:58] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2025-06-01 23:07:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:07:58] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-01 23:07:58] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 40/61 places, 53/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 38110 ms. Remains : 40/61 places, 53/222 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
FORMULA Medical-PT-18-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 23:07:58] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {0=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 40=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :[2, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[15, 1, 16, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
[2025-06-01 23:07:58] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
// Phase 1: matrix 47 rows 37 cols
[2025-06-01 23:07:58] [INFO ] Computed 8 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[15, 1, 16, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
FORMULA Medical-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000008 steps (2 resets) in 540 ms. (1848 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 399 ms. (2500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15, 16, 0, 0] Max Struct:[+inf, +inf, 1, 1]
[2025-06-01 23:07:59] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2025-06-01 23:07:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 23:07:59] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-01 23:07:59] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 23:07:59] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-01 23:07:59] [INFO ] [Real]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-06-01 23:07:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 23:07:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-01 23:07:59] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 23:07:59] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-06-01 23:07:59] [INFO ] Computed and/alt/rep : 41/143/40 causal constraints (skipped 6 transitions) in 5 ms.
[2025-06-01 23:07:59] [INFO ] Added : 22 causal constraints over 5 iterations in 43 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15, 16, 0, 0] Max Struct:[+inf, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15, 16, 0, 0] Max Struct:[+inf, +inf, 1, 1]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 37/37 places, 53/53 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2025-06-01 23:07:59] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2025-06-01 23:07:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:07:59] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-01 23:07:59] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2025-06-01 23:07:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:07:59] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-01 23:07:59] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 23:07:59] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2025-06-01 23:07:59] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2025-06-01 23:07:59] [INFO ] Invariant cache hit.
[2025-06-01 23:07:59] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 47/84 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:08:00] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 73 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1511 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1/37 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 47/84 variables, 37/46 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 27/73 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 52/125 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:08:02] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:08:02] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:08:02] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:08:02] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:08:03] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:08:03] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:08:03] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/84 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (OVERLAPS) 0/84 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 132 constraints, problems are : Problem set: 0 solved, 52 unsolved in 3929 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 5453ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 5454ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5626 ms. Remains : 37/37 places, 53/53 transitions.
[2025-06-01 23:08:05] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {0=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 40=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 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, 16, 0, 0] Max Struct:[+inf, +inf, 1, 1]
[2025-06-01 23:08:05] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2025-06-01 23:08:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, 16, 0, 0] Max Struct:[+inf, +inf, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 367 ms. (2717 steps per ms)
FORMULA Medical-PT-18-UpperBounds-03 +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:[16, 0, 0] Max Struct:[+inf, 1, 1]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 23:08:06] [INFO ] Flatten gal took : 69 ms
[2025-06-01 23:08:06] [INFO ] Flatten gal took : 20 ms
[2025-06-01 23:08:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5131092494614752177.gal : 13 ms
[2025-06-01 23:08:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10017728325593446033.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5131092494614752177.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10017728325593446033.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[16, 0, 0] Max Struct:[+inf, 1, 1]
All properties solved without resorting to model-checking.
Total runtime 59923 ms.

BK_STOP 1748819286272

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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