About the Execution of ITS-Tools for RingSingleMessageInMbox-PT-d0m080
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 245769.00 | 0.00 | 0.00 | 0 0 0 78 1 1 0 0 0 0 1 0 0 0 0 0 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r184-tall-174889264100397.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 RingSingleMessageInMbox-PT-d0m080, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889264100397
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 64K 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 RingSingleMessageInMbox-PT-d0m080-UpperBounds-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-UpperBounds-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-UpperBounds-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-UpperBounds-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-UpperBounds-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-UpperBounds-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-UpperBounds-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-UpperBounds-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-UpperBounds-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-UpperBounds-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-UpperBounds-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-UpperBounds-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-UpperBounds-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-UpperBounds-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-UpperBounds-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749068076158
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d0m080
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-04 20:14:37] [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-04 20:14:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 20:14:37] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2025-06-04 20:14:37] [INFO ] Transformed 385 places.
[2025-06-04 20:14:37] [INFO ] Transformed 59 transitions.
[2025-06-04 20:14:37] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d0m080-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 59 rows 56 cols
[2025-06-04 20:14:37] [INFO ] Computed 5 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[143, 1, 7, 1, 1]
RANDOM walk for 10000 steps (2143 resets) in 27 ms. (357 steps per ms)
FORMULA RingSingleMessageInMbox-PT-d0m080-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (3753 resets) in 56 ms. (701 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 0, 0, 0] Max Struct:[143, 7, 1, 1]
[2025-06-04 20:14:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 20:14:37] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2025-06-04 20:14:37] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-04 20:14:37] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-06-04 20:14:37] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-04 20:14:37] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2025-06-04 20:14:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 20:14:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-06-04 20:14:37] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-04 20:14:37] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-04 20:14:37] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2025-06-04 20:14:37] [INFO ] Computed and/alt/rep : 18/36/18 causal constraints (skipped 40 transitions) in 9 ms.
[2025-06-04 20:14:38] [INFO ] Added : 1 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 19 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 20:14:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-04 20:14:38] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-04 20:14:38] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-04 20:14:38] [INFO ] [Real]Added 27 Read/Feed constraints in 7 ms returned sat
[2025-06-04 20:14:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 20:14:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-04 20:14:38] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-04 20:14:38] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-04 20:14:38] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:14:38] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:14:38] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
[2025-06-04 20:14:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2025-06-04 20:14:38] [INFO ] Computed and/alt/rep : 18/36/18 causal constraints (skipped 40 transitions) in 5 ms.
[2025-06-04 20:14:38] [INFO ] Added : 11 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 17 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 20:14:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-04 20:14:38] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-04 20:14:38] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 20:14:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-04 20:14:38] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-04 20:14:38] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-04 20:14:38] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2025-06-04 20:14:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 20:14:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-04 20:14:38] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-04 20:14:38] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-04 20:14:38] [INFO ] [Nat]Added 27 Read/Feed constraints in 8 ms returned sat
[2025-06-04 20:14:38] [INFO ] Computed and/alt/rep : 18/36/18 causal constraints (skipped 40 transitions) in 6 ms.
[2025-06-04 20:14:38] [INFO ] Added : 4 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 0, 0, 0] Max Struct:[143, 7, 0, 1]
FORMULA RingSingleMessageInMbox-PT-d0m080-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RingSingleMessageInMbox-PT-d0m080-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0] Max Struct:[143, 7]
Support contains 2 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 59/59 transitions.
Graph (complete) has 148 edges and 56 vertex of which 53 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 53 transition count 56
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 47 transition count 48
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 47 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 46 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 46 transition count 47
Applied a total of 18 rules in 21 ms. Remains 46 /56 variables (removed 10) and now considering 47/59 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 46/56 places, 47/59 transitions.
// Phase 1: matrix 47 rows 46 cols
[2025-06-04 20:14:38] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0] Max Struct:[143, 7]
RANDOM walk for 1000000 steps (216913 resets) in 799 ms. (1250 steps per ms)
BEST_FIRST walk for 2000002 steps (186171 resets) in 725 ms. (2754 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 1] Max Struct:[143, 7]
[2025-06-04 20:14:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 20:14:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-04 20:14:40] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-04 20:14:40] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-04 20:14:40] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-04 20:14:40] [INFO ] [Real]Added 18 Read/Feed constraints in 2 ms returned sat
[2025-06-04 20:14:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 20:14:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-04 20:14:40] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-04 20:14:40] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-04 20:14:40] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2025-06-04 20:14:40] [INFO ] Computed and/alt/rep : 12/26/12 causal constraints (skipped 34 transitions) in 3 ms.
[2025-06-04 20:14:40] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 13 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 20:14:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-04 20:14:40] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-04 20:14:40] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[4, 1] Max Struct:[143, 1]
FORMULA RingSingleMessageInMbox-PT-d0m080-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[143]
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 47/47 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 46
Applied a total of 2 rules in 6 ms. Remains 45 /46 variables (removed 1) and now considering 46/47 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 45/46 places, 46/47 transitions.
// Phase 1: matrix 46 rows 45 cols
[2025-06-04 20:14:40] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[143]
RANDOM walk for 1000000 steps (216823 resets) in 603 ms. (1655 steps per ms)
BEST_FIRST walk for 1000001 steps (92775 resets) in 288 ms. (3460 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[143]
[2025-06-04 20:14:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 20:14:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-04 20:14:41] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-04 20:14:41] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-04 20:14:41] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-04 20:14:41] [INFO ] [Real]Added 18 Read/Feed constraints in 2 ms returned sat
[2025-06-04 20:14:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 20:14:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-04 20:14:41] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-04 20:14:41] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-04 20:14:41] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2025-06-04 20:14:41] [INFO ] Computed and/alt/rep : 11/26/11 causal constraints (skipped 34 transitions) in 4 ms.
[2025-06-04 20:14:41] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[143]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[143]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 46/46 transitions.
Applied a total of 0 rules in 5 ms. Remains 45 /45 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 45/45 places, 46/46 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 46/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2025-06-04 20:14:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 20:14:41] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-04 20:14:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 20:14:41] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-04 20:14:41] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 20:14:41] [INFO ] Redundant transitions in 0 ms returned []
Running 45 sub problems to find dead transitions.
[2025-06-04 20:14:41] [INFO ] Invariant cache hit.
[2025-06-04 20:14:41] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 5 (OVERLAPS) 46/91 variables, 45/49 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 18/67 constraints. Problems are: Problem set: 5 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:14:42] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/68 constraints. Problems are: Problem set: 5 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:14:42] [INFO ] Deduced a trap along path composed of 6 places in 31 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 1/69 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/69 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/91 variables, 0/69 constraints. Problems are: Problem set: 5 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 69 constraints, problems are : Problem set: 5 solved, 40 unsolved in 1524 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 5 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 4/45 variables, 3/4 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/5 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 46/91 variables, 45/50 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 18/68 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 40/108 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 1/109 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/109 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/91 variables, 0/109 constraints. Problems are: Problem set: 5 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 109 constraints, problems are : Problem set: 5 solved, 40 unsolved in 2273 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 40/45 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3855ms problems are : Problem set: 5 solved, 40 unsolved
Search for dead transitions found 5 dead transitions in 3860ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 45/45 places, 41/46 transitions.
Graph (complete) has 110 edges and 45 vertex of which 41 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 41 /45 variables (removed 4) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2025-06-04 20:14:45] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 20:14:45] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-04 20:14:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 20:14:45] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-04 20:14:45] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 41/45 places, 41/46 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4095 ms. Remains : 41/45 places, 41/46 transitions.
[2025-06-04 20:14:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[143]
RANDOM walk for 1000000 steps (217176 resets) in 534 ms. (1869 steps per ms)
BEST_FIRST walk for 1000000 steps (92311 resets) in 272 ms. (3663 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[143]
[2025-06-04 20:14:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 20:14:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-04 20:14:46] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-04 20:14:46] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-04 20:14:46] [INFO ] [Real]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-04 20:14:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 20:14:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-04 20:14:46] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-04 20:14:46] [INFO ] [Nat]Added 16 Read/Feed constraints in 6 ms returned sat
[2025-06-04 20:14:46] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 30 transitions) in 3 ms.
[2025-06-04 20:14:46] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[143]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[143]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 41/41 places, 41/41 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2025-06-04 20:14:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 20:14:46] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-04 20:14:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 20:14:46] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-04 20:14:46] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 20:14:46] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2025-06-04 20:14:46] [INFO ] Invariant cache hit.
[2025-06-04 20:14:46] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:14:46] [INFO ] Deduced a trap along path composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 61 constraints, problems are : Problem set: 0 solved, 40 unsolved in 924 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/82 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 101 constraints, problems are : Problem set: 0 solved, 40 unsolved in 2095 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3031ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 3032ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3138 ms. Remains : 41/41 places, 41/41 transitions.
[2025-06-04 20:14:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[143]
RANDOM walk for 1000000 steps (217170 resets) in 543 ms. (1838 steps per ms)
BEST_FIRST walk for 1000001 steps (92853 resets) in 274 ms. (3636 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[143]
[2025-06-04 20:14:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 20:14:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-04 20:14:50] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-04 20:14:50] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-04 20:14:50] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-04 20:14:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 20:14:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-04 20:14:50] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-04 20:14:50] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-04 20:14:50] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 30 transitions) in 3 ms.
[2025-06-04 20:14:50] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[143]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[143]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 41/41 places, 41/41 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2025-06-04 20:14:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 20:14:50] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-04 20:14:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 20:14:50] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-04 20:14:50] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 20:14:50] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2025-06-04 20:14:50] [INFO ] Invariant cache hit.
[2025-06-04 20:14:50] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:14:50] [INFO ] Deduced a trap along path composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 61 constraints, problems are : Problem set: 0 solved, 40 unsolved in 947 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/82 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 101 constraints, problems are : Problem set: 0 solved, 40 unsolved in 2150 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3116ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 3117ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3226 ms. Remains : 41/41 places, 41/41 transitions.
RANDOM walk for 40000 steps (8688 resets) in 636 ms. (62 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3659 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3724 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
[2025-06-04 20:14:54] [INFO ] Flatten gal took : 43 ms
[2025-06-04 20:14:54] [INFO ] Flatten gal took : 35 ms
[2025-06-04 20:14:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12639788269848467409.gal : 9 ms
[2025-06-04 20:14:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16584363328117888533.prop : 2 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/ReachabilityCardinality12639788269848467409.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16584363328117888533.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 ...330
Loading property file /tmp/ReachabilityCardinality16584363328117888533.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 64
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :160 after 312
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :312 after 622
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :622 after 1242
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1242 after 2482
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2482 after 5012
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5012 after 562578
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :562578 after 2.10595e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.10595e+06 after 4.46221e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.46221e+06 after 7.0813e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.02006e+07,2.44662,69504,2,14855,19,298714,7,0,208,270475,0
Total reachable state count : 20200610
Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,2.44735,69504,1,0,19,298714,7,0,209,270475,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,395049,2.45039,69504,2,9435,19,298714,8,0,211,270475,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 3738246 steps, run timeout after 3001 ms. (steps per millisecond=1245 ) properties seen :1 out of 2
Probabilistic random walk after 3738246 steps, saw 1427557 distinct states, run finished after 3005 ms. (steps per millisecond=1244 ) properties seen :1
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[143]
Starting property specific reduction for RingSingleMessageInMbox-PT-d0m080-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[143]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[143]
[2025-06-04 20:14:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[143]
RANDOM walk for 10000 steps (2152 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10000 steps (913 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[143]
[2025-06-04 20:14:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 20:14:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-04 20:14:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-04 20:14:57] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-04 20:14:57] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-04 20:14:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 20:14:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-04 20:14:57] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-04 20:14:57] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-04 20:14:57] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 30 transitions) in 3 ms.
[2025-06-04 20:14:57] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[143]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[143]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 41/41 places, 41/41 transitions.
[2025-06-04 20:14:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[143]
RANDOM walk for 1000000 steps (217245 resets) in 542 ms. (1841 steps per ms)
BEST_FIRST walk for 1000001 steps (92374 resets) in 278 ms. (3584 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[143]
[2025-06-04 20:14:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 20:14:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-04 20:14:58] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-04 20:14:58] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-04 20:14:58] [INFO ] [Real]Added 16 Read/Feed constraints in 6 ms returned sat
[2025-06-04 20:14:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 20:14:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-04 20:14:58] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-04 20:14:58] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-04 20:14:58] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 30 transitions) in 2 ms.
[2025-06-04 20:14:58] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[143]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[143]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 5 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 41/41 places, 41/41 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 6 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2025-06-04 20:14:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 20:14:58] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-04 20:14:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 20:14:58] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-04 20:14:58] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 20:14:58] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2025-06-04 20:14:58] [INFO ] Invariant cache hit.
[2025-06-04 20:14:58] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:14:58] [INFO ] Deduced a trap along path composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 61 constraints, problems are : Problem set: 0 solved, 40 unsolved in 928 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/82 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 101 constraints, problems are : Problem set: 0 solved, 40 unsolved in 2113 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3055ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 3055ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3173 ms. Remains : 41/41 places, 41/41 transitions.
[2025-06-04 20:15:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[143]
RANDOM walk for 1000000 steps (217376 resets) in 547 ms. (1824 steps per ms)
BEST_FIRST walk for 1000000 steps (92712 resets) in 288 ms. (3460 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[143]
[2025-06-04 20:15:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 20:15:02] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-04 20:15:02] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-04 20:15:02] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-04 20:15:02] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-04 20:15:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-04 20:15:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-04 20:15:02] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-04 20:15:02] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-04 20:15:02] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 30 transitions) in 2 ms.
[2025-06-04 20:15:02] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[143]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[143]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 5 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 41/41 places, 41/41 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 5 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2025-06-04 20:15:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 20:15:02] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-04 20:15:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 20:15:02] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-04 20:15:02] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 20:15:02] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2025-06-04 20:15:02] [INFO ] Invariant cache hit.
[2025-06-04 20:15:02] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:15:02] [INFO ] Deduced a trap along path composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 61 constraints, problems are : Problem set: 0 solved, 40 unsolved in 908 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/82 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 101 constraints, problems are : Problem set: 0 solved, 40 unsolved in 2141 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3064ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 3064ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3168 ms. Remains : 41/41 places, 41/41 transitions.
[2025-06-04 20:15:05] [INFO ] Flatten gal took : 7 ms
[2025-06-04 20:15:05] [INFO ] Flatten gal took : 7 ms
[2025-06-04 20:15:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6692154474956983820.gal : 2 ms
[2025-06-04 20:15:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality970552322637674295.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/ReachabilityCardinality6692154474956983820.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality970552322637674295.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 ...327
Loading property file /tmp/ReachabilityCardinality970552322637674295.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 64
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :160 after 312
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :312 after 622
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :622 after 1242
RANDOM walk for 40000 steps (8679 resets) in 180 ms. (220 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3879 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1242 after 2482
BEST_FIRST walk for 40001 steps (3645 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2482 after 5012
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5012 after 562578
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :562578 after 2.10595e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.10595e+06 after 4.46221e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.46221e+06 after 7.0813e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.02006e+07,2.61181,70800,2,14855,19,298714,7,0,208,270475,0
Total reachable state count : 20200610
Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,2.61266,70800,1,0,19,298714,7,0,209,270475,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,395049,2.61581,70800,2,9435,19,298714,8,0,211,270475,0
Interrupted probabilistic random walk after 3794138 steps, run timeout after 3001 ms. (steps per millisecond=1264 ) properties seen :1 out of 2
Probabilistic random walk after 3794138 steps, saw 1449219 distinct states, run finished after 3001 ms. (steps per millisecond=1264 ) properties seen :1
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[143]
Ending property specific reduction for RingSingleMessageInMbox-PT-d0m080-UpperBounds-03 in 11543 ms.
[2025-06-04 20:15:08] [INFO ] Flatten gal took : 5 ms
[2025-06-04 20:15:08] [INFO ] Applying decomposition
[2025-06-04 20:15:08] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13217155832952644468.txt' '-o' '/tmp/graph13217155832952644468.bin' '-w' '/tmp/graph13217155832952644468.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13217155832952644468.bin' '-l' '-1' '-v' '-w' '/tmp/graph13217155832952644468.weights' '-q' '0' '-e' '0.001'
[2025-06-04 20:15:08] [INFO ] Decomposing Gal with order
[2025-06-04 20:15:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 20:15:08] [INFO ] Removed a total of 30 redundant transitions.
[2025-06-04 20:15:08] [INFO ] Flatten gal took : 34 ms
[2025-06-04 20:15:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2025-06-04 20:15:08] [INFO ] Time to serialize gal into /tmp/UpperBounds1759787557302946938.gal : 3 ms
[2025-06-04 20:15:08] [INFO ] Time to serialize properties into /tmp/UpperBounds14180742825301988890.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/UpperBounds1759787557302946938.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14180742825301988890.prop' '--nowitness'
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 ...284
Loading property file /tmp/UpperBounds14180742825301988890.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.02006e+07,208.539,2212732,3852,3170,225708,402316,142,1.74867e+07,55,2.19641e+07,0
Total reachable state count : 20200610
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 78
Bounds property RingSingleMessageInMbox-PT-d0m080-UpperBounds-03 :0 <= u9.l364 <= 78
FORMULA RingSingleMessageInMbox-PT-d0m080-UpperBounds-03 78 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RingSingleMessageInMbox-PT-d0m080-UpperBounds-03,0,212.377,2213372,1,0,290210,515312,204,1.74867e+07,148,2.19641e+07,4568
Total runtime 244567 ms.
BK_STOP 1749068321927
--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ 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="RingSingleMessageInMbox-PT-d0m080"
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 RingSingleMessageInMbox-PT-d0m080, 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 r184-tall-174889264100397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d0m080.tgz
mv RingSingleMessageInMbox-PT-d0m080 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 ;