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

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

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 FFTFTF?FFTTFFFTT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K 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 39K 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.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 544K 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-03b-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2025-00
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2025-02
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2025-03
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2025-04
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2025-05
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2025-06
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2025-07
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2025-08
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2025-09
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2025-10
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2025-11
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2025-12
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2025-13
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2025-14
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748573708081

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-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-30 02:55:09] [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 02:55:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 02:55:09] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2025-05-30 02:55:09] [INFO ] Transformed 1638 places.
[2025-05-30 02:55:09] [INFO ] Transformed 2094 transitions.
[2025-05-30 02:55:09] [INFO ] Found NUPN structural information;
[2025-05-30 02:55:09] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (117 resets) in 1594 ms. (25 steps per ms) remains 7/16 properties
FORMULA ASLink-PT-03b-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (17 resets) in 463 ms. (86 steps per ms) remains 7/7 properties
[2025-05-30 02:55:10] [INFO ] Flatten gal took : 331 ms
BEST_FIRST walk for 40003 steps (19 resets) in 601 ms. (66 steps per ms) remains 7/7 properties
[2025-05-30 02:55:10] [INFO ] Flatten gal took : 193 ms
BEST_FIRST walk for 40003 steps (19 resets) in 219 ms. (181 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (18 resets) in 238 ms. (167 steps per ms) remains 7/7 properties
[2025-05-30 02:55:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9427270771672174660.gal : 94 ms
[2025-05-30 02:55:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4615837529208305287.prop : 1 ms
BEST_FIRST walk for 40003 steps (22 resets) in 163 ms. (243 steps per ms) remains 7/7 properties
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/ReachabilityCardinality9427270771672174660.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4615837529208305287.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (18 resets) in 161 ms. (246 steps per ms) remains 7/7 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40004 steps (21 resets) in 214 ms. (186 steps per ms) remains 7/7 properties
// Phase 1: matrix 2094 rows 1638 cols
Loading property file /tmp/ReachabilityCardinality4615837529208305287.prop.
[2025-05-30 02:55:10] [INFO ] Computed 160 invariants in 119 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 357/473 variables, 29/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 357/502 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 38/511 variables, 8/510 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 38/548 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1116/1627 variables, 119/667 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 9
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :9 after 15
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :15 after 48
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :48 after 195
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :195 after 415
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :415 after 576
At refinement iteration 9 (INCLUDED_ONLY) 0/1627 variables, 1116/1783 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :576 after 28824
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :28824 after 618138
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :618138 after 1.55917e+08
At refinement iteration 10 (INCLUDED_ONLY) 0/1627 variables, 0/1783 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 11/1638 variables, 4/1787 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1638 variables, 11/1798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1638/3732 variables, and 1798 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5044 ms.
Refiners :[Domain max(s): 1638/1638 constraints, Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 123/123 constraints, State Equation: 0/1638 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 357/473 variables, 29/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 357/502 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:55:16] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 38/511 variables, 8/511 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 38/549 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1116/1627 variables, 119/668 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1627 variables, 1116/1784 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:55:18] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:55:18] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:55:19] [INFO ] Deduced a trap composed of 26 places in 627 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:55:20] [INFO ] Deduced a trap composed of 122 places in 740 ms of which 218 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:55:21] [INFO ] Deduced a trap composed of 139 places in 670 ms of which 193 ms to minimize.
SMT process timed out in 10430ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 116 out of 1638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 307 transitions
Trivial Post-agglo rules discarded 307 transitions
Performed 307 trivial Post agglomeration. Transition count delta: 307
Iterating post reduction 0 with 307 rules applied. Total rules applied 307 place count 1638 transition count 1787
Reduce places removed 307 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 316 rules applied. Total rules applied 623 place count 1331 transition count 1778
Reduce places removed 1 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 2 with 19 rules applied. Total rules applied 642 place count 1330 transition count 1760
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 660 place count 1312 transition count 1760
Performed 336 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 336 Pre rules applied. Total rules applied 660 place count 1312 transition count 1424
Deduced a syphon composed of 336 places in 5 ms
Ensure Unique test removed 24 places
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 4 with 696 rules applied. Total rules applied 1356 place count 952 transition count 1424
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 4 with 20 rules applied. Total rules applied 1376 place count 946 transition count 1410
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 16 rules applied. Total rules applied 1392 place count 932 transition count 1408
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1394 place count 930 transition count 1408
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 1394 place count 930 transition count 1400
Deduced a syphon composed of 8 places in 6 ms
Ensure Unique test removed 6 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1416 place count 916 transition count 1400
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 1417 place count 915 transition count 1400
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 7 Pre rules applied. Total rules applied 1417 place count 915 transition count 1393
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 1431 place count 908 transition count 1393
Discarding 46 places :
Symmetric choice reduction at 8 with 46 rule applications. Total rules 1477 place count 862 transition count 1347
Iterating global reduction 8 with 46 rules applied. Total rules applied 1523 place count 862 transition count 1347
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 6 rules applied. Total rules applied 1529 place count 861 transition count 1342
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1530 place count 860 transition count 1342
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 12 Pre rules applied. Total rules applied 1530 place count 860 transition count 1330
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 1554 place count 848 transition count 1330
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1557 place count 845 transition count 1309
Iterating global reduction 10 with 3 rules applied. Total rules applied 1560 place count 845 transition count 1309
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1560 place count 845 transition count 1308
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1562 place count 844 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1563 place count 843 transition count 1300
Iterating global reduction 10 with 1 rules applied. Total rules applied 1564 place count 843 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1565 place count 842 transition count 1292
Iterating global reduction 10 with 1 rules applied. Total rules applied 1566 place count 842 transition count 1292
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1567 place count 841 transition count 1284
Iterating global reduction 10 with 1 rules applied. Total rules applied 1568 place count 841 transition count 1284
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1569 place count 840 transition count 1276
Iterating global reduction 10 with 1 rules applied. Total rules applied 1570 place count 840 transition count 1276
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 10 with 175 rules applied. Total rules applied 1745 place count 752 transition count 1189
Free-agglomeration rule applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1753 place count 752 transition count 1181
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 1761 place count 744 transition count 1181
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 11 with 10 rules applied. Total rules applied 1771 place count 744 transition count 1171
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 1781 place count 734 transition count 1171
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 1783 place count 734 transition count 1171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1784 place count 733 transition count 1170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1785 place count 732 transition count 1170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 1785 place count 732 transition count 1169
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1787 place count 731 transition count 1169
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 13 with 2 rules applied. Total rules applied 1789 place count 730 transition count 1168
Applied a total of 1789 rules in 1030 ms. Remains 730 /1638 variables (removed 908) and now considering 1168/2094 (removed 926) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1036 ms. Remains : 730/1638 places, 1168/2094 transitions.
RANDOM walk for 40000 steps (365 resets) in 419 ms. (95 steps per ms) remains 6/7 properties
FORMULA ASLink-PT-03b-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (106 resets) in 209 ms. (190 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (89 resets) in 197 ms. (202 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (96 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (87 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (95 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (100 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
// Phase 1: matrix 1168 rows 730 cols
[2025-05-30 02:55:22] [INFO ] Computed 120 invariants in 19 ms
[2025-05-30 02:55:22] [INFO ] State equation strengthened by 1 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/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 219/328 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/331 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 396/727 variables, 89/117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/727 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/728 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/728 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/730 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/730 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1168/1898 variables, 730/850 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1898 variables, 1/851 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1898 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1898 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1898/1898 variables, and 851 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2490 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 730/730 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/3 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/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 219/328 variables, 25/25 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 02:55:25] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/328 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/331 variables, 3/29 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 02:55:25] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 396/727 variables, 89/119 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 02:55:26] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 29 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/727 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/727 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/728 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/728 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 2/730 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/730 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 1168/1898 variables, 730/853 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1898 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1898 variables, 3/857 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1898 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/1898 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1898/1898 variables, and 857 constraints, problems are : Problem set: 0 solved, 6 unsolved in 8137 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 730/730 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10685ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 12496 ms.
Support contains 109 out of 730 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 730/730 places, 1168/1168 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 730 transition count 1167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 729 transition count 1167
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 729 transition count 1164
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 8 place count 726 transition count 1164
Applied a total of 8 rules in 37 ms. Remains 726 /730 variables (removed 4) and now considering 1164/1168 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 726/730 places, 1164/1168 transitions.
RANDOM walk for 40000 steps (359 resets) in 271 ms. (147 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (97 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (103 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (98 resets) in 156 ms. (254 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (89 resets) in 167 ms. (238 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (85 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (103 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 277115 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :2 out of 6
Probabilistic random walk after 277115 steps, saw 98994 distinct states, run finished after 3007 ms. (steps per millisecond=92 ) properties seen :2
FORMULA ASLink-PT-03b-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1164 rows 726 cols
[2025-05-30 02:55:49] [INFO ] Computed 120 invariants in 11 ms
[2025-05-30 02:55:49] [INFO ] State equation strengthened by 1 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/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 242/343 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/345 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 378/723 variables, 88/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/723 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/724 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/724 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/726 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/726 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1164/1890 variables, 726/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1890 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1890 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1890 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1890/1890 variables, and 847 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1770 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 726/726 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 242/343 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/345 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 378/723 variables, 88/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:55:51] [INFO ] Deduced a trap composed of 7 places in 274 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:55:51] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:55:52] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 26 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/723 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:55:52] [INFO ] Deduced a trap composed of 46 places in 215 ms of which 37 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/723 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:55:53] [INFO ] Deduced a trap composed of 59 places in 268 ms of which 59 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/723 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/723 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/724 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:55:53] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 30 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/724 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/724 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/726 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/726 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1164/1890 variables, 726/852 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1890 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1890 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:55:56] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 35 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1890 variables, 1/855 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1890 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1890 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1890/1890 variables, and 855 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6511 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 726/726 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8314ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 7381 ms.
Support contains 101 out of 726 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 726/726 places, 1164/1164 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 726 transition count 1163
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 725 transition count 1162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 724 transition count 1162
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 4 place count 724 transition count 1159
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 10 place count 721 transition count 1159
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 721 transition count 1157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 14 place count 719 transition count 1157
Applied a total of 14 rules in 86 ms. Remains 719 /726 variables (removed 7) and now considering 1157/1164 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 719/726 places, 1157/1164 transitions.
RANDOM walk for 40000 steps (382 resets) in 291 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (92 resets) in 370 ms. (107 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (97 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (97 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (77 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 294965 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 4
Probabilistic random walk after 294965 steps, saw 87898 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
// Phase 1: matrix 1157 rows 719 cols
[2025-05-30 02:56:08] [INFO ] Computed 120 invariants in 12 ms
[2025-05-30 02:56:08] [INFO ] State equation strengthened by 1 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/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 223/324 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/327 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 390/717 variables, 89/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/717 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/718 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/718 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/719 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/719 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1157/1876 variables, 719/839 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1876 variables, 1/840 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1876 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1876 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1876/1876 variables, and 840 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1761 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 719/719 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 223/324 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:10] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 3/327 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:10] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 390/717 variables, 89/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:11] [INFO ] Deduced a trap composed of 87 places in 339 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:11] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 39 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/717 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:12] [INFO ] Deduced a trap composed of 46 places in 220 ms of which 38 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/717 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/717 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/718 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/718 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/719 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/719 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1157/1876 variables, 719/844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1876 variables, 1/845 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1876 variables, 1/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1876 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1876 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1876/1876 variables, and 846 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4188 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 719/719 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5981ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3582 ms.
Support contains 101 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 1157/1157 transitions.
Applied a total of 0 rules in 23 ms. Remains 719 /719 variables (removed 0) and now considering 1157/1157 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 719/719 places, 1157/1157 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 1157/1157 transitions.
Applied a total of 0 rules in 21 ms. Remains 719 /719 variables (removed 0) and now considering 1157/1157 (removed 0) transitions.
[2025-05-30 02:56:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:56:18] [INFO ] Implicit Places using invariants in 524 ms returned [3, 23, 24, 29, 43, 61, 81, 125, 151, 186, 204, 205, 208, 225, 246, 308, 311, 361, 365, 366, 397, 417, 489, 501, 517, 532, 533, 534, 565, 567, 571, 590, 591, 592, 593, 594, 611, 617, 623, 629, 637, 643, 649, 656, 662, 669, 675, 717, 718]
[2025-05-30 02:56:18] [INFO ] Actually due to overlaps returned [565, 534, 61, 208, 225, 397, 571, 43, 590, 204, 365, 532, 717, 205, 366, 533, 567, 591, 3, 23, 81, 246, 361, 417, 593, 643, 662, 675, 24, 29, 125, 186, 501, 517, 592, 594, 611, 617, 623, 629, 637, 649, 656, 669]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 547 ms to find 44 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 675/719 places, 1157/1157 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 674 transition count 1117
Reduce places removed 40 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 60 rules applied. Total rules applied 101 place count 634 transition count 1097
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 121 place count 614 transition count 1097
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 121 place count 614 transition count 1079
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 37 rules applied. Total rules applied 158 place count 595 transition count 1079
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 9 rules applied. Total rules applied 167 place count 591 transition count 1074
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 173 place count 586 transition count 1073
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 174 place count 585 transition count 1073
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 183 place count 576 transition count 1064
Iterating global reduction 6 with 9 rules applied. Total rules applied 192 place count 576 transition count 1064
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 194 place count 574 transition count 1062
Iterating global reduction 6 with 2 rules applied. Total rules applied 196 place count 574 transition count 1062
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 240 place count 552 transition count 1040
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 241 place count 551 transition count 1038
Iterating global reduction 6 with 1 rules applied. Total rules applied 242 place count 551 transition count 1038
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 6 with 2 rules applied. Total rules applied 244 place count 550 transition count 1039
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 245 place count 550 transition count 1038
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 6 with 17 rules applied. Total rules applied 262 place count 550 transition count 1021
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 279 place count 533 transition count 1021
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 280 place count 533 transition count 1020
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 287 place count 533 transition count 1020
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 288 place count 533 transition count 1020
Applied a total of 288 rules in 239 ms. Remains 533 /675 variables (removed 142) and now considering 1020/1157 (removed 137) transitions.
// Phase 1: matrix 1020 rows 533 cols
[2025-05-30 02:56:18] [INFO ] Computed 70 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:56:19] [INFO ] Implicit Places using invariants in 331 ms returned [127, 135, 145, 247, 250, 256, 263, 273, 403, 409, 412, 417, 532]
[2025-05-30 02:56:19] [INFO ] Actually due to overlaps returned [532, 127, 247, 256, 263, 403, 412, 135, 145, 273, 417]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 335 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 522/719 places, 1020/1157 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 519 transition count 1017
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 519 transition count 1017
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 0 with 6 rules applied. Total rules applied 12 place count 516 transition count 1014
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 516 transition count 1008
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 510 transition count 1008
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 510 transition count 1008
Applied a total of 27 rules in 56 ms. Remains 510 /522 variables (removed 12) and now considering 1008/1020 (removed 12) transitions.
// Phase 1: matrix 1008 rows 510 cols
[2025-05-30 02:56:19] [INFO ] Computed 59 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:56:19] [INFO ] Implicit Places using invariants in 302 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 303 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 509/719 places, 1008/1157 transitions.
Applied a total of 0 rules in 15 ms. Remains 509 /509 variables (removed 0) and now considering 1008/1008 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1518 ms. Remains : 509/719 places, 1008/1157 transitions.
RANDOM walk for 40000 steps (457 resets) in 230 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (124 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (131 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (135 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (105 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 474089 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 4
Probabilistic random walk after 474089 steps, saw 89483 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
// Phase 1: matrix 1008 rows 509 cols
[2025-05-30 02:56:22] [INFO ] Computed 58 invariants in 6 ms
[2025-05-30 02:56:22] [INFO ] State equation strengthened by 4 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/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 126/227 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 280/507 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/509 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1008/1517 variables, 509/567 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1517 variables, 4/571 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1517 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1517 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1517/1517 variables, and 571 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 509/509 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 126/227 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 280/507 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:24] [INFO ] Deduced a trap composed of 45 places in 327 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:24] [INFO ] Deduced a trap composed of 43 places in 359 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:25] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:25] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:25] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 21 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/509 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1008/1517 variables, 509/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1517 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1517 variables, 1/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:26] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:26] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1517 variables, 2/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1517 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1517 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1517/1517 variables, and 579 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3794 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 509/509 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5001ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1965 ms.
Support contains 101 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 1008/1008 transitions.
Applied a total of 0 rules in 13 ms. Remains 509 /509 variables (removed 0) and now considering 1008/1008 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 509/509 places, 1008/1008 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 1008/1008 transitions.
Applied a total of 0 rules in 12 ms. Remains 509 /509 variables (removed 0) and now considering 1008/1008 (removed 0) transitions.
[2025-05-30 02:56:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:56:30] [INFO ] Implicit Places using invariants in 611 ms returned []
[2025-05-30 02:56:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:56:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 02:56:31] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1818 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:56:31] [INFO ] Redundant transitions in 53 ms returned []
Running 999 sub problems to find dead transitions.
[2025-05-30 02:56:31] [INFO ] Invariant cache hit.
[2025-05-30 02:56:31] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 3 (OVERLAPS) 4/509 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 999 unsolved
SMT process timed out in 30451ms, After SMT, problems are : Problem set: 0 solved, 999 unsolved
Search for dead transitions found 0 dead transitions in 30460ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32357 ms. Remains : 509/509 places, 1008/1008 transitions.
Attempting over-approximation, by ignoring read arcs.
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 509 transition count 1007
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 508 transition count 1007
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 508 transition count 1005
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 506 transition count 1005
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 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 502 transition count 1001
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 502 transition count 1000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 501 transition count 1000
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 501 transition count 1000
Applied a total of 17 rules in 49 ms. Remains 501 /509 variables (removed 8) and now considering 1000/1008 (removed 8) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1000 rows 501 cols
[2025-05-30 02:57:02] [INFO ] Computed 58 invariants in 6 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 02:57:02] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 02:57:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2025-05-30 02:57:02] [INFO ] [Nat]Absence check using 15 positive and 43 generalized place invariants in 22 ms returned sat
[2025-05-30 02:57:03] [INFO ] After 1168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:57:04] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:57:04] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:57:04] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 8 ms to minimize.
[2025-05-30 02:57:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 481 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:57:04] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 14 ms to minimize.
[2025-05-30 02:57:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:57:05] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:57:05] [INFO ] Deduced a trap composed of 62 places in 226 ms of which 20 ms to minimize.
[2025-05-30 02:57:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 520 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:57:06] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:57:06] [INFO ] Deduced a trap composed of 46 places in 208 ms of which 22 ms to minimize.
[2025-05-30 02:57:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 578 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:57:06] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:57:06] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 25 ms to minimize.
[2025-05-30 02:57:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 485 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:57:07] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 22 ms to minimize.
[2025-05-30 02:57:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:57:07] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 11 ms to minimize.
[2025-05-30 02:57:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
TRAPS : Iteration 3
[2025-05-30 02:57:08] [INFO ] After 5829ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-05-30 02:57:09] [INFO ] After 6486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2025-05-30 02:57:09] [INFO ] Flatten gal took : 61 ms
[2025-05-30 02:57:09] [INFO ] Flatten gal took : 43 ms
[2025-05-30 02:57:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1892633188745191466.gal : 12 ms
[2025-05-30 02:57:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8584850252737789295.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/ReachabilityCardinality1892633188745191466.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8584850252737789295.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8584850252737789295.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :3 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 36
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :36 after 48
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :48 after 1830
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1830 after 169188
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.57231e+06 after 4.1134e+06
Detected timeout of ITS tools.
[2025-05-30 02:57:24] [INFO ] Flatten gal took : 35 ms
[2025-05-30 02:57:24] [INFO ] Applying decomposition
[2025-05-30 02:57:24] [INFO ] Flatten gal took : 42 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/graph16066662302587216137.txt' '-o' '/tmp/graph16066662302587216137.bin' '-w' '/tmp/graph16066662302587216137.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16066662302587216137.bin' '-l' '-1' '-v' '-w' '/tmp/graph16066662302587216137.weights' '-q' '0' '-e' '0.001'
[2025-05-30 02:57:24] [INFO ] Decomposing Gal with order
[2025-05-30 02:57:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:57:24] [INFO ] Removed a total of 1713 redundant transitions.
[2025-05-30 02:57:24] [INFO ] Flatten gal took : 107 ms
[2025-05-30 02:57:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 35 ms.
[2025-05-30 02:57:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14681446517919515172.gal : 16 ms
[2025-05-30 02:57:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13161944123841448623.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/ReachabilityCardinality14681446517919515172.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13161944123841448623.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 ...309
Loading property file /tmp/ReachabilityCardinality13161944123841448623.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :6 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 48
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :48 after 25620
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :25620 after 32940
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :32940 after 65520
Invariant property ASLink-PT-03b-ReachabilityCardinality-2025-07 does not hold.
Reachability property ASLink-PT-03b-ReachabilityCardinality-2025-02 is true.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :65520 after 4.45648e+07
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :4.45648e+07 after 6.24863e+08
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :6.24863e+08 after 4.42773e+09
Invariant property ASLink-PT-03b-ReachabilityCardinality-2024-01 does not hold.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.42773e+09 after 1.44175e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.44175e+10 after 5.00782e+10
Invariant property ASLink-PT-03b-ReachabilityCardinality-2025-06 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,5.06659e+11,10.1732,135748,10575,1774,159706,33810,1825,883526,307,165290,0
Total reachable state count : 506658953958

Verifying 4 reachability properties.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 37641 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 02:57:39] [INFO ] Flatten gal took : 54 ms
[2025-05-30 02:57:39] [INFO ] Applying decomposition
[2025-05-30 02:57:39] [INFO ] Flatten gal took : 54 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/graph15430478400025549434.txt' '-o' '/tmp/graph15430478400025549434.bin' '-w' '/tmp/graph15430478400025549434.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15430478400025549434.bin' '-l' '-1' '-v' '-w' '/tmp/graph15430478400025549434.weights' '-q' '0' '-e' '0.001'
[2025-05-30 02:57:40] [INFO ] Decomposing Gal with order
[2025-05-30 02:57:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:57:40] [INFO ] Removed a total of 1629 redundant transitions.
[2025-05-30 02:57:40] [INFO ] Flatten gal took : 102 ms
[2025-05-30 02:57:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 24 ms.
[2025-05-30 02:57:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6879521432426037571.gal : 15 ms
[2025-05-30 02:57:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1183234463626075423.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/ReachabilityCardinality6879521432426037571.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1183234463626075423.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality1183234463626075423.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1 after 1610
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1610 after 5.20648e+17
Invariant property ASLink-PT-03b-ReachabilityCardinality-2025-07 does not hold.
FORMULA ASLink-PT-03b-ReachabilityCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Detected timeout of ITS tools.
[2025-05-30 03:27:40] [INFO ] Flatten gal took : 28 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9040626964591928568
[2025-05-30 03:27:40] [INFO ] Applying decomposition
[2025-05-30 03:27:40] [INFO ] Computing symmetric may disable matrix : 1008 transitions.
[2025-05-30 03:27:40] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:27:40] [INFO ] Flatten gal took : 28 ms
[2025-05-30 03:27:40] [INFO ] Computing symmetric may enable matrix : 1008 transitions.
[2025-05-30 03:27:40] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13055403703617495416.txt' '-o' '/tmp/graph13055403703617495416.bin' '-w' '/tmp/graph13055403703617495416.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13055403703617495416.bin' '-l' '-1' '-v' '-w' '/tmp/graph13055403703617495416.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:27:40] [INFO ] Decomposing Gal with order
[2025-05-30 03:27:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:27:40] [INFO ] Removed a total of 1729 redundant transitions.
[2025-05-30 03:27:40] [INFO ] Flatten gal took : 56 ms
[2025-05-30 03:27:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 10 ms.
[2025-05-30 03:27:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8333678729899828657.gal : 17 ms
[2025-05-30 03:27:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2237041069453974399.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/ReachabilityCardinality8333678729899828657.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2237041069453974399.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
[2025-05-30 03:27:40] [INFO ] Computing Do-Not-Accords matrix : 1008 transitions.
[2025-05-30 03:27:40] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Loading property file /tmp/ReachabilityCardinality2237041069453974399.prop.
[2025-05-30 03:27:40] [INFO ] Built C files in 325ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9040626964591928568
Running compilation step : cd /tmp/ltsmin9040626964591928568;'/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 6
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :6 after 15
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :15 after 1104
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1104 after 4632
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :4632 after 7.63274e+06
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :7.63274e+06 after 3.2942e+07
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :3.2942e+07 after 5.12487e+07
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :5.12487e+07 after 1.70699e+08
Compilation finished in 3068 ms.
Running link step : cd /tmp/ltsmin9040626964591928568;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin9040626964591928568;'/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' 'ASLinkPT03bReachabilityCardinality202401==true'
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.70699e+08 after 7.53016e+09
Reachability property ASLink-PT-03b-ReachabilityCardinality-2025-02 is true.
FORMULA ASLink-PT-03b-ReachabilityCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.13957e+11 after 2.28193e+11
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4.29621e+11 after 4.81361e+11
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4.81361e+11 after 4.84742e+11
WARNING : LTSmin timed out (>300 s) on command cd /tmp/ltsmin9040626964591928568;'/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' 'ASLinkPT03bReachabilityCardinality202401==true'
Running LTSmin : cd /tmp/ltsmin9040626964591928568;'/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' 'ASLinkPT03bReachabilityCardinality202506==true'
Invariant property ASLink-PT-03b-ReachabilityCardinality-2024-01 does not hold.
FORMULA ASLink-PT-03b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.22496e+12 after 1.58415e+12
WARNING : LTSmin timed out (>300 s) on command cd /tmp/ltsmin9040626964591928568;'/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' 'ASLinkPT03bReachabilityCardinality202506==true'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin9040626964591928568;'/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' 'ASLinkPT03bReachabilityCardinality202506==true'
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.03134e+12 after 4.03168e+12
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.08301e+13 after 1.14883e+13

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-03b"
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-03b, 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-174853729000326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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