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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 15K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 223K 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 9.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 295K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 59K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 312K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K 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 906K 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-S02J04T10-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748892493166

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-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 19:28:14] [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:28:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:28:14] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2025-06-02 19:28:14] [INFO ] Transformed 752 places.
[2025-06-02 19:28:14] [INFO ] Transformed 1572 transitions.
[2025-06-02 19:28:14] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 5, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 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:[0, 0, 0, 5, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 19:28:14] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2025-06-02 19:28:14] [INFO ] Computed 54 invariants in 112 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 5, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 100, +inf, +inf, 1, +inf, 2, 1, 1, 3, +inf, 1]
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 111 ms. (89 steps per ms)
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120008 steps (26 resets) in 577 ms. (207 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 5, 2, 1, 2, 2, 1, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, 100, +inf, +inf, +inf, 2, 3, +inf]
[2025-06-02 19:28:15] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-02 19:28:15] [INFO ] Invariant cache hit.
[2025-06-02 19:28:15] [INFO ] [Real]Absence check using 15 positive place invariants in 19 ms returned sat
[2025-06-02 19:28:15] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 26 ms returned unsat
[2025-06-02 19:28:15] [INFO ] [Real]Absence check using 15 positive place invariants in 18 ms returned sat
[2025-06-02 19:28:16] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 17 ms returned unsat
[2025-06-02 19:28:16] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-02 19:28:16] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 19 ms returned unsat
[2025-06-02 19:28:16] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-02 19:28:16] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 16 ms returned unsat
[2025-06-02 19:28:16] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2025-06-02 19:28:16] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 23 ms returned unsat
[2025-06-02 19:28:16] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2025-06-02 19:28:16] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 16 ms returned unsat
[2025-06-02 19:28:16] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2025-06-02 19:28:16] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 25 ms returned unsat
[2025-06-02 19:28:16] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2025-06-02 19:28:16] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 24 ms returned unsat
[2025-06-02 19:28:16] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-06-02 19:28:16] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 17 ms returned unsat
[2025-06-02 19:28:16] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-06-02 19:28:16] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 12 ms returned unsat
[2025-06-02 19:28:17] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2025-06-02 19:28:17] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 26 ms returned sat
[2025-06-02 19:28:17] [INFO ] [Real]Absence check using state equation in 943 ms returned sat
[2025-06-02 19:28:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:28:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-02 19:28:18] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 24 ms returned sat
[2025-06-02 19:28:19] [INFO ] [Nat]Absence check using state equation in 1457 ms returned sat
[2025-06-02 19:28:19] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:28:20] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:28:20] [INFO ] [Nat]Added 120 Read/Feed constraints in 1050 ms returned unknown
[2025-06-02 19:28:20] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-02 19:28:20] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 26 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 5, 2, 1, 2, 2, 1, 1, 0, 1] Max Struct:[1, 1, 1, 5, 2, 1, 2, 2, 1, 1, 3, 1]
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 1 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 660 transition count 1322
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 182 place count 660 transition count 1242
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 342 place count 580 transition count 1242
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 502 place count 500 transition count 1162
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 522 place count 500 transition count 1142
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 542 place count 480 transition count 1142
Applied a total of 542 rules in 270 ms. Remains 480 /752 variables (removed 272) and now considering 1142/1412 (removed 270) transitions.
Running 1140 sub problems to find dead transitions.
[2025-06-02 19:28:21] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
// Phase 1: matrix 1122 rows 480 cols
[2025-06-02 19:28:21] [INFO ] Computed 52 invariants in 34 ms
[2025-06-02 19:28:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2025-06-02 19:28:33] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 20 ms to minimize.
[2025-06-02 19:28:33] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2025-06-02 19:28:33] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2025-06-02 19:28:33] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 5 ms to minimize.
[2025-06-02 19:28:33] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
[2025-06-02 19:28:33] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2025-06-02 19:28:33] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2025-06-02 19:28:33] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:28:34] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
[2025-06-02 19:28:34] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2025-06-02 19:28:34] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 2 ms to minimize.
[2025-06-02 19:28:35] [INFO ] Deduced a trap composed of 89 places in 245 ms of which 3 ms to minimize.
[2025-06-02 19:28:36] [INFO ] Deduced a trap composed of 312 places in 228 ms of which 3 ms to minimize.
[2025-06-02 19:28:36] [INFO ] Deduced a trap composed of 288 places in 241 ms of which 3 ms to minimize.
[2025-06-02 19:28:36] [INFO ] Deduced a trap composed of 286 places in 243 ms of which 3 ms to minimize.
[2025-06-02 19:28:38] [INFO ] Deduced a trap composed of 206 places in 235 ms of which 3 ms to minimize.
[2025-06-02 19:28:38] [INFO ] Deduced a trap composed of 239 places in 234 ms of which 3 ms to minimize.
[2025-06-02 19:28:40] [INFO ] Deduced a trap composed of 178 places in 251 ms of which 4 ms to minimize.
[2025-06-02 19:28:40] [INFO ] Deduced a trap composed of 170 places in 285 ms of which 10 ms to minimize.
[2025-06-02 19:28:40] [INFO ] Deduced a trap composed of 193 places in 276 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1602 variables, and 70 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1140/1140 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2025-06-02 19:28:51] [INFO ] Deduced a trap composed of 193 places in 243 ms of which 3 ms to minimize.
[2025-06-02 19:28:52] [INFO ] Deduced a trap composed of 262 places in 229 ms of which 3 ms to minimize.
[2025-06-02 19:28:52] [INFO ] Deduced a trap composed of 278 places in 224 ms of which 4 ms to minimize.
[2025-06-02 19:28:52] [INFO ] Deduced a trap composed of 166 places in 237 ms of which 3 ms to minimize.
[2025-06-02 19:28:56] [INFO ] Deduced a trap composed of 169 places in 266 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1602 variables, and 75 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1140 constraints, Known Traps: 25/25 constraints]
After SMT, in 42673ms problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 42727ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43021 ms. Remains : 480/752 places, 1142/1412 transitions.
[2025-06-02 19:29:03] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2025-06-02 19:29:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 1000000 steps (327 resets) in 5853 ms. (170 steps per ms)
BEST_FIRST walk for 1000001 steps (137 resets) in 2618 ms. (381 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2025-06-02 19:29:12] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2025-06-02 19:29:12] [INFO ] Invariant cache hit.
[2025-06-02 19:29:12] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-06-02 19:29:12] [INFO ] [Real]Absence check using 15 positive and 37 generalized place invariants in 18 ms returned sat
[2025-06-02 19:29:12] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2025-06-02 19:29:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:29:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-02 19:29:13] [INFO ] [Nat]Absence check using 15 positive and 37 generalized place invariants in 30 ms returned sat
[2025-06-02 19:29:23] [INFO ] [Nat]Absence check using state equation in 10884 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 1 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1142/1142 transitions.
Applied a total of 0 rules in 35 ms. Remains 480 /480 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 480/480 places, 1142/1142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1142/1142 transitions.
Applied a total of 0 rules in 48 ms. Remains 480 /480 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
[2025-06-02 19:29:24] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2025-06-02 19:29:24] [INFO ] Invariant cache hit.
[2025-06-02 19:29:24] [INFO ] Implicit Places using invariants in 647 ms returned [3, 58, 120, 171, 248, 276, 333, 364, 372, 429]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 652 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 470/480 places, 1142/1142 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 461 transition count 1133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 461 transition count 1133
Applied a total of 18 rules in 42 ms. Remains 461 /470 variables (removed 9) and now considering 1133/1142 (removed 9) transitions.
[2025-06-02 19:29:24] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
// Phase 1: matrix 1113 rows 461 cols
[2025-06-02 19:29:24] [INFO ] Computed 42 invariants in 30 ms
[2025-06-02 19:29:25] [INFO ] Implicit Places using invariants in 554 ms returned []
[2025-06-02 19:29:25] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2025-06-02 19:29:25] [INFO ] Invariant cache hit.
[2025-06-02 19:29:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:29:35] [INFO ] Implicit Places using invariants and state equation in 9853 ms returned []
Implicit Place search using SMT with State Equation took 10408 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 461/480 places, 1133/1142 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11152 ms. Remains : 461/480 places, 1133/1142 transitions.
[2025-06-02 19:29:35] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2025-06-02 19:29:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 1000000 steps (344 resets) in 5493 ms. (182 steps per ms)
BEST_FIRST walk for 1000000 steps (132 resets) in 2342 ms. (426 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2025-06-02 19:29:43] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2025-06-02 19:29:43] [INFO ] Invariant cache hit.
[2025-06-02 19:29:43] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-02 19:29:43] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 11 ms returned sat
[2025-06-02 19:29:43] [INFO ] [Real]Absence check using state equation in 775 ms returned sat
[2025-06-02 19:29:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:29:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 22 ms returned sat
[2025-06-02 19:29:44] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 16 ms returned sat
[2025-06-02 19:29:53] [INFO ] [Nat]Absence check using state equation in 9314 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 1 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1133/1133 transitions.
Applied a total of 0 rules in 23 ms. Remains 461 /461 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 461/461 places, 1133/1133 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1133/1133 transitions.
Applied a total of 0 rules in 22 ms. Remains 461 /461 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
[2025-06-02 19:29:53] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2025-06-02 19:29:53] [INFO ] Invariant cache hit.
[2025-06-02 19:29:53] [INFO ] Implicit Places using invariants in 504 ms returned []
[2025-06-02 19:29:53] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2025-06-02 19:29:53] [INFO ] Invariant cache hit.
[2025-06-02 19:29:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:30:04] [INFO ] Implicit Places using invariants and state equation in 10459 ms returned []
Implicit Place search using SMT with State Equation took 10965 ms to find 0 implicit places.
[2025-06-02 19:30:04] [INFO ] Redundant transitions in 64 ms returned []
Running 1131 sub problems to find dead transitions.
[2025-06-02 19:30:04] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2025-06-02 19:30:04] [INFO ] Invariant cache hit.
[2025-06-02 19:30:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2025-06-02 19:30:15] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 2 ms to minimize.
[2025-06-02 19:30:15] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 2 ms to minimize.
[2025-06-02 19:30:15] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2025-06-02 19:30:15] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:30:15] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 0 ms to minimize.
[2025-06-02 19:30:15] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2025-06-02 19:30:15] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2025-06-02 19:30:15] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:30:15] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:30:15] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:30:15] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:30:16] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 2 ms to minimize.
[2025-06-02 19:30:16] [INFO ] Deduced a trap composed of 97 places in 227 ms of which 3 ms to minimize.
[2025-06-02 19:30:17] [INFO ] Deduced a trap composed of 96 places in 231 ms of which 5 ms to minimize.
[2025-06-02 19:30:21] [INFO ] Deduced a trap composed of 271 places in 224 ms of which 3 ms to minimize.
[2025-06-02 19:30:21] [INFO ] Deduced a trap composed of 270 places in 218 ms of which 3 ms to minimize.
[2025-06-02 19:30:24] [INFO ] Deduced a trap composed of 3 places in 232 ms of which 3 ms to minimize.
[2025-06-02 19:30:24] [INFO ] Deduced a trap composed of 181 places in 212 ms of which 2 ms to minimize.
[2025-06-02 19:30:24] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 3 ms to minimize.
[2025-06-02 19:30:25] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2025-06-02 19:30:27] [INFO ] Deduced a trap composed of 184 places in 232 ms of which 3 ms to minimize.
[2025-06-02 19:30:27] [INFO ] Deduced a trap composed of 182 places in 226 ms of which 3 ms to minimize.
[2025-06-02 19:30:31] [INFO ] Deduced a trap composed of 198 places in 214 ms of which 3 ms to minimize.
[2025-06-02 19:30:34] [INFO ] Deduced a trap composed of 245 places in 236 ms of which 3 ms to minimize.
[2025-06-02 19:30:34] [INFO ] Deduced a trap composed of 204 places in 239 ms of which 3 ms to minimize.
[2025-06-02 19:30:34] [INFO ] Deduced a trap composed of 179 places in 233 ms of which 3 ms to minimize.
[2025-06-02 19:30:35] [INFO ] Deduced a trap composed of 172 places in 215 ms of which 3 ms to minimize.
[2025-06-02 19:30:36] [INFO ] Deduced a trap composed of 188 places in 232 ms of which 3 ms to minimize.
SMT process timed out in 32374ms, After SMT, problems are : Problem set: 0 solved, 1131 unsolved
Search for dead transitions found 0 dead transitions in 32387ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43449 ms. Remains : 461/461 places, 1133/1133 transitions.
RANDOM walk for 40000 steps (19 resets) in 1311 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 472 ms. (84 steps per ms) remains 2/2 properties
[2025-06-02 19:30:37] [INFO ] Flatten gal took : 305 ms
BEST_FIRST walk for 40003 steps (8 resets) in 461 ms. (86 steps per ms) remains 2/2 properties
[2025-06-02 19:30:37] [INFO ] Flatten gal took : 116 ms
[2025-06-02 19:30:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10120621791678373475.gal : 49 ms
[2025-06-02 19:30:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8087129727479081672.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/ReachabilityCardinality10120621791678373475.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8087129727479081672.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/ReachabilityCardinality8087129727479081672.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 23
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :23 after 28
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :28 after 70
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :70 after 270
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :270 after 850
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :850 after 1940
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1940 after 15312
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :15312 after 22946
Interrupted probabilistic random walk after 146394 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 2
Probabilistic random walk after 146394 steps, saw 93058 distinct states, run finished after 3004 ms. (steps per millisecond=48 ) properties seen :0
[2025-06-02 19:30:40] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2025-06-02 19:30:40] [INFO ] Invariant cache hit.
[2025-06-02 19:30:40] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 78/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/81 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 327/408 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/418 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 40/458 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :22946 after 25446
[2025-06-02 19:30:41] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 2 ms to minimize.
[2025-06-02 19:30:41] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 2 ms to minimize.
[2025-06-02 19:30:41] [INFO ] Deduced a trap composed of 38 places in 356 ms of which 4 ms to minimize.
[2025-06-02 19:30:41] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 9 ms to minimize.
[2025-06-02 19:30:42] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2025-06-02 19:30:42] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 1 ms to minimize.
[2025-06-02 19:30:42] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 1 ms to minimize.
[2025-06-02 19:30:42] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2025-06-02 19:30:42] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/459 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/459 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1113/1572 variables, 459/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :25446 after 33720
At refinement iteration 15 (INCLUDED_ONLY) 0/1572 variables, 120/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1572 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1574 variables, 2/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/1574 variables, 1/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1574 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1574 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1574/1574 variables, and 632 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3977 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 461/461 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 78/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/81 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 327/408 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/418 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 40/458 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:30:44] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/459 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/459 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1572/1574 variables, and 510 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1715 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 459/461 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 5709ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 190 ms.
Support contains 1 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1133/1133 transitions.
Applied a total of 0 rules in 27 ms. Remains 461 /461 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
Running 1131 sub problems to find dead transitions.
[2025-06-02 19:30:46] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2025-06-02 19:30:46] [INFO ] Invariant cache hit.
[2025-06-02 19:30:46] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :33720 after 350762
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2025-06-02 19:30:57] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 4 ms to minimize.
[2025-06-02 19:30:57] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2025-06-02 19:30:58] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2025-06-02 19:30:58] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
[2025-06-02 19:30:58] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2025-06-02 19:30:58] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2025-06-02 19:30:58] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2025-06-02 19:30:58] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:30:58] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2025-06-02 19:30:58] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2025-06-02 19:30:58] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:30:58] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2025-06-02 19:30:59] [INFO ] Deduced a trap composed of 97 places in 197 ms of which 3 ms to minimize.
[2025-06-02 19:30:59] [INFO ] Deduced a trap composed of 96 places in 200 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :350762 after 1.43128e+06
[2025-06-02 19:31:04] [INFO ] Deduced a trap composed of 271 places in 220 ms of which 3 ms to minimize.
[2025-06-02 19:31:04] [INFO ] Deduced a trap composed of 270 places in 222 ms of which 2 ms to minimize.
[2025-06-02 19:31:07] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 3 ms to minimize.
[2025-06-02 19:31:07] [INFO ] Deduced a trap composed of 181 places in 225 ms of which 3 ms to minimize.
[2025-06-02 19:31:07] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 2 ms to minimize.
[2025-06-02 19:31:07] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/1574 variables, and 60 constraints, problems are : Problem set: 0 solved, 1131 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/461 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1131/1131 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2025-06-02 19:31:13] [INFO ] Deduced a trap composed of 182 places in 244 ms of which 3 ms to minimize.
[2025-06-02 19:31:18] [INFO ] Deduced a trap composed of 178 places in 208 ms of which 2 ms to minimize.
[2025-06-02 19:31:23] [INFO ] Deduced a trap composed of 187 places in 213 ms of which 2 ms to minimize.
[2025-06-02 19:31:23] [INFO ] Deduced a trap composed of 188 places in 204 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 19:31:27] [INFO ] Flatten gal took : 138 ms
[2025-06-02 19:31:27] [INFO ] Applying decomposition
[2025-06-02 19:31:28] [INFO ] Flatten gal took : 106 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/graph16896165406403674397.txt' '-o' '/tmp/graph16896165406403674397.bin' '-w' '/tmp/graph16896165406403674397.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16896165406403674397.bin' '-l' '-1' '-v' '-w' '/tmp/graph16896165406403674397.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:31:28] [INFO ] Deduced a trap composed of 198 places in 868 ms of which 3 ms to minimize.
[2025-06-02 19:31:28] [INFO ] Decomposing Gal with order
[2025-06-02 19:31:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:31:29] [INFO ] Deduced a trap composed of 212 places in 435 ms of which 17 ms to minimize.
SMT process timed out in 42556ms, After SMT, problems are : Problem set: 0 solved, 1131 unsolved
Search for dead transitions found 0 dead transitions in 42570ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42602 ms. Remains : 461/461 places, 1133/1133 transitions.
[2025-06-02 19:31:29] [INFO ] Removed a total of 1258 redundant transitions.
RANDOM walk for 40000 steps (16 resets) in 703 ms. (56 steps per ms) remains 2/2 properties
[2025-06-02 19:31:29] [INFO ] Flatten gal took : 744 ms
BEST_FIRST walk for 40003 steps (11 resets) in 244 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 324 ms. (123 steps per ms) remains 2/2 properties
[2025-06-02 19:31:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 583 labels/synchronizations in 99 ms.
[2025-06-02 19:31:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11197832219784623862.gal : 31 ms
[2025-06-02 19:31:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3271041934855723485.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/ReachabilityCardinality11197832219784623862.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3271041934855723485.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/ReachabilityCardinality3271041934855723485.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 20
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :20 after 20
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :20 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 20
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :20 after 20
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :20 after 116
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :116 after 116
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :116 after 356
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :356 after 3337
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3337 after 4710
Interrupted probabilistic random walk after 140672 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 2
Probabilistic random walk after 140672 steps, saw 89493 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
[2025-06-02 19:31:32] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2025-06-02 19:31:32] [INFO ] Invariant cache hit.
[2025-06-02 19:31:32] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 78/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/81 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 327/408 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/418 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 40/458 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:31:32] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2025-06-02 19:31:33] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4710 after 20311
[2025-06-02 19:31:33] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2025-06-02 19:31:33] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 1 ms to minimize.
[2025-06-02 19:31:33] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2025-06-02 19:31:33] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2025-06-02 19:31:33] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2025-06-02 19:31:33] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:31:33] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/459 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/459 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1113/1572 variables, 459/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1572 variables, 120/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1572 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1574 variables, 2/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1574 variables, 1/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1574 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1574 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1574/1574 variables, and 632 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2854 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 461/461 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 78/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/81 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 327/408 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/418 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 40/458 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:31:35] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/459 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/459 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1113/1572 variables, 459/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :20311 after 30498
At refinement iteration 16 (INCLUDED_ONLY) 0/1572 variables, 120/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 1572/1574 variables, and 632 constraints, problems are : Problem set: 2 solved, 0 unsolved in 2069 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 459/461 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 4942ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-13 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 203216 ms.

BK_STOP 1748892697671

--------------------
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="PolyORBLF-PT-S02J04T10"
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-S02J04T10, 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-174881266100054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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