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.r167-tall-174881266100057.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 PolyORBLF-PT-S02J06T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266100057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 20K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 136K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 47K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 253K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 43K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 217K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.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 PolyORBLF-PT-S02J06T10-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748892714233

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 19:31:55] [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 19:31:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:31:55] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2025-06-02 19:31:55] [INFO ] Transformed 844 places.
[2025-06-02 19:31:55] [INFO ] Transformed 1812 transitions.
[2025-06-02 19:31:55] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 9, 0, 0, 0, 1, 0, 0, 0, 10, 0, 1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 0, 9, 0, 0, 0, 1, 0, 0, 0, 10, 0, 1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 19:31:55] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2025-06-02 19:31:55] [INFO ] Computed 58 invariants in 118 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 9, 0, 0, 0, 1, 0, 0, 0, 10, 0, 1, 0, 0, 0] Max Struct:[+inf, +inf, 20, +inf, +inf, +inf, +inf, +inf, 87, +inf, 10, +inf, 1, +inf, +inf, +inf]
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 87 ms. (113 steps per ms)
BEST_FIRST walk for 140009 steps (30 resets) in 485 ms. (288 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 10, 2, 1, 1, 1, 0, 1, 1, 1, 2, 1, 1] Max Struct:[+inf, +inf, 20, +inf, +inf, +inf, +inf, +inf, 87, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 19:31:56] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2025-06-02 19:31:56] [INFO ] Invariant cache hit.
[2025-06-02 19:31:56] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2025-06-02 19:31:56] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 46 ms returned unsat
[2025-06-02 19:31:57] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2025-06-02 19:31:57] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 37 ms returned sat
[2025-06-02 19:31:58] [INFO ] [Real]Absence check using state equation in 943 ms returned sat
[2025-06-02 19:31:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:31:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2025-06-02 19:31:58] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 37 ms returned sat
[2025-06-02 19:31:59] [INFO ] [Nat]Absence check using state equation in 1338 ms returned sat
[2025-06-02 19:31:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:32:00] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:32:00] [INFO ] [Nat]Added 120 Read/Feed constraints in 1028 ms returned unknown
[2025-06-02 19:32:00] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-02 19:32:00] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 13 ms returned unsat
[2025-06-02 19:32:00] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2025-06-02 19:32:00] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 16 ms returned unsat
[2025-06-02 19:32:01] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2025-06-02 19:32:01] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 21 ms returned unsat
[2025-06-02 19:32:01] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2025-06-02 19:32:01] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 37 ms returned unsat
[2025-06-02 19:32:01] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-02 19:32:01] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 36 ms returned unsat
[2025-06-02 19:32:01] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-02 19:32:01] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 36 ms returned sat
[2025-06-02 19:32:03] [INFO ] [Real]Absence check using state equation in 1635 ms returned sat
[2025-06-02 19:32:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:32:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2025-06-02 19:32:03] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 52 ms returned sat
[2025-06-02 19:32:04] [INFO ] [Nat]Absence check using state equation in 1325 ms returned sat
[2025-06-02 19:32:05] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:32:05] [INFO ] [Nat]Added 120 Read/Feed constraints in 1032 ms returned unknown
[2025-06-02 19:32:05] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2025-06-02 19:32:05] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 36 ms returned unsat
[2025-06-02 19:32:05] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-02 19:32:05] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 34 ms returned unsat
[2025-06-02 19:32:06] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2025-06-02 19:32:06] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 34 ms returned unsat
[2025-06-02 19:32:06] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2025-06-02 19:32:06] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 21 ms returned unsat
[2025-06-02 19:32:06] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2025-06-02 19:32:06] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 32 ms returned unsat
[2025-06-02 19:32:06] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-02 19:32:06] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 33 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 10, 2, 1, 1, 1, 0, 1, 1, 1, 2, 1, 1] Max Struct:[1, +inf, 10, 2, 1, 1, 1, +inf, 1, 1, 1, 2, 1, 1]
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0] Max Struct:[+inf, +inf]
Support contains 11 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 842 transition count 1572
Reduce places removed 80 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 90 rules applied. Total rules applied 172 place count 762 transition count 1562
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 182 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 182 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 382 place count 652 transition count 1462
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 522 place count 582 transition count 1392
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 532 place count 582 transition count 1382
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 542 place count 572 transition count 1382
Applied a total of 542 rules in 300 ms. Remains 572 /844 variables (removed 272) and now considering 1382/1652 (removed 270) transitions.
Running 1380 sub problems to find dead transitions.
[2025-06-02 19:32:06] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
// Phase 1: matrix 1362 rows 572 cols
[2025-06-02 19:32:06] [INFO ] Computed 56 invariants in 33 ms
[2025-06-02 19:32:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2025-06-02 19:32:23] [INFO ] Deduced a trap composed of 46 places in 206 ms of which 22 ms to minimize.
[2025-06-02 19:32:23] [INFO ] Deduced a trap composed of 47 places in 226 ms of which 3 ms to minimize.
[2025-06-02 19:32:23] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 3 ms to minimize.
[2025-06-02 19:32:23] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 12 ms to minimize.
[2025-06-02 19:32:23] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2025-06-02 19:32:23] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2025-06-02 19:32:23] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2025-06-02 19:32:23] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:32:24] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:32:24] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
[2025-06-02 19:32:24] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2025-06-02 19:32:25] [INFO ] Deduced a trap composed of 81 places in 288 ms of which 3 ms to minimize.
[2025-06-02 19:32:25] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 2 ms to minimize.
[2025-06-02 19:32:29] [INFO ] Deduced a trap composed of 186 places in 266 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1934 variables, and 68 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1380/1380 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2025-06-02 19:32:50] [INFO ] Deduced a trap composed of 352 places in 268 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1934 variables, and 69 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1380 constraints, Known Traps: 15/15 constraints]
After SMT, in 43257ms problems are : Problem set: 0 solved, 1380 unsolved
Search for dead transitions found 0 dead transitions in 43301ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43633 ms. Remains : 572/844 places, 1382/1652 transitions.
[2025-06-02 19:32:50] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2025-06-02 19:34:12] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2025-06-02 19:34:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0] Max Struct:[+inf, 3]
RANDOM walk for 1000000 steps (331 resets) in 6124 ms. (163 steps per ms)
BEST_FIRST walk for 2000002 steps (250 resets) in 5561 ms. (359 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 0] Max Struct:[+inf, 3]
[2025-06-02 19:34:24] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2025-06-02 19:34:24] [INFO ] Invariant cache hit.
[2025-06-02 19:34:24] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2025-06-02 19:34:24] [INFO ] [Real]Absence check using 16 positive and 40 generalized place invariants in 22 ms returned sat
[2025-06-02 19:34:25] [INFO ] [Real]Absence check using state equation in 860 ms returned sat
[2025-06-02 19:34:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:34:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 20 ms returned sat
[2025-06-02 19:34:25] [INFO ] [Nat]Absence check using 16 positive and 40 generalized place invariants in 21 ms returned sat
[2025-06-02 19:34:27] [INFO ] [Nat]Absence check using state equation in 2372 ms returned sat
[2025-06-02 19:34:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:34:28] [INFO ] [Nat]Added 120 Read/Feed constraints in 592 ms returned sat
[2025-06-02 19:34:28] [INFO ] Deduced a trap composed of 23 places in 276 ms of which 4 ms to minimize.
[2025-06-02 19:34:29] [INFO ] Deduced a trap composed of 194 places in 274 ms of which 3 ms to minimize.
[2025-06-02 19:34:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 755 ms
[2025-06-02 19:34:29] [INFO ] Computed and/alt/rep : 510/1138/500 causal constraints (skipped 860 transitions) in 116 ms.
[2025-06-02 19:34:30] [INFO ] Added : 32 causal constraints over 7 iterations in 865 ms. Result :sat
Minimization took 4716 ms.
[2025-06-02 19:34:34] [INFO ] [Real]Absence check using 16 positive place invariants in 15 ms returned sat
[2025-06-02 19:34:34] [INFO ] [Real]Absence check using 16 positive and 40 generalized place invariants in 19 ms returned sat
[2025-06-02 19:34:35] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2025-06-02 19:34:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:34:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-06-02 19:34:35] [INFO ] [Nat]Absence check using 16 positive and 40 generalized place invariants in 21 ms returned sat
[2025-06-02 19:34:36] [INFO ] [Nat]Absence check using state equation in 1097 ms returned sat
[2025-06-02 19:34:38] [INFO ] [Nat]Added 120 Read/Feed constraints in 1282 ms returned sat
[2025-06-02 19:34:38] [INFO ] Deduced a trap composed of 217 places in 274 ms of which 4 ms to minimize.
[2025-06-02 19:34:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 692 ms
[2025-06-02 19:34:38] [INFO ] Computed and/alt/rep : 510/1138/500 causal constraints (skipped 860 transitions) in 83 ms.
[2025-06-02 19:34:39] [INFO ] Added : 9 causal constraints over 2 iterations in 414 ms. Result :sat
Minimization took 4616 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 0] Max Struct:[+inf, 3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0] Max Struct:[+inf, 3]
Support contains 11 out of 572 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 572/572 places, 1382/1382 transitions.
Applied a total of 0 rules in 30 ms. Remains 572 /572 variables (removed 0) and now considering 1382/1382 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 572/572 places, 1382/1382 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 572/572 places, 1382/1382 transitions.
Applied a total of 0 rules in 28 ms. Remains 572 /572 variables (removed 0) and now considering 1382/1382 (removed 0) transitions.
[2025-06-02 19:34:43] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2025-06-02 19:34:43] [INFO ] Invariant cache hit.
[2025-06-02 19:34:44] [INFO ] Implicit Places using invariants in 624 ms returned [68, 137, 169, 302, 350, 379, 382, 424, 539, 570]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 628 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 562/572 places, 1382/1382 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 553 transition count 1373
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 553 transition count 1373
Applied a total of 18 rules in 47 ms. Remains 553 /562 variables (removed 9) and now considering 1373/1382 (removed 9) transitions.
[2025-06-02 19:34:44] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
// Phase 1: matrix 1353 rows 553 cols
[2025-06-02 19:34:44] [INFO ] Computed 46 invariants in 31 ms
[2025-06-02 19:34:45] [INFO ] Implicit Places using invariants in 629 ms returned []
[2025-06-02 19:34:45] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-02 19:34:45] [INFO ] Invariant cache hit.
[2025-06-02 19:34:46] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:34:59] [INFO ] Implicit Places using invariants and state equation in 14585 ms returned []
Implicit Place search using SMT with State Equation took 15217 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 553/572 places, 1373/1382 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 15920 ms. Remains : 553/572 places, 1373/1382 transitions.
[2025-06-02 19:34:59] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2025-06-02 20:00:06] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-02 20:00:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0] Max Struct:[+inf, 3]
RANDOM walk for 1000000 steps (327 resets) in 5582 ms. (179 steps per ms)
BEST_FIRST walk for 2000002 steps (237 resets) in 4953 ms. (403 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 0] Max Struct:[+inf, 3]
[2025-06-02 20:00:16] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-02 20:00:16] [INFO ] Invariant cache hit.
[2025-06-02 20:00:16] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-02 20:00:16] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 23 ms returned sat
[2025-06-02 20:00:17] [INFO ] [Real]Absence check using state equation in 888 ms returned sat
[2025-06-02 20:00:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 20:00:17] [INFO ] [Real]Added 120 Read/Feed constraints in 356 ms returned sat
[2025-06-02 20:00:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:00:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-02 20:00:18] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 22 ms returned sat
[2025-06-02 20:00:18] [INFO ] [Nat]Absence check using state equation in 905 ms returned sat
[2025-06-02 20:00:19] [INFO ] [Nat]Added 120 Read/Feed constraints in 581 ms returned sat
[2025-06-02 20:00:19] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 3 ms to minimize.
[2025-06-02 20:00:20] [INFO ] Deduced a trap composed of 208 places in 260 ms of which 3 ms to minimize.
[2025-06-02 20:00:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 941 ms
[2025-06-02 20:00:20] [INFO ] Computed and/alt/rep : 501/1120/491 causal constraints (skipped 860 transitions) in 71 ms.
[2025-06-02 20:00:20] [INFO ] Added : 22 causal constraints over 5 iterations in 471 ms. Result :sat
Minimization took 5113 ms.
[2025-06-02 20:00:26] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-02 20:00:26] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 26 ms returned sat
[2025-06-02 20:00:26] [INFO ] [Real]Absence check using state equation in 683 ms returned sat
[2025-06-02 20:00:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:00:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-02 20:00:26] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 22 ms returned sat
[2025-06-02 20:00:33] [INFO ] [Nat]Absence check using state equation in 6475 ms returned sat
[2025-06-02 20:00:37] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 20:00:42] [INFO ] [Nat]Added 120 Read/Feed constraints in 9018 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 0] Max Struct:[+inf, 3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0] Max Struct:[+inf, 3]
Support contains 11 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1373/1373 transitions.
Applied a total of 0 rules in 26 ms. Remains 553 /553 variables (removed 0) and now considering 1373/1373 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 553/553 places, 1373/1373 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1373/1373 transitions.
Applied a total of 0 rules in 25 ms. Remains 553 /553 variables (removed 0) and now considering 1373/1373 (removed 0) transitions.
[2025-06-02 20:00:42] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-02 20:00:42] [INFO ] Invariant cache hit.
[2025-06-02 20:00:43] [INFO ] Implicit Places using invariants in 720 ms returned []
[2025-06-02 20:00:43] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-02 20:00:43] [INFO ] Invariant cache hit.
[2025-06-02 20:00:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 20:00:57] [INFO ] Implicit Places using invariants and state equation in 14263 ms returned []
Implicit Place search using SMT with State Equation took 14986 ms to find 0 implicit places.
[2025-06-02 20:00:57] [INFO ] Redundant transitions in 75 ms returned []
Running 1371 sub problems to find dead transitions.
[2025-06-02 20:00:57] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-02 20:00:57] [INFO ] Invariant cache hit.
[2025-06-02 20:00:57] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
[2025-06-02 20:01:12] [INFO ] Deduced a trap composed of 46 places in 148 ms of which 3 ms to minimize.
[2025-06-02 20:01:12] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 2 ms to minimize.
[2025-06-02 20:01:12] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 2 ms to minimize.
[2025-06-02 20:01:12] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 2 ms to minimize.
[2025-06-02 20:01:12] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2025-06-02 20:01:13] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2025-06-02 20:01:13] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2025-06-02 20:01:13] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 0 ms to minimize.
[2025-06-02 20:01:13] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 2 ms to minimize.
[2025-06-02 20:01:13] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 2 ms to minimize.
[2025-06-02 20:01:13] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 0 ms to minimize.
[2025-06-02 20:01:14] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2025-06-02 20:01:14] [INFO ] Deduced a trap composed of 57 places in 145 ms of which 2 ms to minimize.
[2025-06-02 20:01:14] [INFO ] Deduced a trap composed of 334 places in 249 ms of which 3 ms to minimize.
[2025-06-02 20:01:14] [INFO ] Deduced a trap composed of 315 places in 249 ms of which 6 ms to minimize.
[2025-06-02 20:01:15] [INFO ] Deduced a trap composed of 187 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:01:15] [INFO ] Deduced a trap composed of 54 places in 247 ms of which 3 ms to minimize.
[2025-06-02 20:01:15] [INFO ] Deduced a trap composed of 79 places in 240 ms of which 3 ms to minimize.
[2025-06-02 20:01:17] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 2 ms to minimize.
[2025-06-02 20:01:17] [INFO ] Deduced a trap composed of 337 places in 245 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
[2025-06-02 20:01:19] [INFO ] Deduced a trap composed of 207 places in 249 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/1906 variables, and 65 constraints, problems are : Problem set: 0 solved, 1371 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/553 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1371/1371 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
[2025-06-02 20:01:49] [INFO ] Deduced a trap composed of 82 places in 155 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/1906 variables, and 66 constraints, problems are : Problem set: 0 solved, 1371 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/553 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1371 constraints, Known Traps: 22/22 constraints]
After SMT, in 62775ms problems are : Problem set: 0 solved, 1371 unsolved
Search for dead transitions found 0 dead transitions in 62789ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77888 ms. Remains : 553/553 places, 1373/1373 transitions.
[2025-06-02 20:02:00] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
When looking for a positive semi flow solution, solver replied unsat
RANDOM walk for 40000 steps (18 resets) in 1287 ms. (31 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 440 ms. (90 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (10 resets) in 369 ms. (108 steps per ms) remains 3/3 properties
[2025-06-02 20:26:28] [INFO ] Flatten gal took : 296 ms
BEST_FIRST walk for 40004 steps (11 resets) in 270 ms. (147 steps per ms) remains 3/3 properties
[2025-06-02 20:26:28] [INFO ] Flatten gal took : 102 ms
[2025-06-02 20:26:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10071264624163579714.gal : 45 ms
[2025-06-02 20:26:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7955879159953496719.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/ReachabilityCardinality10071264624163579714.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7955879159953496719.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7955879159953496719.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :14 after 22
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :22 after 80
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :80 after 134
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :134 after 206
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :206 after 514
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :514 after 1926
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1926 after 2006
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :2006 after 2180
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :2180 after 2704
Interrupted probabilistic random walk after 98608 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 3
Probabilistic random walk after 98608 steps, saw 67528 distinct states, run finished after 3004 ms. (steps per millisecond=32 ) properties seen :0
[2025-06-02 20:26:31] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-02 20:26:31] [INFO ] Invariant cache hit.
[2025-06-02 20:26:31] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 508/519 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/533 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 20:26:32] [INFO ] Deduced a trap composed of 279 places in 300 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 18/551 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 20:26:32] [INFO ] Deduced a trap composed of 46 places in 290 ms of which 3 ms to minimize.
[2025-06-02 20:26:33] [INFO ] Deduced a trap composed of 46 places in 287 ms of which 4 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :2704 after 4242
[2025-06-02 20:26:33] [INFO ] Deduced a trap composed of 46 places in 297 ms of which 3 ms to minimize.
[2025-06-02 20:26:33] [INFO ] Deduced a trap composed of 47 places in 302 ms of which 3 ms to minimize.
[2025-06-02 20:26:34] [INFO ] Deduced a trap composed of 46 places in 359 ms of which 28 ms to minimize.
[2025-06-02 20:26:34] [INFO ] Deduced a trap composed of 90 places in 281 ms of which 3 ms to minimize.
[2025-06-02 20:26:34] [INFO ] Deduced a trap composed of 46 places in 281 ms of which 4 ms to minimize.
[2025-06-02 20:26:34] [INFO ] Deduced a trap composed of 46 places in 279 ms of which 3 ms to minimize.
[2025-06-02 20:26:35] [INFO ] Deduced a trap composed of 46 places in 274 ms of which 3 ms to minimize.
[2025-06-02 20:26:35] [INFO ] Deduced a trap composed of 236 places in 279 ms of which 4 ms to minimize.
[2025-06-02 20:26:35] [INFO ] Deduced a trap composed of 214 places in 282 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :4242 after 7884
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1904/1906 variables, and 608 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 551/553 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 508/519 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 20:26:37] [INFO ] Deduced a trap composed of 289 places in 265 ms of which 3 ms to minimize.
[2025-06-02 20:26:37] [INFO ] Deduced a trap composed of 295 places in 262 ms of which 3 ms to minimize.
[2025-06-02 20:26:37] [INFO ] Deduced a trap composed of 289 places in 269 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 14/533 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 18/551 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 20:26:38] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2025-06-02 20:26:38] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/551 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1353/1904 variables, 551/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1904 variables, 120/733 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem MAX1 is UNSAT
Problem MIN1 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1904/1906 variables, and 736 constraints, problems are : Problem set: 2 solved, 1 unsolved in 3718 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 551/553 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 17/17 constraints]
After SMT, in 8761ms problems are : Problem set: 2 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1373/1373 transitions.
Applied a total of 0 rules in 30 ms. Remains 553 /553 variables (removed 0) and now considering 1373/1373 (removed 0) transitions.
Running 1371 sub problems to find dead transitions.
[2025-06-02 20:26:40] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-02 20:26:40] [INFO ] Invariant cache hit.
[2025-06-02 20:26:40] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :7884 after 47734
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
[2025-06-02 20:26:55] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 4 ms to minimize.
[2025-06-02 20:26:55] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 2 ms to minimize.
[2025-06-02 20:26:55] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 2 ms to minimize.
[2025-06-02 20:26:55] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 2 ms to minimize.
[2025-06-02 20:26:55] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 2 ms to minimize.
[2025-06-02 20:26:56] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2025-06-02 20:26:56] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2025-06-02 20:26:56] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
[2025-06-02 20:26:56] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 2 ms to minimize.
[2025-06-02 20:26:56] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 2 ms to minimize.
[2025-06-02 20:26:56] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 0 ms to minimize.
[2025-06-02 20:26:57] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
[2025-06-02 20:26:57] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 2 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :47734 after 77816
[2025-06-02 20:26:57] [INFO ] Deduced a trap composed of 334 places in 272 ms of which 3 ms to minimize.
[2025-06-02 20:26:57] [INFO ] Deduced a trap composed of 315 places in 275 ms of which 3 ms to minimize.
[2025-06-02 20:26:58] [INFO ] Deduced a trap composed of 187 places in 266 ms of which 4 ms to minimize.
[2025-06-02 20:26:58] [INFO ] Deduced a trap composed of 54 places in 274 ms of which 3 ms to minimize.
[2025-06-02 20:26:59] [INFO ] Deduced a trap composed of 79 places in 272 ms of which 3 ms to minimize.
[2025-06-02 20:27:00] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 3 ms to minimize.
[2025-06-02 20:27:00] [INFO ] Deduced a trap composed of 337 places in 266 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
[2025-06-02 20:27:02] [INFO ] Deduced a trap composed of 207 places in 269 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/1906 variables, and 65 constraints, problems are : Problem set: 0 solved, 1371 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/553 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1371/1371 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :77816 after 180740
Detected timeout of ITS tools.
[2025-06-02 20:27:19] [INFO ] Flatten gal took : 69 ms
[2025-06-02 20:27:19] [INFO ] Applying decomposition
[2025-06-02 20:27:19] [INFO ] Flatten gal took : 59 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/graph1176754552344558602.txt' '-o' '/tmp/graph1176754552344558602.bin' '-w' '/tmp/graph1176754552344558602.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1176754552344558602.bin' '-l' '-1' '-v' '-w' '/tmp/graph1176754552344558602.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:27:19] [INFO ] Decomposing Gal with order
[2025-06-02 20:27:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:27:19] [INFO ] Removed a total of 1278 redundant transitions.
[2025-06-02 20:27:19] [INFO ] Flatten gal took : 287 ms
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
[2025-06-02 20:27:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 575 labels/synchronizations in 54 ms.
[2025-06-02 20:27:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7282087256502287535.gal : 28 ms
[2025-06-02 20:27:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7811747465867721245.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/ReachabilityCardinality7282087256502287535.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7811747465867721245.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/ReachabilityCardinality7811747465867721245.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 73
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :73 after 187
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :187 after 216
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :216 after 759
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :759 after 2271
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2271 after 2691
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2691 after 3423
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3423 after 4455
[2025-06-02 20:27:22] [INFO ] Deduced a trap composed of 82 places in 169 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/1906 variables, and 66 constraints, problems are : Problem set: 0 solved, 1371 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/553 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1371 constraints, Known Traps: 22/22 constraints]
After SMT, in 42957ms problems are : Problem set: 0 solved, 1371 unsolved
Search for dead transitions found 0 dead transitions in 42973ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43009 ms. Remains : 553/553 places, 1373/1373 transitions.
RANDOM walk for 40000 steps (15 resets) in 420 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (12 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4455 after 18160
Interrupted probabilistic random walk after 153903 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 1
Probabilistic random walk after 153903 steps, saw 103669 distinct states, run finished after 3002 ms. (steps per millisecond=51 ) properties seen :0
[2025-06-02 20:27:26] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-02 20:27:26] [INFO ] Invariant cache hit.
[2025-06-02 20:27:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 509/519 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 14/533 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/551 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :18160 after 36856
At refinement iteration 7 (OVERLAPS) 1353/1904 variables, 551/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1904 variables, 120/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/1906 variables, 2/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1906 variables, 1/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1906 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1906 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1906/1906 variables, and 719 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1139 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 553/553 constraints, ReadFeed: 120/120 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 509/519 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:27:28] [INFO ] Deduced a trap composed of 251 places in 271 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 14/533 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/551 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 20:27:28] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 2 ms to minimize.
[2025-06-02 20:27:28] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 2 ms to minimize.
[2025-06-02 20:27:28] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 1 ms to minimize.
[2025-06-02 20:27:28] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
[2025-06-02 20:27:29] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 2 ms to minimize.
[2025-06-02 20:27:29] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2025-06-02 20:27:29] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2025-06-02 20:27:29] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1353/1904 variables, 551/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1904 variables, 120/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1904 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1904 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/1906 variables, 2/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1906 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1906 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1906 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1906/1906 variables, and 729 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3685 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 553/553 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 4839ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 76 ms.
Support contains 10 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1373/1373 transitions.
Applied a total of 0 rules in 30 ms. Remains 553 /553 variables (removed 0) and now considering 1373/1373 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 553/553 places, 1373/1373 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1373/1373 transitions.
Applied a total of 0 rules in 23 ms. Remains 553 /553 variables (removed 0) and now considering 1373/1373 (removed 0) transitions.
[2025-06-02 20:27:31] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-02 20:27:31] [INFO ] Invariant cache hit.
[2025-06-02 20:27:32] [INFO ] Implicit Places using invariants in 550 ms returned []
[2025-06-02 20:27:32] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-02 20:27:32] [INFO ] Invariant cache hit.
[2025-06-02 20:27:33] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :36856 after 78898
[2025-06-02 20:27:44] [INFO ] Implicit Places using invariants and state equation in 12120 ms returned []
Implicit Place search using SMT with State Equation took 12674 ms to find 0 implicit places.
[2025-06-02 20:27:44] [INFO ] Redundant transitions in 74 ms returned []
Running 1371 sub problems to find dead transitions.
[2025-06-02 20:27:44] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-02 20:27:44] [INFO ] Invariant cache hit.
[2025-06-02 20:27:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
[2025-06-02 20:27:59] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 2 ms to minimize.
[2025-06-02 20:27:59] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 2 ms to minimize.
[2025-06-02 20:27:59] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 2 ms to minimize.
[2025-06-02 20:27:59] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 3 ms to minimize.
[2025-06-02 20:27:59] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2025-06-02 20:27:59] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2025-06-02 20:27:59] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2025-06-02 20:27:59] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 0 ms to minimize.
[2025-06-02 20:28:00] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 2 ms to minimize.
[2025-06-02 20:28:00] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 2 ms to minimize.
[2025-06-02 20:28:00] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2025-06-02 20:28:00] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2025-06-02 20:28:01] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 2 ms to minimize.
[2025-06-02 20:28:01] [INFO ] Deduced a trap composed of 334 places in 247 ms of which 3 ms to minimize.
[2025-06-02 20:28:01] [INFO ] Deduced a trap composed of 315 places in 253 ms of which 3 ms to minimize.
[2025-06-02 20:28:01] [INFO ] Deduced a trap composed of 187 places in 257 ms of which 3 ms to minimize.
[2025-06-02 20:28:02] [INFO ] Deduced a trap composed of 54 places in 251 ms of which 4 ms to minimize.
[2025-06-02 20:28:02] [INFO ] Deduced a trap composed of 79 places in 263 ms of which 3 ms to minimize.
[2025-06-02 20:28:04] [INFO ] Deduced a trap composed of 23 places in 312 ms of which 3 ms to minimize.
[2025-06-02 20:28:04] [INFO ] Deduced a trap composed of 337 places in 267 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
[2025-06-02 20:28:06] [INFO ] Deduced a trap composed of 207 places in 270 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/1906 variables, and 65 constraints, problems are : Problem set: 0 solved, 1371 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/553 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1371/1371 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
[2025-06-02 20:28:36] [INFO ] Deduced a trap composed of 82 places in 159 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 8)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/1906 variables, and 66 constraints, problems are : Problem set: 0 solved, 1371 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/553 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1371 constraints, Known Traps: 22/22 constraints]
After SMT, in 62850ms problems are : Problem set: 0 solved, 1371 unsolved
Search for dead transitions found 0 dead transitions in 62865ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75644 ms. Remains : 553/553 places, 1373/1373 transitions.
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-07 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[2] Max Struct:[+inf]
Starting property specific reduction for PolyORBLF-PT-S02J06T10-UpperBounds-01
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:28:47] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-02 20:28:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (5 resets) in 56 ms. (175 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 27 ms. (357 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-02 20:28:47] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-02 20:28:47] [INFO ] Invariant cache hit.
[2025-06-02 20:28:47] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-06-02 20:28:47] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 23 ms returned sat
[2025-06-02 20:28:48] [INFO ] [Real]Absence check using state equation in 896 ms returned sat
[2025-06-02 20:28:48] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 20:28:48] [INFO ] [Real]Added 120 Read/Feed constraints in 351 ms returned sat
[2025-06-02 20:28:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:28:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-06-02 20:28:49] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 25 ms returned sat
[2025-06-02 20:28:50] [INFO ] [Nat]Absence check using state equation in 971 ms returned sat
[2025-06-02 20:28:50] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 20:28:50] [INFO ] [Nat]Added 120 Read/Feed constraints in 751 ms returned sat
[2025-06-02 20:28:51] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 3 ms to minimize.
[2025-06-02 20:28:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 419 ms
[2025-06-02 20:28:51] [INFO ] Computed and/alt/rep : 501/1120/491 causal constraints (skipped 860 transitions) in 78 ms.
[2025-06-02 20:28:52] [INFO ] Deduced a trap composed of 229 places in 267 ms of which 4 ms to minimize.
[2025-06-02 20:28:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 403 ms
[2025-06-02 20:28:52] [INFO ] Added : 35 causal constraints over 7 iterations in 1357 ms. Result :sat
Minimization took 569 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 10 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1373/1373 transitions.
Applied a total of 0 rules in 24 ms. Remains 553 /553 variables (removed 0) and now considering 1373/1373 (removed 0) transitions.
Running 1371 sub problems to find dead transitions.
[2025-06-02 20:28:53] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-02 20:28:53] [INFO ] Invariant cache hit.
[2025-06-02 20:28:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
[2025-06-02 20:29:07] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 2 ms to minimize.
[2025-06-02 20:29:07] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 3 ms to minimize.
[2025-06-02 20:29:08] [INFO ] Deduced a trap composed of 46 places in 148 ms of which 3 ms to minimize.
[2025-06-02 20:29:08] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 2 ms to minimize.
[2025-06-02 20:29:08] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2025-06-02 20:29:08] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2025-06-02 20:29:08] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2025-06-02 20:29:08] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 0 ms to minimize.
[2025-06-02 20:29:08] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 2 ms to minimize.
[2025-06-02 20:29:08] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 2 ms to minimize.
[2025-06-02 20:29:09] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2025-06-02 20:29:09] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2025-06-02 20:29:09] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 3 ms to minimize.
[2025-06-02 20:29:09] [INFO ] Deduced a trap composed of 334 places in 260 ms of which 3 ms to minimize.
[2025-06-02 20:29:10] [INFO ] Deduced a trap composed of 315 places in 246 ms of which 3 ms to minimize.
[2025-06-02 20:29:10] [INFO ] Deduced a trap composed of 187 places in 249 ms of which 3 ms to minimize.
[2025-06-02 20:29:10] [INFO ] Deduced a trap composed of 54 places in 251 ms of which 3 ms to minimize.
[2025-06-02 20:29:11] [INFO ] Deduced a trap composed of 79 places in 253 ms of which 3 ms to minimize.
[2025-06-02 20:29:12] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 3 ms to minimize.
[2025-06-02 20:29:13] [INFO ] Deduced a trap composed of 337 places in 260 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
[2025-06-02 20:29:15] [INFO ] Deduced a trap composed of 207 places in 253 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/1906 variables, and 65 constraints, problems are : Problem set: 0 solved, 1371 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/553 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1371/1371 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
[2025-06-02 20:29:34] [INFO ] Deduced a trap composed of 82 places in 158 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/1906 variables, and 66 constraints, problems are : Problem set: 0 solved, 1371 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/553 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1371 constraints, Known Traps: 22/22 constraints]
After SMT, in 42771ms problems are : Problem set: 0 solved, 1371 unsolved
Search for dead transitions found 0 dead transitions in 42787ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42814 ms. Remains : 553/553 places, 1373/1373 transitions.
[2025-06-02 20:29:35] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)

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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="PolyORBLF-PT-S02J06T10"
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 PolyORBLF-PT-S02J06T10, 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 r167-tall-174881266100057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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