Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729900750.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 AutonomousCar-PT-10a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729900750
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 AutonomousCar-PT-10a-ReachabilityCardinality-2025-00
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2025-01
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2025-02
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2025-03
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2025-04
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2025-05
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2025-06
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2025-07
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2025-08
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2025-09
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2025-10
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2025-11
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2025-12
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2025-13
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2025-14
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748661701764

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-31 03:21:42] [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-05-31 03:21:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 03:21:43] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2025-05-31 03:21:43] [INFO ] Transformed 97 places.
[2025-05-31 03:21:43] [INFO ] Transformed 1921 transitions.
[2025-05-31 03:21:43] [INFO ] Found NUPN structural information;
[2025-05-31 03:21:43] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 317 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 423 transitions
Reduce redundant transitions removed 423 transitions.
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1844 resets) in 4577 ms. (8 steps per ms) remains 5/9 properties
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (128 resets) in 219 ms. (181 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (140 resets) in 192 ms. (207 steps per ms) remains 5/5 properties
[2025-05-31 03:21:44] [INFO ] Flatten gal took : 924 ms
BEST_FIRST walk for 40004 steps (130 resets) in 582 ms. (68 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (150 resets) in 238 ms. (167 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (109 resets) in 198 ms. (201 steps per ms) remains 5/5 properties
[2025-05-31 03:21:45] [INFO ] Flow matrix only has 1497 transitions (discarded 1 similar events)
// Phase 1: matrix 1497 rows 97 cols
[2025-05-31 03:21:45] [INFO ] Computed 15 invariants in 33 ms
[2025-05-31 03:21:45] [INFO ] Flatten gal took : 339 ms
[2025-05-31 03:21:45] [INFO ] State equation strengthened by 403 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
[2025-05-31 03:21:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6556388219680576594.gal : 148 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 03:21:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality944589421203403861.prop : 4 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/ReachabilityCardinality6556388219680576594.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality944589421203403861.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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AutonomousCar-PT-10a-ReachabilityCardinality-2025-06 is UNSAT
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 38/97 variables, 14/74 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 38/112 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Loading property file /tmp/ReachabilityCardinality944589421203403861.prop.
At refinement iteration 6 (OVERLAPS) 1496/1593 variables, 97/209 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1593 variables, 402/611 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1593 variables, 0/611 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1594 variables, 1/612 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1594 variables, 0/612 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :8 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 46
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :46 after 56
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :56 after 298
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :298 after 362
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :362 after 2116
At refinement iteration 11 (OVERLAPS) 0/1594 variables, 0/612 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :2116 after 7554
After SMT solving in domain Real declared 1594/1594 variables, and 612 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1333 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 97/97 constraints, ReadFeed: 403/403 constraints, PredecessorRefiner: 5/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 50/97 variables, 15/62 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :7554 after 9858
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 50/112 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :9858 after 40314
[2025-05-31 03:21:47] [INFO ] Deduced a trap composed of 7 places in 658 ms of which 31 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/113 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1496/1593 variables, 97/210 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1593 variables, 402/612 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1593 variables, 2/614 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :40314 after 242978
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:21:48] [INFO ] Deduced a trap along path composed of 2 places in 183 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:21:48] [INFO ] Deduced a trap along path composed of 2 places in 186 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:21:49] [INFO ] Deduced a trap along path composed of 2 places in 143 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:21:49] [INFO ] Deduced a trap along path composed of 2 places in 98 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:21:49] [INFO ] Deduced a trap along path composed of 2 places in 93 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:21:49] [INFO ] Deduced a trap along path composed of 2 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1593 variables, 6/620 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:21:50] [INFO ] Deduced a trap along path composed of 2 places in 68 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1593 variables, 1/621 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1593/1594 variables, and 621 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5010 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 97/97 constraints, ReadFeed: 402/403 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 6559ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 1498/1498 transitions.
Graph (complete) has 1257 edges and 97 vertex of which 95 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.25 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) 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 0 with 2 rules applied. Total rules applied 3 place count 95 transition count 1494
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 94 transition count 1493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 93 transition count 1493
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 93 transition count 1492
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 92 transition count 1492
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 11 place count 89 transition count 1459
Iterating global reduction 3 with 3 rules applied. Total rules applied 14 place count 89 transition count 1459
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 17 place count 89 transition count 1456
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 30 place count 86 transition count 1446
Applied a total of 30 rules in 406 ms. Remains 86 /97 variables (removed 11) and now considering 1446/1498 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 417 ms. Remains : 86/97 places, 1446/1498 transitions.
RANDOM walk for 40000 steps (1895 resets) in 1427 ms. (28 steps per ms) remains 3/4 properties
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (154 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (133 resets) in 232 ms. (171 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (119 resets) in 153 ms. (259 steps per ms) remains 2/3 properties
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1446 rows 86 cols
[2025-05-31 03:21:52] [INFO ] Computed 14 invariants in 16 ms
[2025-05-31 03:21:52] [INFO ] State equation strengthened by 362 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/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/79 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/85 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1446/1531 variables, 85/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1531 variables, 362/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1531 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1532 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1532 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1532 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1532/1532 variables, and 462 constraints, problems are : Problem set: 0 solved, 2 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 86/86 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/79 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/85 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :242978 after 1.46928e+06
At refinement iteration 5 (OVERLAPS) 1446/1531 variables, 85/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1531 variables, 362/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:21:54] [INFO ] Deduced a trap along path composed of 2 places in 163 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:21:54] [INFO ] Deduced a trap along path composed of 2 places in 151 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:21:54] [INFO ] Deduced a trap along path composed of 2 places in 149 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:21:54] [INFO ] Deduced a trap along path composed of 2 places in 120 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:21:54] [INFO ] Deduced a trap along path composed of 2 places in 95 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:21:54] [INFO ] Deduced a trap along path composed of 2 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1531 variables, 6/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1531 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/1532 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1532 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1532 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1532 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1532/1532 variables, and 469 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2160 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 86/86 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 2717ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1259 ms.
Support contains 31 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 1446/1446 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 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 1445
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 85 transition count 1444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 84 transition count 1444
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 7 place count 81 transition count 1411
Iterating global reduction 3 with 3 rules applied. Total rules applied 10 place count 81 transition count 1411
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 13 place count 81 transition count 1408
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 46 place count 78 transition count 1378
Applied a total of 46 rules in 226 ms. Remains 78 /86 variables (removed 8) and now considering 1378/1446 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 78/86 places, 1378/1446 transitions.
RANDOM walk for 40000 steps (1463 resets) in 1098 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (154 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (149 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 624934 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :0 out of 2
Probabilistic random walk after 624934 steps, saw 95396 distinct states, run finished after 3005 ms. (steps per millisecond=207 ) properties seen :0
// Phase 1: matrix 1378 rows 78 cols
[2025-05-31 03:22:00] [INFO ] Computed 14 invariants in 14 ms
[2025-05-31 03:22:00] [INFO ] State equation strengthened by 302 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/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/72 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/77 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1378/1455 variables, 77/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1455 variables, 302/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1455 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1456 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1456 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1456 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1456/1456 variables, and 394 constraints, problems are : Problem set: 0 solved, 2 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 78/78 constraints, ReadFeed: 302/302 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/72 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/77 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1378/1455 variables, 77/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1455 variables, 302/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:01] [INFO ] Deduced a trap along path composed of 2 places in 156 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:01] [INFO ] Deduced a trap along path composed of 2 places in 114 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:01] [INFO ] Deduced a trap along path composed of 2 places in 82 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:01] [INFO ] Deduced a trap along path composed of 2 places in 63 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:02] [INFO ] Deduced a trap along path composed of 2 places in 89 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:02] [INFO ] Deduced a trap along path composed of 2 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1455 variables, 6/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1455 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/1456 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1456 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1456 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1456 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1456/1456 variables, and 401 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1848 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 78/78 constraints, ReadFeed: 302/302 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 2322ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3532 ms.
Support contains 31 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 1378/1378 transitions.
Applied a total of 0 rules in 87 ms. Remains 78 /78 variables (removed 0) and now considering 1378/1378 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 78/78 places, 1378/1378 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 1378/1378 transitions.
Applied a total of 0 rules in 90 ms. Remains 78 /78 variables (removed 0) and now considering 1378/1378 (removed 0) transitions.
[2025-05-31 03:22:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:22:07] [INFO ] Implicit Places using invariants in 508 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 520 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 77/78 places, 1378/1378 transitions.
Applied a total of 0 rules in 77 ms. Remains 77 /77 variables (removed 0) and now considering 1378/1378 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 688 ms. Remains : 77/78 places, 1378/1378 transitions.
RANDOM walk for 40000 steps (1458 resets) in 1123 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (155 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (153 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 672220 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :0 out of 2
Probabilistic random walk after 672220 steps, saw 102199 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
// Phase 1: matrix 1378 rows 77 cols
[2025-05-31 03:22:10] [INFO ] Computed 13 invariants in 18 ms
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/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/72 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1378/1454 variables, 76/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1454 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/1455 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1455 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1455 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1455/1455 variables, and 90 constraints, problems are : Problem set: 0 solved, 2 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/72 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1378/1454 variables, 76/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:11] [INFO ] Deduced a trap along path composed of 2 places in 124 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:11] [INFO ] Deduced a trap along path composed of 2 places in 125 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:11] [INFO ] Deduced a trap along path composed of 2 places in 93 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:11] [INFO ] Deduced a trap along path composed of 2 places in 69 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:11] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1454 variables, 5/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1454 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1455 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1455 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:12] [INFO ] Deduced a trap along path composed of 2 places in 53 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:12] [INFO ] Deduced a trap along path composed of 2 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1455 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:12] [INFO ] Deduced a trap along path composed of 2 places in 48 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1455 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1455 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1455 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1455/1455 variables, and 99 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 2440ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :1.46928e+06 after 5.89261e+06
Parikh walk visited 0 properties in 3187 ms.
Support contains 31 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 1378/1378 transitions.
Applied a total of 0 rules in 72 ms. Remains 77 /77 variables (removed 0) and now considering 1378/1378 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 77/77 places, 1378/1378 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 1378/1378 transitions.
Applied a total of 0 rules in 74 ms. Remains 77 /77 variables (removed 0) and now considering 1378/1378 (removed 0) transitions.
[2025-05-31 03:22:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:22:16] [INFO ] Implicit Places using invariants in 353 ms returned []
[2025-05-31 03:22:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:22:17] [INFO ] Implicit Places using invariants and state equation in 666 ms returned [73, 75]
Discarding 2 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1024 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 75/77 places, 1377/1378 transitions.
Applied a total of 0 rules in 77 ms. Remains 75 /75 variables (removed 0) and now considering 1377/1377 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1176 ms. Remains : 75/77 places, 1377/1378 transitions.
RANDOM walk for 40000 steps (1342 resets) in 1578 ms. (25 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (157 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (157 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 661689 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :0 out of 2
Probabilistic random walk after 661689 steps, saw 100810 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
// Phase 1: matrix 1377 rows 75 cols
[2025-05-31 03:22:20] [INFO ] Computed 12 invariants in 11 ms
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/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/71 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/75 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1377/1452 variables, 75/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1452 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1452 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1452/1452 variables, and 87 constraints, problems are : Problem set: 0 solved, 2 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/71 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/75 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1377/1452 variables, 75/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1452 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:21] [INFO ] Deduced a trap along path composed of 2 places in 122 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:22] [INFO ] Deduced a trap along path composed of 2 places in 84 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:22] [INFO ] Deduced a trap along path composed of 2 places in 125 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:22] [INFO ] Deduced a trap along path composed of 2 places in 127 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:22] [INFO ] Deduced a trap along path composed of 2 places in 95 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:22] [INFO ] Deduced a trap along path composed of 2 places in 125 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:22] [INFO ] Deduced a trap along path composed of 2 places in 94 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:22] [INFO ] Deduced a trap along path composed of 2 places in 70 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:23] [INFO ] Deduced a trap along path composed of 2 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1452 variables, 9/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1452 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1452 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1452/1452 variables, and 97 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2121 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 9/9 constraints]
After SMT, in 2542ms problems are : Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :5.89261e+06 after 2.3681e+07
Parikh walk visited 0 properties in 5484 ms.
Support contains 31 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 1377/1377 transitions.
Applied a total of 0 rules in 87 ms. Remains 75 /75 variables (removed 0) and now considering 1377/1377 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 75/75 places, 1377/1377 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 1377/1377 transitions.
Applied a total of 0 rules in 75 ms. Remains 75 /75 variables (removed 0) and now considering 1377/1377 (removed 0) transitions.
[2025-05-31 03:22:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:22:29] [INFO ] Implicit Places using invariants in 326 ms returned []
[2025-05-31 03:22:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:22:30] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 03:22:30] [INFO ] Redundant transitions in 95 ms returned []
Running 1376 sub problems to find dead transitions.
[2025-05-31 03:22:30] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1376 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1376 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:22:41] [INFO ] Deduced a trap composed of 24 places in 739 ms of which 60 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 75/1452 variables, and 13 constraints, problems are : Problem set: 0 solved, 1376 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/75 constraints, PredecessorRefiner: 1376/14 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1376 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1376 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1376 unsolved
At refinement iteration 4 (OVERLAPS) 1377/1452 variables, 75/88 constraints. Problems are: Problem set: 0 solved, 1376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1452 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 1376 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:23:28] [INFO ] Deduced a trap composed of 24 places in 595 ms of which 39 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1452/1452 variables, and 103 constraints, problems are : Problem set: 0 solved, 1376 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 1376/14 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63054ms problems are : Problem set: 0 solved, 1376 unsolved
Search for dead transitions found 0 dead transitions in 63065ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64252 ms. Remains : 75/75 places, 1377/1377 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 03:23:33] [INFO ] Flatten gal took : 214 ms
[2025-05-31 03:23:33] [INFO ] Applying decomposition
[2025-05-31 03:23:33] [INFO ] Flatten gal took : 213 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/graph14121363196309716772.txt' '-o' '/tmp/graph14121363196309716772.bin' '-w' '/tmp/graph14121363196309716772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14121363196309716772.bin' '-l' '-1' '-v' '-w' '/tmp/graph14121363196309716772.weights' '-q' '0' '-e' '0.001'
[2025-05-31 03:23:34] [INFO ] Decomposing Gal with order
[2025-05-31 03:23:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 03:23:35] [INFO ] Removed a total of 13128 redundant transitions.
[2025-05-31 03:23:35] [INFO ] Flatten gal took : 552 ms
[2025-05-31 03:23:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 224 ms.
[2025-05-31 03:23:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4774857847141180764.gal : 27 ms
[2025-05-31 03:23:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13777131066252870770.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4774857847141180764.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13777131066252870770.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/ReachabilityCardinality13777131066252870770.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :2 after 1.79159e+07
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1.79159e+07 after 2.04776e+08
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :2.04776e+08 after 3.06895e+08
Detected timeout of ITS tools.
[2025-05-31 03:53:39] [INFO ] Flatten gal took : 1126 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4253510747386492172
[2025-05-31 03:53:40] [INFO ] Computing symmetric may disable matrix : 1377 transitions.
[2025-05-31 03:53:40] [INFO ] Applying decomposition
[2025-05-31 03:53:41] [INFO ] Computation of Complete disable matrix. took 851 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 03:53:42] [INFO ] Flatten gal took : 2278 ms
[2025-05-31 03:53:43] [INFO ] Computing symmetric may enable matrix : 1377 transitions.
[2025-05-31 03:53:43] [INFO ] Computation of Complete enable matrix. took 326 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph4808042891962146592.txt' '-o' '/tmp/graph4808042891962146592.bin' '-w' '/tmp/graph4808042891962146592.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4808042891962146592.bin' '-l' '-1' '-v' '-w' '/tmp/graph4808042891962146592.weights' '-q' '0' '-e' '0.001'
[2025-05-31 03:53:45] [INFO ] Computing Do-Not-Accords matrix : 1377 transitions.
[2025-05-31 03:53:45] [INFO ] Decomposing Gal with order
[2025-05-31 03:53:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 03:53:45] [INFO ] Computation of Completed DNA matrix. took 105 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 03:53:45] [INFO ] Removed a total of 12327 redundant transitions.
[2025-05-31 03:53:45] [INFO ] Built C files in 5667ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4253510747386492172
[2025-05-31 03:53:45] [INFO ] Flatten gal took : 276 ms
Running compilation step : cd /tmp/ltsmin4253510747386492172;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
[2025-05-31 03:54:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 184 ms.
[2025-05-31 03:54:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8035552213775044865.gal : 9 ms
[2025-05-31 03:54:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5096549545464632082.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/ReachabilityCardinality8035552213775044865.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5096549545464632082.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 ...307
Loading property file /tmp/ReachabilityCardinality5096549545464632082.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :2 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 9362
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9362 after 619154
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :619154 after 3.09941e+07
Compilation finished in 49263 ms.
Running link step : cd /tmp/ltsmin4253510747386492172;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 120 ms.
Running LTSmin : cd /tmp/ltsmin4253510747386492172;'/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' 'AutonomousCarPT10aReachabilityCardinality202501==true'
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.72128e+09,60.1803,1060436,11350,164,825803,1798,4433,1.04269e+07,114,16033,0
Total reachable state count : 2721284354

Verifying 2 reachability properties.
Invariant property AutonomousCar-PT-10a-ReachabilityCardinality-2025-01 does not hold.
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutonomousCar-PT-10a-ReachabilityCardinality-2025-01,5.39597e+07,62.1818,1060436,6692,61,825803,1798,4440,1.04269e+07,120,16033,10950
Reachability property AutonomousCar-PT-10a-ReachabilityCardinality-2025-09 is true.
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutonomousCar-PT-10a-ReachabilityCardinality-2025-09,768,65.4035,1060436,79,29,825803,1798,4503,1.04269e+07,134,16033,37292
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2093875 ms.

BK_STOP 1748663797155

--------------------
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="AutonomousCar-PT-10a"
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 AutonomousCar-PT-10a, 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 r002-tall-174853729900750"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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