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-177944366200406.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-08b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200406
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.4K Mar 5 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 5 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:03 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:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 5 14:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K Mar 5 14:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 5 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 5 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:10 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.2M 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-08b-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779484597173

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-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-22 21:16:38] [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 21:16:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 21:16:38] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2026-05-22 21:16:38] [INFO ] Transformed 3618 places.
[2026-05-22 21:16:38] [INFO ] Transformed 4459 transitions.
[2026-05-22 21:16:38] [INFO ] Found NUPN structural information;
[2026-05-22 21:16:38] [INFO ] Parsed PT model containing 3618 places and 4459 transitions and 13543 arcs in 387 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (54 resets) in 2109 ms. (18 steps per ms) remains 5/15 properties
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 383 ms. (104 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 579 ms. (68 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 5/5 properties
[2026-05-22 21:16:40] [INFO ] Flatten gal took : 606 ms
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17174554005465874902.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9947783558111486111.kers'
[2026-05-22 21:16:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17174554005465874902.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9947783558111486111.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 4459 rows 3618 cols 13543 entries
[2026-05-22 21:16:40] [INFO ] Flatten gal took : 173 ms
Finished phase 1 with 2455 SingleSign rule and 808 generalized
[2026-05-22 21:16:40] [INFO ] Computed 355 invariants in 34 ms
Computed 355 P flows in 34 ms.
Exported basis to /tmp/petrispot-output-9947783558111486111.kers
Total runtime 38 ms.
Excessive predecessor constraint size, skipping predecessor.
[2026-05-22 21:16:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7235064427635765817.gal : 124 ms
[2026-05-22 21:16:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2989671261391797014.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7235064427635765817.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2989671261391797014.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 ...328
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1460/1594 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Loading property file /tmp/ReachabilityCardinality2989671261391797014.prop.
At refinement iteration 3 (INCLUDED_ONLY) 0/1594 variables, 1460/1665 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1594 variables, 0/1665 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 137/1731 variables, 9/1674 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1731 variables, 137/1811 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1731 variables, 0/1811 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem ASLink-PT-08b-ReachabilityCardinality-2024-11 is UNSAT
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 1799/3530 variables, 245/2056 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3530 variables, 1799/3855 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3530 variables, 0/3855 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SMT process timed out in 5311ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 110 out of 3618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3618/3618 places, 4459/4459 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 769 transitions
Trivial Post-agglo rules discarded 769 transitions
Performed 769 trivial Post agglomeration. Transition count delta: 769
Iterating post reduction 0 with 769 rules applied. Total rules applied 769 place count 3618 transition count 3690
Reduce places removed 769 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 802 rules applied. Total rules applied 1571 place count 2849 transition count 3657
Reduce places removed 7 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 2 with 31 rules applied. Total rules applied 1602 place count 2842 transition count 3633
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1626 place count 2818 transition count 3633
Performed 807 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 807 Pre rules applied. Total rules applied 1626 place count 2818 transition count 2826
Deduced a syphon composed of 807 places in 8 ms
Ensure Unique test removed 71 places
Reduce places removed 878 places and 0 transitions.
Iterating global reduction 4 with 1685 rules applied. Total rules applied 3311 place count 1940 transition count 2826
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 4 with 55 rules applied. Total rules applied 3366 place count 1925 transition count 2786
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 5 with 48 rules applied. Total rules applied 3414 place count 1885 transition count 2778
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 3422 place count 1877 transition count 2778
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 26 Pre rules applied. Total rules applied 3422 place count 1877 transition count 2752
Deduced a syphon composed of 26 places in 8 ms
Ensure Unique test removed 22 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 74 rules applied. Total rules applied 3496 place count 1829 transition count 2752
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 3496 place count 1829 transition count 2730
Deduced a syphon composed of 22 places in 23 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 3540 place count 1807 transition count 2730
Discarding 107 places :
Symmetric choice reduction at 7 with 107 rule applications. Total rules 3647 place count 1700 transition count 2623
Iterating global reduction 7 with 107 rules applied. Total rules applied 3754 place count 1700 transition count 2623
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3755 place count 1700 transition count 2622
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 31 Pre rules applied. Total rules applied 3755 place count 1700 transition count 2591
Deduced a syphon composed of 31 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 8 with 63 rules applied. Total rules applied 3818 place count 1668 transition count 2591
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3818 place count 1668 transition count 2590
Deduced a syphon composed of 1 places in 6 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 3821 place count 1666 transition count 2590
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 3829 place count 1658 transition count 2539
Iterating global reduction 8 with 8 rules applied. Total rules applied 3837 place count 1658 transition count 2539
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 3837 place count 1658 transition count 2537
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 3841 place count 1656 transition count 2537
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3842 place count 1655 transition count 2529
Iterating global reduction 8 with 1 rules applied. Total rules applied 3843 place count 1655 transition count 2529
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3844 place count 1654 transition count 2521
Iterating global reduction 8 with 1 rules applied. Total rules applied 3845 place count 1654 transition count 2521
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3846 place count 1653 transition count 2513
Iterating global reduction 8 with 1 rules applied. Total rules applied 3847 place count 1653 transition count 2513
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3848 place count 1652 transition count 2505
Iterating global reduction 8 with 1 rules applied. Total rules applied 3849 place count 1652 transition count 2505
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3850 place count 1651 transition count 2497
Iterating global reduction 8 with 1 rules applied. Total rules applied 3851 place count 1651 transition count 2497
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3852 place count 1650 transition count 2489
Iterating global reduction 8 with 1 rules applied. Total rules applied 3853 place count 1650 transition count 2489
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3854 place count 1649 transition count 2481
Iterating global reduction 8 with 1 rules applied. Total rules applied 3855 place count 1649 transition count 2481
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3856 place count 1648 transition count 2473
Iterating global reduction 8 with 1 rules applied. Total rules applied 3857 place count 1648 transition count 2473
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3858 place count 1647 transition count 2465
Iterating global reduction 8 with 1 rules applied. Total rules applied 3859 place count 1647 transition count 2465
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3860 place count 1646 transition count 2457
Iterating global reduction 8 with 1 rules applied. Total rules applied 3861 place count 1646 transition count 2457
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3862 place count 1645 transition count 2449
Iterating global reduction 8 with 1 rules applied. Total rules applied 3863 place count 1645 transition count 2449
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3864 place count 1644 transition count 2441
Iterating global reduction 8 with 1 rules applied. Total rules applied 3865 place count 1644 transition count 2441
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3866 place count 1643 transition count 2433
Iterating global reduction 8 with 1 rules applied. Total rules applied 3867 place count 1643 transition count 2433
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3868 place count 1642 transition count 2425
Iterating global reduction 8 with 1 rules applied. Total rules applied 3869 place count 1642 transition count 2425
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3870 place count 1641 transition count 2417
Iterating global reduction 8 with 1 rules applied. Total rules applied 3871 place count 1641 transition count 2417
Performed 212 Post agglomeration using F-continuation condition.Transition count delta: 212
Deduced a syphon composed of 212 places in 4 ms
Ensure Unique test removed 3 places
Reduce places removed 215 places and 0 transitions.
Iterating global reduction 8 with 427 rules applied. Total rules applied 4298 place count 1426 transition count 2205
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4299 place count 1425 transition count 2204
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 4301 place count 1424 transition count 2204
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4302 place count 1423 transition count 2203
Iterating global reduction 8 with 1 rules applied. Total rules applied 4303 place count 1423 transition count 2203
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 4305 place count 1423 transition count 2201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4306 place count 1422 transition count 2201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4308 place count 1421 transition count 2210
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 4309 place count 1421 transition count 2209
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 4311 place count 1420 transition count 2208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 4312 place count 1419 transition count 2208
Free-agglomeration rule applied 13 times.
Iterating global reduction 12 with 13 rules applied. Total rules applied 4325 place count 1419 transition count 2195
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 4338 place count 1406 transition count 2195
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 13 with 12 rules applied. Total rules applied 4350 place count 1406 transition count 2183
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 13 with 12 rules applied. Total rules applied 4362 place count 1394 transition count 2183
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 4364 place count 1394 transition count 2183
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 4365 place count 1393 transition count 2182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 4366 place count 1392 transition count 2182
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 2 Pre rules applied. Total rules applied 4366 place count 1392 transition count 2180
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 4370 place count 1390 transition count 2180
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 15 with 1 rules applied. Total rules applied 4371 place count 1389 transition count 2180
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 4372 place count 1388 transition count 2179
Iterating global reduction 16 with 1 rules applied. Total rules applied 4373 place count 1388 transition count 2179
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 4374 place count 1387 transition count 2178
Iterating global reduction 16 with 1 rules applied. Total rules applied 4375 place count 1387 transition count 2178
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 4376 place count 1386 transition count 2177
Iterating global reduction 16 with 1 rules applied. Total rules applied 4377 place count 1386 transition count 2177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 4378 place count 1386 transition count 2176
Applied a total of 4378 rules in 2839 ms. Remains 1386 /3618 variables (removed 2232) and now considering 2176/4459 (removed 2283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2856 ms. Remains : 1386/3618 places, 2176/4459 transitions.
RANDOM walk for 40000 steps (239 resets) in 430 ms. (92 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (38 resets) in 240 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (33 resets) in 307 ms. (129 steps per ms) remains 3/4 properties
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (33 resets) in 255 ms. (156 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (39 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16233835655013010738.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3509104881214412512.kers'
[2026-05-22 21:16:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16233835655013010738.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3509104881214412512.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 5 ms.
// Phase 1: matrix 2176 rows 1375 cols 8377 entries
Finished phase 1 with 364 SingleSign rule and 784 generalized
[2026-05-22 21:16:48] [INFO ] Computed 238 invariants in 25 ms
Computed 238 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-3509104881214412512.kers
Total runtime 27 ms.
[2026-05-22 21:16:48] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 516/591 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 84/675 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/675 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 628/1303 variables, 143/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1303 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 26/1329 variables, 7/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1329 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/1332 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1332 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 54/1386 variables, 21/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 14
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :14 after 20
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :20 after 292
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :292 after 392
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :392 after 805
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :805 after 13922
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :13922 after 110174
At refinement iteration 12 (INCLUDED_ONLY) 0/1386 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :110174 after 909863
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :909863 after 1.46003e+11
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :1.46003e+11 after 5.91046e+11
At refinement iteration 13 (OVERLAPS) 2176/3562 variables, 1386/1624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3562 variables, 44/1668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3562 variables, 0/1668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/3562 variables, 0/1668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3562/3562 variables, and 1668 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3282 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 164/164 constraints, State Equation: 1386/1386 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :5.91046e+11 after 6.75423e+22
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 516/591 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 84/675 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/675 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 628/1303 variables, 143/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1303 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1303 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 26/1329 variables, 7/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1329 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/1332 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1332 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem ASLink-PT-08b-ReachabilityCardinality-2024-02 is UNSAT
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (OVERLAPS) 54/1386 variables, 21/240 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1386 variables, 0/240 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :6.75423e+22 after 2.49778e+35
At refinement iteration 14 (OVERLAPS) 2176/3562 variables, 1386/1626 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3562 variables, 44/1670 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3562 variables, 1/1671 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3562 variables, 0/1671 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/3562 variables, 0/1671 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3562/3562 variables, and 1671 constraints, problems are : Problem set: 1 solved, 2 unsolved in 7453 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 164/164 constraints, State Equation: 1386/1386 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10832ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1952 ms.
Support contains 37 out of 1386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1386/1386 places, 2176/2176 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1386 transition count 2158
Reduce places removed 18 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 21 rules applied. Total rules applied 39 place count 1368 transition count 2155
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 1365 transition count 2155
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 42 place count 1365 transition count 2116
Deduced a syphon composed of 39 places in 9 ms
Ensure Unique test removed 5 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 126 place count 1320 transition count 2116
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 128 place count 1319 transition count 2115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 129 place count 1318 transition count 2115
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 129 place count 1318 transition count 2112
Deduced a syphon composed of 3 places in 7 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 137 place count 1313 transition count 2112
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 138 place count 1312 transition count 2112
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 37 rules applied. Total rules applied 175 place count 1293 transition count 2094
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 6 with 2 rules applied. Total rules applied 177 place count 1293 transition count 2092
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 178 place count 1292 transition count 2092
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 180 place count 1290 transition count 2083
Iterating global reduction 8 with 2 rules applied. Total rules applied 182 place count 1290 transition count 2083
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 184 place count 1290 transition count 2081
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 186 place count 1288 transition count 2081
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 188 place count 1288 transition count 2079
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 190 place count 1286 transition count 2079
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 192 place count 1286 transition count 2079
Applied a total of 192 rules in 396 ms. Remains 1286 /1386 variables (removed 100) and now considering 2079/2176 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 1286/1386 places, 2079/2176 transitions.
RANDOM walk for 40000 steps (340 resets) in 640 ms. (62 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (41 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (45 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
Invariant property ASLink-PT-08b-ReachabilityCardinality-2024-12 does not hold.
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Interrupted probabilistic random walk after 233125 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 2
Probabilistic random walk after 233125 steps, saw 43114 distinct states, run finished after 3009 ms. (steps per millisecond=77 ) 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-11455249199818145448.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17022055498377744368.kers'
[2026-05-22 21:17:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11455249199818145448.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17022055498377744368.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 1 ms.
// Phase 1: matrix 2079 rows 1272 cols 8140 entries
Finished phase 1 with 285 SingleSign rule and 774 generalized
[2026-05-22 21:17:05] [INFO ] Computed 227 invariants in 21 ms
Computed 227 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-17022055498377744368.kers
Total runtime 23 ms.
[2026-05-22 21:17:05] [INFO ] State equation strengthened by 48 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 477/513 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/630 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/630 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/632 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/632 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/633 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/633 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 584/1217 variables, 147/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1217 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/1236 variables, 6/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1236 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 27/1263 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1263 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 23/1286 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1286 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2079/3365 variables, 1286/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3365 variables, 48/1561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3365 variables, 0/1561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/3365 variables, 0/1561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3365/3365 variables, and 1561 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1710 ms.
Refiners :[Positive P Invariants (semi-flows): 72/72 constraints, Generalized P Invariants (flows): 155/155 constraints, State Equation: 1286/1286 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 477/513 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/630 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/630 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/632 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/632 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/633 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/633 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 584/1217 variables, 147/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1217 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1217 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/1236 variables, 6/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1236 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 27/1263 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1263 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 23/1286 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1286 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2079/3365 variables, 1286/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3365 variables, 48/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3365 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/3365 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3365/3365 variables, and 1563 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3335 ms.
Refiners :[Positive P Invariants (semi-flows): 72/72 constraints, Generalized P Invariants (flows): 155/155 constraints, State Equation: 1286/1286 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5104ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 136 ms.
Support contains 36 out of 1286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1286/1286 places, 2079/2079 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1286 transition count 2078
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1285 transition count 2078
Applied a total of 2 rules in 57 ms. Remains 1285 /1286 variables (removed 1) and now considering 2078/2079 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1285/1286 places, 2078/2079 transitions.
RANDOM walk for 40000 steps (334 resets) in 434 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (41 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 250873 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 1
Probabilistic random walk after 250873 steps, saw 45666 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) 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-4675682468691783267.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2573463254777213182.kers'
[2026-05-22 21:17:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4675682468691783267.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2573463254777213182.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 4 ms.
// Phase 1: matrix 2078 rows 1271 cols 8138 entries
Finished phase 1 with 277 SingleSign rule and 781 generalized
[2026-05-22 21:17:13] [INFO ] Computed 227 invariants in 61 ms
Computed 227 P flows in 62 ms.
Exported basis to /tmp/petrispot-output-2573463254777213182.kers
Total runtime 63 ms.
[2026-05-22 21:17:13] [INFO ] State equation strengthened by 48 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 476/512 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/629 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/629 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/631 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/632 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/632 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 584/1216 variables, 147/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1216 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/1235 variables, 6/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1235 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 27/1262 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1262 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 23/1285 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1285 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2078/3363 variables, 1285/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3363 variables, 48/1560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3363 variables, 0/1560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/3363 variables, 0/1560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3363/3363 variables, and 1560 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1661 ms.
Refiners :[Positive P Invariants (semi-flows): 72/72 constraints, Generalized P Invariants (flows): 155/155 constraints, State Equation: 1285/1285 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 476/512 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 117/629 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/629 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/631 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/632 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/632 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 584/1216 variables, 147/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1216 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1216 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 19/1235 variables, 6/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1235 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 27/1262 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1262 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 23/1285 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1285 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2078/3363 variables, 1285/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3363 variables, 48/1565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3363 variables, 0/1565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/3363 variables, 0/1565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3363/3363 variables, and 1565 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5482 ms.
Refiners :[Positive P Invariants (semi-flows): 72/72 constraints, Generalized P Invariants (flows): 155/155 constraints, State Equation: 1285/1285 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7229ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 140 ms.
Support contains 36 out of 1285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1285/1285 places, 2078/2078 transitions.
Applied a total of 0 rules in 49 ms. Remains 1285 /1285 variables (removed 0) and now considering 2078/2078 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1285/1285 places, 2078/2078 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1285/1285 places, 2078/2078 transitions.
Applied a total of 0 rules in 49 ms. Remains 1285 /1285 variables (removed 0) and now considering 2078/2078 (removed 0) transitions.
[2026-05-22 21:17:21] [INFO ] Invariant cache hit.
[2026-05-22 21:17:22] [INFO ] Implicit Places using invariants in 1084 ms returned [3, 20, 21, 33, 52, 70, 154, 167, 170, 171, 173, 190, 208, 266, 267, 297, 310, 311, 312, 313, 315, 332, 350, 434, 447, 448, 449, 450, 452, 469, 487, 569, 582, 583, 584, 585, 589, 628, 724, 725, 726, 747, 765, 832, 853, 866, 867, 868, 869, 871, 888, 906, 987, 1000, 1001, 1002, 1003, 1005, 1022, 1040, 1059, 1111, 1112, 1115, 1127, 1128, 1129, 1147, 1149, 1153, 1171, 1172, 1174, 1187, 1194, 1200, 1206, 1212, 1218, 1224, 1230, 1236, 1242, 1249]
[2026-05-22 21:17:22] [INFO ] Actually due to overlaps returned [1147, 1129, 33, 52, 173, 190, 315, 332, 452, 469, 589, 747, 871, 888, 1022, 1153, 170, 312, 448, 449, 583, 584, 724, 725, 868, 1001, 1002, 1005, 1127, 1171, 171, 311, 313, 450, 585, 726, 867, 869, 1003, 1128, 1149, 1172, 3, 20, 297, 434, 569, 853, 987, 1111, 1112, 70, 167, 208, 310, 350, 447, 487, 582, 628, 765, 866, 906, 1000, 1218, 1236, 1249, 21, 154, 832, 1040, 1059, 1115, 1174, 1187, 1194, 1200, 1206, 1212, 1224, 1230, 1242]
Discarding 82 places :
Implicit Place search using SMT only with invariants took 1097 ms to find 82 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1203/1285 places, 2078/2078 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 1203 transition count 1944
Reduce places removed 134 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 139 rules applied. Total rules applied 273 place count 1069 transition count 1939
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 277 place count 1065 transition count 1939
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 277 place count 1065 transition count 1885
Deduced a syphon composed of 54 places in 3 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 385 place count 1011 transition count 1885
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 28 rules applied. Total rules applied 413 place count 998 transition count 1870
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 17 rules applied. Total rules applied 430 place count 983 transition count 1868
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 432 place count 981 transition count 1868
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 446 place count 967 transition count 1854
Iterating global reduction 6 with 14 rules applied. Total rules applied 460 place count 967 transition count 1854
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 462 place count 967 transition count 1852
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 464 place count 965 transition count 1848
Iterating global reduction 7 with 2 rules applied. Total rules applied 466 place count 965 transition count 1848
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 467 place count 964 transition count 1847
Iterating global reduction 7 with 1 rules applied. Total rules applied 468 place count 964 transition count 1847
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 469 place count 963 transition count 1845
Iterating global reduction 7 with 1 rules applied. Total rules applied 470 place count 963 transition count 1845
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 7 with 130 rules applied. Total rules applied 600 place count 898 transition count 1780
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 605 place count 893 transition count 1775
Iterating global reduction 7 with 5 rules applied. Total rules applied 610 place count 893 transition count 1775
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 613 place count 893 transition count 1772
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 614 place count 892 transition count 1771
Iterating global reduction 8 with 1 rules applied. Total rules applied 615 place count 892 transition count 1771
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 616 place count 892 transition count 1770
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 620 place count 890 transition count 1770
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 623 place count 890 transition count 1767
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 627 place count 887 transition count 1766
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 10 with 26 rules applied. Total rules applied 653 place count 887 transition count 1741
Ensure Unique test removed 2 places
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 10 with 28 rules applied. Total rules applied 681 place count 859 transition count 1741
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 683 place count 859 transition count 1739
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 11 with 22 rules applied. Total rules applied 705 place count 859 transition count 1739
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 707 place count 859 transition count 1739
Applied a total of 707 rules in 449 ms. Remains 859 /1203 variables (removed 344) and now considering 1739/2078 (removed 339) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2960471904141878435.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5119069655978114397.kers'
[2026-05-22 21:17:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2960471904141878435.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5119069655978114397.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1739 rows 859 cols 7194 entries
Finished phase 1 with 257 SingleSign rule and 472 generalized
[2026-05-22 21:17:22] [INFO ] Computed 130 invariants in 15 ms
Computed 130 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-5119069655978114397.kers
Total runtime 17 ms.
[2026-05-22 21:17:23] [INFO ] Implicit Places using invariants in 923 ms returned [95, 101, 104, 106, 109, 116, 117, 175, 195, 196, 202, 205, 207, 212, 217, 218, 271, 289, 297, 300, 302, 304, 309, 310, 363, 380, 386, 389, 391, 393, 462, 483, 491, 497, 503, 508, 509, 568, 591, 603, 606, 607, 612, 617, 618, 670, 687, 693, 696, 698, 699, 704, 705, 772, 778, 781, 783, 856]
[2026-05-22 21:17:23] [INFO ] Actually due to overlaps returned [304, 393, 612, 699, 212, 704, 705, 503, 101, 106, 195, 202, 207, 289, 297, 302, 380, 386, 391, 568, 591, 606, 687, 693, 698, 772, 778, 783, 95, 109, 175, 271, 363, 462, 483, 491, 497, 607, 670, 856]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 927 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 819/1285 places, 1739/2078 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 819 transition count 1736
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 816 transition count 1736
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 31 place count 791 transition count 1711
Iterating global reduction 2 with 25 rules applied. Total rules applied 56 place count 791 transition count 1711
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 785 transition count 1705
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 785 transition count 1705
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 783 transition count 1703
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 783 transition count 1703
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 782 transition count 1702
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 782 transition count 1702
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 781 transition count 1701
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 781 transition count 1701
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 100 place count 769 transition count 1689
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 768 transition count 1687
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 768 transition count 1687
Free-agglomeration rule applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 125 place count 768 transition count 1664
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 148 place count 745 transition count 1664
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 745 transition count 1661
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 154 place count 742 transition count 1661
Applied a total of 154 rules in 218 ms. Remains 742 /819 variables (removed 77) and now considering 1661/1739 (removed 78) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6849947112525485860.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-648701670520571742.kers'
[2026-05-22 21:17:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6849947112525485860.kers, --Pflows, --basisKERS=/tmp/petrispot-output-648701670520571742.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 1661 rows 742 cols 6786 entries
Finished phase 1 with 238 SingleSign rule and 414 generalized
[2026-05-22 21:17:23] [INFO ] Computed 90 invariants in 50 ms
Computed 90 P flows in 50 ms.
Exported basis to /tmp/petrispot-output-648701670520571742.kers
Total runtime 52 ms.
[2026-05-22 21:17:24] [INFO ] Implicit Places using invariants in 665 ms returned [105, 106, 182, 195, 196, 272, 273, 436, 437, 532, 533]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 679 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 731/1285 places, 1661/2078 transitions.
Applied a total of 0 rules in 26 ms. Remains 731 /731 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 3445 ms. Remains : 731/1285 places, 1661/2078 transitions.
RANDOM walk for 40000 steps (556 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (84 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 301519 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 1
Probabilistic random walk after 301519 steps, saw 79456 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) 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-16761541431686267747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1411762952709123803.kers'
[2026-05-22 21:17:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16761541431686267747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1411762952709123803.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1661 rows 731 cols 6649 entries
Finished phase 1 with 210 SingleSign rule and 442 generalized
[2026-05-22 21:17:27] [INFO ] Computed 79 invariants in 20 ms
Computed 79 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-1411762952709123803.kers
Total runtime 22 ms.
[2026-05-22 21:17:27] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 368/404 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/418 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 312/730 variables, 49/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/730 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/731 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/731 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1661/2392 variables, 731/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2392 variables, 6/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2392 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2392 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2392/2392 variables, and 816 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1064 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 731/731 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 368/404 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 14/418 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 312/730 variables, 49/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/730 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/730 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/731 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/731 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1661/2392 variables, 731/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2392 variables, 6/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2392 variables, 1/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2392 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2392 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2392/2392 variables, and 819 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2314 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 731/731 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3427ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 111 ms.
Support contains 36 out of 731 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 731/731 places, 1661/1661 transitions.
Applied a total of 0 rules in 27 ms. Remains 731 /731 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 731/731 places, 1661/1661 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 731/731 places, 1661/1661 transitions.
Applied a total of 0 rules in 26 ms. Remains 731 /731 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
[2026-05-22 21:17:31] [INFO ] Invariant cache hit.
[2026-05-22 21:17:32] [INFO ] Implicit Places using invariants in 710 ms returned []
[2026-05-22 21:17:32] [INFO ] Invariant cache hit.
[2026-05-22 21:17:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 21:17:33] [INFO ] Implicit Places using invariants and state equation in 1878 ms returned []
Implicit Place search using SMT with State Equation took 2593 ms to find 0 implicit places.
[2026-05-22 21:17:34] [INFO ] Redundant transitions in 161 ms returned []
Running 1646 sub problems to find dead transitions.
[2026-05-22 21:17:34] [INFO ] Invariant cache hit.
[2026-05-22 21:17:34] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/729 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 729/2392 variables, and 47 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 1/29 constraints, Generalized P Invariants (flows): 46/50 constraints, State Equation: 0/731 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1646/1646 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1646 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/729 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 729/2392 variables, and 47 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 1/29 constraints, Generalized P Invariants (flows): 46/50 constraints, State Equation: 0/731 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/1646 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60816ms problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 60825ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63641 ms. Remains : 731/731 places, 1661/1661 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 4054 edges and 731 vertex of which 730 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 730 transition count 1660
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 729 transition count 1660
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 728 transition count 1660
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 726 transition count 1658
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 726 transition count 1657
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 726 transition count 1656
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 725 transition count 1656
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 725 transition count 1655
Applied a total of 12 rules in 151 ms. Remains 725 /731 variables (removed 6) and now considering 1655/1661 (removed 6) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15477606317563905916.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7069836716852293931.kers'
[2026-05-22 21:18:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15477606317563905916.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7069836716852293931.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1655 rows 725 cols 6631 entries
Finished phase 1 with 210 SingleSign rule and 438 generalized
[2026-05-22 21:18:35] [INFO ] Computed 77 invariants in 15 ms
Computed 77 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-7069836716852293931.kers
Total runtime 17 ms.
[2026-05-22 21:18:35] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 21:18:35] [INFO ] [Nat]Absence check using 28 positive place invariants in 7 ms returned sat
[2026-05-22 21:18:35] [INFO ] [Nat]Absence check using 28 positive and 49 generalized place invariants in 12 ms returned sat
[2026-05-22 21:18:35] [INFO ] After 613ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 21:18:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 581 ms
TRAPS : Iteration 1
[2026-05-22 21:18:36] [INFO ] After 1316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 21:18:36] [INFO ] After 1509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-22 21:18:36] [INFO ] Flatten gal took : 50 ms
[2026-05-22 21:18:36] [INFO ] Flatten gal took : 49 ms
[2026-05-22 21:18:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3001459784703120779.gal : 18 ms
[2026-05-22 21:18:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2687928544521029137.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3001459784703120779.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2687928544521029137.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 ...328
Loading property file /tmp/ReachabilityCardinality2687928544521029137.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 80
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :80 after 110
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :110 after 230
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :230 after 638
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :638 after 446210
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :446210 after 1.52386e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.52386e+10 after 1.92462e+10
Detected timeout of ITS tools.
[2026-05-22 21:18:51] [INFO ] Flatten gal took : 44 ms
[2026-05-22 21:18:51] [INFO ] Applying decomposition
[2026-05-22 21:18:52] [INFO ] Flatten gal took : 45 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/graph8307293985639524100.txt' '-o' '/tmp/graph8307293985639524100.bin' '-w' '/tmp/graph8307293985639524100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8307293985639524100.bin' '-l' '-1' '-v' '-w' '/tmp/graph8307293985639524100.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:18:52] [INFO ] Decomposing Gal with order
[2026-05-22 21:18:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:18:52] [INFO ] Removed a total of 3208 redundant transitions.
[2026-05-22 21:18:52] [INFO ] Flatten gal took : 230 ms
[2026-05-22 21:18:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 58 ms.
[2026-05-22 21:18:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3438807453100512864.gal : 38 ms
[2026-05-22 21:18:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6641006187013449961.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/ReachabilityCardinality3438807453100512864.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6641006187013449961.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/ReachabilityCardinality6641006187013449961.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 72
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :72 after 456
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :456 after 7.81174e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3.32433e+10 after 1.24843e+11
Invariant property ASLink-PT-08b-ReachabilityCardinality-2024-09 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.42841e+12,1.85028,21464,3184,807,26313,3117,2250,34022,549,5202,0
Total reachable state count : 3428409088520

Verifying 1 reachability properties.
Invariant property ASLink-PT-08b-ReachabilityCardinality-2024-09 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-08b-ReachabilityCardinality-2024-09,2.03766e+07,3.8026,21464,440,391,26313,3117,2409,34022,576,5202,0
Over-approximation ignoring read arcs solved 0 properties in 21757 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 21:18:56] [INFO ] Flatten gal took : 77 ms
[2026-05-22 21:18:56] [INFO ] Applying decomposition
[2026-05-22 21:18:56] [INFO ] Flatten gal took : 85 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/graph6786740246929781373.txt' '-o' '/tmp/graph6786740246929781373.bin' '-w' '/tmp/graph6786740246929781373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6786740246929781373.bin' '-l' '-1' '-v' '-w' '/tmp/graph6786740246929781373.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:18:57] [INFO ] Decomposing Gal with order
[2026-05-22 21:18:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:18:58] [INFO ] Removed a total of 3182 redundant transitions.
[2026-05-22 21:18:58] [INFO ] Flatten gal took : 171 ms
[2026-05-22 21:18:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 78 ms.
[2026-05-22 21:18:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6613907275674598990.gal : 34 ms
[2026-05-22 21:18:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11948203927831244812.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6613907275674598990.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11948203927831244812.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 ...308
Loading property file /tmp/ReachabilityCardinality11948203927831244812.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 2.91599e+11
Detected timeout of ITS tools.
[2026-05-22 21:48:58] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17185830475941716010
[2026-05-22 21:48:58] [INFO ] Too many transitions (1661) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:48:58] [INFO ] Applying decomposition
[2026-05-22 21:48:58] [INFO ] Flatten gal took : 32 ms
[2026-05-22 21:48:58] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17185830475941716010
Running compilation step : cd /tmp/ltsmin17185830475941716010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
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/graph14274279332728697520.txt' '-o' '/tmp/graph14274279332728697520.bin' '-w' '/tmp/graph14274279332728697520.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14274279332728697520.bin' '-l' '-1' '-v' '-w' '/tmp/graph14274279332728697520.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:48:58] [INFO ] Decomposing Gal with order
[2026-05-22 21:48:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:48:58] [INFO ] Removed a total of 3252 redundant transitions.
[2026-05-22 21:48:58] [INFO ] Flatten gal took : 66 ms
[2026-05-22 21:48:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 25 ms.
[2026-05-22 21:48:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11467951781274118595.gal : 11 ms
[2026-05-22 21:48:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17720998044867901807.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11467951781274118595.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17720998044867901807.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 ...309
Loading property file /tmp/ReachabilityCardinality17720998044867901807.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 14
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :14 after 526
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :526 after 290542
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :290542 after 2.93535e+10
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.93535e+10 after 2.93536e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.93536e+10 after 2.93537e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.93537e+10 after 2.93546e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.93546e+10 after 1.16129e+16
Compilation finished in 3393 ms.
Running link step : cd /tmp/ltsmin17185830475941716010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 101 ms.
Running LTSmin : cd /tmp/ltsmin17185830475941716010;'/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' 'ASLinkPT08bReachabilityCardinality202409==true'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.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-08b"
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-08b, 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-177944366200406"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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