fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r002-tall-174853729100342
Last Updated
June 24, 2025

About the Execution of ITS-Tools for ASLink-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 ?TFT?FTTFFFTFFTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 669K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748579753719

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-30 04:35:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 04:35:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 04:35:55] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2025-05-30 04:35:55] [INFO ] Transformed 2034 places.
[2025-05-30 04:35:55] [INFO ] Transformed 2567 transitions.
[2025-05-30 04:35:55] [INFO ] Found NUPN structural information;
[2025-05-30 04:35:55] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 344 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-04b-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (96 resets) in 1930 ms. (20 steps per ms) remains 8/15 properties
FORMULA ASLink-PT-04b-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (15 resets) in 720 ms. (55 steps per ms) remains 7/8 properties
FORMULA ASLink-PT-04b-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (15 resets) in 201 ms. (198 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (13 resets) in 150 ms. (264 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (12 resets) in 181 ms. (219 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (13 resets) in 172 ms. (231 steps per ms) remains 7/7 properties
[2025-05-30 04:35:56] [INFO ] Flatten gal took : 577 ms
BEST_FIRST walk for 40004 steps (13 resets) in 185 ms. (215 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 254 ms. (156 steps per ms) remains 7/7 properties
[2025-05-30 04:35:56] [INFO ] Flatten gal took : 245 ms
BEST_FIRST walk for 40004 steps (13 resets) in 472 ms. (84 steps per ms) remains 7/7 properties
[2025-05-30 04:35:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2306848846051643152.gal : 95 ms
[2025-05-30 04:35:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9801267519758599694.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2306848846051643152.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9801267519758599694.prop' '--nowitness' '--gen-order' 'FOLLOW'
// Phase 1: matrix 2567 rows 2034 cols

its-reach command run as :

[2025-05-30 04:35:57] [INFO ] Computed 199 invariants in 154 ms
/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
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality9801267519758599694.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 95/95 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 389/484 variables, 30/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 389/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 118/602 variables, 18/532 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 118/650 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1401/2003 variables, 145/795 constraints. Problems are: Problem set: 0 solved, 7 unsolved
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 16
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :16 after 49
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :49 after 196
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :196 after 416
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :416 after 569
At refinement iteration 9 (INCLUDED_ONLY) 0/2003 variables, 1401/2196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :569 after 15361
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :15361 after 618139
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :618139 after 5.45975e+08
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :5.45975e+08 after 3.89853e+11
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :3.89853e+11 after 3.51941e+17
At refinement iteration 10 (INCLUDED_ONLY) 0/2003 variables, 0/2196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 31/2034 variables, 6/2202 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 5427ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 95 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 395 transitions
Trivial Post-agglo rules discarded 395 transitions
Performed 395 trivial Post agglomeration. Transition count delta: 395
Iterating post reduction 0 with 395 rules applied. Total rules applied 395 place count 2034 transition count 2172
Reduce places removed 395 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 412 rules applied. Total rules applied 807 place count 1639 transition count 2155
Reduce places removed 3 places and 0 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Iterating post reduction 2 with 31 rules applied. Total rules applied 838 place count 1636 transition count 2127
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 866 place count 1608 transition count 2127
Performed 428 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 428 Pre rules applied. Total rules applied 866 place count 1608 transition count 1699
Deduced a syphon composed of 428 places in 19 ms
Ensure Unique test removed 30 places
Reduce places removed 458 places and 0 transitions.
Iterating global reduction 4 with 886 rules applied. Total rules applied 1752 place count 1150 transition count 1699
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 4 with 28 rules applied. Total rules applied 1780 place count 1142 transition count 1679
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 22 rules applied. Total rules applied 1802 place count 1122 transition count 1677
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1804 place count 1120 transition count 1677
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 1804 place count 1120 transition count 1668
Deduced a syphon composed of 9 places in 27 ms
Ensure Unique test removed 7 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 25 rules applied. Total rules applied 1829 place count 1104 transition count 1668
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 1830 place count 1103 transition count 1668
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 7 Pre rules applied. Total rules applied 1830 place count 1103 transition count 1661
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 1844 place count 1096 transition count 1661
Discarding 58 places :
Symmetric choice reduction at 8 with 58 rule applications. Total rules 1902 place count 1038 transition count 1603
Iterating global reduction 8 with 58 rules applied. Total rules applied 1960 place count 1038 transition count 1603
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1961 place count 1038 transition count 1602
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 17 Pre rules applied. Total rules applied 1961 place count 1038 transition count 1585
Deduced a syphon composed of 17 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 35 rules applied. Total rules applied 1996 place count 1020 transition count 1585
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1996 place count 1020 transition count 1584
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1999 place count 1018 transition count 1584
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 2004 place count 1013 transition count 1551
Iterating global reduction 9 with 5 rules applied. Total rules applied 2009 place count 1013 transition count 1551
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 2009 place count 1013 transition count 1548
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 2015 place count 1010 transition count 1548
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2016 place count 1009 transition count 1540
Iterating global reduction 9 with 1 rules applied. Total rules applied 2017 place count 1009 transition count 1540
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2018 place count 1008 transition count 1532
Iterating global reduction 9 with 1 rules applied. Total rules applied 2019 place count 1008 transition count 1532
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2020 place count 1007 transition count 1524
Iterating global reduction 9 with 1 rules applied. Total rules applied 2021 place count 1007 transition count 1524
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2022 place count 1006 transition count 1516
Iterating global reduction 9 with 1 rules applied. Total rules applied 2023 place count 1006 transition count 1516
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2024 place count 1005 transition count 1508
Iterating global reduction 9 with 1 rules applied. Total rules applied 2025 place count 1005 transition count 1508
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2026 place count 1004 transition count 1500
Iterating global reduction 9 with 1 rules applied. Total rules applied 2027 place count 1004 transition count 1500
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2028 place count 1003 transition count 1492
Iterating global reduction 9 with 1 rules applied. Total rules applied 2029 place count 1003 transition count 1492
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2030 place count 1002 transition count 1484
Iterating global reduction 9 with 1 rules applied. Total rules applied 2031 place count 1002 transition count 1484
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2032 place count 1001 transition count 1476
Iterating global reduction 9 with 1 rules applied. Total rules applied 2033 place count 1001 transition count 1476
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2034 place count 1000 transition count 1468
Iterating global reduction 9 with 1 rules applied. Total rules applied 2035 place count 1000 transition count 1468
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2036 place count 999 transition count 1460
Iterating global reduction 9 with 1 rules applied. Total rules applied 2037 place count 999 transition count 1460
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2038 place count 998 transition count 1452
Iterating global reduction 9 with 1 rules applied. Total rules applied 2039 place count 998 transition count 1452
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2040 place count 997 transition count 1444
Iterating global reduction 9 with 1 rules applied. Total rules applied 2041 place count 997 transition count 1444
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2042 place count 996 transition count 1436
Iterating global reduction 9 with 1 rules applied. Total rules applied 2043 place count 996 transition count 1436
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2044 place count 995 transition count 1428
Iterating global reduction 9 with 1 rules applied. Total rules applied 2045 place count 995 transition count 1428
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2046 place count 994 transition count 1420
Iterating global reduction 9 with 1 rules applied. Total rules applied 2047 place count 994 transition count 1420
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 9 with 236 rules applied. Total rules applied 2283 place count 874 transition count 1304
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 2284 place count 873 transition count 1304
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2286 place count 872 transition count 1313
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 2287 place count 872 transition count 1312
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 2 rules applied. Total rules applied 2289 place count 871 transition count 1311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2290 place count 870 transition count 1311
Free-agglomeration rule applied 9 times.
Iterating global reduction 12 with 9 rules applied. Total rules applied 2299 place count 870 transition count 1302
SDD proceeding with computation,7 properties remain. new max is 16384
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 2308 place count 861 transition count 1302
SDD size :3.51941e+17 after 5.54986e+23
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 13 with 7 rules applied. Total rules applied 2315 place count 861 transition count 1295
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 2322 place count 854 transition count 1295
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 2324 place count 854 transition count 1295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 2325 place count 853 transition count 1294
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 2328 place count 850 transition count 1294
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 6 Pre rules applied. Total rules applied 2328 place count 850 transition count 1288
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 15 with 12 rules applied. Total rules applied 2340 place count 844 transition count 1288
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 15 with 1 rules applied. Total rules applied 2341 place count 843 transition count 1288
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 16 with 6 rules applied. Total rules applied 2347 place count 840 transition count 1285
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2348 place count 839 transition count 1284
Iterating global reduction 16 with 1 rules applied. Total rules applied 2349 place count 839 transition count 1284
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 2350 place count 839 transition count 1283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 2351 place count 838 transition count 1283
Applied a total of 2351 rules in 2714 ms. Remains 838 /2034 variables (removed 1196) and now considering 1283/2567 (removed 1284) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2750 ms. Remains : 838/2034 places, 1283/2567 transitions.
RANDOM walk for 40000 steps (354 resets) in 670 ms. (59 steps per ms) remains 6/7 properties
FORMULA ASLink-PT-04b-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (75 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (72 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (75 resets) in 531 ms. (75 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (72 resets) in 194 ms. (205 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (81 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (68 resets) in 288 ms. (138 steps per ms) remains 6/6 properties
// Phase 1: matrix 1283 rows 838 cols
[2025-05-30 04:36:06] [INFO ] Computed 141 invariants in 22 ms
[2025-05-30 04:36:06] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 224/301 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 19/320 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/325 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 502/827 variables, 105/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/829 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/829 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 9/838 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/838 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :5.54986e+23 after 5.70061e+25
At refinement iteration 13 (OVERLAPS) 1283/2121 variables, 838/979 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2121 variables, 6/985 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2121 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/2121 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2121/2121 variables, and 985 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2619 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 107/107 constraints, State Equation: 838/838 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/5 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/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 224/301 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:36:08] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 19/320 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 5/325 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 502/827 variables, 105/138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:36:09] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 21 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/827 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/829 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/829 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 9/838 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/838 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1283/2121 variables, 838/981 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2121 variables, 6/987 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2121 variables, 5/992 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:36:12] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2121 variables, 1/993 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:36:12] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:36:13] [INFO ] Deduced a trap composed of 42 places in 236 ms of which 38 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2121 variables, 2/995 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:36:13] [INFO ] Deduced a trap along path composed of 2 places in 60 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2121 variables, 1/996 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :5.70061e+25 after 6.37066e+25
At refinement iteration 21 (INCLUDED_ONLY) 0/2121 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/2121 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2121/2121 variables, and 996 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7709 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 107/107 constraints, State Equation: 838/838 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 10381ms problems are : Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 131072
SDD size :6.37066e+25 after 7.19464e+25
FORMULA ASLink-PT-04b-ReachabilityCardinality-2025-07 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 22205 ms.
Support contains 73 out of 838 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 838/838 places, 1283/1283 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 838 transition count 1279
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 834 transition count 1279
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 8 place count 834 transition count 1262
Deduced a syphon composed of 17 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 44 place count 815 transition count 1262
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 53 place count 810 transition count 1258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 809 transition count 1256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 808 transition count 1256
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 57 place count 808 transition count 1254
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 61 place count 806 transition count 1254
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 63 place count 805 transition count 1253
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 805 transition count 1252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 65 place count 804 transition count 1252
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 804 transition count 1251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 67 place count 803 transition count 1251
Applied a total of 67 rules in 131 ms. Remains 803 /838 variables (removed 35) and now considering 1251/1283 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 803/838 places, 1251/1283 transitions.
RANDOM walk for 40000 steps (369 resets) in 301 ms. (132 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (77 resets) in 136 ms. (292 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (79 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (84 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (85 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (79 resets) in 283 ms. (140 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 241710 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :2 out of 5
Probabilistic random walk after 241710 steps, saw 77487 distinct states, run finished after 3007 ms. (steps per millisecond=80 ) properties seen :2
FORMULA ASLink-PT-04b-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1251 rows 803 cols
[2025-05-30 04:36:42] [INFO ] Computed 137 invariants in 16 ms
[2025-05-30 04:36:42] [INFO ] State equation strengthened by 6 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/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 214/278 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/299 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5/304 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 489/793 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/793 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/794 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/794 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 9/803 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/803 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1251/2054 variables, 803/940 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2054 variables, 6/946 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2054 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/2054 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2054/2054 variables, and 946 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1257 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 104/104 constraints, State Equation: 803/803 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 214/278 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/299 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5/304 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 489/793 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:36:43] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:36:44] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 24 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/793 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/793 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/794 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/794 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 9/803 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/803 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1251/2054 variables, 803/942 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2054 variables, 6/948 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2054 variables, 2/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:36:46] [INFO ] Deduced a trap composed of 82 places in 310 ms of which 66 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2054 variables, 1/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2054 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/2054 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2054/2054 variables, and 951 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3786 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 104/104 constraints, State Equation: 803/803 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5077ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 5814 ms.
Support contains 64 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 1251/1251 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 803 transition count 1247
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 799 transition count 1247
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 799 transition count 1242
Deduced a syphon composed of 5 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 19 place count 793 transition count 1242
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 790 transition count 1239
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 790 transition count 1238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 789 transition count 1238
Applied a total of 27 rules in 71 ms. Remains 789 /803 variables (removed 14) and now considering 1238/1251 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 789/803 places, 1238/1251 transitions.
RANDOM walk for 40000 steps (370 resets) in 270 ms. (147 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (80 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (78 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (72 resets) in 224 ms. (177 steps per ms) remains 3/3 properties
SDD proceeding with computation,7 properties remain. new max is 262144
SDD size :7.19464e+25 after 1.05181e+26
Interrupted probabilistic random walk after 241191 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 3
Probabilistic random walk after 241191 steps, saw 90999 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
// Phase 1: matrix 1238 rows 789 cols
[2025-05-30 04:36:56] [INFO ] Computed 136 invariants in 20 ms
[2025-05-30 04:36:56] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 209/273 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/294 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5/299 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 480/779 variables, 100/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/779 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/780 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/780 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 9/789 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/789 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1238/2027 variables, 789/925 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2027 variables, 6/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2027 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/2027 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2027/2027 variables, and 931 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1372 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 789/789 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 209/273 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/294 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5/299 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 480/779 variables, 100/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:36:58] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:36:58] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/779 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:36:58] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/779 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/779 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/780 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/780 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 9/789 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/789 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1238/2027 variables, 789/928 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2027 variables, 6/934 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2027 variables, 2/936 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:37:00] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:37:00] [INFO ] Deduced a trap along path composed of 20 places in 49 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2027 variables, 2/938 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2027 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/2027 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2027/2027 variables, and 938 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3211 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 789/789 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 4626ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1966 ms.
Support contains 64 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 1238/1238 transitions.
Applied a total of 0 rules in 21 ms. Remains 789 /789 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 789/789 places, 1238/1238 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 1238/1238 transitions.
Applied a total of 0 rules in 20 ms. Remains 789 /789 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
[2025-05-30 04:37:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:37:03] [INFO ] Implicit Places using invariants in 605 ms returned [1, 20, 21, 22, 26, 41, 58, 77, 116, 188, 189, 193, 210, 228, 285, 308, 314, 325, 326, 328, 349, 367, 437, 454, 459, 460, 471, 472, 473, 476, 494, 514, 583, 596, 605, 611, 614, 627, 628, 629, 647, 649, 653, 672, 673, 675, 676, 699, 705, 711, 717, 723, 729, 735, 741, 747, 753]
[2025-05-30 04:37:03] [INFO ] Actually due to overlaps returned [647, 629, 41, 58, 210, 328, 349, 476, 494, 653, 193, 189, 325, 472, 627, 672, 20, 188, 326, 473, 628, 649, 673, 1, 314, 459, 460, 21, 77, 228, 367, 471, 514, 675, 723, 741, 753, 22, 26, 596, 611, 614, 676, 699, 705, 711, 717, 729, 735, 747]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 616 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 739/789 places, 1238/1238 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 733 transition count 1162
Reduce places removed 76 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 87 rules applied. Total rules applied 169 place count 657 transition count 1151
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 180 place count 646 transition count 1151
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 180 place count 646 transition count 1131
Deduced a syphon composed of 20 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 221 place count 625 transition count 1131
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 7 rules applied. Total rules applied 228 place count 621 transition count 1128
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 231 place count 618 transition count 1128
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 243 place count 606 transition count 1116
Iterating global reduction 5 with 12 rules applied. Total rules applied 255 place count 606 transition count 1116
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 259 place count 602 transition count 1110
Iterating global reduction 5 with 4 rules applied. Total rules applied 263 place count 602 transition count 1110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 265 place count 602 transition count 1108
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 266 place count 601 transition count 1107
Iterating global reduction 6 with 1 rules applied. Total rules applied 267 place count 601 transition count 1107
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 268 place count 600 transition count 1105
Iterating global reduction 6 with 1 rules applied. Total rules applied 269 place count 600 transition count 1105
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 327 place count 571 transition count 1076
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 329 place count 569 transition count 1074
Iterating global reduction 6 with 2 rules applied. Total rules applied 331 place count 569 transition count 1074
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 332 place count 569 transition count 1073
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 336 place count 567 transition count 1073
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 337 place count 567 transition count 1072
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 340 place count 567 transition count 1069
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 343 place count 564 transition count 1069
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 344 place count 564 transition count 1068
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 8 with 21 rules applied. Total rules applied 365 place count 564 transition count 1047
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 386 place count 543 transition count 1047
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 387 place count 543 transition count 1046
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 396 place count 543 transition count 1046
Applied a total of 396 rules in 200 ms. Remains 543 /739 variables (removed 196) and now considering 1046/1238 (removed 192) transitions.
// Phase 1: matrix 1046 rows 543 cols
[2025-05-30 04:37:03] [INFO ] Computed 75 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:37:04] [INFO ] Implicit Places using invariants in 378 ms returned [102, 109, 115, 200, 225, 234, 237, 239, 247, 248, 306, 328, 338, 342, 429, 524, 539, 542]
[2025-05-30 04:37:04] [INFO ] Actually due to overlaps returned [247, 248, 102, 109, 225, 234, 239, 342, 429, 115, 200, 306, 328, 524, 539, 542]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 381 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 527/789 places, 1046/1238 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 527 transition count 1045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 526 transition count 1045
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 520 transition count 1039
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 520 transition count 1039
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 515 transition count 1034
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 515 transition count 1033
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 33 place count 515 transition count 1025
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 41 place count 507 transition count 1025
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 507 transition count 1024
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 506 transition count 1024
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 506 transition count 1024
Applied a total of 44 rules in 91 ms. Remains 506 /527 variables (removed 21) and now considering 1024/1046 (removed 22) transitions.
// Phase 1: matrix 1024 rows 506 cols
[2025-05-30 04:37:04] [INFO ] Computed 59 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:37:04] [INFO ] Implicit Places using invariants in 325 ms returned []
[2025-05-30 04:37:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:37:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 04:37:05] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 506/789 places, 1024/1238 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2533 ms. Remains : 506/789 places, 1024/1238 transitions.
RANDOM walk for 40000 steps (465 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (111 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (106 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (108 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 565930 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 3
Probabilistic random walk after 565930 steps, saw 90905 distinct states, run finished after 3002 ms. (steps per millisecond=188 ) properties seen :0
[2025-05-30 04:37:08] [INFO ] Invariant cache hit.
[2025-05-30 04:37:08] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 110/174 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/178 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 328/506 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1024/1530 variables, 506/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1530 variables, 6/571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1530 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1530 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1530/1530 variables, and 571 constraints, problems are : Problem set: 0 solved, 3 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 506/506 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 110/174 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:37:09] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:37:09] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/178 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 328/506 variables, 47/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/506 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1024/1530 variables, 506/567 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1530 variables, 6/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1530 variables, 2/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:37:10] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1530 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1530 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1530 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1530/1530 variables, and 576 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1648 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 506/506 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2344ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2874 ms.
Support contains 64 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1024/1024 transitions.
Applied a total of 0 rules in 13 ms. Remains 506 /506 variables (removed 0) and now considering 1024/1024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 506/506 places, 1024/1024 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1024/1024 transitions.
Applied a total of 0 rules in 13 ms. Remains 506 /506 variables (removed 0) and now considering 1024/1024 (removed 0) transitions.
[2025-05-30 04:37:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:37:14] [INFO ] Implicit Places using invariants in 292 ms returned []
[2025-05-30 04:37:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:37:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 04:37:15] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1174 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 04:37:15] [INFO ] Redundant transitions in 72 ms returned []
Running 1008 sub problems to find dead transitions.
[2025-05-30 04:37:15] [INFO ] Invariant cache hit.
[2025-05-30 04:37:15] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1008 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1008 unsolved
At refinement iteration 2 (OVERLAPS) 4/505 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 1008 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1008 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/1530 variables, and 58 constraints, problems are : Problem set: 0 solved, 1008 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/47 constraints, State Equation: 0/506 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1008/1008 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1008 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1008 unsolved
SDD proceeding with computation,7 properties remain. new max is 524288
SDD size :1.05181e+26 after 6.41877e+26
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1008 unsolved
At refinement iteration 2 (OVERLAPS) 4/505 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 1008 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1008 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/1530 variables, and 58 constraints, problems are : Problem set: 0 solved, 1008 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/47 constraints, State Equation: 0/506 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/1008 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60394ms problems are : Problem set: 0 solved, 1008 unsolved
Search for dead transitions found 0 dead transitions in 60399ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61682 ms. Remains : 506/506 places, 1024/1024 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 2417 edges and 506 vertex of which 505 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 505 transition count 1022
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 503 transition count 1022
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 7 place count 501 transition count 1022
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 7 place count 501 transition count 1021
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 500 transition count 1021
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 498 transition count 1019
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 498 transition count 1018
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 497 transition count 1018
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 497 transition count 1017
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 497 transition count 1016
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 496 transition count 1016
Applied a total of 18 rules in 104 ms. Remains 496 /506 variables (removed 10) and now considering 1016/1024 (removed 8) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1016 rows 496 cols
[2025-05-30 04:38:15] [INFO ] Computed 56 invariants in 7 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 04:38:15] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 04:38:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-30 04:38:15] [INFO ] [Nat]Absence check using 11 positive and 45 generalized place invariants in 13 ms returned sat
[2025-05-30 04:38:16] [INFO ] After 468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2025-05-30 04:38:16] [INFO ] After 762ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2025-05-30 04:38:16] [INFO ] After 1063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2025-05-30 04:38:16] [INFO ] Flatten gal took : 48 ms
[2025-05-30 04:38:16] [INFO ] Flatten gal took : 44 ms
[2025-05-30 04:38:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1226228605398095274.gal : 10 ms
[2025-05-30 04:38:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16173811765737596542.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/ReachabilityCardinality1226228605398095274.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16173811765737596542.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/ReachabilityCardinality16173811765737596542.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :9 after 17
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :17 after 39
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :39 after 98
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :98 after 987
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :987 after 84825
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :84825 after 4.61055e+07
Invariant property ASLink-PT-04b-ReachabilityCardinality-2025-01 does not hold.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4.61055e+07 after 4.61305e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4.61305e+07 after 4.9628e+07
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4.9628e+07 after 1.78259e+08
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.78259e+08 after 1.33584e+09
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.33584e+09 after 9.07454e+09
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :9.07454e+09 after 4.72938e+10
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :4.72938e+10 after 4.1631e+11
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :4.1631e+11 after 1.03493e+12
Detected timeout of ITS tools.
[2025-05-30 04:38:32] [INFO ] Flatten gal took : 38 ms
[2025-05-30 04:38:32] [INFO ] Applying decomposition
[2025-05-30 04:38:32] [INFO ] Flatten gal took : 37 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/graph12346668620039654516.txt' '-o' '/tmp/graph12346668620039654516.bin' '-w' '/tmp/graph12346668620039654516.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12346668620039654516.bin' '-l' '-1' '-v' '-w' '/tmp/graph12346668620039654516.weights' '-q' '0' '-e' '0.001'
[2025-05-30 04:38:32] [INFO ] Decomposing Gal with order
[2025-05-30 04:38:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 04:38:32] [INFO ] Removed a total of 1858 redundant transitions.
[2025-05-30 04:38:32] [INFO ] Flatten gal took : 130 ms
[2025-05-30 04:38:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 27 ms.
[2025-05-30 04:38:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13225754930186679930.gal : 14 ms
[2025-05-30 04:38:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7364263407872817209.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/ReachabilityCardinality13225754930186679930.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7364263407872817209.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/ReachabilityCardinality7364263407872817209.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 39
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :39 after 117
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :117 after 84825
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1.73151e+08 after 7.56023e+09
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :7.56023e+09 after 1.03384e+10
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.03384e+10 after 8.65555e+10
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :8.65555e+10 after 1.49634e+11
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :8.71513e+11 after 1.13011e+12
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32073 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 04:38:47] [INFO ] Flatten gal took : 79 ms
[2025-05-30 04:38:47] [INFO ] Applying decomposition
[2025-05-30 04:38:47] [INFO ] Flatten gal took : 71 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/graph8814289298101632174.txt' '-o' '/tmp/graph8814289298101632174.bin' '-w' '/tmp/graph8814289298101632174.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8814289298101632174.bin' '-l' '-1' '-v' '-w' '/tmp/graph8814289298101632174.weights' '-q' '0' '-e' '0.001'
[2025-05-30 04:38:48] [INFO ] Decomposing Gal with order
[2025-05-30 04:38:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 04:38:48] [INFO ] Removed a total of 1934 redundant transitions.
[2025-05-30 04:38:48] [INFO ] Flatten gal took : 178 ms
[2025-05-30 04:38:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 48 ms.
[2025-05-30 04:38:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12378556141145370322.gal : 24 ms
[2025-05-30 04:38:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8569489037913623287.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/ReachabilityCardinality12378556141145370322.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8569489037913623287.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/ReachabilityCardinality8569489037913623287.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 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1 after 3.70129e+16
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :3.70129e+16 after 1.07596e+22
Detected timeout of ITS tools.
[2025-05-30 05:08:48] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13181965293497009680
[2025-05-30 05:08:48] [INFO ] Applying decomposition
[2025-05-30 05:08:48] [INFO ] Computing symmetric may disable matrix : 1024 transitions.
[2025-05-30 05:08:48] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 05:08:48] [INFO ] Computing symmetric may enable matrix : 1024 transitions.
[2025-05-30 05:08:48] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 05:08:48] [INFO ] Flatten gal took : 34 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/graph15243497204065670043.txt' '-o' '/tmp/graph15243497204065670043.bin' '-w' '/tmp/graph15243497204065670043.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15243497204065670043.bin' '-l' '-1' '-v' '-w' '/tmp/graph15243497204065670043.weights' '-q' '0' '-e' '0.001'
[2025-05-30 05:08:49] [INFO ] Decomposing Gal with order
[2025-05-30 05:08:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 05:08:49] [INFO ] Removed a total of 1888 redundant transitions.
[2025-05-30 05:08:49] [INFO ] Flatten gal took : 61 ms
[2025-05-30 05:08:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 14 ms.
[2025-05-30 05:08:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12027585651754712783.gal : 15 ms
[2025-05-30 05:08:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5833667848844162937.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/ReachabilityCardinality12027585651754712783.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5833667848844162937.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
[2025-05-30 05:08:49] [INFO ] Computing Do-Not-Accords matrix : 1024 transitions.
[2025-05-30 05:08:49] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Loading property file /tmp/ReachabilityCardinality5833667848844162937.prop.
[2025-05-30 05:08:49] [INFO ] Built C files in 321ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13181965293497009680
Running compilation step : cd /tmp/ltsmin13181965293497009680;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :10 after 102
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :102 after 118
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :118 after 2175
Invariant property ASLink-PT-04b-ReachabilityCardinality-2025-01 does not hold.
FORMULA ASLink-PT-04b-ReachabilityCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1.81137e+08 after 8.81045e+08
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :8.81045e+08 after 1.0393e+09
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.0393e+09 after 1.28294e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.28294e+09 after 2.15133e+09
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.15133e+09 after 8.30506e+09
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :8.30506e+09 after 1.57065e+11
Compilation finished in 3327 ms.
Running link step : cd /tmp/ltsmin13181965293497009680;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin13181965293497009680;'/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' 'ASLinkPT04bReachabilityCardinality202503==true'
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.73449e+12 after 7.05287e+12
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin13181965293497009680;'/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' 'ASLinkPT04bReachabilityCardinality202503==true'
Running LTSmin : cd /tmp/ltsmin13181965293497009680;'/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' 'ASLinkPT04bReachabilityCardinality202314==true'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin13181965293497009680;'/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' 'ASLinkPT04bReachabilityCardinality202314==true'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin13181965293497009680;'/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' 'ASLinkPT04bReachabilityCardinality202503==true'

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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-04b"
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 ASLink-PT-04b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729100342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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