fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r002-oct2-177944366300438
Last Updated
Jun 17, 2026

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4945.915 3600000.00 5593056.00 2201.50 FT???TTFTFTFT?TF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366300438.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is ASLink-PT-10b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366300438
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.1K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 5 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Mar 5 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 5 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 5 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.4M Mar 3 18:30 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-10b-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779489756172

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-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-22 22:42:37] [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]
[2026-05-22 22:42:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 22:42:38] [INFO ] Load time of PNML (sax parser for PT used): 291 ms
[2026-05-22 22:42:38] [INFO ] Transformed 4410 places.
[2026-05-22 22:42:38] [INFO ] Transformed 5405 transitions.
[2026-05-22 22:42:38] [INFO ] Found NUPN structural information;
[2026-05-22 22:42:38] [INFO ] Parsed PT model containing 4410 places and 5405 transitions and 16377 arcs in 524 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-10b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (51 resets) in 2253 ms. (17 steps per ms) remains 7/15 properties
FORMULA ASLink-PT-10b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 414 ms. (96 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 453 ms. (88 steps per ms) remains 7/7 properties
[2026-05-22 22:42:39] [INFO ] Flatten gal took : 597 ms
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 196 ms. (203 steps per ms) remains 7/7 properties
[2026-05-22 22:42:39] [INFO ] Flatten gal took : 261 ms
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 7/7 properties
[2026-05-22 22:42:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2833975819408255782.gal : 109 ms
[2026-05-22 22:42:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15547252876679629945.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2833975819408255782.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15547252876679629945.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.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4067200077499650820.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14445384981006442307.kers'
[2026-05-22 22:42:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4067200077499650820.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14445384981006442307.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5405 rows 4410 cols 16377 entries
Finished phase 1 with 3000 SingleSign rule and 977 generalized
[2026-05-22 22:42:40] [INFO ] Computed 433 invariants in 45 ms
Computed 433 P flows in 47 ms.
Exported basis to /tmp/petrispot-output-14445384981006442307.kers
Total runtime 51 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Loading property file /tmp/ReachabilityCardinality15547252876679629945.prop.
At refinement iteration 2 (OVERLAPS) 1557/1672 variables, 66/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1672 variables, 1557/1738 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1672 variables, 0/1738 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 442/2114 variables, 33/1771 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2114 variables, 442/2213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2114 variables, 1/2214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2114 variables, 0/2214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 2204/4318 variables, 301/2515 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4318 variables, 2204/4719 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4318 variables, 0/4719 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 92/4410 variables, 32/4751 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4410 variables, 92/4843 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4410/9815 variables, and 4843 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5047 ms.
Refiners :[Domain max(s): 4410/4410 constraints, Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 334/334 constraints, State Equation: 0/4410 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1557/1672 variables, 66/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1672 variables, 1557/1738 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1672 variables, 3/1741 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1672 variables, 2/1743 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1672 variables, 0/1743 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 442/2114 variables, 33/1776 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2114 variables, 442/2218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2114 variables, 1/2219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2114 variables, 1/2220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2114/9815 variables, and 2220 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5025 ms.
Refiners :[Domain max(s): 2114/4410 constraints, Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 1/334 constraints, State Equation: 0/4410 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10328ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 115 out of 4410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4410/4410 places, 5405/5405 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 951 transitions
Trivial Post-agglo rules discarded 951 transitions
Performed 951 trivial Post agglomeration. Transition count delta: 951
Iterating post reduction 0 with 951 rules applied. Total rules applied 951 place count 4410 transition count 4454
Reduce places removed 951 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 989 rules applied. Total rules applied 1940 place count 3459 transition count 4416
Reduce places removed 9 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 2 with 41 rules applied. Total rules applied 1981 place count 3450 transition count 4384
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 2016 place count 3418 transition count 4381
Performed 988 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 988 Pre rules applied. Total rules applied 2016 place count 3418 transition count 3393
Deduced a syphon composed of 988 places in 12 ms
Ensure Unique test removed 87 places
Reduce places removed 1075 places and 0 transitions.
Iterating global reduction 4 with 2063 rules applied. Total rules applied 4079 place count 2343 transition count 3393
Discarding 18 places :
Implicit places reduction removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 4 with 70 rules applied. Total rules applied 4149 place count 2325 transition count 3341
Reduce places removed 52 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 5 with 56 rules applied. Total rules applied 4205 place count 2273 transition count 3337
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 4209 place count 2269 transition count 3337
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 35 Pre rules applied. Total rules applied 4209 place count 2269 transition count 3302
Deduced a syphon composed of 35 places in 9 ms
Ensure Unique test removed 33 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 7 with 103 rules applied. Total rules applied 4312 place count 2201 transition count 3302
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 33 Pre rules applied. Total rules applied 4312 place count 2201 transition count 3269
Deduced a syphon composed of 33 places in 24 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 4378 place count 2168 transition count 3269
Discarding 137 places :
Symmetric choice reduction at 7 with 137 rule applications. Total rules 4515 place count 2031 transition count 3132
Iterating global reduction 7 with 137 rules applied. Total rules applied 4652 place count 2031 transition count 3132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4653 place count 2031 transition count 3131
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 42 Pre rules applied. Total rules applied 4653 place count 2031 transition count 3089
Deduced a syphon composed of 42 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 8 with 85 rules applied. Total rules applied 4738 place count 1988 transition count 3089
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4738 place count 1988 transition count 3088
Deduced a syphon composed of 1 places in 11 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 4741 place count 1986 transition count 3088
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 4752 place count 1975 transition count 3019
Iterating global reduction 8 with 11 rules applied. Total rules applied 4763 place count 1975 transition count 3019
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 7 Pre rules applied. Total rules applied 4763 place count 1975 transition count 3012
Deduced a syphon composed of 7 places in 8 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 4777 place count 1968 transition count 3012
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4778 place count 1967 transition count 3004
Iterating global reduction 8 with 1 rules applied. Total rules applied 4779 place count 1967 transition count 3004
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4780 place count 1966 transition count 2996
Iterating global reduction 8 with 1 rules applied. Total rules applied 4781 place count 1966 transition count 2996
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4782 place count 1965 transition count 2988
Iterating global reduction 8 with 1 rules applied. Total rules applied 4783 place count 1965 transition count 2988
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4784 place count 1964 transition count 2980
Iterating global reduction 8 with 1 rules applied. Total rules applied 4785 place count 1964 transition count 2980
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4786 place count 1963 transition count 2972
Iterating global reduction 8 with 1 rules applied. Total rules applied 4787 place count 1963 transition count 2972
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4788 place count 1962 transition count 2964
Iterating global reduction 8 with 1 rules applied. Total rules applied 4789 place count 1962 transition count 2964
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4790 place count 1961 transition count 2956
Iterating global reduction 8 with 1 rules applied. Total rules applied 4791 place count 1961 transition count 2956
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4792 place count 1960 transition count 2948
Iterating global reduction 8 with 1 rules applied. Total rules applied 4793 place count 1960 transition count 2948
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4794 place count 1959 transition count 2940
Iterating global reduction 8 with 1 rules applied. Total rules applied 4795 place count 1959 transition count 2940
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4796 place count 1958 transition count 2932
Iterating global reduction 8 with 1 rules applied. Total rules applied 4797 place count 1958 transition count 2932
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4798 place count 1957 transition count 2924
Iterating global reduction 8 with 1 rules applied. Total rules applied 4799 place count 1957 transition count 2924
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4800 place count 1956 transition count 2916
Iterating global reduction 8 with 1 rules applied. Total rules applied 4801 place count 1956 transition count 2916
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4802 place count 1955 transition count 2908
Iterating global reduction 8 with 1 rules applied. Total rules applied 4803 place count 1955 transition count 2908
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4804 place count 1954 transition count 2900
Iterating global reduction 8 with 1 rules applied. Total rules applied 4805 place count 1954 transition count 2900
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4806 place count 1953 transition count 2892
Iterating global reduction 8 with 1 rules applied. Total rules applied 4807 place count 1953 transition count 2892
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4808 place count 1952 transition count 2884
Iterating global reduction 8 with 1 rules applied. Total rules applied 4809 place count 1952 transition count 2884
Performed 253 Post agglomeration using F-continuation condition.Transition count delta: 253
Deduced a syphon composed of 253 places in 7 ms
Ensure Unique test removed 2 places
Reduce places removed 255 places and 0 transitions.
Iterating global reduction 8 with 508 rules applied. Total rules applied 5317 place count 1697 transition count 2631
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5318 place count 1696 transition count 2630
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 5320 place count 1695 transition count 2630
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5321 place count 1694 transition count 2629
Iterating global reduction 8 with 1 rules applied. Total rules applied 5322 place count 1694 transition count 2629
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 5324 place count 1694 transition count 2627
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 5325 place count 1693 transition count 2627
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 5327 place count 1692 transition count 2636
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 5328 place count 1692 transition count 2635
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 5330 place count 1691 transition count 2634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 5331 place count 1690 transition count 2634
Free-agglomeration rule applied 12 times.
Iterating global reduction 12 with 12 rules applied. Total rules applied 5343 place count 1690 transition count 2622
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 5355 place count 1678 transition count 2622
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 13 with 12 rules applied. Total rules applied 5367 place count 1678 transition count 2610
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 13 with 12 rules applied. Total rules applied 5379 place count 1666 transition count 2610
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 5381 place count 1666 transition count 2610
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 5382 place count 1665 transition count 2609
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 5385 place count 1662 transition count 2609
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 4 Pre rules applied. Total rules applied 5385 place count 1662 transition count 2605
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 5393 place count 1658 transition count 2605
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 15 with 3 rules applied. Total rules applied 5396 place count 1655 transition count 2605
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 16 with 10 rules applied. Total rules applied 5406 place count 1650 transition count 2600
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 5408 place count 1648 transition count 2598
Iterating global reduction 16 with 2 rules applied. Total rules applied 5410 place count 1648 transition count 2598
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 5411 place count 1648 transition count 2597
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 5412 place count 1647 transition count 2597
Applied a total of 5412 rules in 4528 ms. Remains 1647 /4410 variables (removed 2763) and now considering 2597/5405 (removed 2808) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4535 ms. Remains : 1647/4410 places, 2597/5405 transitions.
RANDOM walk for 40000 steps (242 resets) in 794 ms. (50 steps per ms) remains 7/7 properties
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
BEST_FIRST walk for 40003 steps (28 resets) in 247 ms. (161 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 16
BEST_FIRST walk for 40004 steps (28 resets) in 279 ms. (142 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :16 after 22
SDD proceeding with computation,7 properties remain. new max is 64
BEST_FIRST walk for 40003 steps (26 resets) in 217 ms. (183 steps per ms) remains 7/7 properties
SDD size :22 after 294
SDD proceeding with computation,7 properties remain. new max is 128
BEST_FIRST walk for 40003 steps (27 resets) in 196 ms. (203 steps per ms) remains 7/7 properties
SDD size :294 after 394
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :394 after 807
BEST_FIRST walk for 40004 steps (27 resets) in 170 ms. (233 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (28 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :807 after 26888
BEST_FIRST walk for 40004 steps (29 resets) in 184 ms. (216 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :26888 after 110044
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :110044 after 906895
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :906895 after 1.46003e+11
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :1.46003e+11 after 5.88427e+11
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :5.88427e+11 after 1.78867e+21
Interrupted probabilistic random walk after 144946 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 7
Probabilistic random walk after 144946 steps, saw 34761 distinct states, run finished after 3008 ms. (steps per millisecond=48 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-180067419897102732.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16806281336033348169.kers'
[2026-05-22 22:42:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-180067419897102732.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16806281336033348169.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 1 ms.
// Phase 1: matrix 2597 rows 1636 cols 10043 entries
Finished phase 1 with 418 SingleSign rule and 946 generalized
[2026-05-22 22:42:58] [INFO ] Computed 283 invariants in 29 ms
Computed 283 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-16806281336033348169.kers
Total runtime 32 ms.
[2026-05-22 22:42:58] [INFO ] State equation strengthened by 52 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 656/771 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/771 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 49/820 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 704/1524 variables, 159/245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1524 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 50/1574 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1574 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 72/1646 variables, 28/282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1646 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/1647 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :1.78867e+21 after 5.42075e+34
At refinement iteration 12 (INCLUDED_ONLY) 0/1647 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 2597/4244 variables, 1647/1930 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4244 variables, 52/1982 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4244 variables, 0/1982 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/4244 variables, 0/1982 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4244/4244 variables, and 1982 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5993 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 187/187 constraints, State Equation: 1647/1647 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 656/771 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/771 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 49/820 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 704/1524 variables, 159/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1524 variables, 7/253 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1524 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 50/1574 variables, 9/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 65536
At refinement iteration 10 (INCLUDED_ONLY) 0/1574 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD size :5.42075e+34 after 3.40741e+59
At refinement iteration 11 (OVERLAPS) 72/1646 variables, 28/290 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1646 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 1/1647 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1647 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 2597/4244 variables, 1647/1938 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4244 variables, 52/1990 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Invariant property ASLink-PT-10b-ReachabilityCardinality-2024-09 does not hold.
FORMULA ASLink-PT-10b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :3.40741e+59 after 2.93055e+61
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :2.93055e+61 after 2.93055e+61
At refinement iteration 17 (INCLUDED_ONLY) 0/4244 variables, 6/1996 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4244/4244 variables, and 1996 constraints, problems are : Problem set: 1 solved, 6 unsolved in 45027 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 187/187 constraints, State Equation: 1647/1647 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51097ms problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 113 out of 1647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1647/1647 places, 2597/2597 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 1647 transition count 2596
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1646 transition count 2596
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1646 transition count 2596
Applied a total of 3 rules in 184 ms. Remains 1646 /1647 variables (removed 1) and now considering 2596/2597 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 1646/1647 places, 2596/2597 transitions.
RANDOM walk for 40000 steps (256 resets) in 568 ms. (70 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (29 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (29 resets) in 226 ms. (176 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (29 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (28 resets) in 153 ms. (259 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (28 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (28 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 149452 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 6
Probabilistic random walk after 149452 steps, saw 36902 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10173194608161298201.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4516759781477968920.kers'
[2026-05-22 22:43:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10173194608161298201.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4516759781477968920.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 1 ms.
// Phase 1: matrix 2596 rows 1635 cols 10042 entries
Finished phase 1 with 417 SingleSign rule and 946 generalized
[2026-05-22 22:43:53] [INFO ] Computed 283 invariants in 29 ms
Computed 283 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-4516759781477968920.kers
Total runtime 32 ms.
[2026-05-22 22:43:53] [INFO ] State equation strengthened by 52 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 661/774 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/774 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 49/823 variables, 21/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/823 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 700/1523 variables, 157/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1523 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 50/1573 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1573 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 72/1645 variables, 28/282 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1645 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/1646 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1646 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2596/4242 variables, 1646/1929 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4242 variables, 52/1981 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4242 variables, 0/1981 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/4242 variables, 0/1981 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4242/4242 variables, and 1981 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6099 ms.
Refiners :[Positive P Invariants (semi-flows): 98/98 constraints, Generalized P Invariants (flows): 185/185 constraints, State Equation: 1646/1646 constraints, ReadFeed: 52/52 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
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 661/774 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/774 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 49/823 variables, 21/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/823 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 700/1523 variables, 157/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1523 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1523 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1523 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1523 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1523 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 50/1573 variables, 9/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 262144
SDD size :2.93055e+61 after 2.93055e+61
At refinement iteration 12 (INCLUDED_ONLY) 0/1573 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 72/1645 variables, 28/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1645 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1/1646 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1646 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 2596/4242 variables, 1646/1936 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4242 variables, 52/1988 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4242 variables, 5/1993 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4242 variables, 0/1993 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/4242 variables, 0/1993 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4242/4242 variables, and 1993 constraints, problems are : Problem set: 0 solved, 6 unsolved in 26960 ms.
Refiners :[Positive P Invariants (semi-flows): 98/98 constraints, Generalized P Invariants (flows): 185/185 constraints, State Equation: 1646/1646 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33138ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 33436 ms.
Support contains 113 out of 1646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1646/1646 places, 2596/2596 transitions.
Applied a total of 0 rules in 79 ms. Remains 1646 /1646 variables (removed 0) and now considering 2596/2596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 1646/1646 places, 2596/2596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1646/1646 places, 2596/2596 transitions.
Applied a total of 0 rules in 77 ms. Remains 1646 /1646 variables (removed 0) and now considering 2596/2596 (removed 0) transitions.
[2026-05-22 22:45:00] [INFO ] Invariant cache hit.
[2026-05-22 22:45:01] [INFO ] Implicit Places using invariants in 1474 ms returned [2, 21, 22, 25, 37, 54, 74, 173, 174, 175, 176, 181, 199, 219, 284, 287, 323, 326, 327, 332, 465, 468, 469, 473, 490, 510, 614, 615, 616, 618, 638, 657, 748, 761, 762, 763, 764, 765, 769, 788, 807, 907, 908, 909, 910, 913, 930, 948, 1025, 1050, 1056, 1059, 1077, 1096, 1151, 1177, 1193, 1194, 1196, 1213, 1231, 1273, 1314, 1332, 1333, 1335, 1352, 1370, 1409, 1412, 1455, 1456, 1459, 1470, 1473, 1474, 1475, 1493, 1495, 1499, 1517, 1518, 1519, 1520, 1539, 1545, 1551, 1558, 1564, 1570, 1576, 1582, 1588, 1594, 1600, 1630]
[2026-05-22 22:45:01] [INFO ] Actually due to overlaps returned [1493, 1475, 37, 54, 181, 199, 332, 473, 490, 638, 769, 788, 913, 930, 1077, 1213, 1352, 1499, 618, 1059, 1196, 1335, 174, 175, 326, 468, 614, 615, 763, 764, 908, 909, 1193, 1332, 1473, 1517, 176, 327, 469, 616, 765, 910, 1056, 1194, 1333, 1474, 1495, 1518, 2, 21, 748, 761, 1177, 1314, 1455, 1456, 74, 173, 219, 323, 465, 510, 657, 807, 907, 948, 1050, 1096, 1231, 1370, 1470, 1519, 1570, 1588, 1600, 22, 25, 762, 1459, 1520, 1539, 1545, 1551, 1558, 1564, 1576, 1582, 1594, 1630]
Discarding 89 places :
Implicit Place search using SMT only with invariants took 1490 ms to find 89 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1557/1646 places, 2596/2596 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 146 rules applied. Total rules applied 146 place count 1555 transition count 2452
Reduce places removed 144 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 162 rules applied. Total rules applied 308 place count 1411 transition count 2434
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 326 place count 1393 transition count 2434
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 326 place count 1393 transition count 2378
Deduced a syphon composed of 56 places in 6 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 438 place count 1337 transition count 2378
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 22 rules applied. Total rules applied 460 place count 1325 transition count 2368
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 470 place count 1315 transition count 2368
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 470 place count 1315 transition count 2367
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 472 place count 1314 transition count 2367
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 483 place count 1303 transition count 2356
Iterating global reduction 5 with 11 rules applied. Total rules applied 494 place count 1303 transition count 2356
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 494 place count 1303 transition count 2355
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 496 place count 1302 transition count 2355
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 499 place count 1299 transition count 2349
Iterating global reduction 5 with 3 rules applied. Total rules applied 502 place count 1299 transition count 2349
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 503 place count 1298 transition count 2348
Iterating global reduction 5 with 1 rules applied. Total rules applied 504 place count 1298 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 505 place count 1297 transition count 2346
Iterating global reduction 5 with 1 rules applied. Total rules applied 506 place count 1297 transition count 2346
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 5 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 5 with 158 rules applied. Total rules applied 664 place count 1218 transition count 2267
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 667 place count 1215 transition count 2264
Iterating global reduction 5 with 3 rules applied. Total rules applied 670 place count 1215 transition count 2264
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 673 place count 1215 transition count 2261
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 677 place count 1213 transition count 2262
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 682 place count 1213 transition count 2257
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 689 place count 1208 transition count 2255
Free-agglomeration rule (complex) applied 34 times.
Iterating global reduction 7 with 34 rules applied. Total rules applied 723 place count 1208 transition count 2221
Ensure Unique test removed 1 places
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 758 place count 1173 transition count 2221
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 760 place count 1173 transition count 2219
Partial Free-agglomeration rule applied 23 times.
Drop transitions (Partial Free agglomeration) removed 23 transitions
Iterating global reduction 8 with 23 rules applied. Total rules applied 783 place count 1173 transition count 2219
Applied a total of 783 rules in 878 ms. Remains 1173 /1557 variables (removed 384) and now considering 2219/2596 (removed 377) transitions.
[2026-05-22 22:45:02] [INFO ] Flow matrix only has 2218 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11828569401509476628.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13846560793577203745.kers'
[2026-05-22 22:45:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11828569401509476628.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13846560793577203745.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 2218 rows 1172 cols 8799 entries
Finished phase 1 with 431 SingleSign rule and 563 generalized
[2026-05-22 22:45:02] [INFO ] Computed 179 invariants in 24 ms
Computed 179 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-13846560793577203745.kers
Total runtime 30 ms.
[2026-05-22 22:45:03] [INFO ] Implicit Places using invariants in 926 ms returned [80, 99, 105, 111, 198, 206, 209, 212, 214, 217, 316, 325, 332, 411, 441, 444, 446, 452, 457, 458, 538, 545, 548, 551, 558, 626, 643, 649, 652, 654, 656, 755, 764, 772, 773, 861, 864, 866, 869, 879, 948, 956, 962, 965, 967, 973, 1052, 1055, 1063, 1070, 1073, 1075, 1156, 1160, 1171]
[2026-05-22 22:45:03] [INFO ] Actually due to overlaps returned [558, 772, 879, 773, 452, 656, 99, 105, 198, 206, 214, 441, 446, 538, 551, 643, 649, 654, 866, 956, 962, 967, 1063, 1075, 80, 111, 217, 316, 325, 332, 411, 545, 626, 755, 764, 861, 869, 948, 973, 1052, 1070, 1156, 1160, 1171]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 930 ms to find 44 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1129/1646 places, 2219/2596 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1106 transition count 2196
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1106 transition count 2196
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 1102 transition count 2192
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 1102 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1101 transition count 2191
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1101 transition count 2191
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1100 transition count 2190
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1100 transition count 2190
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 78 place count 1090 transition count 2180
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 81 place count 1090 transition count 2177
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 101 place count 1090 transition count 2157
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 121 place count 1070 transition count 2157
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 1070 transition count 2155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 125 place count 1068 transition count 2155
Applied a total of 125 rules in 397 ms. Remains 1068 /1129 variables (removed 61) and now considering 2155/2219 (removed 64) transitions.
[2026-05-22 22:45:03] [INFO ] Flow matrix only has 2154 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5160196859556578622.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2544122104640951292.kers'
[2026-05-22 22:45:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5160196859556578622.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2544122104640951292.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 2154 rows 1067 cols 8497 entries
Finished phase 1 with 429 SingleSign rule and 504 generalized
[2026-05-22 22:45:03] [INFO ] Computed 135 invariants in 19 ms
Computed 135 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-2544122104640951292.kers
Total runtime 21 ms.
[2026-05-22 22:45:04] [INFO ] Implicit Places using invariants in 801 ms returned [191, 414, 415, 963]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 803 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1064/1646 places, 2155/2596 transitions.
Applied a total of 0 rules in 43 ms. Remains 1064 /1064 variables (removed 0) and now considering 2155/2155 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 4618 ms. Remains : 1064/1646 places, 2155/2596 transitions.
RANDOM walk for 40000 steps (322 resets) in 616 ms. (64 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (39 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (44 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (44 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (44 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (45 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (43 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 145073 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 6
Probabilistic random walk after 145073 steps, saw 62522 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2026-05-22 22:45:08] [INFO ] Flow matrix only has 2154 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16453763747064945841.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14422364304640613774.kers'
[2026-05-22 22:45:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16453763747064945841.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14422364304640613774.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 2154 rows 1063 cols 8466 entries
Finished phase 1 with 422 SingleSign rule and 511 generalized
[2026-05-22 22:45:08] [INFO ] Computed 131 invariants in 19 ms
Computed 131 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-14422364304640613774.kers
Total runtime 20 ms.
[2026-05-22 22:45:08] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 436/549 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/557 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 490/1047 variables, 85/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1047 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 17/1064 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1064 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2154/3218 variables, 1064/1195 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3218 variables, 19/1214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3218 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/3218 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3218/3218 variables, and 1214 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2964 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 89/89 constraints, State Equation: 1064/1064 constraints, ReadFeed: 19/19 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
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 436/549 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/549 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Reachability property ASLink-PT-10b-ReachabilityCardinality-2024-06 is true.
FORMULA ASLink-PT-10b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 8/557 variables, 1/45 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 490/1047 variables, 85/130 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1047 variables, 5/135 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1047 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 17/1064 variables, 4/139 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1064 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2154/3218 variables, 1064/1203 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3218 variables, 19/1222 constraints. Problems are: Problem set: 1 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 262144
SDD size :2.93055e+61 after 4.63802e+61
At refinement iteration 14 (INCLUDED_ONLY) 0/3218 variables, 4/1226 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3218 variables, 2/1228 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3218 variables, 0/1228 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/3218 variables, 0/1228 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3218/3218 variables, and 1228 constraints, problems are : Problem set: 1 solved, 5 unsolved in 17087 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 89/89 constraints, State Equation: 1064/1064 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 20119ms problems are : Problem set: 1 solved, 5 unsolved
Parikh walk visited 0 properties in 16252 ms.
Support contains 112 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 2155/2155 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 1064 transition count 2154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1063 transition count 2154
Applied a total of 2 rules in 53 ms. Remains 1063 /1064 variables (removed 1) and now considering 2154/2155 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1063/1064 places, 2154/2155 transitions.
RANDOM walk for 40000 steps (324 resets) in 262 ms. (152 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (31 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (42 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (43 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (40 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (43 resets) in 174 ms. (228 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 133868 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 5
Probabilistic random walk after 133868 steps, saw 57946 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2026-05-22 22:45:47] [INFO ] Flow matrix only has 2153 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1898835068277670052.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3167732272102045035.kers'
[2026-05-22 22:45:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1898835068277670052.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3167732272102045035.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 2153 rows 1062 cols 8464 entries
Finished phase 1 with 421 SingleSign rule and 511 generalized
[2026-05-22 22:45:47] [INFO ] Computed 131 invariants in 19 ms
Computed 131 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-3167732272102045035.kers
Total runtime 22 ms.
[2026-05-22 22:45:47] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 436/548 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/548 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8/556 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 490/1046 variables, 85/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1046 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 17/1063 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1063 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2153/3216 variables, 1063/1194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3216 variables, 19/1213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3216 variables, 0/1213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/3216 variables, 0/1213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3216/3216 variables, and 1213 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2847 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 89/89 constraints, State Equation: 1063/1063 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 436/548 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/548 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/548 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 8/556 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 490/1046 variables, 85/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1046 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1046 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 17/1063 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1063 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2153/3216 variables, 1063/1199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3216 variables, 19/1218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3216 variables, 4/1222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3216 variables, 5/1227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3216 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/3216 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3216/3216 variables, and 1227 constraints, problems are : Problem set: 0 solved, 5 unsolved in 24954 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 89/89 constraints, State Equation: 1063/1063 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27868ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 25698 ms.
Support contains 112 out of 1063 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1063/1063 places, 2154/2154 transitions.
Applied a total of 0 rules in 48 ms. Remains 1063 /1063 variables (removed 0) and now considering 2154/2154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1063/1063 places, 2154/2154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1063/1063 places, 2154/2154 transitions.
Applied a total of 0 rules in 50 ms. Remains 1063 /1063 variables (removed 0) and now considering 2154/2154 (removed 0) transitions.
[2026-05-22 22:46:41] [INFO ] Flow matrix only has 2153 transitions (discarded 1 similar events)
[2026-05-22 22:46:41] [INFO ] Invariant cache hit.
[2026-05-22 22:46:42] [INFO ] Implicit Places using invariants in 878 ms returned []
[2026-05-22 22:46:42] [INFO ] Flow matrix only has 2153 transitions (discarded 1 similar events)
[2026-05-22 22:46:42] [INFO ] Invariant cache hit.
[2026-05-22 22:46:43] [INFO ] State equation strengthened by 19 read => feed constraints.
[2026-05-22 22:46:49] [INFO ] Implicit Places using invariants and state equation in 7071 ms returned []
Implicit Place search using SMT with State Equation took 7960 ms to find 0 implicit places.
[2026-05-22 22:46:49] [INFO ] Redundant transitions in 129 ms returned []
Running 2127 sub problems to find dead transitions.
[2026-05-22 22:46:49] [INFO ] Flow matrix only has 2153 transitions (discarded 1 similar events)
[2026-05-22 22:46:49] [INFO ] Invariant cache hit.
[2026-05-22 22:46:49] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1060 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2127 unsolved
SMT process timed out in 31010ms, After SMT, problems are : Problem set: 0 solved, 2127 unsolved
Search for dead transitions found 0 dead transitions in 31026ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39212 ms. Remains : 1063/1063 places, 2154/2154 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 5245 edges and 1063 vertex of which 1062 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1062 transition count 2153
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 2 place count 1062 transition count 2146
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 16 place count 1055 transition count 2146
Applied a total of 16 rules in 74 ms. Remains 1055 /1063 variables (removed 8) and now considering 2146/2154 (removed 8) transitions.
Running SMT prover for 5 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17009355094027605322.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7855187262231679730.kers'
[2026-05-22 22:47:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17009355094027605322.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7855187262231679730.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 2146 rows 1054 cols 8449 entries
Finished phase 1 with 412 SingleSign rule and 513 generalized
[2026-05-22 22:47:20] [INFO ] Computed 130 invariants in 32 ms
Computed 130 P flows in 37 ms.
Exported basis to /tmp/petrispot-output-7855187262231679730.kers
Total runtime 40 ms.
[2026-05-22 22:47:21] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2026-05-22 22:47:21] [INFO ] [Nat]Absence check using 41 positive place invariants in 27 ms returned sat
[2026-05-22 22:47:21] [INFO ] [Nat]Absence check using 41 positive and 89 generalized place invariants in 25 ms returned sat
[2026-05-22 22:47:37] [INFO ] After 16011ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2026-05-22 22:47:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 878 ms
[2026-05-22 22:47:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 818 ms
TRAPS : Iteration 1
[2026-05-22 22:47:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 724 ms
TRAPS : Iteration 2
[2026-05-22 22:47:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 989 ms
TRAPS : Iteration 3
[2026-05-22 22:48:00] [INFO ] After 38267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2026-05-22 22:48:04] [INFO ] After 42996ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 43440 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 22:48:04] [INFO ] Flatten gal took : 190 ms
[2026-05-22 22:48:04] [INFO ] Applying decomposition
[2026-05-22 22:48:04] [INFO ] Flatten gal took : 137 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5110959062816121684.txt' '-o' '/tmp/graph5110959062816121684.bin' '-w' '/tmp/graph5110959062816121684.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5110959062816121684.bin' '-l' '-1' '-v' '-w' '/tmp/graph5110959062816121684.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:48:05] [INFO ] Decomposing Gal with order
[2026-05-22 22:48:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:48:06] [INFO ] Removed a total of 3822 redundant transitions.
[2026-05-22 22:48:06] [INFO ] Flatten gal took : 337 ms
[2026-05-22 22:48:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 49 ms.
[2026-05-22 22:48:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4857952768953837459.gal : 55 ms
[2026-05-22 22:48:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5281066439251980132.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4857952768953837459.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5281066439251980132.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5281066439251980132.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1 after 5.0733e+20
Detected timeout of ITS tools.
[2026-05-22 23:18:07] [INFO ] Flatten gal took : 60 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16998124216289882342
[2026-05-22 23:18:07] [INFO ] Too many transitions (2154) to apply POR reductions. Disabling POR matrices.
[2026-05-22 23:18:07] [INFO ] Applying decomposition
[2026-05-22 23:18:07] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16998124216289882342
Running compilation step : cd /tmp/ltsmin16998124216289882342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-22 23:18:07] [INFO ] Flatten gal took : 61 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7649717775065072071.txt' '-o' '/tmp/graph7649717775065072071.bin' '-w' '/tmp/graph7649717775065072071.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7649717775065072071.bin' '-l' '-1' '-v' '-w' '/tmp/graph7649717775065072071.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:18:07] [INFO ] Decomposing Gal with order
[2026-05-22 23:18:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:18:07] [INFO ] Removed a total of 3734 redundant transitions.
[2026-05-22 23:18:07] [INFO ] Flatten gal took : 102 ms
[2026-05-22 23:18:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 44 ms.
[2026-05-22 23:18:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6964455815812073500.gal : 16 ms
[2026-05-22 23:18:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5307026466434658573.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6964455815812073500.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5307026466434658573.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5307026466434658573.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :1 after 7745
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :7745 after 193569
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :193569 after 7.64174e+15
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :7.64174e+15 after 8.44231e+16
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :8.44231e+16 after 1.13173e+17
Compilation finished in 5192 ms.
Running link step : cd /tmp/ltsmin16998124216289882342;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin16998124216289882342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202400==true'
Invariant property ASLink-PT-10b-ReachabilityCardinality-2024-00 does not hold.
FORMULA ASLink-PT-10b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.13173e+17 after 5.47219e+17
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16998124216289882342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202400==true'
Running LTSmin : cd /tmp/ltsmin16998124216289882342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202402==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16998124216289882342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202402==true'
Running LTSmin : cd /tmp/ltsmin16998124216289882342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202403==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16998124216289882342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202403==true'
Running LTSmin : cd /tmp/ltsmin16998124216289882342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202404==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16998124216289882342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202404==true'
Running LTSmin : cd /tmp/ltsmin16998124216289882342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202413==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16998124216289882342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202413==true'
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin16998124216289882342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202402==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
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-10b"
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-5973"
echo " Executing tool itstools"
echo " Input is ASLink-PT-10b, 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-oct2-177944366300438"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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