Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r016-smll-174853765200494.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 BugTracking-PT-q3m004, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853765200494
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K 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 16M 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 booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2023-15
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2024-04
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2024-07
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2024-12
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2025-00
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2025-01
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2025-02
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2025-03
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2025-05
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2025-06
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2025-08
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2025-09
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2025-10
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2025-11
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2025-13
FORMULA_NAME BugTracking-PT-q3m004-ReachabilityCardinality-2025-14

=== Now, execution of the tool begins

BK_START 1749122303730

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-05 11:18:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 11:18:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 11:18:28] [INFO ] Load time of PNML (sax parser for PT used): 1828 ms
[2025-06-05 11:18:28] [INFO ] Transformed 754 places.
[2025-06-05 11:18:28] [INFO ] Transformed 27370 transitions.
[2025-06-05 11:18:28] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 2184 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 514 places in 274 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40004 steps (475 resets) in 4290 ms. (9 steps per ms) remains 8/9 properties
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (108 resets) in 410 ms. (97 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (106 resets) in 372 ms. (107 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (126 resets) in 359 ms. (111 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (112 resets) in 230 ms. (173 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (104 resets) in 413 ms. (96 steps per ms) remains 8/8 properties
[2025-06-05 11:18:31] [INFO ] Flatten gal took : 897 ms
BEST_FIRST walk for 40004 steps (118 resets) in 422 ms. (94 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (126 resets) in 277 ms. (143 steps per ms) remains 8/8 properties
[2025-06-05 11:18:31] [INFO ] Flatten gal took : 280 ms
[2025-06-05 11:18:31] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2025-06-05 11:18:31] [INFO ] Computed 10 invariants in 89 ms
[2025-06-05 11:18:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11105700192665055625.gal : 175 ms
[2025-06-05 11:18:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4976978211121759676.prop : 3 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/ReachabilityCardinality11105700192665055625.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4976978211121759676.prop' '--nowitness' '--gen-order' 'FOLLOW'
[2025-06-05 11:18:31] [INFO ] State equation strengthened by 255 read => feed constraints.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem BugTracking-PT-q3m004-ReachabilityCardinality-2025-05 is UNSAT
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q3m004-ReachabilityCardinality-2025-11 is UNSAT
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 119/147 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Loading property file /tmp/ReachabilityCardinality4976978211121759676.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :20 after 35
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :35 after 440
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :440 after 2715
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :2715 after 7230
At refinement iteration 3 (OVERLAPS) 2542/2689 variables, 147/155 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :7230 after 16225
At refinement iteration 4 (INCLUDED_ONLY) 0/2689 variables, 163/318 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2689 variables, 0/318 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 192/2881 variables, 92/410 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2881 variables, 1/411 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2881 variables, 92/503 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2881 variables, 0/503 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/2882 variables, 1/504 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2882 variables, 1/505 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :16225 after 34180
At refinement iteration 12 (INCLUDED_ONLY) 0/2882 variables, 0/505 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/2882 variables, 0/505 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2882/2882 variables, and 505 constraints, problems are : Problem set: 2 solved, 6 unsolved in 3489 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 240/240 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 96/117 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:18:36] [INFO ] Deduced a trap composed of 7 places in 716 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:18:36] [INFO ] Deduced a trap composed of 9 places in 480 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:18:37] [INFO ] Deduced a trap composed of 13 places in 401 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:18:37] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 4/11 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1933/2050 variables, 117/128 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2050 variables, 158/286 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :34180 after 70055
At refinement iteration 6 (INCLUDED_ONLY) 0/2050 variables, 0/286 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 825/2875 variables, 118/404 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2875 variables, 2/406 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2875 variables, 97/503 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2875 variables, 6/509 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:18:40] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2875/2882 variables, and 510 constraints, problems are : Problem set: 2 solved, 6 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/10 constraints, State Equation: 235/240 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8878ms problems are : Problem set: 2 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 237 transition count 2772
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 237 transition count 2766
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 15 place count 231 transition count 2766
Applied a total of 15 rules in 558 ms. Remains 231 /240 variables (removed 9) and now considering 2766/2769 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 576 ms. Remains : 231/240 places, 2766/2769 transitions.
RANDOM walk for 40002 steps (10 resets) in 1186 ms. (33 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (13 resets) in 383 ms. (104 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 469 ms. (85 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (11 resets) in 417 ms. (95 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 414 ms. (96 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 354 ms. (112 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (12 resets) in 338 ms. (118 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 83184 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 6
Probabilistic random walk after 83184 steps, saw 47132 distinct states, run finished after 3010 ms. (steps per millisecond=27 ) properties seen :0
[2025-06-05 11:18:45] [INFO ] Flow matrix only has 2635 transitions (discarded 131 similar events)
// Phase 1: matrix 2635 rows 231 cols
[2025-06-05 11:18:45] [INFO ] Computed 8 invariants in 20 ms
[2025-06-05 11:18:45] [INFO ] State equation strengthened by 255 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 88/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1895/2004 variables, 109/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2004 variables, 125/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2004 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 858/2862 variables, 118/358 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2862 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2862 variables, 130/490 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2862 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 4/2866 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2866 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/2866 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2866/2866 variables, and 494 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2485 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 88/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:18:47] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:18:48] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:18:48] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:18:48] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:18:48] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1895/2004 variables, 109/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2004 variables, 125/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2004 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 858/2862 variables, 118/363 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2862 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2862 variables, 130/495 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem BugTracking-PT-q3m004-ReachabilityCardinality-2024-12 is UNSAT
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (INCLUDED_ONLY) 0/2862 variables, 6/501 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:18:51] [INFO ] Deduced a trap composed of 10 places in 344 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:18:51] [INFO ] Deduced a trap composed of 18 places in 237 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:18:51] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2862 variables, 3/504 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2862 variables, 0/504 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 4/2866 variables, 4/508 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2866 variables, 0/508 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/2866 variables, 0/508 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2866/2866 variables, and 508 constraints, problems are : Problem set: 1 solved, 5 unsolved in 9386 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11978ms problems are : Problem set: 1 solved, 5 unsolved
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :70055 after 141770
Parikh walk visited 0 properties in 15286 ms.
Support contains 20 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 2766/2766 transitions.
Applied a total of 0 rules in 78 ms. Remains 231 /231 variables (removed 0) and now considering 2766/2766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 231/231 places, 2766/2766 transitions.
RANDOM walk for 40000 steps (13 resets) in 970 ms. (41 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (13 resets) in 391 ms. (102 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 447 ms. (89 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (10 resets) in 278 ms. (143 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 301 ms. (132 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (9 resets) in 287 ms. (138 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 91356 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 5
Probabilistic random walk after 91356 steps, saw 51903 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
[2025-06-05 11:19:16] [INFO ] Flow matrix only has 2635 transitions (discarded 131 similar events)
[2025-06-05 11:19:16] [INFO ] Invariant cache hit.
[2025-06-05 11:19:16] [INFO ] State equation strengthened by 255 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 88/108 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1866/1974 variables, 108/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1974 variables, 124/238 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1974 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 888/2862 variables, 119/357 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2862 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2862 variables, 131/490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2862 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/2866 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2866 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/2866 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2866/2866 variables, and 494 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2657 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 88/108 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:19:19] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:19:19] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:19:19] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1866/1974 variables, 108/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1974 variables, 124/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:19:20] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1974 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1974 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 888/2862 variables, 119/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2862 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2862 variables, 131/494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2862 variables, 5/499 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:19:23] [INFO ] Deduced a trap composed of 8 places in 446 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:19:23] [INFO ] Deduced a trap composed of 8 places in 530 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:19:24] [INFO ] Deduced a trap composed of 18 places in 452 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:19:24] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2862 variables, 4/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2862 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 4/2866 variables, 4/507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:19:26] [INFO ] Deduced a trap composed of 12 places in 373 ms of which 14 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2866 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2866 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/2866 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2866/2866 variables, and 508 constraints, problems are : Problem set: 0 solved, 5 unsolved in 12293 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15003ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 4973 ms.
Support contains 20 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 2766/2766 transitions.
Applied a total of 0 rules in 52 ms. Remains 231 /231 variables (removed 0) and now considering 2766/2766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 231/231 places, 2766/2766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 2766/2766 transitions.
Applied a total of 0 rules in 49 ms. Remains 231 /231 variables (removed 0) and now considering 2766/2766 (removed 0) transitions.
[2025-06-05 11:19:36] [INFO ] Flow matrix only has 2635 transitions (discarded 131 similar events)
[2025-06-05 11:19:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:19:37] [INFO ] Implicit Places using invariants in 738 ms returned []
[2025-06-05 11:19:37] [INFO ] Flow matrix only has 2635 transitions (discarded 131 similar events)
[2025-06-05 11:19:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:19:38] [INFO ] State equation strengthened by 255 read => feed constraints.
[2025-06-05 11:19:47] [INFO ] Implicit Places using invariants and state equation in 10517 ms returned []
Implicit Place search using SMT with State Equation took 11273 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:19:47] [INFO ] Redundant transitions in 288 ms returned []
Running 2765 sub problems to find dead transitions.
[2025-06-05 11:19:47] [INFO ] Flow matrix only has 2635 transitions (discarded 131 similar events)
[2025-06-05 11:19:47] [INFO ] Invariant cache hit.
[2025-06-05 11:19:47] [INFO ] State equation strengthened by 255 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2765 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:20:16] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 9 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :141770 after 285165
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 231/2866 variables, and 9 constraints, problems are : Problem set: 0 solved, 2765 unsolved in 30121 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/231 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 2765/1231 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2765 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2765 unsolved
Problem TDEAD1799 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD2748 is UNSAT
Problem TDEAD2749 is UNSAT
Problem TDEAD2750 is UNSAT
Problem TDEAD2751 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2753 is UNSAT
Problem TDEAD2754 is UNSAT
Problem TDEAD2755 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2757 is UNSAT
Problem TDEAD2758 is UNSAT
Problem TDEAD2759 is UNSAT
Problem TDEAD2760 is UNSAT
Problem TDEAD2761 is UNSAT
Problem TDEAD2764 is UNSAT
Problem TDEAD2765 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 1/9 constraints. Problems are: Problem set: 32 solved, 2733 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:20:50] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:20:50] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 5 ms to minimize.
Problem TDEAD1463 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1480 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:20:51] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 4 ms to minimize.
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:20:54] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 231/2866 variables, and 13 constraints, problems are : Problem set: 68 solved, 2697 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/231 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 1534/1231 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68874ms problems are : Problem set: 68 solved, 2697 unsolved
Search for dead transitions found 68 dead transitions in 68911ms
Found 68 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 68 transitions
Dead transitions reduction (with SMT) removed 68 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 231/231 places, 2698/2766 transitions.
Reduce places removed 13 places and 354 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 218 transition count 2344
Reduce places removed 12 places and 134 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 206 transition count 2210
Reduce places removed 16 places and 445 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 41 place count 190 transition count 1765
Reduce places removed 15 places and 289 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 56 place count 175 transition count 1476
Reduce places removed 4 places and 84 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 60 place count 171 transition count 1392
Reduce places removed 2 places and 32 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 62 place count 169 transition count 1360
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 64 place count 167 transition count 1334
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 9 places and 168 transitions.
Iterating global reduction 6 with 11 rules applied. Total rules applied 75 place count 158 transition count 1166
Deduced a syphon composed of 8 places in 2 ms
Applied a total of 75 rules in 105 ms. Remains 158 /231 variables (removed 73) and now considering 1166/2698 (removed 1532) transitions.
[2025-06-05 11:20:56] [INFO ] Flow matrix only has 1106 transitions (discarded 60 similar events)
// Phase 1: matrix 1106 rows 158 cols
[2025-06-05 11:20:56] [INFO ] Computed 16 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:20:57] [INFO ] Implicit Places using invariants in 358 ms returned []
[2025-06-05 11:20:57] [INFO ] Flow matrix only has 1106 transitions (discarded 60 similar events)
[2025-06-05 11:20:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:20:57] [INFO ] State equation strengthened by 135 read => feed constraints.
[2025-06-05 11:20:58] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 1728 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 158/231 places, 1166/2766 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 82383 ms. Remains : 158/231 places, 1166/2766 transitions.
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 0 transitions.
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (18 resets) in 462 ms. (86 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (10 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 154410 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 3
Probabilistic random walk after 154410 steps, saw 81847 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
[2025-06-05 11:21:01] [INFO ] Flow matrix only has 1106 transitions (discarded 60 similar events)
// Phase 1: matrix 1106 rows 150 cols
[2025-06-05 11:21:02] [INFO ] Computed 8 invariants in 9 ms
[2025-06-05 11:21:02] [INFO ] State equation strengthened by 135 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/56 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 736/792 variables, 56/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/792 variables, 25/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/792 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 448/1240 variables, 78/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1240 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1240 variables, 110/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1240 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 16/1256 variables, 16/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1256 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1256 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1256/1256 variables, and 293 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1065 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/56 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:03] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:03] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 736/792 variables, 56/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/792 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:03] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/792 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/792 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 448/1240 variables, 78/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1240 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1240 variables, 110/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1240 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:04] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:04] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:04] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:04] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:04] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:05] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 11 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1240 variables, 6/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1240 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 16/1256 variables, 16/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:05] [INFO ] Deduced a trap along path composed of 4 places in 27 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1256 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1256 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1256 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1256/1256 variables, and 306 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3604 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4695ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2877 ms.
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1166/1166 transitions.
Applied a total of 0 rules in 22 ms. Remains 150 /150 variables (removed 0) and now considering 1166/1166 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 150/150 places, 1166/1166 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1166/1166 transitions.
Applied a total of 0 rules in 17 ms. Remains 150 /150 variables (removed 0) and now considering 1166/1166 (removed 0) transitions.
[2025-06-05 11:21:09] [INFO ] Flow matrix only has 1106 transitions (discarded 60 similar events)
[2025-06-05 11:21:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:21:09] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-06-05 11:21:09] [INFO ] Flow matrix only has 1106 transitions (discarded 60 similar events)
[2025-06-05 11:21:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:21:10] [INFO ] State equation strengthened by 135 read => feed constraints.
[2025-06-05 11:21:11] [INFO ] Implicit Places using invariants and state equation in 1785 ms returned []
Implicit Place search using SMT with State Equation took 2034 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:21:11] [INFO ] Redundant transitions in 74 ms returned []
Running 1165 sub problems to find dead transitions.
[2025-06-05 11:21:11] [INFO ] Flow matrix only has 1106 transitions (discarded 60 similar events)
[2025-06-05 11:21:11] [INFO ] Invariant cache hit.
[2025-06-05 11:21:11] [INFO ] State equation strengthened by 135 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:22] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 3 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:22] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 3 ms to minimize.
Problem TDEAD707 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 2/10 constraints. Problems are: Problem set: 19 solved, 1146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 19 solved, 1146 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1106/1256 variables, 150/160 constraints. Problems are: Problem set: 19 solved, 1146 unsolved
SMT process timed out in 32935ms, After SMT, problems are : Problem set: 19 solved, 1146 unsolved
Search for dead transitions found 19 dead transitions in 32940ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/150 places, 1147/1166 transitions.
Reduce places removed 2 places and 40 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 148 transition count 1107
Reduce places removed 1 places and 18 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 147 transition count 1089
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 146 transition count 1071
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 107 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 139 transition count 964
Applied a total of 12 rules in 28 ms. Remains 139 /150 variables (removed 11) and now considering 964/1147 (removed 183) transitions.
[2025-06-05 11:21:44] [INFO ] Flow matrix only has 909 transitions (discarded 55 similar events)
// Phase 1: matrix 909 rows 139 cols
[2025-06-05 11:21:44] [INFO ] Computed 8 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:21:44] [INFO ] Implicit Places using invariants in 274 ms returned []
[2025-06-05 11:21:44] [INFO ] Flow matrix only has 909 transitions (discarded 55 similar events)
[2025-06-05 11:21:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:21:45] [INFO ] State equation strengthened by 113 read => feed constraints.
[2025-06-05 11:21:46] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1495 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 139/150 places, 964/1166 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 36600 ms. Remains : 139/150 places, 964/1166 transitions.
RANDOM walk for 40001 steps (17 resets) in 303 ms. (131 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (13 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 175158 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 3
Probabilistic random walk after 175158 steps, saw 86875 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2025-06-05 11:21:49] [INFO ] Flow matrix only has 909 transitions (discarded 55 similar events)
[2025-06-05 11:21:49] [INFO ] Invariant cache hit.
[2025-06-05 11:21:49] [INFO ] State equation strengthened by 113 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 604/657 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/657 variables, 24/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/657 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 377/1034 variables, 72/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1034 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1034 variables, 89/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1034 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 14/1048 variables, 14/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1048 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1048 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 260 constraints, problems are : Problem set: 0 solved, 3 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 139/139 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:50] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:50] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:50] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 604/657 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/657 variables, 24/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 377/1034 variables, 72/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1034 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1034 variables, 89/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1034 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:51] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:51] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:51] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:51] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:51] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1034 variables, 5/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:21:52] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1034 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1034 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 14/1048 variables, 14/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1048 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1048 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 272 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3376 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 139/139 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3962ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1324 ms.
Support contains 10 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 964/964 transitions.
Applied a total of 0 rules in 14 ms. Remains 139 /139 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 139/139 places, 964/964 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 964/964 transitions.
Applied a total of 0 rules in 13 ms. Remains 139 /139 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2025-06-05 11:21:54] [INFO ] Flow matrix only has 909 transitions (discarded 55 similar events)
[2025-06-05 11:21:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:21:54] [INFO ] Implicit Places using invariants in 209 ms returned []
[2025-06-05 11:21:54] [INFO ] Flow matrix only has 909 transitions (discarded 55 similar events)
[2025-06-05 11:21:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:21:55] [INFO ] State equation strengthened by 113 read => feed constraints.
[2025-06-05 11:21:56] [INFO ] Implicit Places using invariants and state equation in 1872 ms returned []
Implicit Place search using SMT with State Equation took 2086 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:21:56] [INFO ] Redundant transitions in 18 ms returned []
Running 963 sub problems to find dead transitions.
[2025-06-05 11:21:56] [INFO ] Flow matrix only has 909 transitions (discarded 55 similar events)
[2025-06-05 11:21:56] [INFO ] Invariant cache hit.
[2025-06-05 11:21:56] [INFO ] State equation strengthened by 113 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 963 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:22:04] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 7 ms to minimize.
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 1/9 constraints. Problems are: Problem set: 12 solved, 951 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/9 constraints. Problems are: Problem set: 12 solved, 951 unsolved
Problem TDEAD634 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
At refinement iteration 3 (OVERLAPS) 909/1048 variables, 139/148 constraints. Problems are: Problem set: 15 solved, 948 unsolved
SMT process timed out in 31526ms, After SMT, problems are : Problem set: 15 solved, 948 unsolved
Search for dead transitions found 15 dead transitions in 31531ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 139/139 places, 949/964 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 137 transition count 921
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 137 transition count 921
Applied a total of 4 rules in 40 ms. Remains 137 /139 variables (removed 2) and now considering 921/949 (removed 28) transitions.
[2025-06-05 11:22:28] [INFO ] Flow matrix only has 874 transitions (discarded 47 similar events)
// Phase 1: matrix 874 rows 137 cols
[2025-06-05 11:22:28] [INFO ] Computed 9 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:22:28] [INFO ] Implicit Places using invariants in 251 ms returned []
[2025-06-05 11:22:28] [INFO ] Flow matrix only has 874 transitions (discarded 47 similar events)
[2025-06-05 11:22:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:22:29] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 11:22:29] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1312 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 137/139 places, 921/964 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 35010 ms. Remains : 137/139 places, 921/964 transitions.
RANDOM walk for 40005 steps (8 resets) in 351 ms. (113 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (9 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (10 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 205746 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 3
Probabilistic random walk after 205746 steps, saw 104740 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2025-06-05 11:22:33] [INFO ] Flow matrix only has 874 transitions (discarded 47 similar events)
[2025-06-05 11:22:33] [INFO ] Invariant cache hit.
[2025-06-05 11:22:33] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/53 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/55 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 573/628 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 26/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 369/997 variables, 68/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/997 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/997 variables, 85/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/997 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 14/1011 variables, 14/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1011 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1011 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1011/1011 variables, and 257 constraints, problems are : Problem set: 0 solved, 3 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/53 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:22:33] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:22:33] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:22:33] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/55 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:22:33] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 573/628 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/628 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 369/997 variables, 68/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/997 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/997 variables, 85/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/997 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:22:34] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:22:34] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:22:34] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/997 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:22:35] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 8 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/997 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/997 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 14/1011 variables, 14/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:22:35] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1011 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1011 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1011 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1011/1011 variables, and 269 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2426 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2927ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1353 ms.
Support contains 10 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 921/921 transitions.
Applied a total of 0 rules in 11 ms. Remains 137 /137 variables (removed 0) and now considering 921/921 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 137/137 places, 921/921 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 921/921 transitions.
Applied a total of 0 rules in 12 ms. Remains 137 /137 variables (removed 0) and now considering 921/921 (removed 0) transitions.
[2025-06-05 11:22:37] [INFO ] Flow matrix only has 874 transitions (discarded 47 similar events)
[2025-06-05 11:22:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:22:37] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-06-05 11:22:37] [INFO ] Flow matrix only has 874 transitions (discarded 47 similar events)
[2025-06-05 11:22:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:22:37] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 11:22:38] [INFO ] Implicit Places using invariants and state equation in 1244 ms returned []
Implicit Place search using SMT with State Equation took 1496 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:22:38] [INFO ] Redundant transitions in 11 ms returned []
Running 920 sub problems to find dead transitions.
[2025-06-05 11:22:38] [INFO ] Flow matrix only has 874 transitions (discarded 47 similar events)
[2025-06-05 11:22:38] [INFO ] Invariant cache hit.
[2025-06-05 11:22:38] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 3 (OVERLAPS) 874/1011 variables, 137/146 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1011 variables, 111/257 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1011/1011 variables, and 257 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 3 (OVERLAPS) 874/1011 variables, 137/146 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1011 variables, 111/257 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Problem TDEAD123 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1011 variables, 920/1177 constraints. Problems are: Problem set: 65 solved, 855 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1011/1011 variables, and 1177 constraints, problems are : Problem set: 65 solved, 855 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61522ms problems are : Problem set: 65 solved, 855 unsolved
Search for dead transitions found 65 dead transitions in 61526ms
Found 65 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 65 transitions
Dead transitions reduction (with SMT) removed 65 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 137/137 places, 856/921 transitions.
Reduce places removed 15 places and 283 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 122 transition count 573
Reduce places removed 14 places and 138 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 108 transition count 435
Reduce places removed 3 places and 36 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 105 transition count 399
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 34 place count 103 transition count 383
Reduce places removed 1 places and 14 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 35 place count 102 transition count 369
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 37 place count 100 transition count 351
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 39 place count 100 transition count 351
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 39 rules in 20 ms. Remains 100 /137 variables (removed 37) and now considering 351/856 (removed 505) transitions.
[2025-06-05 11:23:40] [INFO ] Flow matrix only has 327 transitions (discarded 24 similar events)
// Phase 1: matrix 327 rows 100 cols
[2025-06-05 11:23:40] [INFO ] Computed 14 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:23:40] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-05 11:23:40] [INFO ] Flow matrix only has 327 transitions (discarded 24 similar events)
[2025-06-05 11:23:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:23:40] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-05 11:23:40] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 100/137 places, 351/921 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63653 ms. Remains : 100/137 places, 351/921 transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (9 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 798443 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 1
Probabilistic random walk after 798443 steps, saw 450884 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
[2025-06-05 11:23:44] [INFO ] Flow matrix only has 327 transitions (discarded 24 similar events)
// Phase 1: matrix 327 rows 95 cols
[2025-06-05 11:23:44] [INFO ] Computed 9 invariants in 3 ms
[2025-06-05 11:23:44] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 89/105 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 287/392 variables, 50/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 41/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/393 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/393 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/393 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 29/422 variables, 28/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/422 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/422 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 89/105 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 287/392 variables, 50/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 41/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:23:44] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/393 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/393 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/393 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 29/422 variables, 28/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/422 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/422 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/422 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/422 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 547ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 351/351 transitions.
Applied a total of 0 rules in 4 ms. Remains 95 /95 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 95/95 places, 351/351 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 351/351 transitions.
Applied a total of 0 rules in 4 ms. Remains 95 /95 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2025-06-05 11:23:44] [INFO ] Flow matrix only has 327 transitions (discarded 24 similar events)
[2025-06-05 11:23:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:23:44] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-05 11:23:44] [INFO ] Flow matrix only has 327 transitions (discarded 24 similar events)
[2025-06-05 11:23:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:23:44] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-05 11:23:45] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:23:45] [INFO ] Redundant transitions in 1 ms returned []
Running 350 sub problems to find dead transitions.
[2025-06-05 11:23:45] [INFO ] Flow matrix only has 327 transitions (discarded 24 similar events)
[2025-06-05 11:23:45] [INFO ] Invariant cache hit.
[2025-06-05 11:23:45] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 350 unsolved
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
At refinement iteration 3 (OVERLAPS) 327/422 variables, 95/104 constraints. Problems are: Problem set: 2 solved, 348 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 55/159 constraints. Problems are: Problem set: 2 solved, 348 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:23:51] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 1/160 constraints. Problems are: Problem set: 2 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/160 constraints. Problems are: Problem set: 2 solved, 348 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:24:03] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 2 ms to minimize.
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:24:04] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 3 ms to minimize.
Problem TDEAD329 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
At refinement iteration 7 (OVERLAPS) 0/422 variables, 2/162 constraints. Problems are: Problem set: 28 solved, 322 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/162 constraints. Problems are: Problem set: 28 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/422 variables, and 162 constraints, problems are : Problem set: 28 solved, 322 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 28 solved, 322 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 28 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/8 constraints. Problems are: Problem set: 28 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 3/11 constraints. Problems are: Problem set: 28 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/11 constraints. Problems are: Problem set: 28 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 3/95 variables, 1/12 constraints. Problems are: Problem set: 28 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/12 constraints. Problems are: Problem set: 28 solved, 322 unsolved
At refinement iteration 6 (OVERLAPS) 327/422 variables, 95/107 constraints. Problems are: Problem set: 28 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 55/162 constraints. Problems are: Problem set: 28 solved, 322 unsolved
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 322/484 constraints. Problems are: Problem set: 38 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:24:27] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:24:27] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 3 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:24:28] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:24:28] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:24:28] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:24:29] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 3 ms to minimize.
Problem TDEAD184 is UNSAT
Problem TDEAD189 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:24:30] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 3 ms to minimize.
Problem TDEAD192 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:24:30] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:24:31] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:24:31] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 4 ms to minimize.
Problem TDEAD235 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 10/494 constraints. Problems are: Problem set: 59 solved, 291 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:24:40] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 1/495 constraints. Problems are: Problem set: 59 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 495 constraints, problems are : Problem set: 59 solved, 291 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 322/350 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60210ms problems are : Problem set: 59 solved, 291 unsolved
Search for dead transitions found 59 dead transitions in 60211ms
Found 59 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 59 transitions
Dead transitions reduction (with SMT) removed 59 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 95/95 places, 292/351 transitions.
Graph (complete) has 494 edges and 95 vertex of which 92 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 30 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 87 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 85 transition count 247
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 85 transition count 247
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 10 rules in 12 ms. Remains 85 /95 variables (removed 10) and now considering 247/292 (removed 45) transitions.
[2025-06-05 11:24:45] [INFO ] Flow matrix only has 232 transitions (discarded 15 similar events)
// Phase 1: matrix 232 rows 85 cols
[2025-06-05 11:24:45] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:24:45] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-05 11:24:45] [INFO ] Flow matrix only has 232 transitions (discarded 15 similar events)
[2025-06-05 11:24:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:24:45] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-05 11:24:45] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 85/95 places, 247/351 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61327 ms. Remains : 85/95 places, 247/351 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40001 steps (11 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 885630 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :0 out of 1
Probabilistic random walk after 885630 steps, saw 517138 distinct states, run finished after 3001 ms. (steps per millisecond=295 ) properties seen :0
[2025-06-05 11:24:49] [INFO ] Flow matrix only has 232 transitions (discarded 15 similar events)
// Phase 1: matrix 232 rows 84 cols
[2025-06-05 11:24:49] [INFO ] Computed 8 invariants in 2 ms
[2025-06-05 11:24:49] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 150.0 s and query timeout 15000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/63 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 206/269 variables, 37/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 38/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/270 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 44/314 variables, 38/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/314 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/315 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/315 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/315 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/316 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/316 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/316 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/316 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 150.0 s and query timeout 15000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/63 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 206/269 variables, 37/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 38/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:24:49] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/270 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/270 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 44/314 variables, 38/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/314 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/314 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/314 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/315 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/315 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/315 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/316 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/316 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/316 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/316 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 497ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 247/247 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 247/247 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 84/84 places, 247/247 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 247/247 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 247/247 (removed 0) transitions.
[2025-06-05 11:24:49] [INFO ] Flow matrix only has 232 transitions (discarded 15 similar events)
[2025-06-05 11:24:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:24:49] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-05 11:24:49] [INFO ] Flow matrix only has 232 transitions (discarded 15 similar events)
[2025-06-05 11:24:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:24:49] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-05 11:24:49] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:24:49] [INFO ] Redundant transitions in 1 ms returned []
Running 246 sub problems to find dead transitions.
[2025-06-05 11:24:49] [INFO ] Flow matrix only has 232 transitions (discarded 15 similar events)
[2025-06-05 11:24:49] [INFO ] Invariant cache hit.
[2025-06-05 11:24:49] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 3 (OVERLAPS) 232/316 variables, 84/92 constraints. Problems are: Problem set: 14 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 50/142 constraints. Problems are: Problem set: 14 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/142 constraints. Problems are: Problem set: 14 solved, 232 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/142 constraints. Problems are: Problem set: 14 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 142 constraints, problems are : Problem set: 14 solved, 232 unsolved in 9003 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 232 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 14 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 1/8 constraints. Problems are: Problem set: 14 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/8 constraints. Problems are: Problem set: 14 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 232/316 variables, 84/92 constraints. Problems are: Problem set: 14 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 50/142 constraints. Problems are: Problem set: 14 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 232/374 constraints. Problems are: Problem set: 14 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:25:02] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 1/375 constraints. Problems are: Problem set: 14 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:25:07] [INFO ] Deduced a trap along path composed of 6 places in 28 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 1/376 constraints. Problems are: Problem set: 19 solved, 227 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:25:15] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 3 ms to minimize.
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 1/377 constraints. Problems are: Problem set: 27 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:25:21] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 1/378 constraints. Problems are: Problem set: 27 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:25:25] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:25:25] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 2/380 constraints. Problems are: Problem set: 27 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 380 constraints, problems are : Problem set: 27 solved, 219 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 232/246 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39103ms problems are : Problem set: 27 solved, 219 unsolved
Search for dead transitions found 27 dead transitions in 39103ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 84/84 places, 220/247 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:25:29] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 39534 ms. Remains : 84/84 places, 220/247 transitions.
RANDOM walk for 40000 steps (18 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1028534 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :0 out of 1
Probabilistic random walk after 1028534 steps, saw 600592 distinct states, run finished after 3001 ms. (steps per millisecond=342 ) properties seen :0
[2025-06-05 11:25:32] [INFO ] Flow matrix only has 205 transitions (discarded 15 similar events)
// Phase 1: matrix 205 rows 84 cols
[2025-06-05 11:25:32] [INFO ] Computed 8 invariants in 1 ms
[2025-06-05 11:25:32] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 165.0 s and query timeout 16500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/53 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 187/240 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 36/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/241 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 46/287 variables, 40/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/287 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/287 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/287 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/288 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/288 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/288 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/289 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/289 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/289 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/289 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 165.0 s and query timeout 16500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/53 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 187/240 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 36/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:25:32] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/241 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 46/287 variables, 40/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/287 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/287 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/287 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/287 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/288 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/288 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/288 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/289 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/289 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/289 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/289 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 443ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 220/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 84/84 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2025-06-05 11:25:32] [INFO ] Flow matrix only has 205 transitions (discarded 15 similar events)
[2025-06-05 11:25:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:25:32] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-05 11:25:32] [INFO ] Flow matrix only has 205 transitions (discarded 15 similar events)
[2025-06-05 11:25:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:25:32] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-05 11:25:32] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:25:32] [INFO ] Redundant transitions in 1 ms returned []
Running 219 sub problems to find dead transitions.
[2025-06-05 11:25:32] [INFO ] Flow matrix only has 205 transitions (discarded 15 similar events)
[2025-06-05 11:25:32] [INFO ] Invariant cache hit.
[2025-06-05 11:25:32] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 205/289 variables, 84/92 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 46/138 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/289 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 138 constraints, problems are : Problem set: 0 solved, 219 unsolved in 10342 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 205/289 variables, 84/92 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 46/138 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 219/357 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:25:46] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:25:47] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:25:51] [INFO ] Deduced a trap along path composed of 6 places in 25 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:25:56] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:25:56] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:25:58] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:25:58] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:25:59] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:25:59] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 6/366 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:26:01] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:26:01] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:26:02] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 3/369 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:26:07] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:26:10] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:26:10] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:26:11] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:26:11] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:26:12] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/289 variables, and 375 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40421ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 40422ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40778 ms. Remains : 84/84 places, 220/220 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 329 edges and 84 vertex of which 82 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 82 transition count 204
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 17 place count 82 transition count 203
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 81 transition count 203
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 30 place count 70 transition count 156
Iterating global reduction 1 with 11 rules applied. Total rules applied 41 place count 70 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 70 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 69 transition count 154
Ensure Unique test removed 1 places
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 68 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 67 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 67 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 67 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 65 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 51 place count 65 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 63 transition count 150
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 62 place count 59 transition count 146
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 68 place count 56 transition count 149
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 72 place count 56 transition count 145
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 76 place count 52 transition count 145
Applied a total of 76 rules in 43 ms. Remains 52 /84 variables (removed 32) and now considering 145/220 (removed 75) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 52 cols
[2025-06-05 11:26:13] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 11:26:13] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 11:26:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-05 11:26:13] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-05 11:26:13] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-05 11:26:13] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-05 11:26:13] [INFO ] Flatten gal took : 11 ms
[2025-06-05 11:26:13] [INFO ] Flatten gal took : 7 ms
[2025-06-05 11:26:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11998974733587695916.gal : 3 ms
[2025-06-05 11:26:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6765356491137859791.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11998974733587695916.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6765356491137859791.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6765356491137859791.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :14 after 30
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :30 after 400
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :400 after 1375
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1375 after 3310
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3310 after 7165
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7165 after 14860
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :14860 after 30235
Detected timeout of ITS tools.
[2025-06-05 11:26:28] [INFO ] Flatten gal took : 7 ms
[2025-06-05 11:26:28] [INFO ] Applying decomposition
[2025-06-05 11:26:28] [INFO ] Flatten gal took : 7 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/graph57880521623468291.txt' '-o' '/tmp/graph57880521623468291.bin' '-w' '/tmp/graph57880521623468291.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph57880521623468291.bin' '-l' '-1' '-v' '-w' '/tmp/graph57880521623468291.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:26:28] [INFO ] Decomposing Gal with order
[2025-06-05 11:26:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:26:28] [INFO ] Removed a total of 142 redundant transitions.
[2025-06-05 11:26:29] [INFO ] Flatten gal took : 69 ms
[2025-06-05 11:26:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 6 ms.
[2025-06-05 11:26:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16618769584091994673.gal : 4 ms
[2025-06-05 11:26:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4258936023544989588.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16618769584091994673.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4258936023544989588.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 ...308
Loading property file /tmp/ReachabilityCardinality4258936023544989588.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 2415
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2415 after 60865
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :60865 after 544320
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :544320 after 2.15151e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.15151e+07 after 8.39368e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8.39368e+08 after 1.01957e+11
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.01957e+11 after 1.56298e+13
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :285165 after 571920
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30690 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 11:26:44] [INFO ] Flatten gal took : 255 ms
[2025-06-05 11:26:44] [INFO ] Applying decomposition
[2025-06-05 11:26:44] [INFO ] Flatten gal took : 284 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/graph2688385848224805918.txt' '-o' '/tmp/graph2688385848224805918.bin' '-w' '/tmp/graph2688385848224805918.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2688385848224805918.bin' '-l' '-1' '-v' '-w' '/tmp/graph2688385848224805918.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:26:45] [INFO ] Decomposing Gal with order
[2025-06-05 11:26:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:26:45] [INFO ] Removed a total of 297 redundant transitions.
[2025-06-05 11:26:45] [INFO ] Flatten gal took : 269 ms
[2025-06-05 11:26:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 393 labels/synchronizations in 37 ms.
[2025-06-05 11:26:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality301978142668139771.gal : 29 ms
[2025-06-05 11:26:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3190244904507321659.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality301978142668139771.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3190244904507321659.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/ReachabilityCardinality3190244904507321659.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 35
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :35 after 60
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :60 after 68
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :68 after 105
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :105 after 3695
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3695 after 12690
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :12690 after 30645
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :30645 after 66520
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :66520 after 138235
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :138235 after 281630
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :281630 after 568385
Detected timeout of ITS tools.
[2025-06-05 11:56:47] [INFO ] Flatten gal took : 166 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18163471034062313128
[2025-06-05 11:56:48] [INFO ] Applying decomposition
[2025-06-05 11:56:48] [INFO ] Flatten gal took : 40 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/graph13153842767260449654.txt' '-o' '/tmp/graph13153842767260449654.bin' '-w' '/tmp/graph13153842767260449654.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13153842767260449654.bin' '-l' '-1' '-v' '-w' '/tmp/graph13153842767260449654.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:56:48] [INFO ] Computing symmetric may disable matrix : 220 transitions.
[2025-06-05 11:56:48] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:56:48] [INFO ] Decomposing Gal with order
[2025-06-05 11:56:48] [INFO ] Computing symmetric may enable matrix : 220 transitions.
[2025-06-05 11:56:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:56:48] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:56:48] [INFO ] Computing Do-Not-Accords matrix : 220 transitions.
[2025-06-05 11:56:48] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:56:48] [INFO ] Removed a total of 18 redundant transitions.
[2025-06-05 11:56:48] [INFO ] Flatten gal took : 58 ms
[2025-06-05 11:56:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 4 ms.
[2025-06-05 11:56:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9427536622424416734.gal : 10 ms
[2025-06-05 11:56:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality777950361725555296.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/ReachabilityCardinality9427536622424416734.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality777950361725555296.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 ...306
[2025-06-05 11:56:49] [INFO ] Built C files in 505ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18163471034062313128
Loading property file /tmp/ReachabilityCardinality777950361725555296.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 25
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :25 after 35
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :35 after 168
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :168 after 230
Running compilation step : cd /tmp/ltsmin18163471034062313128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :230 after 1039
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1039 after 1138
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1138 after 1407
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1407 after 3068
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3068 after 4449
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4449 after 7075
Compilation finished in 1010 ms.
Running link step : cd /tmp/ltsmin18163471034062313128;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin18163471034062313128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BugTrackingPTq3m004ReachabilityCardinality202506==true'
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7075 after 20064
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :20064 after 57726
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :57726 after 185260
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :185260 after 631216
LTSmin run took 125162 ms.
Found Violation
FORMULA BugTracking-PT-q3m004-ReachabilityCardinality-2025-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2429214 ms.

BK_STOP 1749124736120

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="BugTracking-PT-q3m004"
export BK_EXAMINATION="ReachabilityCardinality"
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 BugTracking-PT-q3m004, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r016-smll-174853765200494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m004.tgz
mv BugTracking-PT-q3m004 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;