Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 8.9K Jun 6 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 6 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jun 6 09:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 6 09:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 12:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 12:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 14K Jun 6 09:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Jun 6 09:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Jun 6 09:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 11M Jun 5 20:08 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 MedleyB-PT-B08-ReachabilityCardinality-2025-00
FORMULA_NAME MedleyB-PT-B08-ReachabilityCardinality-2025-01
FORMULA_NAME MedleyB-PT-B08-ReachabilityCardinality-2025-02
FORMULA_NAME MedleyB-PT-B08-ReachabilityCardinality-2025-03
FORMULA_NAME MedleyB-PT-B08-ReachabilityCardinality-2025-04
FORMULA_NAME MedleyB-PT-B08-ReachabilityCardinality-2025-05
FORMULA_NAME MedleyB-PT-B08-ReachabilityCardinality-2025-06
FORMULA_NAME MedleyB-PT-B08-ReachabilityCardinality-2025-07
FORMULA_NAME MedleyB-PT-B08-ReachabilityCardinality-2025-08
FORMULA_NAME MedleyB-PT-B08-ReachabilityCardinality-2025-09
FORMULA_NAME MedleyB-PT-B08-ReachabilityCardinality-2025-10
FORMULA_NAME MedleyB-PT-B08-ReachabilityCardinality-2025-11
FORMULA_NAME MedleyB-PT-B08-ReachabilityCardinality-2025-12
FORMULA_NAME MedleyB-PT-B08-ReachabilityCardinality-2025-13
FORMULA_NAME MedleyB-PT-B08-ReachabilityCardinality-2025-14
FORMULA_NAME MedleyB-PT-B08-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749398762052

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-08 16:06:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 16:06:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 16:06:03] [INFO ] Load time of PNML (sax parser for PT used): 611 ms
[2025-06-08 16:06:04] [INFO ] Transformed 1099 places.
[2025-06-08 16:06:04] [INFO ] Transformed 14556 transitions.
[2025-06-08 16:06:04] [INFO ] Found NUPN structural information;
[2025-06-08 16:06:04] [INFO ] Parsed PT model containing 1099 places and 14556 transitions and 216508 arcs in 802 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (290 resets) in 2712 ms. (14 steps per ms) remains 8/16 properties
FORMULA MedleyB-PT-B08-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B08-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B08-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B08-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B08-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B08-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B08-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B08-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (38 resets) in 667 ms. (59 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (52 resets) in 626 ms. (63 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (39 resets) in 297 ms. (134 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (37 resets) in 288 ms. (138 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (37 resets) in 366 ms. (109 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (39 resets) in 315 ms. (126 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (38 resets) in 183 ms. (217 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (35 resets) in 199 ms. (200 steps per ms) remains 8/8 properties
// Phase 1: matrix 14556 rows 1099 cols
[2025-06-08 16:06:06] [INFO ] Computed 9 invariants in 598 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 16:06:07] [INFO ] Flatten gal took : 2207 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MedleyB-PT-B08-ReachabilityCardinality-2025-10 is UNSAT
FORMULA MedleyB-PT-B08-ReachabilityCardinality-2025-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 950/1099 variables, 9/158 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1099 variables, 950/1108 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1099 variables, 0/1108 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2025-06-08 16:06:08] [INFO ] Flatten gal took : 1187 ms
[2025-06-08 16:06:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11040870138127331407.gal : 313 ms
[2025-06-08 16:06:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality571466610826061150.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/ReachabilityCardinality11040870138127331407.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality571466610826061150.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 15655/15655 variables, and 2207 constraints, problems are : Problem set: 1 solved, 7 unsolved in 5059 ms.
Refiners :[Domain max(s): 1099/1099 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 1099/1099 constraints, PredecessorRefiner: 8/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 955/1080 variables, 8/133 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1080 variables, 955/1088 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Loading property file /tmp/ReachabilityCardinality571466610826061150.prop.
[2025-06-08 16:06:18] [INFO ] Deduced a trap composed of 188 places in 6053 ms of which 361 ms to minimize.
SMT process timed out in 12506ms, After SMT, problems are : Problem set: 1 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 125 out of 1099 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1099/1099 places, 14556/14556 transitions.
Graph (trivial) has 862 edges and 1099 vertex of which 69 / 1099 are part of one of the 14 SCC in 6 ms
Free SCC test removed 55 places
Drop transitions (Empty/Sink Transition effects.) removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Graph (complete) has 2492 edges and 1044 vertex of which 1032 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.68 ms
Discarding 12 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 520 transitions
Trivial Post-agglo rules discarded 520 transitions
Performed 520 trivial Post agglomeration. Transition count delta: 520
Iterating post reduction 0 with 523 rules applied. Total rules applied 525 place count 1032 transition count 13955
Reduce places removed 520 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 537 rules applied. Total rules applied 1062 place count 512 transition count 13938
Reduce places removed 8 places and 0 transitions.
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Iterating post reduction 2 with 85 rules applied. Total rules applied 1147 place count 504 transition count 13861
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 80 rules applied. Total rules applied 1227 place count 427 transition count 13858
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1228 place count 426 transition count 13858
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 26 Pre rules applied. Total rules applied 1228 place count 426 transition count 13832
Deduced a syphon composed of 26 places in 10 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 1280 place count 400 transition count 13832
Discarding 53 places :
Symmetric choice reduction at 5 with 53 rule applications. Total rules 1333 place count 347 transition count 13779
Iterating global reduction 5 with 53 rules applied. Total rules applied 1386 place count 347 transition count 13779
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 4 rules applied. Total rules applied 1390 place count 347 transition count 13775
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1391 place count 346 transition count 13775
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1391 place count 346 transition count 13773
Deduced a syphon composed of 2 places in 27 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1395 place count 344 transition count 13773
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1406 place count 333 transition count 2963
Iterating global reduction 7 with 11 rules applied. Total rules applied 1417 place count 333 transition count 2963
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1420 place count 333 transition count 2960
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 5 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 8 with 62 rules applied. Total rules applied 1482 place count 302 transition count 2929
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1485 place count 299 transition count 2926
Iterating global reduction 8 with 3 rules applied. Total rules applied 1488 place count 299 transition count 2926
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1498 place count 294 transition count 2927
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1502 place count 294 transition count 2923
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1507 place count 294 transition count 2918
Free-agglomeration rule applied 39 times.
Iterating global reduction 9 with 39 rules applied. Total rules applied 1546 place count 294 transition count 2879
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 9 with 39 rules applied. Total rules applied 1585 place count 255 transition count 2879
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1587 place count 255 transition count 2877
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1590 place count 255 transition count 2877
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1591 place count 255 transition count 2876
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1592 place count 255 transition count 2876
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1593 place count 254 transition count 2875
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 10 with 8 rules applied. Total rules applied 1601 place count 253 transition count 2868
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 1609 place count 246 transition count 2867
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 7 Pre rules applied. Total rules applied 1609 place count 246 transition count 2860
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 12 with 14 rules applied. Total rules applied 1623 place count 239 transition count 2860
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1631 place count 235 transition count 2856
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 1635 place count 235 transition count 2852
Drop transitions (Redundant composition of simpler transitions.) removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 13 with 128 rules applied. Total rules applied 1763 place count 235 transition count 2724
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1764 place count 235 transition count 2723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1765 place count 234 transition count 2723
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1766 place count 234 transition count 2722
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1768 place count 234 transition count 2722
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1769 place count 234 transition count 2721
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1770 place count 233 transition count 2720
Iterating global reduction 14 with 1 rules applied. Total rules applied 1771 place count 233 transition count 2720
Applied a total of 1771 rules in 8204 ms. Remains 233 /1099 variables (removed 866) and now considering 2720/14556 (removed 11836) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8211 ms. Remains : 233/1099 places, 2720/14556 transitions.
RANDOM walk for 40000 steps (806 resets) in 527 ms. (75 steps per ms) remains 6/7 properties
FORMULA MedleyB-PT-B08-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (131 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (164 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (132 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (132 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (132 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (129 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
// Phase 1: matrix 2720 rows 233 cols
[2025-06-08 16:06:27] [INFO ] Computed 4 invariants in 16 ms
[2025-06-08 16:06:27] [INFO ] State equation strengthened by 1488 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 58/171 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2698/2869 variables, 171/175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2869 variables, 776/951 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2869 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 79/2948 variables, 58/1009 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2948 variables, 712/1721 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2948 variables, 0/1721 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 4/2952 variables, 3/1724 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2952 variables, 0/1724 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/2953 variables, 1/1725 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2953 variables, 0/1725 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/2953 variables, 0/1725 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2953/2953 variables, and 1725 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3545 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 233/233 constraints, ReadFeed: 1488/1488 constraints, PredecessorRefiner: 6/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 58/171 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:31] [INFO ] Deduced a trap composed of 26 places in 479 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:32] [INFO ] Deduced a trap composed of 24 places in 516 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:32] [INFO ] Deduced a trap composed of 33 places in 453 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:33] [INFO ] Deduced a trap composed of 46 places in 394 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:33] [INFO ] Deduced a trap composed of 27 places in 449 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2698/2869 variables, 171/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2869 variables, 776/956 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:35] [INFO ] Deduced a trap composed of 26 places in 447 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:35] [INFO ] Deduced a trap composed of 29 places in 450 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:36] [INFO ] Deduced a trap composed of 30 places in 416 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:36] [INFO ] Deduced a trap composed of 32 places in 387 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2869 variables, 4/960 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:37] [INFO ] Deduced a trap composed of 45 places in 331 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2869 variables, 1/961 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:38] [INFO ] Deduced a trap composed of 46 places in 413 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:39] [INFO ] Deduced a trap composed of 46 places in 335 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:39] [INFO ] Deduced a trap composed of 47 places in 328 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2869 variables, 3/964 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:40] [INFO ] Deduced a trap composed of 47 places in 328 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2869 variables, 1/965 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:41] [INFO ] Deduced a trap composed of 26 places in 389 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:41] [INFO ] Deduced a trap composed of 42 places in 350 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2869 variables, 2/967 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2869 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 79/2948 variables, 58/1025 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2948 variables, 712/1737 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2948 variables, 1/1738 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:44] [INFO ] Deduced a trap composed of 33 places in 640 ms of which 13 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :12 after 19
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :19 after 21
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :21 after 190
At refinement iteration 15 (INCLUDED_ONLY) 0/2948 variables, 1/1739 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :190 after 5884
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:45] [INFO ] Deduced a trap composed of 26 places in 574 ms of which 10 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :5884 after 166191
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :166191 after 166425
At refinement iteration 16 (INCLUDED_ONLY) 0/2948 variables, 1/1740 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :166425 after 355016
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :355016 after 461422
At refinement iteration 17 (INCLUDED_ONLY) 0/2948 variables, 0/1740 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :461422 after 1.83964e+06
At refinement iteration 18 (OVERLAPS) 4/2952 variables, 3/1743 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:48] [INFO ] Deduced a trap composed of 37 places in 648 ms of which 12 ms to minimize.
Problem MedleyB-PT-B08-ReachabilityCardinality-2025-06 is UNSAT
FORMULA MedleyB-PT-B08-ReachabilityCardinality-2025-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 19 (INCLUDED_ONLY) 0/2952 variables, 1/1744 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :1.83964e+06 after 8.89021e+06
[2025-06-08 16:06:50] [INFO ] Deduced a trap composed of 46 places in 671 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:51] [INFO ] Deduced a trap composed of 53 places in 791 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:06:51] [INFO ] Deduced a trap composed of 58 places in 609 ms of which 12 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2952 variables, 3/1747 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2952 variables, 0/1747 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 1/2953 variables, 1/1748 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2953 variables, 0/1748 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/2953 variables, 0/1748 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2953/2953 variables, and 1748 constraints, problems are : Problem set: 1 solved, 5 unsolved in 24446 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 233/233 constraints, ReadFeed: 1488/1488 constraints, PredecessorRefiner: 6/1 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28339ms problems are : Problem set: 1 solved, 5 unsolved
Parikh walk visited 0 properties in 1346 ms.
Support contains 97 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 2720/2720 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 233 transition count 2695
Reduce places removed 24 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 30 rules applied. Total rules applied 55 place count 209 transition count 2689
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 64 place count 203 transition count 2686
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 64 place count 203 transition count 2684
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 201 transition count 2684
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 71 place count 198 transition count 2681
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 198 transition count 2681
Performed 5 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 84 place count 193 transition count 2644
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 116 place count 193 transition count 2612
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 118 place count 192 transition count 2611
Drop transitions (Redundant composition of simpler transitions.) removed 650 transitions
Redundant transition composition rules discarded 650 transitions
Iterating global reduction 4 with 650 rules applied. Total rules applied 768 place count 192 transition count 1961
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 770 place count 191 transition count 1960
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 780 place count 191 transition count 1950
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Iterating post reduction 4 with 442 rules applied. Total rules applied 1222 place count 181 transition count 1518
Drop transitions (Redundant composition of simpler transitions.) removed 321 transitions
Redundant transition composition rules discarded 321 transitions
Iterating global reduction 5 with 321 rules applied. Total rules applied 1543 place count 181 transition count 1197
Applied a total of 1543 rules in 1050 ms. Remains 181 /233 variables (removed 52) and now considering 1197/2720 (removed 1523) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1050 ms. Remains : 181/233 places, 1197/2720 transitions.
RANDOM walk for 40000 steps (927 resets) in 307 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (159 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (198 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (169 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (165 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (154 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 583163 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 5
Probabilistic random walk after 583163 steps, saw 92116 distinct states, run finished after 3008 ms. (steps per millisecond=193 ) properties seen :0
// Phase 1: matrix 1197 rows 181 cols
[2025-06-08 16:07:01] [INFO ] Computed 5 invariants in 9 ms
[2025-06-08 16:07:01] [INFO ] State equation strengthened by 512 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/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 53/150 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1343 variables, 150/155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1343 variables, 512/667 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1343 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 35/1378 variables, 31/698 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1378 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1378 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1378/1378 variables, and 698 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1221 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 512/512 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 53/150 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:03] [INFO ] Deduced a trap composed of 26 places in 252 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:03] [INFO ] Deduced a trap composed of 20 places in 269 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:03] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:03] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:04] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:04] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:04] [INFO ] Deduced a trap composed of 20 places in 269 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:04] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1193/1343 variables, 150/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1343 variables, 512/675 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:05] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:06] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1343 variables, 2/677 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:06] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1343 variables, 1/678 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1343 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 35/1378 variables, 31/709 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1378 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:07] [INFO ] Deduced a trap composed of 20 places in 395 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:08] [INFO ] Deduced a trap composed of 23 places in 500 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:08] [INFO ] Deduced a trap composed of 26 places in 358 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:09] [INFO ] Deduced a trap composed of 35 places in 352 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:09] [INFO ] Deduced a trap composed of 36 places in 316 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:09] [INFO ] Deduced a trap composed of 47 places in 293 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1378 variables, 6/716 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:10] [INFO ] Deduced a trap composed of 20 places in 366 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :8.89021e+06 after 3.62428e+10
[2025-06-08 16:07:11] [INFO ] Deduced a trap composed of 47 places in 291 ms of which 12 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1378 variables, 2/718 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1378 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:12] [INFO ] Deduced a trap composed of 19 places in 387 ms of which 9 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/1378 variables, 1/719 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:12] [INFO ] Deduced a trap composed of 32 places in 342 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:13] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1378 variables, 2/721 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1378 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/1378 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1378/1378 variables, and 721 constraints, problems are : Problem set: 0 solved, 5 unsolved in 12096 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 512/512 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13390ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 403 ms.
Support contains 97 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 1197/1197 transitions.
Applied a total of 0 rules in 106 ms. Remains 181 /181 variables (removed 0) and now considering 1197/1197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 181/181 places, 1197/1197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 1197/1197 transitions.
Applied a total of 0 rules in 104 ms. Remains 181 /181 variables (removed 0) and now considering 1197/1197 (removed 0) transitions.
[2025-06-08 16:07:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 16:07:15] [INFO ] Implicit Places using invariants in 436 ms returned []
[2025-06-08 16:07:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 16:07:16] [INFO ] State equation strengthened by 512 read => feed constraints.
[2025-06-08 16:07:17] [INFO ] Implicit Places using invariants and state equation in 1209 ms returned []
Implicit Place search using SMT with State Equation took 1664 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 16:07:17] [INFO ] Redundant transitions in 102 ms returned []
Running 1192 sub problems to find dead transitions.
[2025-06-08 16:07:17] [INFO ] Invariant cache hit.
[2025-06-08 16:07:17] [INFO ] State equation strengthened by 512 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 1 (OVERLAPS) 2/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:31] [INFO ] Deduced a trap composed of 35 places in 224 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:31] [INFO ] Deduced a trap composed of 18 places in 241 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:31] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:32] [INFO ] Deduced a trap composed of 28 places in 402 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:32] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:32] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:33] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:33] [INFO ] Deduced a trap composed of 28 places in 241 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:33] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:33] [INFO ] Deduced a trap composed of 23 places in 262 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:34] [INFO ] Deduced a trap composed of 29 places in 260 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:34] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:34] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:35] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:35] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:35] [INFO ] Deduced a trap composed of 42 places in 194 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:35] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:35] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:36] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:36] [INFO ] Deduced a trap composed of 44 places in 203 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:37] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:37] [INFO ] Deduced a trap composed of 44 places in 192 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:37] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:37] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:38] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:38] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:38] [INFO ] Deduced a trap composed of 46 places in 188 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:39] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:39] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:40] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:40] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:40] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:40] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:41] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:41] [INFO ] Deduced a trap composed of 39 places in 237 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:41] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:41] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 181/1378 variables, and 42 constraints, problems are : Problem set: 0 solved, 1192 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/181 constraints, ReadFeed: 0/512 constraints, PredecessorRefiner: 1192/181 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1192 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 1 (OVERLAPS) 2/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 37/42 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:54] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:55] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:56] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:07:56] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 5 (OVERLAPS) 1197/1378 variables, 181/227 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1378 variables, 512/739 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1378/1378 variables, and 920 constraints, problems are : Problem set: 0 solved, 1192 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 512/512 constraints, PredecessorRefiner: 1192/181 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62615ms problems are : Problem set: 0 solved, 1192 unsolved
Search for dead transitions found 0 dead transitions in 62639ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64531 ms. Remains : 181/181 places, 1197/1197 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 67 ms. Remains 181 /181 variables (removed 0) and now considering 1197/1197 (removed 0) transitions.
Running SMT prover for 5 properties.
[2025-06-08 16:08:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-08 16:08:20] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-08 16:08:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-08 16:08:20] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:08:21] [INFO ] Deduced a trap composed of 22 places in 386 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:08:21] [INFO ] Deduced a trap composed of 35 places in 364 ms of which 15 ms to minimize.
[2025-06-08 16:08:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 840 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:08:21] [INFO ] Deduced a trap composed of 36 places in 341 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:08:22] [INFO ] Deduced a trap composed of 38 places in 304 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:08:22] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 6 ms to minimize.
[2025-06-08 16:08:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1050 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:08:23] [INFO ] Deduced a trap composed of 24 places in 364 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:08:23] [INFO ] Deduced a trap composed of 27 places in 321 ms of which 7 ms to minimize.
[2025-06-08 16:08:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 779 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:08:24] [INFO ] Deduced a trap composed of 26 places in 387 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:08:24] [INFO ] Deduced a trap composed of 27 places in 348 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:08:24] [INFO ] Deduced a trap composed of 35 places in 280 ms of which 7 ms to minimize.
[2025-06-08 16:08:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1129 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 16:08:25] [INFO ] Deduced a trap composed of 47 places in 233 ms of which 9 ms to minimize.
[2025-06-08 16:08:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
TRAPS : Iteration 3
[2025-06-08 16:08:25] [INFO ] After 5401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2025-06-08 16:08:25] [INFO ] After 5641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2025-06-08 16:08:25] [INFO ] Flatten gal took : 76 ms
[2025-06-08 16:08:25] [INFO ] Flatten gal took : 73 ms
[2025-06-08 16:08:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4555295326127875523.gal : 20 ms
[2025-06-08 16:08:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10513080069857686329.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/ReachabilityCardinality4555295326127875523.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10513080069857686329.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10513080069857686329.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 21
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :21 after 252
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :252 after 314
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :314 after 693
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :693 after 56986
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :56986 after 75438
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :75438 after 137319
Reachability property MedleyB-PT-B08-ReachabilityCardinality-2025-11 is true.
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :137319 after 1.12705e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.12705e+06 after 8.76051e+06
Invariant property MedleyB-PT-B08-ReachabilityCardinality-2025-13 does not hold.
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :8.76051e+06 after 7.10594e+07
Detected timeout of ITS tools.
[2025-06-08 16:08:41] [INFO ] Flatten gal took : 70 ms
[2025-06-08 16:08:41] [INFO ] Applying decomposition
[2025-06-08 16:08:41] [INFO ] Flatten gal took : 67 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/graph7096056609070253548.txt' '-o' '/tmp/graph7096056609070253548.bin' '-w' '/tmp/graph7096056609070253548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7096056609070253548.bin' '-l' '-1' '-v' '-w' '/tmp/graph7096056609070253548.weights' '-q' '0' '-e' '0.001'
[2025-06-08 16:08:41] [INFO ] Decomposing Gal with order
[2025-06-08 16:08:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 16:08:42] [INFO ] Removed a total of 927 redundant transitions.
[2025-06-08 16:08:42] [INFO ] Flatten gal took : 390 ms
[2025-06-08 16:08:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 1182 labels/synchronizations in 52 ms.
[2025-06-08 16:08:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12338859815074083252.gal : 17 ms
[2025-06-08 16:08:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2691980440697925030.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/ReachabilityCardinality12338859815074083252.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2691980440697925030.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/ReachabilityCardinality2691980440697925030.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :2 after 8
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :8 after 4964
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :4964 after 16244
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :16244 after 25640
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :25640 after 1.28804e+06
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.28804e+06 after 1.60473e+06
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :3.62428e+10 after 6.86982e+11
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 37385 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-08 16:08:58] [INFO ] Flatten gal took : 1119 ms
[2025-06-08 16:08:58] [INFO ] Applying decomposition
[2025-06-08 16:08:59] [INFO ] Flatten gal took : 1080 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/graph15376723717416670525.txt' '-o' '/tmp/graph15376723717416670525.bin' '-w' '/tmp/graph15376723717416670525.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15376723717416670525.bin' '-l' '-1' '-v' '-w' '/tmp/graph15376723717416670525.weights' '-q' '0' '-e' '0.001'
[2025-06-08 16:09:02] [INFO ] Decomposing Gal with order
[2025-06-08 16:09:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 16:09:05] [INFO ] Removed a total of 107178 redundant transitions.
[2025-06-08 16:09:05] [INFO ] Flatten gal took : 1811 ms
[2025-06-08 16:09:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 623 ms.
[2025-06-08 16:09:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3726158300071192650.gal : 111 ms
[2025-06-08 16:09:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11050197670111175033.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/ReachabilityCardinality3726158300071192650.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11050197670111175033.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/ReachabilityCardinality11050197670111175033.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 15
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :15 after 1.43675e+13
Detected timeout of ITS tools.
[2025-06-08 16:39:07] [INFO ] Flatten gal took : 82 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17863922029116077220
[2025-06-08 16:39:07] [INFO ] Applying decomposition
[2025-06-08 16:39:07] [INFO ] Computing symmetric may disable matrix : 1197 transitions.
[2025-06-08 16:39:07] [INFO ] Flatten gal took : 148 ms
[2025-06-08 16:39:07] [INFO ] Computation of Complete disable matrix. took 295 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 16:39:08] [INFO ] Computing symmetric may enable matrix : 1197 transitions.
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/graph16027485266673028203.txt' '-o' '/tmp/graph16027485266673028203.bin' '-w' '/tmp/graph16027485266673028203.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16027485266673028203.bin' '-l' '-1' '-v' '-w' '/tmp/graph16027485266673028203.weights' '-q' '0' '-e' '0.001'
[2025-06-08 16:39:08] [INFO ] Decomposing Gal with order
[2025-06-08 16:39:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 16:39:08] [INFO ] Computation of Complete enable matrix. took 192 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 16:39:08] [INFO ] Removed a total of 1671 redundant transitions.
[2025-06-08 16:39:08] [INFO ] Flatten gal took : 445 ms
[2025-06-08 16:39:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 1310 labels/synchronizations in 64 ms.
[2025-06-08 16:39:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality686161590375434678.gal : 32 ms
[2025-06-08 16:39:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11301938361742884627.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/ReachabilityCardinality686161590375434678.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11301938361742884627.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
[2025-06-08 16:39:09] [INFO ] Computing Do-Not-Accords matrix : 1197 transitions.
[2025-06-08 16:39:09] [INFO ] Computation of Completed DNA matrix. took 195 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 16:39:09] [INFO ] Built C files in 2024ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17863922029116077220
Running compilation step : cd /tmp/ltsmin17863922029116077220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '144' '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'
Loading property file /tmp/ReachabilityCardinality11301938361742884627.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1 after 2
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :2 after 8
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :8 after 5732
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :5732 after 16244
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :16244 after 28376
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :28376 after 2.96364e+06
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :2.96364e+06 after 4.13245e+06
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :4.13245e+06 after 5.91987e+06
Compilation finished in 9292 ms.
Running link step : cd /tmp/ltsmin17863922029116077220;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 121 ms.
Running LTSmin : cd /tmp/ltsmin17863922029116077220;'/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' 'MedleyBPTB08ReachabilityCardinality202500==true'
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :5.91987e+06 after 6.04317e+06
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :6.04317e+06 after 3.27287e+07
Invariant property MedleyB-PT-B08-ReachabilityCardinality-2025-13 does not hold.
FORMULA MedleyB-PT-B08-ReachabilityCardinality-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin17863922029116077220;'/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' 'MedleyBPTB08ReachabilityCardinality202500==true'
Running LTSmin : cd /tmp/ltsmin17863922029116077220;'/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' 'MedleyBPTB08ReachabilityCardinality202503==true'
Reachability property MedleyB-PT-B08-ReachabilityCardinality-2025-00 is true.
FORMULA MedleyB-PT-B08-ReachabilityCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :3.27287e+07 after 6.83437e+07
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin17863922029116077220;'/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' 'MedleyBPTB08ReachabilityCardinality202503==true'
Running LTSmin : cd /tmp/ltsmin17863922029116077220;'/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' 'MedleyBPTB08ReachabilityCardinality202505==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin17863922029116077220;'/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' 'MedleyBPTB08ReachabilityCardinality202505==true'
Running LTSmin : cd /tmp/ltsmin17863922029116077220;'/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' 'MedleyBPTB08ReachabilityCardinality202511==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin17863922029116077220;'/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' 'MedleyBPTB08ReachabilityCardinality202511==true'
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin17863922029116077220;'/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' 'MedleyBPTB08ReachabilityCardinality202503==true'
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :6.83437e+07 after 1.87624e+08
Reachability property MedleyB-PT-B08-ReachabilityCardinality-2025-11 is true.
FORMULA MedleyB-PT-B08-ReachabilityCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property MedleyB-PT-B08-ReachabilityCardinality-2025-03 does not hold.
FORMULA MedleyB-PT-B08-ReachabilityCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.87624e+08 after 2.00831e+08

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="MedleyB-PT-B08"
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 MedleyB-PT-B08, 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 r254-tall-174931340000486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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