About the Execution of ITS-Tools for PolyORBLF-PT-S02J06T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | 1 ? 10 2 1 1 1 0 1 1 10 1 1 2 1 1 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254000453.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is PolyORBLF-PT-S02J06T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254000453
=====================================================================
--------------------
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 1748991259771
Invoking MCC driver with
BK_TOOL=itstools
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 202505121319
[2025-06-03 22:54:20] [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-03 22:54:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 22:54:21] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2025-06-03 22:54:21] [INFO ] Transformed 844 places.
[2025-06-03 22:54:21] [INFO ] Transformed 1812 transitions.
[2025-06-03 22:54:21] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 343 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:[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-03 22:54:21] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2025-06-03 22:54:21] [INFO ] Computed 58 invariants in 147 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 (3 resets) in 122 ms. (81 steps per ms)
BEST_FIRST walk for 140008 steps (32 resets) in 561 ms. (249 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-03 22:54:22] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2025-06-03 22:54:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 22:54:22] [INFO ] [Real]Absence check using 13 positive place invariants in 40 ms returned sat
[2025-06-03 22:54:22] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 47 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 22:54:22] [INFO ] [Real]Absence check using 13 positive place invariants in 39 ms returned sat
[2025-06-03 22:54:22] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 39 ms returned sat
[2025-06-03 22:54:23] [INFO ] [Real]Absence check using state equation in 998 ms returned sat
[2025-06-03 22:54:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 22:54:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 23 ms returned sat
[2025-06-03 22:54:24] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 34 ms returned sat
[2025-06-03 22:54:26] [INFO ] [Nat]Absence check using state equation in 1946 ms returned sat
[2025-06-03 22:54:26] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 22:54:26] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 22:54:27] [INFO ] [Nat]Added 120 Read/Feed constraints in 1010 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 22:54:27] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2025-06-03 22:54:27] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 16 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 22:54:27] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2025-06-03 22:54:27] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 11 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 22:54:27] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2025-06-03 22:54:27] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 19 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 22:54:27] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2025-06-03 22:54:27] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 31 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 22:54:27] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2025-06-03 22:54:27] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 30 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 22:54:27] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2025-06-03 22:54:27] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 36 ms returned sat
[2025-06-03 22:54:29] [INFO ] [Real]Absence check using state equation in 1539 ms returned sat
[2025-06-03 22:54:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 22:54:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2025-06-03 22:54:29] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 38 ms returned sat
[2025-06-03 22:54:31] [INFO ] [Nat]Absence check using state equation in 1564 ms returned sat
[2025-06-03 22:54:31] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 22:54:32] [INFO ] [Nat]Added 120 Read/Feed constraints in 1009 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 22:54:32] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2025-06-03 22:54:32] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 49 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 22:54:32] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2025-06-03 22:54:32] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 29 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 22:54:32] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2025-06-03 22:54:32] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 30 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 22:54:32] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-03 22:54:32] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 23 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 22:54:32] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-03 22:54:32] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 39 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 22:54:32] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-03 22:54:33] [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 3 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 333 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-03 22:54:33] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
// Phase 1: matrix 1362 rows 572 cols
[2025-06-03 22:54:33] [INFO ] Computed 56 invariants in 33 ms
[2025-06-03 22:54:33] [INFO ] State equation strengthened by 120 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:54:47] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:54:47] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:54:47] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:54:47] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:54:47] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:54:48] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:54:48] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:54:48] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:54:48] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:54:48] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:54:48] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:54:49] [INFO ] Deduced a trap composed of 77 places in 328 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:54:50] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 27 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1934 variables, and 67 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20039 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/1320 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1380 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
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, 13/67 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1934 variables, and 67 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20033 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: 60/1320 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41775ms problems are : Problem set: 0 solved, 1380 unsolved
Search for dead transitions found 0 dead transitions in 41814ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42197 ms. Remains : 572/844 places, 1382/1652 transitions.
[2025-06-03 22:55:15] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
[2025-06-03 22:56:32] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2025-06-03 22:56:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0] Max Struct:[+inf, 3]
RANDOM walk for 1000000 steps (308 resets) in 5649 ms. (176 steps per ms)
BEST_FIRST walk for 2000002 steps (246 resets) in 5035 ms. (397 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 0] Max Struct:[+inf, 3]
[2025-06-03 22:56:43] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2025-06-03 22:56:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 22:56:43] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2025-06-03 22:56:43] [INFO ] [Real]Absence check using 16 positive and 40 generalized place invariants in 26 ms returned sat
[2025-06-03 22:56:44] [INFO ] [Real]Absence check using state equation in 837 ms returned sat
[2025-06-03 22:56:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 22:56:44] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2025-06-03 22:56:44] [INFO ] [Nat]Absence check using 16 positive and 40 generalized place invariants in 22 ms returned sat
[2025-06-03 22:56:47] [INFO ] [Nat]Absence check using state equation in 2599 ms returned sat
[2025-06-03 22:56:47] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 22:56:47] [INFO ] [Nat]Added 120 Read/Feed constraints in 569 ms returned sat
[2025-06-03 22:56:47] [INFO ] Computed and/alt/rep : 510/1138/500 causal constraints (skipped 860 transitions) in 135 ms.
[2025-06-03 22:56:48] [INFO ] Added : 19 causal constraints over 4 iterations in 542 ms. Result :sat
Minimization took 4580 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 22:56:53] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-06-03 22:56:53] [INFO ] [Real]Absence check using 16 positive and 40 generalized place invariants in 18 ms returned sat
[2025-06-03 22:56:53] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2025-06-03 22:56:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 22:56:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-06-03 22:56:53] [INFO ] [Nat]Absence check using 16 positive and 40 generalized place invariants in 17 ms returned sat
[2025-06-03 22:56:55] [INFO ] [Nat]Absence check using state equation in 1274 ms returned sat
[2025-06-03 22:56:56] [INFO ] [Nat]Added 120 Read/Feed constraints in 1549 ms returned sat
[2025-06-03 22:56:56] [INFO ] Computed and/alt/rep : 510/1138/500 causal constraints (skipped 860 transitions) in 101 ms.
[2025-06-03 22:56:57] [INFO ] Added : 22 causal constraints over 5 iterations in 618 ms. Result :sat
Minimization took 4526 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 40 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 41 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 34 ms. Remains 572 /572 variables (removed 0) and now considering 1382/1382 (removed 0) transitions.
[2025-06-03 22:57:01] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2025-06-03 22:57:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:57:03] [INFO ] Implicit Places using invariants in 1784 ms returned [68, 137, 169, 302, 350, 379, 382, 424, 539, 570]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1789 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 43 ms. Remains 553 /562 variables (removed 9) and now considering 1373/1382 (removed 9) transitions.
[2025-06-03 22:57:03] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
// Phase 1: matrix 1353 rows 553 cols
[2025-06-03 22:57:03] [INFO ] Computed 46 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:57:05] [INFO ] Implicit Places using invariants in 1435 ms returned []
[2025-06-03 22:57:05] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-03 22:57:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:57:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 22:57:23] [INFO ] Implicit Places using invariants and state equation in 18092 ms returned []
Implicit Place search using SMT with State Equation took 19530 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 21396 ms. Remains : 553/572 places, 1373/1382 transitions.
[2025-06-03 22:57:23] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
[2025-06-03 23:21:25] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-03 23:21:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0] Max Struct:[+inf, 3]
RANDOM walk for 1000000 steps (314 resets) in 5123 ms. (195 steps per ms)
BEST_FIRST walk for 2000001 steps (249 resets) in 4513 ms. (443 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 0] Max Struct:[+inf, 3]
[2025-06-03 23:21:35] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-03 23:21:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 23:21:35] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-06-03 23:21:35] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 30 ms returned sat
[2025-06-03 23:21:36] [INFO ] [Real]Absence check using state equation in 887 ms returned sat
[2025-06-03 23:21:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 23:21:36] [INFO ] [Real]Added 120 Read/Feed constraints in 349 ms returned sat
[2025-06-03 23:21:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 23:21:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-03 23:21:36] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 22 ms returned sat
[2025-06-03 23:21:37] [INFO ] [Nat]Absence check using state equation in 887 ms returned sat
[2025-06-03 23:21:38] [INFO ] [Nat]Added 120 Read/Feed constraints in 613 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:21:38] [INFO ] Deduced a trap composed of 23 places in 303 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:21:39] [INFO ] Deduced a trap composed of 177 places in 347 ms of which 82 ms to minimize.
[2025-06-03 23:21:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1110 ms
[2025-06-03 23:21:39] [INFO ] Computed and/alt/rep : 501/1120/491 causal constraints (skipped 860 transitions) in 68 ms.
[2025-06-03 23:21:40] [INFO ] Added : 23 causal constraints over 5 iterations in 573 ms. Result :sat
Minimization took 4622 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 23:21:44] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-03 23:21:44] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 28 ms returned sat
[2025-06-03 23:21:45] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2025-06-03 23:21:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 23:21:45] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2025-06-03 23:21:45] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 27 ms returned sat
[2025-06-03 23:21:47] [INFO ] [Nat]Absence check using state equation in 1768 ms returned sat
[2025-06-03 23:21:48] [INFO ] [Nat]Added 120 Read/Feed constraints in 1004 ms returned sat
[2025-06-03 23:21:48] [INFO ] Computed and/alt/rep : 501/1120/491 causal constraints (skipped 860 transitions) in 67 ms.
[2025-06-03 23:21:48] [INFO ] Added : 19 causal constraints over 4 iterations in 459 ms. Result :sat
Minimization took 4620 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 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 34 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 35 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-03 23:21:53] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-03 23:21:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 23:21:55] [INFO ] Implicit Places using invariants in 1505 ms returned []
[2025-06-03 23:21:55] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-03 23:21:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 23:21:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 23:22:13] [INFO ] Implicit Places using invariants and state equation in 18321 ms returned []
Implicit Place search using SMT with State Equation took 19828 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 23:22:13] [INFO ] Redundant transitions in 81 ms returned []
Running 1371 sub problems to find dead transitions.
[2025-06-03 23:22:13] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-03 23:22:13] [INFO ] Invariant cache hit.
[2025-06-03 23:22:13] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:22:27] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:22:27] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:22:27] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:22:27] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:22:27] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:22:27] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:22:27] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:22:28] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:22:28] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:22:28] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:22:28] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:22:28] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:22:29] [INFO ] Deduced a trap composed of 186 places in 346 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:22:30] [INFO ] Deduced a trap composed of 42 places in 283 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:22:30] [INFO ] Deduced a trap composed of 77 places in 300 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:22:42] [INFO ] Deduced a trap composed of 343 places in 391 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:22:43] [INFO ] Deduced a trap composed of 352 places in 352 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:22:44] [INFO ] Deduced a trap composed of 177 places in 320 ms of which 83 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/1906 variables, and 62 constraints, problems are : Problem set: 0 solved, 1371 unsolved in 30026 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: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1371 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 18/62 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/1906 variables, and 62 constraints, problems are : Problem set: 0 solved, 1371 unsolved in 30036 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: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61364ms problems are : Problem set: 0 solved, 1371 unsolved
Search for dead transitions found 0 dead transitions in 61368ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81310 ms. Remains : 553/553 places, 1373/1373 transitions.
[2025-06-03 23:23:14] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
RANDOM walk for 40001 steps (15 resets) in 959 ms. (41 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (11 resets) in 369 ms. (108 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (13 resets) in 322 ms. (123 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (11 resets) in 289 ms. (137 steps per ms) remains 3/3 properties
[2025-06-03 23:47:19] [INFO ] Flatten gal took : 224 ms
[2025-06-03 23:47:19] [INFO ] Flatten gal took : 111 ms
[2025-06-03 23:47:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13135404066796198617.gal : 42 ms
[2025-06-03 23:47:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6586980429971120651.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13135404066796198617.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6586980429971120651.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6586980429971120651.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
Interrupted probabilistic random walk after 115990 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 3
Probabilistic random walk after 115990 steps, saw 79140 distinct states, run finished after 3005 ms. (steps per millisecond=38 ) properties seen :0
[2025-06-03 23:47:21] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-03 23:47:21] [INFO ] Invariant cache hit.
[2025-06-03 23:47:21] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :2180 after 2704
[2025-06-03 23:47:22] [INFO ] Deduced a trap composed of 229 places in 436 ms of which 158 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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:22] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:22] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:22] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:22] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:23] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:23] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:23] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:23] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :2704 after 4242
At refinement iteration 9 (OVERLAPS) 1353/1904 variables, 551/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1904 variables, 120/725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1904 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/1906 variables, 2/727 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1906 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1906 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1906 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1906/1906 variables, and 728 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3803 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: 3/3 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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
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
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1353/1904 variables, 551/605 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
At refinement iteration 10 (INCLUDED_ONLY) 0/1904 variables, 120/725 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 728 constraints, problems are : Problem set: 2 solved, 1 unsolved in 3092 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: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6913ms 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 39 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-03 23:47:28] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-03 23:47:28] [INFO ] Invariant cache hit.
[2025-06-03 23:47:28] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:43] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:43] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:43] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:43] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:43] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:43] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:43] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:43] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:43] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:44] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:44] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:44] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:45] [INFO ] Deduced a trap composed of 186 places in 365 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:45] [INFO ] Deduced a trap composed of 42 places in 312 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:47:46] [INFO ] Deduced a trap composed of 77 places in 324 ms of which 58 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :47734 after 77816
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/1906 variables, and 59 constraints, problems are : Problem set: 0 solved, 1371 unsolved in 20023 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: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1371 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 15/15 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-03 23:48:09] [INFO ] Flatten gal took : 71 ms
[2025-06-03 23:48:09] [INFO ] Applying decomposition
[2025-06-03 23:48:09] [INFO ] Flatten gal took : 61 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14176182666207836540.txt' '-o' '/tmp/graph14176182666207836540.bin' '-w' '/tmp/graph14176182666207836540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14176182666207836540.bin' '-l' '-1' '-v' '-w' '/tmp/graph14176182666207836540.weights' '-q' '0' '-e' '0.001'
[2025-06-03 23:48:09] [INFO ] Decomposing Gal with order
[2025-06-03 23:48:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 23:48:10] [INFO ] Removed a total of 927 redundant transitions.
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
SMT process timed out in 41612ms, After SMT, problems are : Problem set: 0 solved, 1371 unsolved
Search for dead transitions found 0 dead transitions in 41617ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41663 ms. Remains : 553/553 places, 1373/1373 transitions.
[2025-06-03 23:48:10] [INFO ] Flatten gal took : 311 ms
[2025-06-03 23:48:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 573 labels/synchronizations in 43 ms.
RANDOM walk for 40000 steps (11 resets) in 510 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (9 resets) in 291 ms. (136 steps per ms) remains 1/1 properties
[2025-06-03 23:48:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4969437105714464414.gal : 14 ms
[2025-06-03 23:48:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6269654711547423809.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4969437105714464414.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6269654711547423809.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6269654711547423809.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 11
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :11 after 45
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :45 after 71
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :71 after 80
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :80 after 1540
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1540 after 1632
Interrupted probabilistic random walk after 156500 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 1
Probabilistic random walk after 156500 steps, saw 105394 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2025-06-03 23:48:13] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-03 23:48:13] [INFO ] Invariant cache hit.
[2025-06-03 23:48:13] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1632 after 1780
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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
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 1299 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1780 after 2684
[2025-06-03 23:48:15] [INFO ] Deduced a trap composed of 237 places in 367 ms of which 93 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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:15] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:15] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:15] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:15] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:16] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:16] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:16] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:16] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 2 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
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2684 after 6464
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
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :6464 after 18656
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:19] [INFO ] Deduced a trap composed of 23 places in 327 ms of which 36 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1906 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1906 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1906 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1906/1906 variables, and 730 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5712 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: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7026ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 67 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 25 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 24 ms. Remains 553 /553 variables (removed 0) and now considering 1373/1373 (removed 0) transitions.
[2025-06-03 23:48:20] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-03 23:48:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 23:48:22] [INFO ] Implicit Places using invariants in 1510 ms returned []
[2025-06-03 23:48:22] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-03 23:48:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 23:48:23] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :18656 after 68582
[2025-06-03 23:48:39] [INFO ] Implicit Places using invariants and state equation in 17529 ms returned []
Implicit Place search using SMT with State Equation took 19052 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 23:48:39] [INFO ] Redundant transitions in 70 ms returned []
Running 1371 sub problems to find dead transitions.
[2025-06-03 23:48:39] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-03 23:48:39] [INFO ] Invariant cache hit.
[2025-06-03 23:48:39] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :68582 after 182456
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:53] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:53] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:53] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:54] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:54] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:54] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:54] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:54] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:54] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:54] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:54] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:55] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:55] [INFO ] Deduced a trap composed of 186 places in 369 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:56] [INFO ] Deduced a trap composed of 42 places in 337 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:48:56] [INFO ] Deduced a trap composed of 77 places in 319 ms of which 60 ms to minimize.
Detected timeout of ITS tools.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:09] [INFO ] Deduced a trap composed of 343 places in 392 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:09] [INFO ] Deduced a trap composed of 352 places in 372 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:11] [INFO ] Deduced a trap composed of 177 places in 327 ms of which 82 ms to minimize.
SMT process timed out in 31650ms, After SMT, problems are : Problem set: 0 solved, 1371 unsolved
Search for dead transitions found 0 dead transitions in 31654ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50811 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-03 23:49:11] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-03 23:49:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (9 resets) in 77 ms. (128 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 25 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 23:49:11] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-03 23:49:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 23:49:11] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-03 23:49:11] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 24 ms returned sat
[2025-06-03 23:49:12] [INFO ] [Real]Absence check using state equation in 880 ms returned sat
[2025-06-03 23:49:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 23:49:12] [INFO ] [Real]Added 120 Read/Feed constraints in 350 ms returned sat
[2025-06-03 23:49:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 23:49:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-06-03 23:49:12] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 22 ms returned sat
[2025-06-03 23:49:13] [INFO ] [Nat]Absence check using state equation in 904 ms returned sat
[2025-06-03 23:49:14] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 23:49:14] [INFO ] [Nat]Added 120 Read/Feed constraints in 781 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:14] [INFO ] Deduced a trap composed of 23 places in 302 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:15] [INFO ] Deduced a trap composed of 177 places in 345 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:15] [INFO ] Deduced a trap composed of 196 places in 347 ms of which 95 ms to minimize.
[2025-06-03 23:49:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1312 ms
[2025-06-03 23:49:16] [INFO ] Computed and/alt/rep : 501/1120/491 causal constraints (skipped 860 transitions) in 97 ms.
[2025-06-03 23:49:17] [INFO ] Added : 43 causal constraints over 9 iterations in 1449 ms. Result :sat
Minimization took 460 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 29 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-03 23:49:17] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
[2025-06-03 23:49:17] [INFO ] Invariant cache hit.
[2025-06-03 23:49:17] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:31] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:31] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:32] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:32] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:32] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:32] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:32] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:32] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:32] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:32] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:32] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:33] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:33] [INFO ] Deduced a trap composed of 186 places in 369 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:34] [INFO ] Deduced a trap composed of 42 places in 353 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 23:49:34] [INFO ] Deduced a trap composed of 77 places in 333 ms of which 59 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/1906 variables, and 59 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: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1371 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
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
SMT process timed out in 41463ms, After SMT, problems are : Problem set: 0 solved, 1371 unsolved
Search for dead transitions found 0 dead transitions in 41467ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41499 ms. Remains : 553/553 places, 1373/1373 transitions.
[2025-06-03 23:49:59] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
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
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S02J06T10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is 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 r156-tall-174881254000453"
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 '
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 ;