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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 5.7K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 5 14:02 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.8K Mar 15 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K Mar 15 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 5 14:02 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.1M 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-07b-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779481913868

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-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-22 20:31:55] [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 20:31:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 20:31:56] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2026-05-22 20:31:56] [INFO ] Transformed 3222 places.
[2026-05-22 20:31:56] [INFO ] Transformed 3986 transitions.
[2026-05-22 20:31:56] [INFO ] Found NUPN structural information;
[2026-05-22 20:31:56] [INFO ] Parsed PT model containing 3222 places and 3986 transitions and 12126 arcs in 443 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (60 resets) in 1863 ms. (21 steps per ms) remains 9/13 properties
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 312 ms. (127 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 9/9 properties
[2026-05-22 20:31:57] [INFO ] Flatten gal took : 382 ms
BEST_FIRST walk for 40004 steps (8 resets) in 672 ms. (59 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 9/9 properties
[2026-05-22 20:31:57] [INFO ] Flatten gal took : 269 ms
BEST_FIRST walk for 40004 steps (8 resets) in 401 ms. (99 steps per ms) remains 9/9 properties
[2026-05-22 20:31:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7644339402976654456.gal : 140 ms
BEST_FIRST walk for 40003 steps (8 resets) in 193 ms. (206 steps per ms) remains 9/9 properties
[2026-05-22 20:31:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4568200936680694320.prop : 4 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/ReachabilityCardinality7644339402976654456.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4568200936680694320.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 9/9 properties
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
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7214364906757699294.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8314969159614880125.kers'
[2026-05-22 20:31:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7214364906757699294.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8314969159614880125.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3986 rows 3222 cols 12126 entries
Finished phase 1 with 2183 SingleSign rule and 723 generalized
[2026-05-22 20:31:57] [INFO ] Computed 316 invariants in 29 ms
Computed 316 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-8314969159614880125.kers
Total runtime 36 ms.
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality4568200936680694320.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1098/1224 variables, 44/170 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1224 variables, 1098/1268 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1224 variables, 0/1268 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 272/1496 variables, 26/1294 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1496 variables, 272/1566 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1496 variables, 0/1566 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1652/3148 variables, 221/1787 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3148 variables, 1652/3439 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3148 variables, 0/3439 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SMT process timed out in 5241ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 126 out of 3222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3222/3222 places, 3986/3986 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 670 transitions
Trivial Post-agglo rules discarded 670 transitions
Performed 670 trivial Post agglomeration. Transition count delta: 670
Iterating post reduction 0 with 670 rules applied. Total rules applied 670 place count 3222 transition count 3316
Reduce places removed 670 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 696 rules applied. Total rules applied 1366 place count 2552 transition count 3290
Reduce places removed 5 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 2 with 32 rules applied. Total rules applied 1398 place count 2547 transition count 3263
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 1427 place count 2520 transition count 3261
Performed 701 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 701 Pre rules applied. Total rules applied 1427 place count 2520 transition count 2560
Deduced a syphon composed of 701 places in 6 ms
Ensure Unique test removed 61 places
Reduce places removed 762 places and 0 transitions.
Iterating global reduction 4 with 1463 rules applied. Total rules applied 2890 place count 1758 transition count 2560
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 4 with 40 rules applied. Total rules applied 2930 place count 1748 transition count 2530
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 5 with 36 rules applied. Total rules applied 2966 place count 1718 transition count 2524
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2972 place count 1712 transition count 2524
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 2972 place count 1712 transition count 2502
Deduced a syphon composed of 22 places in 6 ms
Ensure Unique test removed 14 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 58 rules applied. Total rules applied 3030 place count 1676 transition count 2502
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 3032 place count 1674 transition count 2502
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 14 Pre rules applied. Total rules applied 3032 place count 1674 transition count 2488
Deduced a syphon composed of 14 places in 56 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 3060 place count 1660 transition count 2488
Discarding 93 places :
Symmetric choice reduction at 8 with 93 rule applications. Total rules 3153 place count 1567 transition count 2395
Iterating global reduction 8 with 93 rules applied. Total rules applied 3246 place count 1567 transition count 2395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3247 place count 1567 transition count 2394
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 27 Pre rules applied. Total rules applied 3247 place count 1567 transition count 2367
Deduced a syphon composed of 27 places in 22 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 9 with 55 rules applied. Total rules applied 3302 place count 1539 transition count 2367
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 3302 place count 1539 transition count 2366
Deduced a syphon composed of 1 places in 14 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 3305 place count 1537 transition count 2366
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 3313 place count 1529 transition count 2315
Iterating global reduction 9 with 8 rules applied. Total rules applied 3321 place count 1529 transition count 2315
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 5 Pre rules applied. Total rules applied 3321 place count 1529 transition count 2310
Deduced a syphon composed of 5 places in 7 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 3331 place count 1524 transition count 2310
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3332 place count 1523 transition count 2302
Iterating global reduction 9 with 1 rules applied. Total rules applied 3333 place count 1523 transition count 2302
Performed 189 Post agglomeration using F-continuation condition.Transition count delta: 189
Deduced a syphon composed of 189 places in 6 ms
Ensure Unique test removed 4 places
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 9 with 382 rules applied. Total rules applied 3715 place count 1330 transition count 2113
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3716 place count 1329 transition count 2112
Ensure Unique test removed 1 places
Iterating global reduction 9 with 2 rules applied. Total rules applied 3718 place count 1328 transition count 2112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3720 place count 1327 transition count 2111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3722 place count 1326 transition count 2120
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 3723 place count 1326 transition count 2119
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 3725 place count 1325 transition count 2118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3726 place count 1324 transition count 2118
Free-agglomeration rule applied 13 times.
Iterating global reduction 11 with 13 rules applied. Total rules applied 3739 place count 1324 transition count 2105
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 3752 place count 1311 transition count 2105
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 12 with 13 rules applied. Total rules applied 3765 place count 1311 transition count 2092
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 3778 place count 1298 transition count 2092
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 3779 place count 1298 transition count 2092
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 3780 place count 1297 transition count 2091
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 13 with 9 rules applied. Total rules applied 3789 place count 1290 transition count 2089
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 14 with 3 rules applied. Total rules applied 3792 place count 1288 transition count 2088
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 3793 place count 1287 transition count 2088
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 11 Pre rules applied. Total rules applied 3793 place count 1287 transition count 2077
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 16 with 22 rules applied. Total rules applied 3815 place count 1276 transition count 2077
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 16 with 2 rules applied. Total rules applied 3817 place count 1274 transition count 2077
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 3825 place count 1270 transition count 2073
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3826 place count 1269 transition count 2072
Iterating global reduction 17 with 1 rules applied. Total rules applied 3827 place count 1269 transition count 2072
Free-agglomeration rule applied 2 times.
Iterating global reduction 17 with 2 rules applied. Total rules applied 3829 place count 1269 transition count 2070
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 3831 place count 1267 transition count 2070
Applied a total of 3831 rules in 2034 ms. Remains 1267 /3222 variables (removed 1955) and now considering 2070/3986 (removed 1916) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2043 ms. Remains : 1267/3222 places, 2070/3986 transitions.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
RANDOM walk for 40000 steps (276 resets) in 538 ms. (74 steps per ms) remains 8/9 properties
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
BEST_FIRST walk for 40004 steps (40 resets) in 187 ms. (212 steps per ms) remains 8/8 properties
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 13
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :13 after 19
BEST_FIRST walk for 40001 steps (34 resets) in 251 ms. (158 steps per ms) remains 8/8 properties
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :19 after 291
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :291 after 391
BEST_FIRST walk for 40003 steps (37 resets) in 313 ms. (127 steps per ms) remains 8/8 properties
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :391 after 804
BEST_FIRST walk for 40004 steps (35 resets) in 217 ms. (183 steps per ms) remains 8/8 properties
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :804 after 26845
BEST_FIRST walk for 40004 steps (39 resets) in 294 ms. (135 steps per ms) remains 8/8 properties
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :26845 after 110041
BEST_FIRST walk for 40004 steps (35 resets) in 256 ms. (155 steps per ms) remains 8/8 properties
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :110041 after 909862
BEST_FIRST walk for 40003 steps (40 resets) in 220 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (38 resets) in 182 ms. (218 steps per ms) remains 8/8 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15719393875597828059.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13049305060444639742.kers'
[2026-05-22 20:32:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15719393875597828059.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13049305060444639742.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 1 ms.
// Phase 1: matrix 2070 rows 1252 cols 7901 entries
Finished phase 1 with 342 SingleSign rule and 713 generalized
[2026-05-22 20:32:05] [INFO ] Computed 212 invariants in 18 ms
Computed 212 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-13049305060444639742.kers
Total runtime 24 ms.
[2026-05-22 20:32:05] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 425/549 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,9 properties remain. new max is 4096
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD size :909862 after 1.46003e+11
At refinement iteration 3 (OVERLAPS) 84/633 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/633 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 4/637 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/638 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/638 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :1.46003e+11 after 5.91046e+11
At refinement iteration 9 (OVERLAPS) 576/1214 variables, 122/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1214 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 21/1235 variables, 13/193 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1235 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/1237 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :5.91046e+11 after 2.23156e+20
At refinement iteration 14 (INCLUDED_ONLY) 0/1237 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 30/1267 variables, 17/212 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1267 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 2070/3337 variables, 1267/1479 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3337 variables, 2/1481 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3337 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/3337 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :2.23156e+20 after 5.42075e+34
No progress, stopping.
After SMT solving in domain Real declared 3337/3337 variables, and 1481 constraints, problems are : Problem set: 0 solved, 8 unsolved in 6476 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 139/139 constraints, State Equation: 1267/1267 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 8/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 425/549 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 84/633 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/633 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 4/637 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/638 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/638 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 576/1214 variables, 122/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1214 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1214 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 21/1235 variables, 13/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1235 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 2/1237 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1237 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 30/1267 variables, 17/219 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Invariant property ASLink-PT-07b-ReachabilityCardinality-2024-14 does not hold.
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 17 (INCLUDED_ONLY) 0/1267 variables, 2/221 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1267 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 2070/3337 variables, 1267/1488 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3337 variables, 2/1490 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3337 variables, 5/1495 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3337 variables, 2/1497 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3337 variables, 1/1498 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3337 variables, 0/1498 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 0/3337 variables, 0/1498 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3337/3337 variables, and 1498 constraints, problems are : Problem set: 1 solved, 7 unsolved in 32500 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 139/139 constraints, State Equation: 1267/1267 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39069ms problems are : Problem set: 1 solved, 7 unsolved
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 25114 ms.
Support contains 118 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 2070/2070 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1267 transition count 2069
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1266 transition count 2069
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 1266 transition count 2063
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 1260 transition count 2063
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 1259 transition count 2062
Applied a total of 16 rules in 115 ms. Remains 1259 /1267 variables (removed 8) and now considering 2062/2070 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 1259/1267 places, 2062/2070 transitions.
RANDOM walk for 40000 steps (281 resets) in 381 ms. (104 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (39 resets) in 248 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (34 resets) in 154 ms. (258 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (39 resets) in 167 ms. (238 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (39 resets) in 208 ms. (191 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (31 resets) in 234 ms. (170 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 105830 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 5
Probabilistic random walk after 105830 steps, saw 40870 distinct states, run finished after 3009 ms. (steps per millisecond=35 ) 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-13192771362497994409.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17716371423858211768.kers'
[2026-05-22 20:33:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13192771362497994409.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17716371423858211768.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 1 ms.
// Phase 1: matrix 2062 rows 1244 cols 7885 entries
Finished phase 1 with 334 SingleSign rule and 713 generalized
[2026-05-22 20:33:13] [INFO ] Computed 212 invariants in 20 ms
Computed 212 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-17716371423858211768.kers
Total runtime 23 ms.
[2026-05-22 20:33:13] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 412/530 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 100/630 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/630 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/634 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/634 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/635 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/635 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 570/1205 variables, 120/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1205 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 21/1226 variables, 13/192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1226 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/1228 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1228 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 31/1259 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1259 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2062/3321 variables, 1259/1471 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3321 variables, 2/1473 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3321 variables, 0/1473 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/3321 variables, 0/1473 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3321/3321 variables, and 1473 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4608 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 138/138 constraints, State Equation: 1259/1259 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 412/530 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 100/630 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/630 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/630 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 4/634 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/634 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/635 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/635 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 570/1205 variables, 120/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1205 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1205 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 21/1226 variables, 13/197 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1226 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1226 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 2/1228 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1228 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 31/1259 variables, 18/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1259 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 2062/3321 variables, 1259/1477 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3321 variables, 2/1479 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3321 variables, 3/1482 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3321 variables, 1/1483 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3321 variables, 0/1483 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 0/3321 variables, 0/1483 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3321/3321 variables, and 1483 constraints, problems are : Problem set: 0 solved, 5 unsolved in 13301 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 138/138 constraints, State Equation: 1259/1259 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17965ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 19761 ms.
Support contains 118 out of 1259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1259/1259 places, 2062/2062 transitions.
Applied a total of 0 rules in 54 ms. Remains 1259 /1259 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1259/1259 places, 2062/2062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1259/1259 places, 2062/2062 transitions.
Applied a total of 0 rules in 47 ms. Remains 1259 /1259 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2026-05-22 20:33:51] [INFO ] Invariant cache hit.
[2026-05-22 20:33:53] [INFO ] Implicit Places using invariants in 1622 ms returned [1, 18, 19, 21, 33, 52, 70, 130, 143, 146, 166, 183, 184, 186, 204, 223, 266, 281, 298, 313, 317, 318, 329, 331, 332, 335, 371, 427, 451, 455, 456, 467, 471, 490, 509, 570, 608, 625, 626, 630, 633, 651, 669, 709, 725, 751, 758, 762, 763, 778, 802, 821, 933, 934, 938, 974, 1052, 1056, 1057, 1060, 1071, 1072, 1112, 1116, 1135, 1138, 1152, 1158, 1164, 1170, 1176, 1182, 1188, 1195, 1201, 1207, 1213, 1242]
[2026-05-22 20:33:53] [INFO ] Actually due to overlaps returned [52, 186, 204, 335, 471, 490, 633, 651, 802, 1116, 33, 938, 183, 331, 467, 778, 933, 1071, 18, 184, 332, 630, 934, 1072, 1112, 1135, 1, 317, 318, 455, 456, 608, 762, 763, 1056, 1057, 70, 223, 329, 371, 509, 625, 669, 821, 974, 1182, 1201, 1213, 19, 21, 130, 143, 166, 427, 626, 709, 725, 751, 1060, 1138, 1152, 1158, 1164, 1170, 1176, 1188, 1195, 1207, 1242]
Discarding 69 places :
Implicit Place search using SMT only with invariants took 1646 ms to find 69 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1190/1259 places, 2062/2062 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 1181 transition count 1994
Reduce places removed 68 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 88 rules applied. Total rules applied 165 place count 1113 transition count 1974
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 185 place count 1093 transition count 1974
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 185 place count 1093 transition count 1958
Deduced a syphon composed of 16 places in 5 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 217 place count 1077 transition count 1958
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 218 place count 1076 transition count 1958
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 230 place count 1064 transition count 1946
Iterating global reduction 4 with 12 rules applied. Total rules applied 242 place count 1064 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 245 place count 1061 transition count 1943
Iterating global reduction 4 with 3 rules applied. Total rules applied 248 place count 1061 transition count 1943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 249 place count 1061 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 251 place count 1059 transition count 1938
Iterating global reduction 5 with 2 rules applied. Total rules applied 253 place count 1059 transition count 1938
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 4 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 353 place count 1009 transition count 1888
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 356 place count 1006 transition count 1885
Iterating global reduction 5 with 3 rules applied. Total rules applied 359 place count 1006 transition count 1885
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 361 place count 1006 transition count 1883
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 363 place count 1006 transition count 1881
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 364 place count 1006 transition count 1880
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 365 place count 1005 transition count 1880
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 7 with 38 rules applied. Total rules applied 403 place count 1005 transition count 1842
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 7 with 38 rules applied. Total rules applied 441 place count 967 transition count 1842
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 456 place count 967 transition count 1842
Applied a total of 456 rules in 459 ms. Remains 967 /1190 variables (removed 223) and now considering 1842/2062 (removed 220) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5164471294781858750.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7449332518076063415.kers'
[2026-05-22 20:33:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5164471294781858750.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7449332518076063415.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 1 ms.
// Phase 1: matrix 1842 rows 964 cols 7207 entries
Finished phase 1 with 364 SingleSign rule and 470 generalized
[2026-05-22 20:33:53] [INFO ] Computed 133 invariants in 18 ms
Computed 133 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-7449332518076063415.kers
Total runtime 21 ms.
[2026-05-22 20:33:54] [INFO ] Implicit Places using invariants in 791 ms returned [115, 117, 124, 131, 132, 193, 229, 231, 236, 237, 298, 335, 342, 347, 348, 447, 464, 472, 473, 474, 533, 570, 694, 697, 699, 709, 718, 780, 804, 823]
[2026-05-22 20:33:54] [INFO ] Actually due to overlaps returned [131, 236, 347, 473, 718, 132, 237, 348, 474, 117, 231, 694, 699, 124, 193, 298, 335, 342, 447, 464, 472, 533, 570, 709, 780, 804, 823]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 795 ms to find 27 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 940/1259 places, 1842/2062 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 931 transition count 1833
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 931 transition count 1833
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 930 transition count 1832
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 930 transition count 1832
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 929 transition count 1831
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 929 transition count 1831
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 36 place count 922 transition count 1824
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 922 transition count 1818
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 48 place count 916 transition count 1818
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 916 transition count 1816
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 914 transition count 1816
Applied a total of 52 rules in 187 ms. Remains 914 /940 variables (removed 26) and now considering 1816/1842 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5152023841980162211.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18391908380532285420.kers'
[2026-05-22 20:33:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5152023841980162211.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18391908380532285420.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 1 ms.
// Phase 1: matrix 1816 rows 911 cols 7013 entries
Finished phase 1 with 339 SingleSign rule and 469 generalized
[2026-05-22 20:33:54] [INFO ] Computed 106 invariants in 14 ms
Computed 106 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-18391908380532285420.kers
Total runtime 18 ms.
[2026-05-22 20:33:55] [INFO ] Implicit Places using invariants in 642 ms returned []
[2026-05-22 20:33:55] [INFO ] Invariant cache hit.
[2026-05-22 20:33:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 20:34:02] [INFO ] Implicit Places using invariants and state equation in 7487 ms returned []
Implicit Place search using SMT with State Equation took 8140 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 914/1259 places, 1816/2062 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 11277 ms. Remains : 914/1259 places, 1816/2062 transitions.
RANDOM walk for 40000 steps (345 resets) in 366 ms. (108 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (49 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (48 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (46 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (43 resets) in 159 ms. (250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (45 resets) in 169 ms. (235 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 216976 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :1 out of 5
Probabilistic random walk after 216976 steps, saw 49099 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :1
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2026-05-22 20:34:06] [INFO ] Invariant cache hit.
[2026-05-22 20:34:06] [INFO ] State equation strengthened by 5 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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 307/382 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 44/426 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 451/877 variables, 71/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/877 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 20/897 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/897 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 15/912 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/912 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1815/2727 variables, 912/1017 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2727 variables, 5/1022 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2727 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 3/2730 variables, 2/1024 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2730 variables, 1/1025 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2730 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/2730 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2730/2730 variables, and 1025 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2711 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 914/914 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 307/382 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 44/426 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 451/877 variables, 71/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/877 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/877 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 20/897 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/897 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/897 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 15/912 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/912 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1815/2727 variables, 912/1022 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2727 variables, 5/1027 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2727 variables, 3/1030 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2727 variables, 2/1032 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2727 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 3/2730 variables, 2/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2730 variables, 1/1035 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2730 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/2730 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2730/2730 variables, and 1035 constraints, problems are : Problem set: 0 solved, 4 unsolved in 11610 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 914/914 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14363ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6188 ms.
Support contains 75 out of 914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 914/914 places, 1816/1816 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 914 transition count 1803
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 901 transition count 1801
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 899 transition count 1801
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 30 place count 899 transition count 1783
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 66 place count 881 transition count 1783
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 879 transition count 1781
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 879 transition count 1781
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 877 transition count 1778
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 877 transition count 1778
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 95 place count 866 transition count 1768
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 866 transition count 1767
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 96 place count 866 transition count 1765
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 100 place count 864 transition count 1765
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 863 transition count 1765
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 102 place count 862 transition count 1764
Iterating global reduction 5 with 1 rules applied. Total rules applied 103 place count 862 transition count 1764
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 104 place count 861 transition count 1762
Iterating global reduction 5 with 1 rules applied. Total rules applied 105 place count 861 transition count 1762
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 107 place count 860 transition count 1761
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 109 place count 860 transition count 1759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 111 place count 858 transition count 1759
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 115 place count 858 transition count 1755
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 119 place count 854 transition count 1755
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 121 place count 854 transition count 1755
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 122 place count 854 transition count 1754
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 125 place count 851 transition count 1751
Applied a total of 125 rules in 410 ms. Remains 851 /914 variables (removed 63) and now considering 1751/1816 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 423 ms. Remains : 851/914 places, 1751/1816 transitions.
RANDOM walk for 40000 steps (417 resets) in 338 ms. (117 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (55 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (59 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (61 resets) in 136 ms. (292 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (51 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 235335 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 4
Probabilistic random walk after 235335 steps, saw 48705 distinct states, run finished after 3014 ms. (steps per millisecond=78 ) 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-5644366069645230280.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10459392108152162306.kers'
[2026-05-22 20:34:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5644366069645230280.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10459392108152162306.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 1 ms.
// Phase 1: matrix 1751 rows 848 cols 6859 entries
Finished phase 1 with 269 SingleSign rule and 478 generalized
[2026-05-22 20:34:30] [INFO ] Computed 104 invariants in 15 ms
Computed 104 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-10459392108152162306.kers
Total runtime 17 ms.
[2026-05-22 20:34:30] [INFO ] State equation strengthened by 5 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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 297/372 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 29/401 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 421/822 variables, 65/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/822 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 17/839 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/839 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 12/851 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/851 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1751/2602 variables, 851/955 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2602 variables, 5/960 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2602 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/2602 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2602/2602 variables, and 960 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2421 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 73/73 constraints, State Equation: 851/851 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 297/372 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 29/401 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 421/822 variables, 65/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/822 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/822 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/822 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/822 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 17/839 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/839 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 12/851 variables, 8/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/851 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/851 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1751/2602 variables, 851/964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2602 variables, 5/969 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2602 variables, 3/972 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2602 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/2602 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2602/2602 variables, and 972 constraints, problems are : Problem set: 0 solved, 4 unsolved in 10558 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 73/73 constraints, State Equation: 851/851 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13036ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1651 ms.
Support contains 75 out of 851 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 851/851 places, 1751/1751 transitions.
Applied a total of 0 rules in 30 ms. Remains 851 /851 variables (removed 0) and now considering 1751/1751 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 851/851 places, 1751/1751 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 851/851 places, 1751/1751 transitions.
Applied a total of 0 rules in 28 ms. Remains 851 /851 variables (removed 0) and now considering 1751/1751 (removed 0) transitions.
[2026-05-22 20:34:45] [INFO ] Invariant cache hit.
[2026-05-22 20:34:46] [INFO ] Implicit Places using invariants in 891 ms returned [229, 271, 289, 625, 632, 788]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 895 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 845/851 places, 1751/1751 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 845 transition count 1748
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 842 transition count 1748
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 842 transition count 1747
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 841 transition count 1747
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 837 transition count 1743
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 837 transition count 1743
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 836 transition count 1742
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 836 transition count 1742
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 830 transition count 1736
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 829 transition count 1735
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 829 transition count 1735
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 829 transition count 1732
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 38 place count 826 transition count 1732
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 826 transition count 1732
Applied a total of 39 rules in 200 ms. Remains 826 /845 variables (removed 19) and now considering 1732/1751 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5610327519417769736.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5976282709482706090.kers'
[2026-05-22 20:34:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5610327519417769736.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5976282709482706090.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 3 ms.
// Phase 1: matrix 1732 rows 823 cols 6829 entries
Finished phase 1 with 266 SingleSign rule and 462 generalized
[2026-05-22 20:34:46] [INFO ] Computed 98 invariants in 43 ms
Computed 98 P flows in 44 ms.
Exported basis to /tmp/petrispot-output-5976282709482706090.kers
Total runtime 46 ms.
[2026-05-22 20:34:47] [INFO ] Implicit Places using invariants in 968 ms returned [501, 502, 503, 793]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 970 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 822/851 places, 1732/1751 transitions.
Applied a total of 0 rules in 27 ms. Remains 822 /822 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2134 ms. Remains : 822/851 places, 1732/1751 transitions.
RANDOM walk for 40000 steps (414 resets) in 284 ms. (140 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (64 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (64 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (62 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (54 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 210014 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 4
Probabilistic random walk after 210014 steps, saw 50608 distinct states, run finished after 3003 ms. (steps per millisecond=69 ) 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-12028181213717953668.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7448806170909555630.kers'
[2026-05-22 20:34:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12028181213717953668.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7448806170909555630.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 1 ms.
// Phase 1: matrix 1732 rows 819 cols 6798 entries
Finished phase 1 with 268 SingleSign rule and 460 generalized
[2026-05-22 20:34:50] [INFO ] Computed 94 invariants in 20 ms
Computed 94 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-7448806170909555630.kers
Total runtime 22 ms.
[2026-05-22 20:34:50] [INFO ] State equation strengthened by 5 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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 304/379 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 32/411 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 406/817 variables, 60/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/818 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/818 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 4/822 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/822 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1732/2554 variables, 822/916 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2554 variables, 5/921 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2554 variables, 0/921 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/2554 variables, 0/921 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2554/2554 variables, and 921 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2280 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 822/822 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 304/379 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 32/411 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 406/817 variables, 60/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/817 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/818 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 4/822 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/822 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1732/2554 variables, 822/922 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2554 variables, 5/927 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2554 variables, 3/930 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2554 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/2554 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2554/2554 variables, and 930 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7384 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 822/822 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9735ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7674 ms.
Support contains 75 out of 822 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 822/822 places, 1732/1732 transitions.
Applied a total of 0 rules in 27 ms. Remains 822 /822 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 822/822 places, 1732/1732 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 822/822 places, 1732/1732 transitions.
Applied a total of 0 rules in 25 ms. Remains 822 /822 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
[2026-05-22 20:35:07] [INFO ] Invariant cache hit.
[2026-05-22 20:35:09] [INFO ] Implicit Places using invariants in 1175 ms returned []
[2026-05-22 20:35:09] [INFO ] Invariant cache hit.
[2026-05-22 20:35:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 20:35:11] [INFO ] Implicit Places using invariants and state equation in 2476 ms returned []
Implicit Place search using SMT with State Equation took 3673 ms to find 0 implicit places.
[2026-05-22 20:35:11] [INFO ] Redundant transitions in 148 ms returned []
Running 1697 sub problems to find dead transitions.
[2026-05-22 20:35:11] [INFO ] Invariant cache hit.
[2026-05-22 20:35:11] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/818 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1697 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/818 variables, 49/72 constraints. Problems are: Problem set: 0 solved, 1697 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 818/2554 variables, and 72 constraints, problems are : Problem set: 0 solved, 1697 unsolved in 30117 ms.
Refiners :[Positive P Invariants (semi-flows): 23/31 constraints, Generalized P Invariants (flows): 49/63 constraints, State Equation: 0/822 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 1697/1697 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1697 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/818 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1697 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/818 variables, 49/72 constraints. Problems are: Problem set: 0 solved, 1697 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/2554 variables, and 77 constraints, problems are : Problem set: 0 solved, 1697 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 23/31 constraints, Generalized P Invariants (flows): 49/63 constraints, State Equation: 0/822 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 0/1697 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60940ms problems are : Problem set: 0 solved, 1697 unsolved
Search for dead transitions found 0 dead transitions in 60947ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64825 ms. Remains : 822/822 places, 1732/1732 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 822 transition count 1729
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 819 transition count 1729
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 818 transition count 1729
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 815 transition count 1726
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 815 transition count 1725
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 815 transition count 1724
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 814 transition count 1724
Applied a total of 16 rules in 99 ms. Remains 814 /822 variables (removed 8) and now considering 1724/1732 (removed 8) transitions.
Running SMT prover for 4 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9339291350153043708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5613318566200941763.kers'
[2026-05-22 20:36:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9339291350153043708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5613318566200941763.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 3 ms.
// Phase 1: matrix 1724 rows 810 cols 6752 entries
Finished phase 1 with 260 SingleSign rule and 461 generalized
[2026-05-22 20:36:12] [INFO ] Computed 93 invariants in 42 ms
Computed 93 P flows in 43 ms.
Exported basis to /tmp/petrispot-output-5613318566200941763.kers
Total runtime 45 ms.
[2026-05-22 20:36:13] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2026-05-22 20:36:13] [INFO ] [Nat]Absence check using 32 positive place invariants in 10 ms returned sat
[2026-05-22 20:36:13] [INFO ] [Nat]Absence check using 32 positive and 61 generalized place invariants in 51 ms returned sat
[2026-05-22 20:36:14] [INFO ] After 1271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2026-05-22 20:36:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 924 ms
[2026-05-22 20:36:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2026-05-22 20:36:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
TRAPS : Iteration 1
[2026-05-22 20:36:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2026-05-22 20:36:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 756 ms
TRAPS : Iteration 2
[2026-05-22 20:36:19] [INFO ] After 5834ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2026-05-22 20:36:21] [INFO ] After 8458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2026-05-22 20:36:21] [INFO ] Flatten gal took : 56 ms
[2026-05-22 20:36:21] [INFO ] Flatten gal took : 52 ms
[2026-05-22 20:36:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10144244713311616229.gal : 24 ms
[2026-05-22 20:36:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1254859116122652663.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/ReachabilityCardinality10144244713311616229.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1254859116122652663.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1254859116122652663.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 20
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :20 after 60
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :60 after 140
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :140 after 1840
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1840 after 599400
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :599400 after 1.97528e+08
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.97528e+08 after 5.31409e+11
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :5.31409e+11 after 5.32244e+11
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :5.32244e+11 after 1.21504e+12
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.21504e+12 after 4.83345e+12
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :4.83345e+12 after 1.33457e+14
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :1.33457e+14 after 1.89123e+16
Invariant property ASLink-PT-07b-ReachabilityCardinality-2024-05 does not hold.
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :1.89123e+16 after 3.03516e+17
Detected timeout of ITS tools.
[2026-05-22 20:36:36] [INFO ] Flatten gal took : 45 ms
[2026-05-22 20:36:36] [INFO ] Applying decomposition
[2026-05-22 20:36:36] [INFO ] Flatten gal took : 60 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/graph4523990498528347977.txt' '-o' '/tmp/graph4523990498528347977.bin' '-w' '/tmp/graph4523990498528347977.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4523990498528347977.bin' '-l' '-1' '-v' '-w' '/tmp/graph4523990498528347977.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:36:37] [INFO ] Decomposing Gal with order
[2026-05-22 20:36:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:36:38] [INFO ] Removed a total of 3164 redundant transitions.
[2026-05-22 20:36:38] [INFO ] Flatten gal took : 466 ms
[2026-05-22 20:36:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 67 ms.
[2026-05-22 20:36:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14121064670346979346.gal : 37 ms
[2026-05-22 20:36:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4983447921031296152.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/ReachabilityCardinality14121064670346979346.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4983447921031296152.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/ReachabilityCardinality4983447921031296152.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 1840
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1840 after 100160
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :100160 after 1.87552e+07
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1.87552e+07 after 1.61724e+12
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :4.02181e+12 after 1.65732e+13
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.65732e+13 after 1.66103e+13
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.66103e+13 after 3.00763e+14
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :3.00763e+14 after 2.25512e+15
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 40873 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 20:36:53] [INFO ] Flatten gal took : 86 ms
[2026-05-22 20:36:53] [INFO ] Applying decomposition
[2026-05-22 20:36:53] [INFO ] Flatten gal took : 86 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/graph14761707091018095342.txt' '-o' '/tmp/graph14761707091018095342.bin' '-w' '/tmp/graph14761707091018095342.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14761707091018095342.bin' '-l' '-1' '-v' '-w' '/tmp/graph14761707091018095342.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:36:54] [INFO ] Decomposing Gal with order
[2026-05-22 20:36:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:36:54] [INFO ] Removed a total of 2872 redundant transitions.
[2026-05-22 20:36:55] [INFO ] Flatten gal took : 144 ms
[2026-05-22 20:36:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 44 ms.
[2026-05-22 20:36:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3488857592871774129.gal : 35 ms
[2026-05-22 20:36:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15538141238916629860.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/ReachabilityCardinality3488857592871774129.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15538141238916629860.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/ReachabilityCardinality15538141238916629860.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1 after 3.63942e+07
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :3.63942e+07 after 2.98067e+15
Detected timeout of ITS tools.
[2026-05-22 21:06:55] [INFO ] Flatten gal took : 132 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14526433095324505621
[2026-05-22 21:06:55] [INFO ] Too many transitions (1732) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:06:55] [INFO ] Applying decomposition
[2026-05-22 21:06:55] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14526433095324505621
Running compilation step : cd /tmp/ltsmin14526433095324505621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-22 21:06:55] [INFO ] Flatten gal took : 50 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/graph10372779544365699778.txt' '-o' '/tmp/graph10372779544365699778.bin' '-w' '/tmp/graph10372779544365699778.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10372779544365699778.bin' '-l' '-1' '-v' '-w' '/tmp/graph10372779544365699778.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:06:55] [INFO ] Decomposing Gal with order
[2026-05-22 21:06:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:06:55] [INFO ] Removed a total of 3210 redundant transitions.
[2026-05-22 21:06:55] [INFO ] Flatten gal took : 79 ms
[2026-05-22 21:06:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 127 labels/synchronizations in 19 ms.
[2026-05-22 21:06:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1863183680326049005.gal : 10 ms
[2026-05-22 21:06:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4143578250083938053.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/ReachabilityCardinality1863183680326049005.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4143578250083938053.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/ReachabilityCardinality4143578250083938053.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 80
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :80 after 2300
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :2300 after 2.87529e+09
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2.87529e+09 after 8.52044e+12
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :8.52044e+12 after 1.44128e+13
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.44128e+13 after 1.8497e+14
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.8497e+14 after 3.92473e+15
Compilation finished in 4264 ms.
Running link step : cd /tmp/ltsmin14526433095324505621;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 112 ms.
Running LTSmin : cd /tmp/ltsmin14526433095324505621;'/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' 'ASLinkPT07bReachabilityCardinality202402==true'
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :3.92473e+15 after 2.89871e+16
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin14526433095324505621;'/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' 'ASLinkPT07bReachabilityCardinality202402==true'
Running LTSmin : cd /tmp/ltsmin14526433095324505621;'/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' 'ASLinkPT07bReachabilityCardinality202405==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin14526433095324505621;'/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' 'ASLinkPT07bReachabilityCardinality202405==true'
Running LTSmin : cd /tmp/ltsmin14526433095324505621;'/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' 'ASLinkPT07bReachabilityCardinality202408==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin14526433095324505621;'/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' 'ASLinkPT07bReachabilityCardinality202408==true'
Running LTSmin : cd /tmp/ltsmin14526433095324505621;'/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' 'ASLinkPT07bReachabilityCardinality202410==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin14526433095324505621;'/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' 'ASLinkPT07bReachabilityCardinality202410==true'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin14526433095324505621;'/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' 'ASLinkPT07bReachabilityCardinality202402==true'
Invariant property ASLink-PT-07b-ReachabilityCardinality-2024-10 does not hold.
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ASLink-PT-07b-ReachabilityCardinality-2024-08 is true.
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ASLink-PT-07b-ReachabilityCardinality-2024-05 does not hold.
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.08509e+17 after 1.96583e+18

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

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