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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.1M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Medical-PT-18-UpperBounds-00
FORMULA_NAME Medical-PT-18-UpperBounds-01
FORMULA_NAME Medical-PT-18-UpperBounds-02
FORMULA_NAME Medical-PT-18-UpperBounds-03
FORMULA_NAME Medical-PT-18-UpperBounds-04
FORMULA_NAME Medical-PT-18-UpperBounds-05
FORMULA_NAME Medical-PT-18-UpperBounds-06
FORMULA_NAME Medical-PT-18-UpperBounds-07
FORMULA_NAME Medical-PT-18-UpperBounds-08
FORMULA_NAME Medical-PT-18-UpperBounds-09
FORMULA_NAME Medical-PT-18-UpperBounds-10
FORMULA_NAME Medical-PT-18-UpperBounds-11
FORMULA_NAME Medical-PT-18-UpperBounds-12
FORMULA_NAME Medical-PT-18-UpperBounds-13
FORMULA_NAME Medical-PT-18-UpperBounds-14
FORMULA_NAME Medical-PT-18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748895281737

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-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:14:43] [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:14:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:14:44] [INFO ] Load time of PNML (sax parser for PT used): 763 ms
[2025-06-02 20:14:44] [INFO ] Transformed 312 places.
[2025-06-02 20:14:45] [INFO ] Transformed 5431 transitions.
[2025-06-02 20:14:45] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 1032 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Deduced a syphon composed of 242 places in 31 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-18-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-06-02 20:14:45] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 69 cols
[2025-06-02 20:14:45] [INFO ] Computed 10 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
RANDOM walk for 10000 steps (41 resets) in 46 ms. (212 steps per ms)
BEST_FIRST walk for 50005 steps (35 resets) in 84 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15, 0, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
[2025-06-02 20:14:45] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2025-06-02 20:14:45] [INFO ] Invariant cache hit.
[2025-06-02 20:14:45] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2025-06-02 20:14:46] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2025-06-02 20:14:46] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-02 20:14:46] [INFO ] [Real]Added 56 Read/Feed constraints in 27 ms returned sat
[2025-06-02 20:14:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:14:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-02 20:14:46] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2025-06-02 20:14:46] [INFO ] [Nat]Added 56 Read/Feed constraints in 32 ms returned sat
[2025-06-02 20:14:46] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 11 ms to minimize.
[2025-06-02 20:14:46] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2025-06-02 20:14:46] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 2 ms to minimize.
[2025-06-02 20:14:46] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2025-06-02 20:14:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 524 ms
[2025-06-02 20:14:47] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 58 ms.
[2025-06-02 20:14:47] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2025-06-02 20:14:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2025-06-02 20:14:47] [INFO ] Added : 49 causal constraints over 11 iterations in 389 ms. Result :sat
Minimization took 72 ms.
[2025-06-02 20:14:47] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-02 20:14:47] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-06-02 20:14:47] [INFO ] [Real]Added 56 Read/Feed constraints in 17 ms returned sat
[2025-06-02 20:14:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:14:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-02 20:14:47] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2025-06-02 20:14:47] [INFO ] [Nat]Added 56 Read/Feed constraints in 23 ms returned sat
[2025-06-02 20:14:47] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2025-06-02 20:14:47] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2025-06-02 20:14:48] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 2 ms to minimize.
[2025-06-02 20:14:48] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2025-06-02 20:14:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 403 ms
[2025-06-02 20:14:48] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 38 ms.
[2025-06-02 20:14:48] [INFO ] Added : 59 causal constraints over 14 iterations in 368 ms. Result :sat
Minimization took 109 ms.
[2025-06-02 20:14:48] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-02 20:14:48] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2025-06-02 20:14:48] [INFO ] [Real]Added 56 Read/Feed constraints in 17 ms returned sat
[2025-06-02 20:14:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:14:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-06-02 20:14:48] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2025-06-02 20:14:48] [INFO ] [Nat]Added 56 Read/Feed constraints in 18 ms returned sat
[2025-06-02 20:14:49] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2025-06-02 20:14:49] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2025-06-02 20:14:49] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 3 ms to minimize.
[2025-06-02 20:14:49] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-06-02 20:14:49] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
[2025-06-02 20:14:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 455 ms
[2025-06-02 20:14:49] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 37 ms.
[2025-06-02 20:14:49] [INFO ] Added : 33 causal constraints over 7 iterations in 206 ms. Result :sat
Minimization took 89 ms.
[2025-06-02 20:14:49] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-02 20:14:49] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2025-06-02 20:14:49] [INFO ] [Real]Added 56 Read/Feed constraints in 14 ms returned sat
[2025-06-02 20:14:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:14:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-02 20:14:49] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-06-02 20:14:50] [INFO ] [Nat]Added 56 Read/Feed constraints in 38 ms returned sat
[2025-06-02 20:14:50] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2025-06-02 20:14:50] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2025-06-02 20:14:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2025-06-02 20:14:50] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 36 ms.
[2025-06-02 20:14:50] [INFO ] Added : 10 causal constraints over 2 iterations in 108 ms. Result :sat
Minimization took 79 ms.
[2025-06-02 20:14:50] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-02 20:14:50] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-06-02 20:14:50] [INFO ] [Real]Added 56 Read/Feed constraints in 16 ms returned sat
[2025-06-02 20:14:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:14:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-02 20:14:50] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-06-02 20:14:50] [INFO ] [Nat]Added 56 Read/Feed constraints in 20 ms returned sat
[2025-06-02 20:14:50] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2025-06-02 20:14:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2025-06-02 20:14:50] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 39 ms.
[2025-06-02 20:14:51] [INFO ] Added : 40 causal constraints over 10 iterations in 289 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15, 0, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15, 0, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 227/227 transitions.
Graph (complete) has 347 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.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 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 64 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 63 transition count 224
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 63 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 13 place count 61 transition count 222
Applied a total of 13 rules in 103 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 125 ms. Remains : 61/69 places, 222/227 transitions.
[2025-06-02 20:14:51] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
Found an invariant !
This invariant on transitions {1=1, 151=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {3=1, 151=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :[1, 0, 3, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[15, 0, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
[2025-06-02 20:14:52] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2025-06-02 20:14:52] [INFO ] Computed 8 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[15, 0, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
RANDOM walk for 1000007 steps (2 resets) in 789 ms. (1265 steps per ms)
BEST_FIRST walk for 5000004 steps (10 resets) in 2985 ms. (1674 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15, 0, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
[2025-06-02 20:14:55] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:14:55] [INFO ] Invariant cache hit.
[2025-06-02 20:14:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:14:56] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2025-06-02 20:14:56] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-02 20:14:56] [INFO ] [Real]Added 57 Read/Feed constraints in 19 ms returned sat
[2025-06-02 20:14:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:14:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:14:56] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2025-06-02 20:14:56] [INFO ] [Nat]Added 57 Read/Feed constraints in 14 ms returned sat
[2025-06-02 20:14:56] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 37 ms.
[2025-06-02 20:14:56] [INFO ] Added : 41 causal constraints over 9 iterations in 210 ms. Result :sat
Minimization took 59 ms.
[2025-06-02 20:14:56] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:14:56] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2025-06-02 20:14:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:14:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 20:14:56] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-06-02 20:14:56] [INFO ] [Nat]Added 57 Read/Feed constraints in 18 ms returned sat
[2025-06-02 20:14:56] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 23 ms.
[2025-06-02 20:14:56] [INFO ] Added : 12 causal constraints over 3 iterations in 100 ms. Result :sat
Minimization took 75 ms.
[2025-06-02 20:14:57] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:14:57] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2025-06-02 20:14:57] [INFO ] [Real]Added 57 Read/Feed constraints in 19 ms returned sat
[2025-06-02 20:14:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:14:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 20:14:57] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-06-02 20:14:57] [INFO ] [Nat]Added 57 Read/Feed constraints in 14 ms returned sat
[2025-06-02 20:14:57] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 19 ms.
[2025-06-02 20:14:57] [INFO ] Added : 57 causal constraints over 12 iterations in 268 ms. Result :sat
Minimization took 100 ms.
[2025-06-02 20:14:57] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 20:14:57] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-06-02 20:14:57] [INFO ] [Real]Added 57 Read/Feed constraints in 27 ms returned sat
[2025-06-02 20:14:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:14:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:14:57] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-06-02 20:14:57] [INFO ] [Nat]Added 57 Read/Feed constraints in 21 ms returned sat
[2025-06-02 20:14:57] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 25 ms.
[2025-06-02 20:14:58] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2025-06-02 20:14:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2025-06-02 20:14:58] [INFO ] Added : 25 causal constraints over 6 iterations in 297 ms. Result :sat
Minimization took 91 ms.
[2025-06-02 20:14:58] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:14:58] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-06-02 20:14:58] [INFO ] [Real]Added 57 Read/Feed constraints in 13 ms returned sat
[2025-06-02 20:14:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:14:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:14:58] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-06-02 20:14:58] [INFO ] [Nat]Added 57 Read/Feed constraints in 20 ms returned sat
[2025-06-02 20:14:58] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2025-06-02 20:14:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2025-06-02 20:14:58] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 28 ms.
[2025-06-02 20:14:58] [INFO ] Added : 9 causal constraints over 2 iterations in 92 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15, 0, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15, 0, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 11 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 11 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 11 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2025-06-02 20:14:58] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:14:58] [INFO ] Invariant cache hit.
[2025-06-02 20:14:59] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-02 20:14:59] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:14:59] [INFO ] Invariant cache hit.
[2025-06-02 20:14:59] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-02 20:14:59] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2025-06-02 20:14:59] [INFO ] Redundant transitions in 10 ms returned []
Running 221 sub problems to find dead transitions.
[2025-06-02 20:14:59] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:14:59] [INFO ] Invariant cache hit.
[2025-06-02 20:14:59] [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:15:00] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 176/237 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 57/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 127 constraints, problems are : Problem set: 0 solved, 221 unsolved in 6944 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:15:09] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2025-06-02 20:15:09] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2025-06-02 20:15:10] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 3/351 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2025-06-02 20:15:12] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 2 ms to minimize.
[2025-06-02 20:15:12] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2025-06-02 20:15:12] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2025-06-02 20:15:12] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2025-06-02 20:15:13] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 5/356 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2025-06-02 20:15:17] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 4 ms to minimize.
[2025-06-02 20:15:17] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2025-06-02 20:15:17] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 3/359 constraints. Problems are: Problem set: 43 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/359 constraints. Problems are: Problem set: 43 solved, 178 unsolved
At refinement iteration 10 (OVERLAPS) 0/237 variables, 0/359 constraints. Problems are: Problem set: 43 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 359 constraints, problems are : Problem set: 43 solved, 178 unsolved in 16717 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: 12/12 constraints]
After SMT, in 24150ms problems are : Problem set: 43 solved, 178 unsolved
Search for dead transitions found 43 dead transitions in 24173ms
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 6 places and 31 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 44 transition count 83
Reduce places removed 1 places and 11 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 43 transition count 72
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 41 transition count 60
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 21 place count 40 transition count 56
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 21 rules in 7 ms. Remains 40 /61 variables (removed 21) and now considering 56/179 (removed 123) transitions.
[2025-06-02 20:15:23] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 40 cols
[2025-06-02 20:15:23] [INFO ] Computed 11 invariants in 1 ms
[2025-06-02 20:15:23] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-02 20:15:23] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:23] [INFO ] Invariant cache hit.
[2025-06-02 20:15:23] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:15:23] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 162 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 24785 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-18-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 20:15:23] [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 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :[1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[15, 2, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
[2025-06-02 20:15:23] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 37 cols
[2025-06-02 20:15:23] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[15, 2, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
RANDOM walk for 1000003 steps (2 resets) in 341 ms. (2923 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 854 ms. (2339 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15, 4, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
[2025-06-02 20:15:24] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:24] [INFO ] Invariant cache hit.
[2025-06-02 20:15:24] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:15:25] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 20:15:25] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:15:25] [INFO ] [Real]Added 27 Read/Feed constraints in 7 ms returned sat
[2025-06-02 20:15:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:15:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:15:25] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-02 20:15:25] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2025-06-02 20:15:25] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 6 ms.
[2025-06-02 20:15:25] [INFO ] Added : 16 causal constraints over 4 iterations in 37 ms. Result :sat
Minimization took 14 ms.
[2025-06-02 20:15:25] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:15:25] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 20:15:25] [INFO ] [Real]Added 27 Read/Feed constraints in 7 ms returned sat
[2025-06-02 20:15:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:15:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 20:15:25] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 20:15:25] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-06-02 20:15:25] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 4 ms.
[2025-06-02 20:15:25] [INFO ] Added : 13 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15, 4, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15, 4, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 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 4 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2025-06-02 20:15:25] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:25] [INFO ] Invariant cache hit.
[2025-06-02 20:15:25] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-02 20:15:25] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:25] [INFO ] Invariant cache hit.
[2025-06-02 20:15:25] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:15:25] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2025-06-02 20:15:25] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 20:15:25] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:25] [INFO ] Invariant cache hit.
[2025-06-02 20:15:25] [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
All remaining problems are real, not stopping.
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 665 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:15:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2025-06-02 20:15:26] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 129 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1041 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 1731ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1734ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1913 ms. Remains : 37/37 places, 56/56 transitions.
[2025-06-02 20:15: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 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :[1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[15, 4, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
[2025-06-02 20:15:27] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[15, 4, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
RANDOM walk for 1000007 steps (2 resets) in 391 ms. (2551 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 853 ms. (2341 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15, 8, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
[2025-06-02 20:15:28] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:28] [INFO ] Invariant cache hit.
[2025-06-02 20:15:28] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:15:28] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 20:15:28] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:15:28] [INFO ] [Real]Added 27 Read/Feed constraints in 8 ms returned sat
[2025-06-02 20:15:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:15:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:15:28] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 20:15:28] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-06-02 20:15:28] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 4 ms.
[2025-06-02 20:15:28] [INFO ] Added : 16 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 15 ms.
[2025-06-02 20:15:28] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:15:28] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-02 20:15:28] [INFO ] [Real]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-06-02 20:15:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:15:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 20:15:28] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 20:15:28] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-06-02 20:15:28] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 4 ms.
[2025-06-02 20:15:28] [INFO ] Added : 12 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15, 8, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15, 8, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 37/37 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2025-06-02 20:15:28] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:28] [INFO ] Invariant cache hit.
[2025-06-02 20:15:28] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-02 20:15:28] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:28] [INFO ] Invariant cache hit.
[2025-06-02 20:15:28] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:15:29] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2025-06-02 20:15:29] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 20:15:29] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:29] [INFO ] Invariant cache hit.
[2025-06-02 20:15:29] [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
All remaining problems are real, not stopping.
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 793 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:15:30] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2025-06-02 20:15:30] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 129 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1187 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 2009ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2010ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2190 ms. Remains : 37/37 places, 56/56 transitions.
[2025-06-02 20:15: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 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 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :[1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[15, 8, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
[2025-06-02 20:15:31] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[15, 8, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
RANDOM walk for 1000011 steps (2 resets) in 392 ms. (2544 steps per ms)
BEST_FIRST walk for 2000000 steps (4 resets) in 818 ms. (2442 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15, 8, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
[2025-06-02 20:15:32] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:32] [INFO ] Invariant cache hit.
[2025-06-02 20:15:32] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:15:32] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 20:15:32] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:15:32] [INFO ] [Real]Added 27 Read/Feed constraints in 8 ms returned sat
[2025-06-02 20:15:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:15:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:15:32] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 20:15:32] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-06-02 20:15:32] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 4 ms.
[2025-06-02 20:15:32] [INFO ] Added : 16 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 14 ms.
[2025-06-02 20:15:32] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:15:32] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 20:15:32] [INFO ] [Real]Added 27 Read/Feed constraints in 7 ms returned sat
[2025-06-02 20:15:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:15:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:15:32] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 20:15:32] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-06-02 20:15:32] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 5 ms.
[2025-06-02 20:15:32] [INFO ] Added : 12 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15, 8, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15, 8, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 37/37 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2025-06-02 20:15:32] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:32] [INFO ] Invariant cache hit.
[2025-06-02 20:15:32] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-02 20:15:32] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:32] [INFO ] Invariant cache hit.
[2025-06-02 20:15:32] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:15:32] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2025-06-02 20:15:32] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 20:15:32] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:32] [INFO ] Invariant cache hit.
[2025-06-02 20:15:32] [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
All remaining problems are real, not stopping.
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 579 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:15:33] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2025-06-02 20:15:33] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 129 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1123 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 1718ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1720ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1851 ms. Remains : 37/37 places, 56/56 transitions.
[2025-06-02 20:15:34] [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 2) seen :[1, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[15, 8, 11, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
RANDOM walk for 40027 steps (8 resets) in 445 ms. (89 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/2 properties
[2025-06-02 20:15:34] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:34] [INFO ] Invariant cache hit.
[2025-06-02 20:15:34] [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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 30/36 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/70 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 15/85 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/85 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/87 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/87 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:15:35] [INFO ] Flatten gal took : 54 ms
At refinement iteration 19 (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 125 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
[2025-06-02 20:15:35] [INFO ] Flatten gal took : 26 ms
[2025-06-02 20:15:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2305762491625954903.gal : 8 ms
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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:15:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8679323532054653169.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/ReachabilityCardinality2305762491625954903.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8679323532054653169.prop' '--nowitness' '--gen-order' 'FOLLOW'

At refinement iteration 4 (OVERLAPS) 30/36 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
At refinement iteration 8 (OVERLAPS) 34/70 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Loading property file /tmp/ReachabilityCardinality8679323532054653169.prop.
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
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
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 152
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :152 after 1974
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1974 after 5679
[2025-06-02 20:15:35] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/70 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 15/85 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/85 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:15:35] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/85 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/85 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/87 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/87 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5679 after 13032
At refinement iteration 21 (INCLUDED_ONLY) 0/87 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (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 235 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 372ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 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 10 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 10 ms. Remains : 37/37 places, 56/56 transitions.
RANDOM walk for 40029 steps (8 resets) in 29 ms. (1334 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :13032 after 27681
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :27681 after 56922
Interrupted probabilistic random walk after 2070530 steps, run timeout after 3001 ms. (steps per millisecond=689 ) properties seen :0 out of 1
Probabilistic random walk after 2070530 steps, saw 1203601 distinct states, run finished after 3006 ms. (steps per millisecond=688 ) properties seen :0
[2025-06-02 20:15:38] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:38] [INFO ] Invariant cache hit.
[2025-06-02 20:15:38] [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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 30/36 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/70 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 15/85 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/85 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/87 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/87 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (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 102 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 30/36 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/70 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:15:38] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/70 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 15/85 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/85 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:15:38] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/85 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/85 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/87 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/87 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/87 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (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 174 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 282ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 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:15:38] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:38] [INFO ] Invariant cache hit.
[2025-06-02 20:15:38] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-02 20:15:38] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:38] [INFO ] Invariant cache hit.
[2025-06-02 20:15:38] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:15:38] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2025-06-02 20:15:38] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 20:15:38] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:15:38] [INFO ] Invariant cache hit.
[2025-06-02 20:15:38] [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
All remaining problems are real, not stopping.
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 606 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:15:39] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2025-06-02 20:15:39] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 129 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1057 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 1691ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1692ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1849 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.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 9 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 11 rules applied. Total rules applied 12 place count 35 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 33 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 19 place count 30 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 27 transition count 55
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 27 transition count 58
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 24 transition count 58
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 24 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 23 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 23 transition count 81
Applied a total of 32 rules in 28 ms. Remains 23 /37 variables (removed 14) and now considering 81/56 (removed -25) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 23 cols
[2025-06-02 20:15:40] [INFO ] Computed 5 invariants in 1 ms
[2025-06-02 20:15:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 20:15:40] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 20:15:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 20:15:40] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 20:15:40] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 20:15:40] [INFO ] After 7ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 20:15:40] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 20:15:40] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-02 20:15:40] [INFO ] Flatten gal took : 37 ms
[2025-06-02 20:15:40] [INFO ] Flatten gal took : 25 ms
[2025-06-02 20:15:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6185050263647378011.gal : 12 ms
[2025-06-02 20:15:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9231909438761584936.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/ReachabilityCardinality6185050263647378011.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9231909438761584936.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 ...328
Loading property file /tmp/ReachabilityCardinality9231909438761584936.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 19
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :19 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 71
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :71 after 137
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :137 after 267
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :267 after 525
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :525 after 1039
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1039 after 2065
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :56922 after 115347
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2065 after 4115
Detected timeout of ITS tools.
[2025-06-02 20:15:55] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:15:55] [INFO ] Applying decomposition
[2025-06-02 20:15:55] [INFO ] Flatten gal took : 14 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/graph1760339595510016209.txt' '-o' '/tmp/graph1760339595510016209.bin' '-w' '/tmp/graph1760339595510016209.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1760339595510016209.bin' '-l' '-1' '-v' '-w' '/tmp/graph1760339595510016209.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:15:56] [INFO ] Decomposing Gal with order
[2025-06-02 20:15:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:15:56] [INFO ] Removed a total of 79 redundant transitions.
[2025-06-02 20:15:56] [INFO ] Flatten gal took : 56 ms
[2025-06-02 20:15:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 8 ms.
[2025-06-02 20:15:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3035315912474989705.gal : 3 ms
[2025-06-02 20:15:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1611412124447977652.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/ReachabilityCardinality3035315912474989705.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1611412124447977652.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/ReachabilityCardinality1611412124447977652.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 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :520 after 1033
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1033 after 2058
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30646 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 20:16:11] [INFO ] Flatten gal took : 6 ms
[2025-06-02 20:16:11] [INFO ] Applying decomposition
[2025-06-02 20:16:11] [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/graph504954047738392218.txt' '-o' '/tmp/graph504954047738392218.bin' '-w' '/tmp/graph504954047738392218.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph504954047738392218.bin' '-l' '-1' '-v' '-w' '/tmp/graph504954047738392218.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:16:11] [INFO ] Decomposing Gal with order
[2025-06-02 20:16:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:16:11] [INFO ] Removed a total of 17 redundant transitions.
[2025-06-02 20:16:11] [INFO ] Flatten gal took : 9 ms
[2025-06-02 20:16:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 2 ms.
[2025-06-02 20:16:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4573124891956820232.gal : 3 ms
[2025-06-02 20:16:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9958033096920799864.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/ReachabilityCardinality4573124891956820232.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9958033096920799864.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/ReachabilityCardinality9958033096920799864.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 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 76
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :76 after 76
Detected timeout of ITS tools.
FORMULA Medical-PT-18-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[15, 11, 0, 0] Max Struct:[+inf, +inf, 1, 1]
Starting property specific reduction for Medical-PT-18-UpperBounds-03
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:17:01] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 37 cols
[2025-06-02 20:17:01] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 6 ms. (1428 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15] Max Struct:[+inf]
[2025-06-02 20:17:01] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:17:01] [INFO ] Invariant cache hit.
[2025-06-02 20:17:01] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:17:01] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 20:17:01] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:17:01] [INFO ] [Real]Added 27 Read/Feed constraints in 7 ms returned sat
[2025-06-02 20:17:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:17:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:17:01] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-02 20:17:01] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2025-06-02 20:17:01] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 5 ms.
[2025-06-02 20:17:01] [INFO ] Added : 16 causal constraints over 4 iterations in 37 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] 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:17:01] [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 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
[2025-06-02 20:17:01] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:17:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[15] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 616 ms. (1620 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 527 ms. (1893 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15] Max Struct:[+inf]
[2025-06-02 20:17:02] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:17:02] [INFO ] Invariant cache hit.
[2025-06-02 20:17:02] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:17:02] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 20:17:02] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:17:02] [INFO ] [Real]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-06-02 20:17:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:17:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 20:17:02] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 20:17:02] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2025-06-02 20:17:02] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 5 ms.
[2025-06-02 20:17:02] [INFO ] Added : 16 causal constraints over 4 iterations in 36 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] Max Struct:[+inf]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 37/37 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2025-06-02 20:17:02] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:17:02] [INFO ] Invariant cache hit.
[2025-06-02 20:17:03] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-02 20:17:03] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:17:03] [INFO ] Invariant cache hit.
[2025-06-02 20:17:03] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:17:03] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2025-06-02 20:17:03] [INFO ] Redundant transitions in 0 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 20:17:03] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:17:03] [INFO ] Invariant cache hit.
[2025-06-02 20:17:03] [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
All remaining problems are real, not stopping.
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 820 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:17:04] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
[2025-06-02 20:17:04] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 129 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1391 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 2244ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2246ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2450 ms. Remains : 37/37 places, 56/56 transitions.
[2025-06-02 20:17:05] [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 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
[2025-06-02 20:17:05] [INFO ] Flatten gal took : 9 ms
RANDOM walk for 40013 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
[2025-06-02 20:17:05] [INFO ] Flatten gal took : 8 ms
[2025-06-02 20:17:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2116282611648413195.gal : 3 ms
[2025-06-02 20:17:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3201890792531059022.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/ReachabilityCardinality2116282611648413195.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3201890792531059022.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 ...328
BEST_FIRST walk for 40002 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality3201890792531059022.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 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 152
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :152 after 1974
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1974 after 5679
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5679 after 13032
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :13032 after 27681
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :27681 after 56922
Interrupted probabilistic random walk after 1877120 steps, run timeout after 3001 ms. (steps per millisecond=625 ) properties seen :0 out of 1
Probabilistic random walk after 1877120 steps, saw 1087555 distinct states, run finished after 3001 ms. (steps per millisecond=625 ) properties seen :0
[2025-06-02 20:17:08] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:17:08] [INFO ] Invariant cache hit.
[2025-06-02 20:17:08] [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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 30/36 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/70 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 15/85 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/85 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/87 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/87 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (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 90 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 30/36 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/70 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:17:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/70 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 15/85 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/85 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:17:08] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/85 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/85 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/87 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/87 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/87 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (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 144 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 242ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 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 3 ms. Remains : 37/37 places, 56/56 transitions.
RANDOM walk for 40024 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1917308 steps, run timeout after 3001 ms. (steps per millisecond=638 ) properties seen :0 out of 1
Probabilistic random walk after 1917308 steps, saw 1111668 distinct states, run finished after 3001 ms. (steps per millisecond=638 ) properties seen :0
[2025-06-02 20:17:11] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:17:11] [INFO ] Invariant cache hit.
[2025-06-02 20:17:11] [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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 30/36 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/70 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 15/85 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/85 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/87 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/87 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (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 80 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 30/36 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/70 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:17:11] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/70 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 15/85 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/85 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:17:12] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/85 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/85 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/87 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/87 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/87 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (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 134 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 220ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 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 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:17:12] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:17:12] [INFO ] Invariant cache hit.
[2025-06-02 20:17:12] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-02 20:17:12] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:17:12] [INFO ] Invariant cache hit.
[2025-06-02 20:17:12] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:17:12] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2025-06-02 20:17:12] [INFO ] Redundant transitions in 0 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 20:17:12] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:17:12] [INFO ] Invariant cache hit.
[2025-06-02 20:17:12] [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
All remaining problems are real, not stopping.
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 608 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:17:13] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2025-06-02 20:17:13] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 129 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1059 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 1689ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1690ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1838 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 3 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 9 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 11 rules applied. Total rules applied 12 place count 35 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 33 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 19 place count 30 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 27 transition count 55
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 27 transition count 58
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 24 transition count 58
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 24 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 23 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 23 transition count 81
Applied a total of 32 rules in 37 ms. Remains 23 /37 variables (removed 14) and now considering 81/56 (removed -25) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 23 cols
[2025-06-02 20:17:13] [INFO ] Computed 5 invariants in 17 ms
[2025-06-02 20:17:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 20:17:14] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 20:17:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 20:17:14] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 20:17:14] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 20:17:14] [INFO ] After 8ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 20:17:14] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 20:17:14] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-02 20:17:14] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:17:14] [INFO ] Flatten gal took : 13 ms
[2025-06-02 20:17:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1910522103691869278.gal : 2 ms
[2025-06-02 20:17:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5013562911944150760.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/ReachabilityCardinality1910522103691869278.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5013562911944150760.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 ...328
Loading property file /tmp/ReachabilityCardinality5013562911944150760.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 19
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :19 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 71
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :71 after 137
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :137 after 267
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :267 after 525
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :525 after 1039
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1039 after 2065
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :56922 after 115347
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2065 after 4115
Detected timeout of ITS tools.
[2025-06-02 20:17:29] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:17:29] [INFO ] Applying decomposition
[2025-06-02 20:17:29] [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/graph13779324549644501108.txt' '-o' '/tmp/graph13779324549644501108.bin' '-w' '/tmp/graph13779324549644501108.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13779324549644501108.bin' '-l' '-1' '-v' '-w' '/tmp/graph13779324549644501108.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:17:29] [INFO ] Decomposing Gal with order
[2025-06-02 20:17:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:17:29] [INFO ] Removed a total of 79 redundant transitions.
[2025-06-02 20:17:29] [INFO ] Flatten gal took : 23 ms
[2025-06-02 20:17:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 7 ms.
[2025-06-02 20:17:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7381245632543560709.gal : 3 ms
[2025-06-02 20:17:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1389323127094777671.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/ReachabilityCardinality7381245632543560709.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1389323127094777671.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/ReachabilityCardinality1389323127094777671.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 18
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :18 after 35
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :35 after 68
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :68 after 133
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :133 after 262
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :262 after 519
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :519 after 1032
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1032 after 2057
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30460 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 20:17:44] [INFO ] Flatten gal took : 4 ms
[2025-06-02 20:17:44] [INFO ] Applying decomposition
[2025-06-02 20:17:44] [INFO ] Flatten gal took : 5 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/graph3943995915313955158.txt' '-o' '/tmp/graph3943995915313955158.bin' '-w' '/tmp/graph3943995915313955158.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3943995915313955158.bin' '-l' '-1' '-v' '-w' '/tmp/graph3943995915313955158.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:17:44] [INFO ] Decomposing Gal with order
[2025-06-02 20:17:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:17:44] [INFO ] Removed a total of 17 redundant transitions.
[2025-06-02 20:17:44] [INFO ] Flatten gal took : 7 ms
[2025-06-02 20:17:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 1 ms.
[2025-06-02 20:17:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14120465965366724173.gal : 2 ms
[2025-06-02 20:17:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6084128362594883961.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/ReachabilityCardinality14120465965366724173.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6084128362594883961.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 ...308
Loading property file /tmp/ReachabilityCardinality6084128362594883961.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 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 76
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :76 after 76
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[15] Max Struct:[+inf]
Ending property specific reduction for Medical-PT-18-UpperBounds-03 in 93157 ms.
[2025-06-02 20:18:34] [INFO ] Flatten gal took : 5 ms
[2025-06-02 20:18:34] [INFO ] Applying decomposition
[2025-06-02 20:18:34] [INFO ] Flatten gal took : 4 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/graph10372442649814420199.txt' '-o' '/tmp/graph10372442649814420199.bin' '-w' '/tmp/graph10372442649814420199.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10372442649814420199.bin' '-l' '-1' '-v' '-w' '/tmp/graph10372442649814420199.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:18:34] [INFO ] Decomposing Gal with order
[2025-06-02 20:18:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:18:34] [INFO ] Removed a total of 17 redundant transitions.
[2025-06-02 20:18:34] [INFO ] Flatten gal took : 7 ms
[2025-06-02 20:18:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 1 ms.
[2025-06-02 20:18:34] [INFO ] Time to serialize gal into /tmp/UpperBounds10126264621306647178.gal : 1 ms
[2025-06-02 20:18:34] [INFO ] Time to serialize properties into /tmp/UpperBounds2462316117053283204.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/UpperBounds10126264621306647178.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2462316117053283204.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 ...284
Loading property file /tmp/UpperBounds2462316117053283204.prop.
Detected timeout of ITS tools.
[2025-06-02 20:39:50] [INFO ] Flatten gal took : 5 ms
[2025-06-02 20:39:50] [INFO ] Time to serialize gal into /tmp/UpperBounds7971266686281849199.gal : 2 ms
[2025-06-02 20:39:50] [INFO ] Time to serialize properties into /tmp/UpperBounds8351433308367052079.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/UpperBounds7971266686281849199.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8351433308367052079.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 ...304
Loading property file /tmp/UpperBounds8351433308367052079.prop.
Detected timeout of ITS tools.
[2025-06-02 21:01:07] [INFO ] Flatten gal took : 5 ms
[2025-06-02 21:01:07] [INFO ] Input system was already deterministic with 56 transitions.
[2025-06-02 21:01:07] [INFO ] Transformed 37 places.
[2025-06-02 21:01:07] [INFO ] Transformed 56 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 21:01:07] [INFO ] Time to serialize gal into /tmp/UpperBounds14891194186762952347.gal : 2 ms
[2025-06-02 21:01:07] [INFO ] Time to serialize properties into /tmp/UpperBounds18313431434665429864.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/UpperBounds14891194186762952347.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18313431434665429864.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds18313431434665429864.prop.

BK_TIME_CONFINEMENT_REACHED

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

tar xzf /home/mcc/BenchKit/INPUTS/Medical-PT-18.tgz
mv Medical-PT-18 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;