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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K 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.1K 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-16-UpperBounds-00
FORMULA_NAME Medical-PT-16-UpperBounds-01
FORMULA_NAME Medical-PT-16-UpperBounds-02
FORMULA_NAME Medical-PT-16-UpperBounds-03
FORMULA_NAME Medical-PT-16-UpperBounds-04
FORMULA_NAME Medical-PT-16-UpperBounds-05
FORMULA_NAME Medical-PT-16-UpperBounds-06
FORMULA_NAME Medical-PT-16-UpperBounds-07
FORMULA_NAME Medical-PT-16-UpperBounds-08
FORMULA_NAME Medical-PT-16-UpperBounds-09
FORMULA_NAME Medical-PT-16-UpperBounds-10
FORMULA_NAME Medical-PT-16-UpperBounds-11
FORMULA_NAME Medical-PT-16-UpperBounds-12
FORMULA_NAME Medical-PT-16-UpperBounds-13
FORMULA_NAME Medical-PT-16-UpperBounds-14
FORMULA_NAME Medical-PT-16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748895219578

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:13:41] [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:13:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:13:42] [INFO ] Load time of PNML (sax parser for PT used): 972 ms
[2025-06-02 20:13:42] [INFO ] Transformed 312 places.
[2025-06-02 20:13:42] [INFO ] Transformed 5431 transitions.
[2025-06-02 20:13:43] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 1215 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Deduced a syphon composed of 242 places in 32 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-16-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-02 20:13:43] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 69 cols
[2025-06-02 20:13:43] [INFO ] Computed 10 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, 1, +inf, +inf]
RANDOM walk for 10000 steps (56 resets) in 57 ms. (172 steps per ms)
BEST_FIRST walk for 40004 steps (30 resets) in 63 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 9, 0] Max Struct:[+inf, 1, +inf, +inf]
[2025-06-02 20:13:43] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2025-06-02 20:13:43] [INFO ] Invariant cache hit.
[2025-06-02 20:13:43] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-02 20:13:43] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2025-06-02 20:13:43] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-02 20:13:43] [INFO ] [Real]Added 56 Read/Feed constraints in 27 ms returned sat
[2025-06-02 20:13:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:13:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-02 20:13:44] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2025-06-02 20:13:44] [INFO ] [Nat]Added 56 Read/Feed constraints in 35 ms returned sat
[2025-06-02 20:13:44] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 18 ms to minimize.
[2025-06-02 20:13:44] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 2 ms to minimize.
[2025-06-02 20:13:44] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2025-06-02 20:13:44] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2025-06-02 20:13:44] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2025-06-02 20:13:44] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2025-06-02 20:13:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 882 ms
[2025-06-02 20:13:45] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 49 ms.
[2025-06-02 20:13:45] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2025-06-02 20:13:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2025-06-02 20:13:45] [INFO ] Added : 20 causal constraints over 4 iterations in 389 ms. Result :sat
Minimization took 87 ms.
[2025-06-02 20:13:45] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-02 20:13:45] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2025-06-02 20:13:45] [INFO ] [Real]Added 56 Read/Feed constraints in 15 ms returned sat
[2025-06-02 20:13:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:13:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-02 20:13:45] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-06-02 20:13:45] [INFO ] [Nat]Added 56 Read/Feed constraints in 24 ms returned sat
[2025-06-02 20:13:45] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2025-06-02 20:13:46] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2025-06-02 20:13:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2025-06-02 20:13:46] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 31 ms.
[2025-06-02 20:13:46] [INFO ] Added : 10 causal constraints over 2 iterations in 88 ms. Result :sat
Minimization took 70 ms.
[2025-06-02 20:13:46] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-02 20:13:46] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-06-02 20:13:46] [INFO ] [Real]Added 56 Read/Feed constraints in 17 ms returned sat
[2025-06-02 20:13:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:13:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-02 20:13:46] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2025-06-02 20:13:46] [INFO ] [Nat]Added 56 Read/Feed constraints in 13 ms returned sat
[2025-06-02 20:13:46] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2025-06-02 20:13:46] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2025-06-02 20:13:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2025-06-02 20:13:46] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 35 ms.
[2025-06-02 20:13:46] [INFO ] Added : 47 causal constraints over 10 iterations in 233 ms. Result :sat
Minimization took 101 ms.
[2025-06-02 20:13:47] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-02 20:13:47] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2025-06-02 20:13:47] [INFO ] [Real]Added 56 Read/Feed constraints in 16 ms returned sat
[2025-06-02 20:13:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:13:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-02 20:13:47] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2025-06-02 20:13:47] [INFO ] [Nat]Added 56 Read/Feed constraints in 22 ms returned sat
[2025-06-02 20:13:47] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 1 ms to minimize.
[2025-06-02 20:13:47] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 2 ms to minimize.
[2025-06-02 20:13:47] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2025-06-02 20:13:47] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
[2025-06-02 20:13:48] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 2 ms to minimize.
[2025-06-02 20:13:48] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 1 ms to minimize.
[2025-06-02 20:13:48] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2025-06-02 20:13:48] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 3 ms to minimize.
[2025-06-02 20:13:48] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 3 ms to minimize.
[2025-06-02 20:13:48] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 4 ms to minimize.
[2025-06-02 20:13:48] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 3 ms to minimize.
[2025-06-02 20:13:48] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2025-06-02 20:13:49] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 2 ms to minimize.
[2025-06-02 20:13:49] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2025-06-02 20:13:49] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2025-06-02 20:13:49] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2025-06-02 20:13:49] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2025-06-02 20:13:49] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2025-06-02 20:13:49] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2361 ms
[2025-06-02 20:13:49] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 35 ms.
[2025-06-02 20:13:50] [INFO ] Added : 51 causal constraints over 11 iterations in 346 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 9, 0] Max Struct:[+inf, 1, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 11, 0] Max Struct:[+inf, 1, +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.5 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 1 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 100 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 124 ms. Remains : 61/69 places, 222/227 transitions.
[2025-06-02 20:13:50] [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 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 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :[0, 0, 5, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 11, 0] Max Struct:[+inf, 1, +inf, +inf]
[2025-06-02 20:13:50] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2025-06-02 20:13:50] [INFO ] Computed 8 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 11, 0] Max Struct:[+inf, 1, +inf, +inf]
RANDOM walk for 1000010 steps (2 resets) in 824 ms. (1212 steps per ms)
BEST_FIRST walk for 4000002 steps (8 resets) in 3358 ms. (1190 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 4537, 0] Max Struct:[+inf, 1, +inf, +inf]
[2025-06-02 20:13:55] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:13:55] [INFO ] Invariant cache hit.
[2025-06-02 20:13:55] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 20:13:55] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-02 20:13:55] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-02 20:13:55] [INFO ] [Real]Added 57 Read/Feed constraints in 12 ms returned sat
[2025-06-02 20:13:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:13:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:13:55] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2025-06-02 20:13:55] [INFO ] [Nat]Added 57 Read/Feed constraints in 19 ms returned sat
[2025-06-02 20:13:55] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 2 ms to minimize.
[2025-06-02 20:13:55] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2025-06-02 20:13:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 212 ms
[2025-06-02 20:13:55] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 35 ms.
[2025-06-02 20:13:55] [INFO ] Added : 46 causal constraints over 10 iterations in 327 ms. Result :sat
Minimization took 96 ms.
[2025-06-02 20:13:56] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 20:13:56] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2025-06-02 20:13:56] [INFO ] [Real]Added 57 Read/Feed constraints in 20 ms returned sat
[2025-06-02 20:13:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:13:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 20:13:56] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2025-06-02 20:13:56] [INFO ] [Nat]Added 57 Read/Feed constraints in 23 ms returned sat
[2025-06-02 20:13:56] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 32 ms.
[2025-06-02 20:13:56] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2025-06-02 20:13:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2025-06-02 20:13:56] [INFO ] Added : 25 causal constraints over 6 iterations in 341 ms. Result :sat
Minimization took 88 ms.
[2025-06-02 20:13:56] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 20:13:57] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2025-06-02 20:13:57] [INFO ] [Real]Added 57 Read/Feed constraints in 17 ms returned sat
[2025-06-02 20:13:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:13:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 20:13:57] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2025-06-02 20:13:57] [INFO ] [Nat]Added 57 Read/Feed constraints in 24 ms returned sat
[2025-06-02 20:13:57] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2025-06-02 20:13:57] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2025-06-02 20:13:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2025-06-02 20:13:57] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 45 ms.
[2025-06-02 20:13:57] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2025-06-02 20:13:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2025-06-02 20:13:57] [INFO ] Added : 32 causal constraints over 7 iterations in 332 ms. Result :sat
Minimization took 77 ms.
[2025-06-02 20:13:57] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 20:13:57] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-06-02 20:13:57] [INFO ] [Real]Added 57 Read/Feed constraints in 11 ms returned sat
[2025-06-02 20:13:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:13:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:13:58] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2025-06-02 20:13:58] [INFO ] [Nat]Added 57 Read/Feed constraints in 12 ms returned sat
[2025-06-02 20:13:58] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2025-06-02 20:13:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2025-06-02 20:13:58] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 17 ms.
[2025-06-02 20:13:58] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2025-06-02 20:13:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2025-06-02 20:13:58] [INFO ] Added : 6 causal constraints over 2 iterations in 138 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 4537, 0] Max Struct:[+inf, 1, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 4537, 0] Max Struct:[+inf, 1, +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:13:58] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:13:58] [INFO ] Invariant cache hit.
[2025-06-02 20:13:58] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-06-02 20:13:58] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:13:58] [INFO ] Invariant cache hit.
[2025-06-02 20:13:58] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-02 20:13:58] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2025-06-02 20:13:58] [INFO ] Redundant transitions in 15 ms returned []
Running 221 sub problems to find dead transitions.
[2025-06-02 20:13:58] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:13:58] [INFO ] Invariant cache hit.
[2025-06-02 20:13:58] [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:14:00] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 2 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 8638 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 176/237 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 57/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 221/348 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2025-06-02 20:14:11] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 1/349 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2025-06-02 20:14:13] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
[2025-06-02 20:14:14] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 2/351 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2025-06-02 20:14:15] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-06-02 20:14:16] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2025-06-02 20:14:17] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 3/354 constraints. Problems are: Problem set: 43 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/354 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2025-06-02 20:14:21] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/237 variables, 1/355 constraints. Problems are: Problem set: 43 solved, 178 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 0/355 constraints. Problems are: Problem set: 43 solved, 178 unsolved
At refinement iteration 12 (OVERLAPS) 0/237 variables, 0/355 constraints. Problems are: Problem set: 43 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 355 constraints, problems are : Problem set: 43 solved, 178 unsolved in 18897 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: 8/8 constraints]
After SMT, in 28052ms problems are : Problem set: 43 solved, 178 unsolved
Search for dead transitions found 43 dead transitions in 28077ms
Found 43 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 43 transitions
Dead transitions reduction (with SMT) removed 43 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/61 places, 179/222 transitions.
Reduce places removed 11 places and 65 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 50 transition count 114
Reduce places removed 7 places and 31 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 18 place count 43 transition count 83
Reduce places removed 0 places and 11 transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 3 places and 16 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 40 transition count 56
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 21 rules in 8 ms. Remains 40 /61 variables (removed 21) and now considering 56/179 (removed 123) transitions.
[2025-06-02 20:14:26] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 40 cols
[2025-06-02 20:14:26] [INFO ] Computed 11 invariants in 2 ms
[2025-06-02 20:14:26] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-02 20:14:26] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:14:26] [INFO ] Invariant cache hit.
[2025-06-02 20:14:26] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:14:27] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 40/61 places, 56/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 28720 ms. Remains : 40/61 places, 56/222 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
FORMULA Medical-PT-16-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 20:14:27] [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 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :[8]
Current structural bounds on expressions (after cover walk) : Max Seen:[8, 0, 4537, 0] Max Struct:[+inf, 1, +inf, +inf]
[2025-06-02 20:14:27] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 37 cols
[2025-06-02 20:14:27] [INFO ] Computed 8 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[8, 0, 4537, 0] Max Struct:[+inf, 1, +inf, +inf]
RANDOM walk for 1000014 steps (2 resets) in 476 ms. (2096 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 658 ms. (1517 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4561, 0, 4537, 0] Max Struct:[+inf, 1, +inf, +inf]
[2025-06-02 20:14:28] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:14:28] [INFO ] Invariant cache hit.
[2025-06-02 20:14:28] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:14:28] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 20:14:28] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:14:28] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2025-06-02 20:14:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:14:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 20:14:28] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 20:14:28] [INFO ] [Nat]Added 27 Read/Feed constraints in 8 ms returned sat
[2025-06-02 20:14:28] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2025-06-02 20:14:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2025-06-02 20:14:28] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 7 ms.
[2025-06-02 20:14:28] [INFO ] Added : 19 causal constraints over 4 iterations in 57 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4561, 0, 4537, 0] Max Struct:[+inf, 1, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4561, 0, 4537, 0] Max Struct:[+inf, 1, +inf, +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 5 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 4 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2025-06-02 20:14:28] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:14:28] [INFO ] Invariant cache hit.
[2025-06-02 20:14:28] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-02 20:14:28] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:14:28] [INFO ] Invariant cache hit.
[2025-06-02 20:14:28] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:14:28] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2025-06-02 20:14:28] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 20:14:28] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:14:28] [INFO ] Invariant cache hit.
[2025-06-02 20:14:28] [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 953 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:14:30] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-02 20:14:30] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (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 1746 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 2749ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2751ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3009 ms. Remains : 37/37 places, 56/56 transitions.
[2025-06-02 20:14:31] [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 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[4561, 0, 4537, 0] Max Struct:[+inf, 1, +inf, +inf]
[2025-06-02 20:14:31] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:14:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4561, 0, 4537, 0] Max Struct:[+inf, 1, +inf, +inf]
RANDOM walk for 1000011 steps (2 resets) in 677 ms. (1474 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 536 ms. (1862 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4561, 0, 4537, 0] Max Struct:[+inf, 1, +inf, +inf]
[2025-06-02 20:14:32] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:14:32] [INFO ] Invariant cache hit.
[2025-06-02 20:14:32] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:14:32] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 20:14:32] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:14:32] [INFO ] [Real]Added 27 Read/Feed constraints in 7 ms returned sat
[2025-06-02 20:14:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:14:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:14:32] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-02 20:14:33] [INFO ] [Nat]Added 27 Read/Feed constraints in 14 ms returned sat
[2025-06-02 20:14:33] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2025-06-02 20:14:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2025-06-02 20:14:33] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 6 ms.
[2025-06-02 20:14:33] [INFO ] Added : 19 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4561, 0, 4537, 0] Max Struct:[+inf, 1, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4561, 0, 4537, 0] Max Struct:[+inf, 1, +inf, +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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2025-06-02 20:14:33] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:14:33] [INFO ] Invariant cache hit.
[2025-06-02 20:14:33] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 20:14:33] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:14:33] [INFO ] Invariant cache hit.
[2025-06-02 20:14:33] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:14:33] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2025-06-02 20:14:33] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 20:14:33] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:14:33] [INFO ] Invariant cache hit.
[2025-06-02 20:14: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 927 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:14:34] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-02 20:14:35] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (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 2158 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 3113ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 3115ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3351 ms. Remains : 37/37 places, 56/56 transitions.
[2025-06-02 20:14:36] [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 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[4561, 0, 4537, 0] Max Struct:[+inf, 1, +inf, +inf]
RANDOM walk for 40034 steps (8 resets) in 337 ms. (118 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
[2025-06-02 20:14:37] [INFO ] Flatten gal took : 78 ms
[2025-06-02 20:14:37] [INFO ] Flatten gal took : 32 ms
[2025-06-02 20:14:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1980843324439785911.gal : 15 ms
[2025-06-02 20:14:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10690738086349111956.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/ReachabilityCardinality1980843324439785911.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10690738086349111956.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/ReachabilityCardinality10690738086349111956.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 136
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :136 after 1766
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1766 after 5081
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5081 after 11660
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :11660 after 24767
Interrupted probabilistic random walk after 1844471 steps, run timeout after 3001 ms. (steps per millisecond=614 ) properties seen :0 out of 1
Probabilistic random walk after 1844471 steps, saw 1067973 distinct states, run finished after 3006 ms. (steps per millisecond=613 ) properties seen :0
[2025-06-02 20:14:39] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:14:39] [INFO ] Invariant cache hit.
[2025-06-02 20:14:39] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 37/46 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/72 variables, 12/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 9/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/84 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/84 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/84 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/84 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/85 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/85 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/85 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/87 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/87 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 37/46 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/72 variables, 12/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 9/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/84 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/84 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/84 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/84 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/85 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/85 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:14:40] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2025-06-02 20:14:40] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/85 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/85 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/87 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/87 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/87 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/87 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 75 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 313ms problems are : Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :24767 after 50930
Parikh walk visited 0 properties in 1366 ms.
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.
RANDOM walk for 40023 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2182623 steps, run timeout after 3001 ms. (steps per millisecond=727 ) properties seen :0 out of 1
Probabilistic random walk after 2182623 steps, saw 1270864 distinct states, run finished after 3001 ms. (steps per millisecond=727 ) properties seen :0
[2025-06-02 20:14:44] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:14:44] [INFO ] Invariant cache hit.
[2025-06-02 20:14:44] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 37/46 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/72 variables, 12/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 9/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/84 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/84 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/84 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/84 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/85 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/85 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/85 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/87 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/87 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 37/46 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/72 variables, 12/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 9/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/84 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/84 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/84 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/84 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/85 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/85 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:14:44] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2025-06-02 20:14:44] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/85 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/85 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/87 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/87 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/87 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/87 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 75 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 272ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1314 ms.
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.
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:14:46] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:14:46] [INFO ] Invariant cache hit.
[2025-06-02 20:14:46] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-02 20:14:46] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:14:46] [INFO ] Invariant cache hit.
[2025-06-02 20:14:46] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:14:46] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2025-06-02 20:14:46] [INFO ] Redundant transitions in 0 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 20:14:46] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:14:46] [INFO ] Invariant cache hit.
[2025-06-02 20:14:46] [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 850 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:14:47] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-02 20:14:47] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (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 1300 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 2169ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2170ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2372 ms. Remains : 37/37 places, 56/56 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 87 edges and 37 vertex of which 35 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 35 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 33 transition count 44
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 22 place count 29 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 28 transition count 51
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 28 transition count 52
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 25 transition count 52
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 25 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 24 transition count 63
Applied a total of 31 rules in 13 ms. Remains 24 /37 variables (removed 13) and now considering 63/56 (removed -7) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 63 rows 24 cols
[2025-06-02 20:14:48] [INFO ] Computed 6 invariants in 1 ms
[2025-06-02 20:14:48] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:14:48] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 20:14:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 20:14:48] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 20:14:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 20:14:48] [INFO ] After 8ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 20:14:48] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 20:14:48] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-02 20:14:48] [INFO ] Flatten gal took : 14 ms
[2025-06-02 20:14:48] [INFO ] Flatten gal took : 28 ms
[2025-06-02 20:14:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15660035090080528906.gal : 5 ms
[2025-06-02 20:14:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7700615044825689710.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15660035090080528906.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7700615044825689710.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/ReachabilityCardinality7700615044825689710.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 33
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :33 after 439
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :439 after 1561
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1561 after 3771
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3771 after 8157
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8157 after 16895
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :16895 after 34337
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :50930 after 103205
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :34337 after 69187
Detected timeout of ITS tools.
[2025-06-02 20:15:03] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:15:03] [INFO ] Applying decomposition
[2025-06-02 20:15:03] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17467225724828247823.txt' '-o' '/tmp/graph17467225724828247823.bin' '-w' '/tmp/graph17467225724828247823.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17467225724828247823.bin' '-l' '-1' '-v' '-w' '/tmp/graph17467225724828247823.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:15:03] [INFO ] Decomposing Gal with order
[2025-06-02 20:15:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:15:03] [INFO ] Removed a total of 78 redundant transitions.
[2025-06-02 20:15:03] [INFO ] Flatten gal took : 75 ms
[2025-06-02 20:15:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 9 ms.
[2025-06-02 20:15:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17835793483795336010.gal : 6 ms
[2025-06-02 20:15:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality137881528005036864.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/ReachabilityCardinality17835793483795336010.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality137881528005036864.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality137881528005036864.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 65
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :65 after 658
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :658 after 2091
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2091 after 6768
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6768 after 19864
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :19864 after 52326
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :52326 after 154141
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :154141 after 440152
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :440152 after 1.21412e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.21412e+06 after 3.48277e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.48277e+06 after 9.65328e+06
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.65328e+06 after 2.71841e+07
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.71841e+07 after 7.68585e+07
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30595 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 20:15:19] [INFO ] Flatten gal took : 7 ms
[2025-06-02 20:15:19] [INFO ] Applying decomposition
[2025-06-02 20:15:19] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5253611112253858613.txt' '-o' '/tmp/graph5253611112253858613.bin' '-w' '/tmp/graph5253611112253858613.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5253611112253858613.bin' '-l' '-1' '-v' '-w' '/tmp/graph5253611112253858613.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:15:19] [INFO ] Decomposing Gal with order
[2025-06-02 20:15:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:15:19] [INFO ] Removed a total of 17 redundant transitions.
[2025-06-02 20:15:19] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:15:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 2 ms.
[2025-06-02 20:15:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10464061194778674128.gal : 2 ms
[2025-06-02 20:15:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12951684022922939628.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/ReachabilityCardinality10464061194778674128.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12951684022922939628.prop' '--nowitness'

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 ...309
Loading property file /tmp/ReachabilityCardinality12951684022922939628.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 68
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :68 after 68
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4561, 0, 4537, 0] Max Struct:[+inf, 1, +inf, +inf]
Starting property specific reduction for Medical-PT-16-UpperBounds-04
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:16:09] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 37 cols
[2025-06-02 20:16:09] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10005 steps (2 resets) in 14 ms. (667 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[52] Max Struct:[+inf]
[2025-06-02 20:16:09] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:16:09] [INFO ] Invariant cache hit.
[2025-06-02 20:16:09] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 20:16:09] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-02 20:16:09] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:16:09] [INFO ] [Real]Added 27 Read/Feed constraints in 9 ms returned sat
[2025-06-02 20:16:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:16:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 20:16:09] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-02 20:16:09] [INFO ] [Nat]Added 27 Read/Feed constraints in 9 ms returned sat
[2025-06-02 20:16:09] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
[2025-06-02 20:16:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2025-06-02 20:16:09] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 8 ms.
[2025-06-02 20:16:09] [INFO ] Added : 19 causal constraints over 4 iterations in 63 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[52] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[52] 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 4 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 5 ms. Remains : 37/37 places, 56/56 transitions.
[2025-06-02 20:16:09] [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 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[52] Max Struct:[+inf]
[2025-06-02 20:16:09] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:16:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[52] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 618 ms. (1615 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 886 ms. (1127 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4603] Max Struct:[+inf]
[2025-06-02 20:16:11] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:16:11] [INFO ] Invariant cache hit.
[2025-06-02 20:16:11] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:16:11] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-02 20:16:11] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:16:11] [INFO ] [Real]Added 27 Read/Feed constraints in 8 ms returned sat
[2025-06-02 20:16:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:16:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:16:11] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-02 20:16:11] [INFO ] [Nat]Added 27 Read/Feed constraints in 7 ms returned sat
[2025-06-02 20:16:11] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2025-06-02 20:16:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2025-06-02 20:16:11] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 7 ms.
[2025-06-02 20:16:11] [INFO ] Added : 19 causal constraints over 4 iterations in 54 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4603] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4603] 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 4 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 4 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:16:11] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:16:11] [INFO ] Invariant cache hit.
[2025-06-02 20:16:11] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-02 20:16:11] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:16:11] [INFO ] Invariant cache hit.
[2025-06-02 20:16:11] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:16:11] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2025-06-02 20:16:11] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 20:16:11] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:16:11] [INFO ] Invariant cache hit.
[2025-06-02 20:16:11] [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 936 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:16:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-02 20:16:13] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (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 2001 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 2970ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2972ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3194 ms. Remains : 37/37 places, 56/56 transitions.
[2025-06-02 20:16:14] [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 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[4603] Max Struct:[+inf]
[2025-06-02 20:16:14] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:16:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4603] Max Struct:[+inf]
RANDOM walk for 1000012 steps (2 resets) in 361 ms. (2762 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 555 ms. (1798 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4603] Max Struct:[+inf]
[2025-06-02 20:16:15] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:16:15] [INFO ] Invariant cache hit.
[2025-06-02 20:16:15] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 20:16:15] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 20:16:15] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:16:15] [INFO ] [Real]Added 27 Read/Feed constraints in 9 ms returned sat
[2025-06-02 20:16:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:16:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:16:15] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-02 20:16:15] [INFO ] [Nat]Added 27 Read/Feed constraints in 7 ms returned sat
[2025-06-02 20:16:15] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
[2025-06-02 20:16:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2025-06-02 20:16:15] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 7 ms.
[2025-06-02 20:16:15] [INFO ] Added : 19 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4603] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4603] 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 4 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 5 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:16:16] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:16:16] [INFO ] Invariant cache hit.
[2025-06-02 20:16:16] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-02 20:16:16] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:16:16] [INFO ] Invariant cache hit.
[2025-06-02 20:16:16] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:16:16] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2025-06-02 20:16:16] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 20:16:16] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:16:16] [INFO ] Invariant cache hit.
[2025-06-02 20:16:16] [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 957 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:16:17] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-02 20:16:18] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (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 2137 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 3122ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 3124ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3349 ms. Remains : 37/37 places, 56/56 transitions.
[2025-06-02 20:16:19] [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 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2025-06-02 20:16:19] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:16:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000012 steps (2 resets) in 640 ms. (1560 steps per ms)
FORMULA Medical-PT-16-UpperBounds-04 +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:16:20] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:16:20] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:16:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14598218979117251216.gal : 4 ms
[2025-06-02 20:16:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2664257335984342682.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14598218979117251216.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2664257335984342682.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Medical-PT-16-UpperBounds-04 in 10946 ms.
[2025-06-02 20:16:20] [INFO ] Flatten gal took : 10 ms
Total runtime 158423 ms.

BK_STOP 1748895380281

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

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