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-177944366200391.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200391
=====================================================================

--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-11
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779481964083

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
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
ReachabilityFireability PT
Running Version 202604301425
[2026-05-22 20:32:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 20:32:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 20:32:45] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2026-05-22 20:32:45] [INFO ] Transformed 3222 places.
[2026-05-22 20:32:45] [INFO ] Transformed 3986 transitions.
[2026-05-22 20:32:45] [INFO ] Found NUPN structural information;
[2026-05-22 20:32:46] [INFO ] Parsed PT model containing 3222 places and 3986 transitions and 12126 arcs in 344 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (63 resets) in 1565 ms. (25 steps per ms) remains 9/16 properties
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (9 resets) in 510 ms. (78 steps per ms) remains 9/9 properties
[2026-05-22 20:32:47] [INFO ] Flatten gal took : 518 ms
BEST_FIRST walk for 40004 steps (8 resets) in 700 ms. (57 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 177 ms. (224 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 9/9 properties
[2026-05-22 20:32:47] [INFO ] Flatten gal took : 261 ms
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9095592771863438435.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5189584059129436230.kers'
[2026-05-22 20:32:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9095592771863438435.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5189584059129436230.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:32:47] [INFO ] Computed 316 invariants in 32 ms
Computed 316 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-5189584059129436230.kers
Total runtime 37 ms.
[2026-05-22 20:32:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12423837228085268494.gal : 91 ms
[2026-05-22 20:32:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3948249762818593462.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/ReachabilityCardinality12423837228085268494.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3948249762818593462.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
Excessive predecessor constraint size, skipping predecessor.
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
Loading property file /tmp/ReachabilityCardinality3948249762818593462.prop.
At refinement iteration 2 (OVERLAPS) 1056/1182 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1182 variables, 1056/1227 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1182 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 286/1468 variables, 25/1252 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1468 variables, 286/1538 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1468 variables, 0/1538 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1663/3131 variables, 217/1755 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3131 variables, 1663/3418 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3131/7208 variables, and 3418 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5044 ms.
Refiners :[Domain max(s): 3131/3222 constraints, Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 217/246 constraints, State Equation: 0/3222 constraints, PredecessorRefiner: 9/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
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) 1056/1182 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1182 variables, 1056/1227 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1182 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 286/1468 variables, 25/1252 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1468 variables, 286/1538 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
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
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
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :391 after 804
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :804 after 26845
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :26845 after 110041
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :110041 after 909862
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :909862 after 1.46003e+11
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :1.46003e+11 after 5.91046e+11
At refinement iteration 7 (INCLUDED_ONLY) 0/1468 variables, 2/1540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :5.91046e+11 after 2.23156e+20
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1468/7208 variables, and 1540 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5013 ms.
Refiners :[Domain max(s): 1468/3222 constraints, Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 0/246 constraints, State Equation: 0/3222 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10313ms 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 691 transitions
Trivial Post-agglo rules discarded 691 transitions
Performed 691 trivial Post agglomeration. Transition count delta: 691
Iterating post reduction 0 with 691 rules applied. Total rules applied 691 place count 3222 transition count 3295
Reduce places removed 691 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 725 rules applied. Total rules applied 1416 place count 2531 transition count 3261
Reduce places removed 9 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 19 rules applied. Total rules applied 1435 place count 2522 transition count 3251
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1445 place count 2512 transition count 3251
Performed 708 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 708 Pre rules applied. Total rules applied 1445 place count 2512 transition count 2543
Deduced a syphon composed of 708 places in 21 ms
Ensure Unique test removed 67 places
Reduce places removed 775 places and 0 transitions.
Iterating global reduction 4 with 1483 rules applied. Total rules applied 2928 place count 1737 transition count 2543
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 4 with 46 rules applied. Total rules applied 2974 place count 1729 transition count 2505
Reduce places removed 38 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 5 with 44 rules applied. Total rules applied 3018 place count 1691 transition count 2499
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 3024 place count 1685 transition count 2499
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 25 Pre rules applied. Total rules applied 3024 place count 1685 transition count 2474
Deduced a syphon composed of 25 places in 10 ms
Ensure Unique test removed 22 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 7 with 72 rules applied. Total rules applied 3096 place count 1638 transition count 2474
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 3096 place count 1638 transition count 2454
Deduced a syphon composed of 20 places in 16 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 3136 place count 1618 transition count 2454
Discarding 100 places :
Symmetric choice reduction at 7 with 100 rule applications. Total rules 3236 place count 1518 transition count 2354
Iterating global reduction 7 with 100 rules applied. Total rules applied 3336 place count 1518 transition count 2354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3337 place count 1518 transition count 2353
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 28 Pre rules applied. Total rules applied 3337 place count 1518 transition count 2325
Deduced a syphon composed of 28 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 8 with 57 rules applied. Total rules applied 3394 place count 1489 transition count 2325
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3394 place count 1489 transition count 2324
Deduced a syphon composed of 1 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 3397 place count 1487 transition count 2324
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 3403 place count 1481 transition count 2285
Iterating global reduction 8 with 6 rules applied. Total rules applied 3409 place count 1481 transition count 2285
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 5 Pre rules applied. Total rules applied 3409 place count 1481 transition count 2280
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 3419 place count 1476 transition count 2280
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 4 ms
Ensure Unique test removed 3 places
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 8 with 369 rules applied. Total rules applied 3788 place count 1290 transition count 2097
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 8 with 2 rules applied. Total rules applied 3790 place count 1289 transition count 2106
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 3798 place count 1289 transition count 2098
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 3806 place count 1281 transition count 2098
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 3810 place count 1281 transition count 2094
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 3814 place count 1277 transition count 2094
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 3816 place count 1277 transition count 2094
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 3817 place count 1277 transition count 2094
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3818 place count 1276 transition count 2093
Reduce places removed 8 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 10 with 10 rules applied. Total rules applied 3828 place count 1268 transition count 2091
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 3830 place count 1266 transition count 2091
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 11 Pre rules applied. Total rules applied 3830 place count 1266 transition count 2080
Deduced a syphon composed of 11 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 12 with 23 rules applied. Total rules applied 3853 place count 1254 transition count 2080
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 12 with 6 rules applied. Total rules applied 3859 place count 1248 transition count 2080
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3859 place count 1248 transition count 2079
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3861 place count 1247 transition count 2079
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 3862 place count 1246 transition count 2078
Iterating global reduction 13 with 1 rules applied. Total rules applied 3863 place count 1246 transition count 2078
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 3864 place count 1245 transition count 2077
Iterating global reduction 13 with 1 rules applied. Total rules applied 3865 place count 1245 transition count 2077
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 13 with 22 rules applied. Total rules applied 3887 place count 1234 transition count 2066
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 3891 place count 1230 transition count 2062
Iterating global reduction 13 with 4 rules applied. Total rules applied 3895 place count 1230 transition count 2062
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 3896 place count 1229 transition count 2061
Iterating global reduction 13 with 1 rules applied. Total rules applied 3897 place count 1229 transition count 2061
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 3898 place count 1229 transition count 2060
Free-agglomeration rule applied 3 times.
Iterating global reduction 14 with 3 rules applied. Total rules applied 3901 place count 1229 transition count 2057
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 3904 place count 1226 transition count 2057
Applied a total of 3904 rules in 1799 ms. Remains 1226 /3222 variables (removed 1996) and now considering 2057/3986 (removed 1929) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1809 ms. Remains : 1226/3222 places, 2057/3986 transitions.
RANDOM walk for 40000 steps (264 resets) in 550 ms. (72 steps per ms) remains 7/9 properties
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (40 resets) in 187 ms. (212 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (40 resets) in 165 ms. (240 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (40 resets) in 150 ms. (264 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (40 resets) in 221 ms. (180 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (42 resets) in 312 ms. (127 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (40 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (38 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14976811626787501336.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2236621177264104650.kers'
[2026-05-22 20:33:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14976811626787501336.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2236621177264104650.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 1 ms.
// Phase 1: matrix 2057 rows 1212 cols 7876 entries
Finished phase 1 with 356 SingleSign rule and 671 generalized
[2026-05-22 20:33:00] [INFO ] Computed 199 invariants in 18 ms
Computed 199 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-2236621177264104650.kers
Total runtime 20 ms.
[2026-05-22 20:33:00] [INFO ] State equation strengthened by 8 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, 7 unsolved
At refinement iteration 1 (OVERLAPS) 431/555 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/555 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 70/625 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :2.23156e+20 after 5.42075e+34
At refinement iteration 4 (INCLUDED_ONLY) 0/625 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 35/660 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/660 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/661 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 505/1166 variables, 107/170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1166 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 7/1173 variables, 6/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1173 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 1/1174 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1174 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 52/1226 variables, 22/199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1226 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2057/3283 variables, 1226/1425 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3283 variables, 8/1433 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3283 variables, 0/1433 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/3283 variables, 0/1433 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3283/3283 variables, and 1433 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4463 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 129/129 constraints, State Equation: 1226/1226 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 431/555 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/555 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/555 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 70/625 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/625 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 35/660 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/660 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/661 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 505/1166 variables, 107/171 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1166 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1166 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 7/1173 variables, 6/179 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Reachability property ASLink-PT-07b-ReachabilityFireability-2024-12 is true.
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 14 (INCLUDED_ONLY) 0/1173 variables, 2/181 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1173 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 1/1174 variables, 1/182 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1174 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 52/1226 variables, 22/204 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1226 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem ASLink-PT-07b-ReachabilityFireability-2024-00 is UNSAT
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-07b-ReachabilityFireability-2024-03 is UNSAT
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-07b-ReachabilityFireability-2024-09 is UNSAT
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-07b-ReachabilityFireability-2024-10 is UNSAT
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 20 (OVERLAPS) 2057/3283 variables, 1226/1430 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3283 variables, 8/1438 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3283 variables, 1/1439 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3283 variables, 0/1439 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/3283 variables, 0/1439 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3283/3283 variables, and 1439 constraints, problems are : Problem set: 5 solved, 2 unsolved in 11267 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 129/129 constraints, State Equation: 1226/1226 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15789ms problems are : Problem set: 5 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 656 ms.
Support contains 25 out of 1226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1226/1226 places, 2057/2057 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 1226 transition count 2044
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 1213 transition count 2043
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 1212 transition count 2043
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 28 place count 1212 transition count 1979
Deduced a syphon composed of 64 places in 3 ms
Ensure Unique test removed 6 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 135 rules applied. Total rules applied 163 place count 1141 transition count 1979
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 164 place count 1141 transition count 1978
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 165 place count 1140 transition count 1978
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 165 place count 1140 transition count 1976
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 169 place count 1138 transition count 1976
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 172 place count 1135 transition count 1966
Ensure Unique test removed 1 places
Iterating global reduction 5 with 4 rules applied. Total rules applied 176 place count 1134 transition count 1966
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 178 place count 1132 transition count 1957
Iterating global reduction 5 with 2 rules applied. Total rules applied 180 place count 1132 transition count 1957
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 182 place count 1132 transition count 1955
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 183 place count 1131 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 184 place count 1130 transition count 1947
Iterating global reduction 7 with 1 rules applied. Total rules applied 185 place count 1130 transition count 1947
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 186 place count 1129 transition count 1939
Iterating global reduction 7 with 1 rules applied. Total rules applied 187 place count 1129 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 188 place count 1128 transition count 1931
Iterating global reduction 7 with 1 rules applied. Total rules applied 189 place count 1128 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 190 place count 1127 transition count 1923
Iterating global reduction 7 with 1 rules applied. Total rules applied 191 place count 1127 transition count 1923
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 192 place count 1126 transition count 1915
Iterating global reduction 7 with 1 rules applied. Total rules applied 193 place count 1126 transition count 1915
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 194 place count 1125 transition count 1907
Iterating global reduction 7 with 1 rules applied. Total rules applied 195 place count 1125 transition count 1907
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 196 place count 1124 transition count 1899
Iterating global reduction 7 with 1 rules applied. Total rules applied 197 place count 1124 transition count 1899
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 198 place count 1123 transition count 1891
Iterating global reduction 7 with 1 rules applied. Total rules applied 199 place count 1123 transition count 1891
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 200 place count 1122 transition count 1883
Iterating global reduction 7 with 1 rules applied. Total rules applied 201 place count 1122 transition count 1883
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 202 place count 1121 transition count 1875
Iterating global reduction 7 with 1 rules applied. Total rules applied 203 place count 1121 transition count 1875
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 204 place count 1120 transition count 1867
Iterating global reduction 7 with 1 rules applied. Total rules applied 205 place count 1120 transition count 1867
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 206 place count 1119 transition count 1859
Iterating global reduction 7 with 1 rules applied. Total rules applied 207 place count 1119 transition count 1859
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 208 place count 1118 transition count 1851
Iterating global reduction 7 with 1 rules applied. Total rules applied 209 place count 1118 transition count 1851
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 210 place count 1117 transition count 1843
Iterating global reduction 7 with 1 rules applied. Total rules applied 211 place count 1117 transition count 1843
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 19 rules applied. Total rules applied 230 place count 1107 transition count 1834
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 230 place count 1107 transition count 1832
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 234 place count 1105 transition count 1832
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 236 place count 1104 transition count 1831
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 237 place count 1104 transition count 1830
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 238 place count 1103 transition count 1830
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 240 place count 1103 transition count 1828
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 242 place count 1101 transition count 1828
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 243 place count 1101 transition count 1828
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 246 place count 1098 transition count 1825
Reduce places removed 2 places and 0 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 9 with 3 rules applied. Total rules applied 249 place count 1096 transition count 1824
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 250 place count 1095 transition count 1824
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 250 place count 1095 transition count 1821
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 256 place count 1092 transition count 1821
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 11 with 1 rules applied. Total rules applied 257 place count 1091 transition count 1821
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 261 place count 1089 transition count 1819
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 262 place count 1088 transition count 1818
Iterating global reduction 12 with 1 rules applied. Total rules applied 263 place count 1088 transition count 1818
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 264 place count 1088 transition count 1817
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 265 place count 1087 transition count 1817
Applied a total of 265 rules in 1046 ms. Remains 1087 /1226 variables (removed 139) and now considering 1817/2057 (removed 240) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1047 ms. Remains : 1087/1226 places, 1817/2057 transitions.
RANDOM walk for 40000 steps (349 resets) in 281 ms. (141 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (48 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (43 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 205241 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 2
Probabilistic random walk after 205241 steps, saw 62351 distinct states, run finished after 3011 ms. (steps per millisecond=68 ) 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-7799727487780999702.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2475486595790219138.kers'
[2026-05-22 20:33:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7799727487780999702.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2475486595790219138.kers]
Culling duplicate invariants (modulo rational): removing 17 columns.
Culled 17 columns in 1 ms.
// Phase 1: matrix 1817 rows 1070 cols 7077 entries
Finished phase 1 with 269 SingleSign rule and 631 generalized
[2026-05-22 20:33:20] [INFO ] Computed 187 invariants in 15 ms
Computed 187 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-2475486595790219138.kers
Total runtime 17 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 201/226 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 85/311 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/346 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 409/755 variables, 66/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/755 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 101/856 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/856 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 32/888 variables, 7/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/888 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/889 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/889 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 170/1059 variables, 36/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1059 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/1063 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1063 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/1064 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1064 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 23/1087 variables, 15/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1087 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1817/2904 variables, 1087/1274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2904 variables, 0/1274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/2904 variables, 0/1274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2904/2904 variables, and 1274 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1842 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 117/117 constraints, State Equation: 1087/1087 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 201/226 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 85/311 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/346 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 409/755 variables, 66/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/755 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/755 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 101/856 variables, 21/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/856 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 32/888 variables, 7/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/888 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/889 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/889 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 170/1059 variables, 36/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1059 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/1063 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1063 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/1064 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1064 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 23/1087 variables, 15/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1087 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 1817/2904 variables, 1087/1275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2904 variables, 1/1276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2904 variables, 0/1276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/2904 variables, 0/1276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2904/2904 variables, and 1276 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5056 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 117/117 constraints, State Equation: 1087/1087 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6936ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1228 ms.
Support contains 25 out of 1087 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1087/1087 places, 1817/1817 transitions.
Applied a total of 0 rules in 45 ms. Remains 1087 /1087 variables (removed 0) and now considering 1817/1817 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1087/1087 places, 1817/1817 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1087/1087 places, 1817/1817 transitions.
Applied a total of 0 rules in 43 ms. Remains 1087 /1087 variables (removed 0) and now considering 1817/1817 (removed 0) transitions.
[2026-05-22 20:33:29] [INFO ] Invariant cache hit.
[2026-05-22 20:33:30] [INFO ] Implicit Places using invariants in 1017 ms returned [1, 19, 20, 32, 51, 69, 107, 143, 147, 157, 158, 180, 198, 217, 267, 272, 274, 285, 286, 288, 305, 323, 392, 396, 397, 408, 409, 411, 428, 446, 508, 518, 522, 523, 534, 535, 537, 555, 574, 653, 667, 668, 670, 687, 705, 775, 779, 780, 791, 792, 814, 832, 903, 919, 932, 933, 934, 952, 954, 958, 976, 977, 978, 979, 991, 997, 1003, 1009, 1015, 1021, 1027, 1033, 1039, 1045, 1051]
[2026-05-22 20:33:30] [INFO ] Actually due to overlaps returned [952, 934, 51, 180, 305, 428, 555, 687, 814, 958, 32, 288, 411, 537, 670, 157, 285, 408, 534, 667, 791, 932, 976, 158, 286, 409, 535, 668, 792, 933, 954, 977, 1, 19, 272, 396, 397, 522, 523, 653, 779, 780, 69, 323, 446, 574, 705, 832, 978, 1021, 1039, 1051, 20, 198, 217, 267, 274, 903, 919, 979, 991, 997, 1003, 1009, 1015, 1027, 1033, 1045]
Discarding 68 places :
Implicit Place search using SMT only with invariants took 1032 ms to find 68 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1019/1087 places, 1817/1817 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 129 rules applied. Total rules applied 129 place count 1013 transition count 1694
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 130 rules applied. Total rules applied 259 place count 890 transition count 1687
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 262 place count 887 transition count 1687
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 262 place count 887 transition count 1649
Deduced a syphon composed of 38 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 77 rules applied. Total rules applied 339 place count 848 transition count 1649
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 351 place count 844 transition count 1641
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 359 place count 836 transition count 1641
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 374 place count 821 transition count 1626
Iterating global reduction 5 with 15 rules applied. Total rules applied 389 place count 821 transition count 1626
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 392 place count 821 transition count 1623
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 392 place count 821 transition count 1622
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 394 place count 820 transition count 1622
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 397 place count 817 transition count 1616
Iterating global reduction 6 with 3 rules applied. Total rules applied 400 place count 817 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 401 place count 816 transition count 1615
Iterating global reduction 6 with 1 rules applied. Total rules applied 402 place count 816 transition count 1615
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 403 place count 815 transition count 1613
Iterating global reduction 6 with 1 rules applied. Total rules applied 404 place count 815 transition count 1613
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 506 place count 764 transition count 1562
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 512 place count 758 transition count 1554
Iterating global reduction 6 with 6 rules applied. Total rules applied 518 place count 758 transition count 1554
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 522 place count 758 transition count 1550
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 526 place count 756 transition count 1551
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 528 place count 756 transition count 1549
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 530 place count 754 transition count 1549
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 8 with 16 rules applied. Total rules applied 546 place count 754 transition count 1533
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 563 place count 737 transition count 1533
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 581 place count 737 transition count 1533
Applied a total of 581 rules in 367 ms. Remains 737 /1019 variables (removed 282) and now considering 1533/1817 (removed 284) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-128906485613840536.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7667942038436883315.kers'
[2026-05-22 20:33:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-128906485613840536.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7667942038436883315.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 1533 rows 734 cols 6204 entries
Finished phase 1 with 207 SingleSign rule and 423 generalized
[2026-05-22 20:33:30] [INFO ] Computed 107 invariants in 12 ms
Computed 107 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-7667942038436883315.kers
Total runtime 16 ms.
[2026-05-22 20:33:31] [INFO ] Implicit Places using invariants in 547 ms returned [75, 95, 101, 104, 106, 107, 191, 197, 200, 202, 208, 209, 261, 278, 284, 287, 289, 294, 295, 347, 364, 375, 377, 382, 383, 457, 463, 465, 468, 472, 479, 480, 534, 551, 557, 560, 562, 653, 659, 662, 664, 667]
[2026-05-22 20:33:31] [INFO ] Actually due to overlaps returned [208, 294, 382, 479, 295, 383, 209, 480, 95, 101, 106, 191, 197, 202, 278, 284, 289, 364, 377, 457, 463, 468, 551, 557, 562, 653, 659, 664, 75, 107, 261, 347, 472, 534, 667]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 551 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 702/1087 places, 1533/1817 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 676 transition count 1507
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 676 transition count 1507
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 670 transition count 1501
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 670 transition count 1501
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 86 place count 659 transition count 1490
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 87 place count 659 transition count 1489
Free-agglomeration rule applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 104 place count 659 transition count 1472
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 121 place count 642 transition count 1472
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 642 transition count 1468
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 129 place count 638 transition count 1468
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 638 transition count 1468
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 637 transition count 1467
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 637 transition count 1467
Applied a total of 133 rules in 199 ms. Remains 637 /702 variables (removed 65) and now considering 1467/1533 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9059062403312335403.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9941112680651094965.kers'
[2026-05-22 20:33:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9059062403312335403.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9941112680651094965.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 1467 rows 635 cols 5927 entries
Finished phase 1 with 155 SingleSign rule and 410 generalized
[2026-05-22 20:33:31] [INFO ] Computed 72 invariants in 12 ms
Computed 72 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-9941112680651094965.kers
Total runtime 15 ms.
[2026-05-22 20:33:31] [INFO ] Implicit Places using invariants in 604 ms returned []
[2026-05-22 20:33:31] [INFO ] Invariant cache hit.
[2026-05-22 20:33:33] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned []
Implicit Place search using SMT with State Equation took 2278 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 637/1087 places, 1467/1817 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4474 ms. Remains : 637/1087 places, 1467/1817 transitions.
RANDOM walk for 40000 steps (446 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (82 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (71 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 221508 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 2
Probabilistic random walk after 221508 steps, saw 99641 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2026-05-22 20:33:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 217/242 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/258 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 258/516 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/558 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 79/637 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/637 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1467/2104 variables, 637/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2104 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2104 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2104/2104 variables, and 709 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1129 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 637/637 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 217/242 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/258 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 258/516 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/558 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 79/637 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/637 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1467/2104 variables, 637/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2104 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2104 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2104 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2104/2104 variables, and 710 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2364 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 637/637 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3505ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1614 ms.
Support contains 25 out of 637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1467/1467 transitions.
Applied a total of 0 rules in 23 ms. Remains 637 /637 variables (removed 0) and now considering 1467/1467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 637/637 places, 1467/1467 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1467/1467 transitions.
Applied a total of 0 rules in 26 ms. Remains 637 /637 variables (removed 0) and now considering 1467/1467 (removed 0) transitions.
[2026-05-22 20:33:41] [INFO ] Invariant cache hit.
[2026-05-22 20:33:42] [INFO ] Implicit Places using invariants in 599 ms returned []
[2026-05-22 20:33:42] [INFO ] Invariant cache hit.
[2026-05-22 20:33:44] [INFO ] Implicit Places using invariants and state equation in 1605 ms returned []
Implicit Place search using SMT with State Equation took 2209 ms to find 0 implicit places.
[2026-05-22 20:33:44] [INFO ] Redundant transitions in 123 ms returned []
Running 1433 sub problems to find dead transitions.
[2026-05-22 20:33:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/631 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/631 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 1433 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 631/2104 variables, and 58 constraints, problems are : Problem set: 0 solved, 1433 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 13/24 constraints, Generalized P Invariants (flows): 44/48 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 1433/1433 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/631 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/631 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 1433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/631 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1433 unsolved
Problem TDEAD572 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD610 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 631/2104 variables, and 60 constraints, problems are : Problem set: 4 solved, 1429 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 13/24 constraints, Generalized P Invariants (flows): 44/48 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 0/1433 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60659ms problems are : Problem set: 4 solved, 1429 unsolved
Search for dead transitions found 4 dead transitions in 60665ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 637/637 places, 1463/1467 transitions.
Applied a total of 0 rules in 27 ms. Remains 637 /637 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2026-05-22 20:34:44] [INFO ] Redundant transitions in 58 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63152 ms. Remains : 637/637 places, 1463/1467 transitions.
RANDOM walk for 40000 steps (474 resets) in 447 ms. (89 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (78 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (78 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 242640 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 2
Probabilistic random walk after 242640 steps, saw 108390 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) 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-18262899482121288605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3724031640403188701.kers'
[2026-05-22 20:34:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18262899482121288605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3724031640403188701.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 1463 rows 635 cols 5911 entries
Finished phase 1 with 154 SingleSign rule and 411 generalized
[2026-05-22 20:34:48] [INFO ] Computed 72 invariants in 12 ms
Computed 72 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-3724031640403188701.kers
Total runtime 14 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 213/238 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/251 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 265/516 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/558 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 79/637 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/637 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1463/2100 variables, 637/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2100 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2100 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2100/2100 variables, and 709 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1332 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 637/637 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 213/238 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/251 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 265/516 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/558 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 79/637 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/637 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/637 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1463/2100 variables, 637/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2100 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2100 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2100 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2100 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2100/2100 variables, and 712 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3745 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 637/637 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5110ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1385 ms.
Support contains 25 out of 637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1463/1463 transitions.
Applied a total of 0 rules in 24 ms. Remains 637 /637 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 637/637 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1463/1463 transitions.
Applied a total of 0 rules in 24 ms. Remains 637 /637 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2026-05-22 20:34:54] [INFO ] Invariant cache hit.
[2026-05-22 20:34:55] [INFO ] Implicit Places using invariants in 537 ms returned []
[2026-05-22 20:34:55] [INFO ] Invariant cache hit.
[2026-05-22 20:34:56] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned []
Implicit Place search using SMT with State Equation took 2098 ms to find 0 implicit places.
[2026-05-22 20:34:56] [INFO ] Redundant transitions in 24 ms returned []
Running 1429 sub problems to find dead transitions.
[2026-05-22 20:34:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/631 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1429 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/631 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 1429 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 631/2100 variables, and 58 constraints, problems are : Problem set: 0 solved, 1429 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 11/22 constraints, Generalized P Invariants (flows): 46/50 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 1429/1429 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1429 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/631 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1429 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/631 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 1429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/631 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1429 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 631/2100 variables, and 58 constraints, problems are : Problem set: 0 solved, 1429 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 11/22 constraints, Generalized P Invariants (flows): 46/50 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 0/1429 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60550ms problems are : Problem set: 0 solved, 1429 unsolved
Search for dead transitions found 0 dead transitions in 60553ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62708 ms. Remains : 637/637 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 637 transition count 1461
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 635 transition count 1461
Applied a total of 4 rules in 30 ms. Remains 635 /637 variables (removed 2) and now considering 1461/1463 (removed 2) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15503092405233140289.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2965527433441897555.kers'
[2026-05-22 20:35:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15503092405233140289.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2965527433441897555.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 2 ms.
// Phase 1: matrix 1461 rows 632 cols 5878 entries
Finished phase 1 with 152 SingleSign rule and 411 generalized
[2026-05-22 20:35:57] [INFO ] Computed 72 invariants in 35 ms
Computed 72 P flows in 36 ms.
Exported basis to /tmp/petrispot-output-2965527433441897555.kers
Total runtime 37 ms.
[2026-05-22 20:35:57] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2026-05-22 20:35:57] [INFO ] [Real]Absence check using 23 positive and 49 generalized place invariants in 25 ms returned sat
[2026-05-22 20:35:57] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-22 20:35:57] [INFO ] [Nat]Absence check using 23 positive place invariants in 7 ms returned sat
[2026-05-22 20:35:57] [INFO ] [Nat]Absence check using 23 positive and 49 generalized place invariants in 26 ms returned sat
[2026-05-22 20:35:59] [INFO ] After 1163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-22 20:35:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
TRAPS : Iteration 1
[2026-05-22 20:36:01] [INFO ] After 3700ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-22 20:36:02] [INFO ] After 5188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-22 20:36:02] [INFO ] Flatten gal took : 54 ms
[2026-05-22 20:36:03] [INFO ] Flatten gal took : 44 ms
[2026-05-22 20:36:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2967373437552805518.gal : 14 ms
[2026-05-22 20:36:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9280941986677346579.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2967373437552805518.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9280941986677346579.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9280941986677346579.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 80
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :80 after 304
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :304 after 11360
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :11360 after 3.45216e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.45216e+06 after 8.81779e+08
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :8.81779e+08 after 8.8854e+08
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :8.8854e+08 after 8.89163e+08
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8.89163e+08 after 1.48543e+10
Reachability property ASLink-PT-07b-ReachabilityFireability-2024-04 is true.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.48543e+10 after 1.90281e+11
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.90281e+11 after 7.02919e+11
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :7.02919e+11 after 8.80039e+12
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :8.80039e+12 after 2.31781e+14
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.31781e+14 after 3.26632e+15
Detected timeout of ITS tools.
[2026-05-22 20:36:18] [INFO ] Flatten gal took : 67 ms
[2026-05-22 20:36:18] [INFO ] Applying decomposition
[2026-05-22 20:36:18] [INFO ] Flatten gal took : 48 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/graph560040708499122828.txt' '-o' '/tmp/graph560040708499122828.bin' '-w' '/tmp/graph560040708499122828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph560040708499122828.bin' '-l' '-1' '-v' '-w' '/tmp/graph560040708499122828.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:36:18] [INFO ] Decomposing Gal with order
[2026-05-22 20:36:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:36:18] [INFO ] Removed a total of 2717 redundant transitions.
[2026-05-22 20:36:18] [INFO ] Flatten gal took : 155 ms
[2026-05-22 20:36:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 43 ms.
[2026-05-22 20:36:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3686329469916927955.gal : 25 ms
[2026-05-22 20:36:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16845196212436001309.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/ReachabilityCardinality3686329469916927955.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16845196212436001309.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/ReachabilityCardinality16845196212436001309.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 20
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :20 after 40
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :40 after 120
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :120 after 1.72608e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.72608e+06 after 4.83302e+07
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4.83302e+07 after 4.83302e+07
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5.52346e+08 after 5.33704e+09
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.33704e+09 after 1.07224e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.07224e+10 after 1.17995e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.17995e+10 after 1.55554e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.55554e+10 after 3.92856e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.92856e+10 after 7.43595e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :7.43595e+10 after 7.1866e+18
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 36559 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 20:36:34] [INFO ] Flatten gal took : 71 ms
[2026-05-22 20:36:34] [INFO ] Applying decomposition
[2026-05-22 20:36:34] [INFO ] Flatten gal took : 73 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/graph9435933907673273598.txt' '-o' '/tmp/graph9435933907673273598.bin' '-w' '/tmp/graph9435933907673273598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9435933907673273598.bin' '-l' '-1' '-v' '-w' '/tmp/graph9435933907673273598.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:36:34] [INFO ] Decomposing Gal with order
[2026-05-22 20:36:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:36:35] [INFO ] Removed a total of 2883 redundant transitions.
[2026-05-22 20:36:35] [INFO ] Flatten gal took : 169 ms
[2026-05-22 20:36:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 72 ms.
[2026-05-22 20:36:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3538226677210528578.gal : 72 ms
[2026-05-22 20:36:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10775190168754793865.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/ReachabilityCardinality3538226677210528578.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10775190168754793865.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/ReachabilityCardinality10775190168754793865.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1 after 4.76775e+07
Detected timeout of ITS tools.
[2026-05-22 21:06:35] [INFO ] Flatten gal took : 62 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2627629777508552833
[2026-05-22 21:06:35] [INFO ] Applying decomposition
[2026-05-22 21:06:35] [INFO ] Computing symmetric may disable matrix : 1463 transitions.
[2026-05-22 21:06:35] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 21:06:35] [INFO ] Computing symmetric may enable matrix : 1463 transitions.
[2026-05-22 21:06:35] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 21:06:35] [INFO ] Flatten gal took : 46 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/graph18424736224896515041.txt' '-o' '/tmp/graph18424736224896515041.bin' '-w' '/tmp/graph18424736224896515041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18424736224896515041.bin' '-l' '-1' '-v' '-w' '/tmp/graph18424736224896515041.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:06:35] [INFO ] Decomposing Gal with order
[2026-05-22 21:06:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:06:35] [INFO ] Removed a total of 2741 redundant transitions.
[2026-05-22 21:06:35] [INFO ] Flatten gal took : 79 ms
[2026-05-22 21:06:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 20 ms.
[2026-05-22 21:06:35] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14158292288157718482.gal : 12 ms
[2026-05-22 21:06:35] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1633048448075565218.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/ReachabilityFireability14158292288157718482.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1633048448075565218.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
[2026-05-22 21:06:35] [INFO ] Computing Do-Not-Accords matrix : 1463 transitions.
Loading property file /tmp/ReachabilityFireability1633048448075565218.prop.
[2026-05-22 21:06:36] [INFO ] Computation of Completed DNA matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
[2026-05-22 21:06:36] [INFO ] Built C files in 523ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2627629777508552833
Running compilation step : cd /tmp/ltsmin2627629777508552833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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'
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 1216
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1216 after 11360
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11360 after 8.52096e+07
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :8.52096e+07 after 8.52096e+07
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :8.39923e+08 after 1.19548e+10
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.19548e+10 after 1.35251e+10
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.35251e+10 after 1.8382e+10
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.8382e+10 after 2.30929e+10
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.30929e+10 after 2.86072e+10
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.86072e+10 after 5.75054e+10
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5.75054e+10 after 3.46486e+11
Compilation finished in 5880 ms.
Running link step : cd /tmp/ltsmin2627629777508552833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 117 ms.
Running LTSmin : cd /tmp/ltsmin2627629777508552833;'/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' 'ASLinkPT07bReachabilityFireability202404==true'
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.50127e+19 after 3.50132e+19
Invariant property ASLink-PT-07b-ReachabilityFireability-2024-15 does not hold.
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.77807e+19 after 2.25497e+20
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.76867e+20 after 7.74271e+20
Reachability property ASLink-PT-07b-ReachabilityFireability-2024-04 is true.
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 32769 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.58835e+21,85.8651,914312,6762,9303,1.50908e+06,761582,2089,2.40726e+06,595,4.03616e+06,0
Total reachable state count : 2588352213219502017280

Verifying 2 reachability properties.
Reachability property ASLink-PT-07b-ReachabilityFireability-2024-04 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-07b-ReachabilityFireability-2024-04,4.5904e+14,86.1108,914312,330,617,1.50908e+06,761582,2103,2.40726e+06,600,4.03616e+06,0
Invariant property ASLink-PT-07b-ReachabilityFireability-2024-15 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-07b-ReachabilityFireability-2024-15,1.0271e+17,246.94,914312,3441,4945,1.50908e+06,761582,2234,2.40726e+06,619,4.03616e+06,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2277424 ms.

BK_STOP 1779484243109

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="ReachabilityFireability"
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 ReachabilityFireability"
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-177944366200391"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;