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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.3K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K 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 4.0K Mar 15 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 920K 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-10a-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779488316339

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-22 22:18:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 22:18:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 22:18:37] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2026-05-22 22:18:37] [INFO ] Transformed 2186 places.
[2026-05-22 22:18:37] [INFO ] Transformed 3192 transitions.
[2026-05-22 22:18:37] [INFO ] Found NUPN structural information;
[2026-05-22 22:18:37] [INFO ] Parsed PT model containing 2186 places and 3192 transitions and 11972 arcs in 319 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
FORMULA ASLink-PT-10a-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (163 resets) in 2144 ms. (18 steps per ms) remains 12/13 properties
FORMULA ASLink-PT-10a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 329 ms. (121 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 253 ms. (157 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (13 resets) in 508 ms. (78 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (11 resets) in 280 ms. (142 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 308 ms. (129 steps per ms) remains 12/12 properties
[2026-05-22 22:18:39] [INFO ] Flatten gal took : 488 ms
BEST_FIRST walk for 40004 steps (10 resets) in 659 ms. (60 steps per ms) remains 12/12 properties
[2026-05-22 22:18:39] [INFO ] Flatten gal took : 171 ms
BEST_FIRST walk for 40004 steps (12 resets) in 297 ms. (134 steps per ms) remains 12/12 properties
[2026-05-22 22:18:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17662393641359609124.gal : 123 ms
[2026-05-22 22:18:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3180397820545344709.prop : 2 ms
BEST_FIRST walk for 40004 steps (11 resets) in 399 ms. (100 steps per ms) remains 12/12 properties
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17662393641359609124.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3180397820545344709.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
BEST_FIRST walk for 40004 steps (12 resets) in 320 ms. (124 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (13 resets) in 201 ms. (198 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 338 ms. (118 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (13 resets) in 195 ms. (204 steps per ms) remains 12/12 properties
Loading property file /tmp/ReachabilityCardinality3180397820545344709.prop.
Interrupted probabilistic random walk after 126854 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 12
Probabilistic random walk after 126854 steps, saw 39400 distinct states, run finished after 3014 ms. (steps per millisecond=42 ) 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-4719711578841834026.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16622007489624801616.kers'
[2026-05-22 22:18:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4719711578841834026.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16622007489624801616.kers]
Culling duplicate invariants (modulo rational): removing 40 columns.
Culled 40 columns in 2 ms.
// Phase 1: matrix 3158 rows 2146 cols 11824 entries
Finished phase 1 with 839 SingleSign rule and 925 generalized
[2026-05-22 22:18:42] [INFO ] Computed 422 invariants in 32 ms
Computed 422 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-16622007489624801616.kers
Total runtime 35 ms.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :8 after 16
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :16 after 18
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :18 after 24
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :24 after 41
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :41 after 50
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :50 after 267
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 202/202 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :267 after 110361
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 700/902 variables, 56/258 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/902 variables, 700/958 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/902 variables, 1/959 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :110361 after 5.59665e+06
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 174/1076 variables, 44/1003 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1076 variables, 174/1177 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1076 variables, 10/1187 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1076 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1076/2152 variables, 296/1483 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :5.59665e+06 after 6.24117e+16
At refinement iteration 11 (INCLUDED_ONLY) 0/2152 variables, 1076/2559 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2152 variables, 0/2559 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 34/2186 variables, 15/2574 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2186 variables, 34/2608 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2186/5344 variables, and 2608 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5039 ms.
Refiners :[Domain max(s): 2186/2186 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 322/322 constraints, State Equation: 0/2186 constraints, PredecessorRefiner: 12/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 202/202 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 700/902 variables, 56/258 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/902 variables, 700/958 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/902 variables, 1/959 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 174/1076 variables, 44/1003 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1076 variables, 174/1177 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1076 variables, 10/1187 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1076 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem ASLink-PT-10a-ReachabilityCardinality-2024-02 is UNSAT
FORMULA ASLink-PT-10a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 1076/2152 variables, 296/1483 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2152 variables, 1076/2559 constraints. Problems are: Problem set: 1 solved, 11 unsolved
SMT process timed out in 10517ms, After SMT, problems are : Problem set: 1 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 200 out of 2186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 40 places
Discarding 17 places :
Implicit places reduction removed 17 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 194 rules applied. Total rules applied 194 place count 2129 transition count 3021
Reduce places removed 137 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 148 rules applied. Total rules applied 342 place count 1992 transition count 3010
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 353 place count 1981 transition count 3010
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 180 Pre rules applied. Total rules applied 353 place count 1981 transition count 2830
Deduced a syphon composed of 180 places in 4 ms
Ensure Unique test removed 56 places
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 3 with 416 rules applied. Total rules applied 769 place count 1745 transition count 2830
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 771 place count 1744 transition count 2829
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 772 place count 1743 transition count 2829
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 783 place count 1732 transition count 2770
Ensure Unique test removed 1 places
Iterating global reduction 5 with 12 rules applied. Total rules applied 795 place count 1731 transition count 2770
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 801 place count 1730 transition count 2765
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 804 place count 1727 transition count 2765
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 805 place count 1726 transition count 2757
Iterating global reduction 7 with 1 rules applied. Total rules applied 806 place count 1726 transition count 2757
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 807 place count 1725 transition count 2749
Iterating global reduction 7 with 1 rules applied. Total rules applied 808 place count 1725 transition count 2749
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 809 place count 1724 transition count 2741
Iterating global reduction 7 with 1 rules applied. Total rules applied 810 place count 1724 transition count 2741
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 811 place count 1723 transition count 2733
Iterating global reduction 7 with 1 rules applied. Total rules applied 812 place count 1723 transition count 2733
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 813 place count 1722 transition count 2725
Iterating global reduction 7 with 1 rules applied. Total rules applied 814 place count 1722 transition count 2725
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 815 place count 1721 transition count 2717
Iterating global reduction 7 with 1 rules applied. Total rules applied 816 place count 1721 transition count 2717
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 817 place count 1720 transition count 2709
Iterating global reduction 7 with 1 rules applied. Total rules applied 818 place count 1720 transition count 2709
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 819 place count 1719 transition count 2701
Iterating global reduction 7 with 1 rules applied. Total rules applied 820 place count 1719 transition count 2701
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 821 place count 1718 transition count 2693
Iterating global reduction 7 with 1 rules applied. Total rules applied 822 place count 1718 transition count 2693
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 823 place count 1717 transition count 2685
Iterating global reduction 7 with 1 rules applied. Total rules applied 824 place count 1717 transition count 2685
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 825 place count 1716 transition count 2677
Iterating global reduction 7 with 1 rules applied. Total rules applied 826 place count 1716 transition count 2677
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 4 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 7 with 106 rules applied. Total rules applied 932 place count 1663 transition count 2624
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 933 place count 1663 transition count 2623
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 934 place count 1662 transition count 2623
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 8 with 12 rules applied. Total rules applied 946 place count 1662 transition count 2611
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 958 place count 1650 transition count 2611
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 969 place count 1650 transition count 2611
Applied a total of 969 rules in 1962 ms. Remains 1650 /2186 variables (removed 536) and now considering 2611/3158 (removed 547) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1969 ms. Remains : 1650/2186 places, 2611/3158 transitions.
RANDOM walk for 40000 steps (263 resets) in 752 ms. (53 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (24 resets) in 206 ms. (193 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (25 resets) in 186 ms. (213 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (25 resets) in 245 ms. (162 steps per ms) remains 10/11 properties
FORMULA ASLink-PT-10a-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (25 resets) in 214 ms. (186 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (23 resets) in 206 ms. (193 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (24 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (24 resets) in 303 ms. (131 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (24 resets) in 201 ms. (198 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (23 resets) in 180 ms. (221 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (25 resets) in 147 ms. (270 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 117419 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 10
Probabilistic random walk after 117419 steps, saw 35418 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) 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-11823953391254730832.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9118840466430547916.kers'
[2026-05-22 22:18:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11823953391254730832.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9118840466430547916.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 2 ms.
// Phase 1: matrix 2611 rows 1643 cols 10253 entries
Finished phase 1 with 431 SingleSign rule and 913 generalized
[2026-05-22 22:18:59] [INFO ] Computed 306 invariants in 29 ms
Computed 306 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-9118840466430547916.kers
Total runtime 32 ms.
[2026-05-22 22:18:59] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 476/656 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/656 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 133/789 variables, 32/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/789 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 842/1631 variables, 210/292 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1631 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 19/1650 variables, 14/306 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1650 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 2611/4261 variables, 1650/1956 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4261 variables, 40/1996 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4261 variables, 0/1996 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/4261 variables, 0/1996 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4261/4261 variables, and 1996 constraints, problems are : Problem set: 0 solved, 10 unsolved in 7525 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, Generalized P Invariants (flows): 224/224 constraints, State Equation: 1650/1650 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 10/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 476/656 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/656 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 133/789 variables, 32/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/789 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 842/1631 variables, 210/292 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1631 variables, 5/297 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1631 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1631 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 19/1650 variables, 14/313 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1650 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1650 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 2611/4261 variables, 1650/1964 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4261 variables, 40/2004 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4261 variables, 7/2011 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4261/4261 variables, and 2011 constraints, problems are : Problem set: 0 solved, 10 unsolved in 45018 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, Generalized P Invariants (flows): 224/224 constraints, State Equation: 1650/1650 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 10/7 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52626ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 180 out of 1650 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1650/1650 places, 2611/2611 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1650 transition count 2607
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 1646 transition count 2606
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 1645 transition count 2606
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 10 place count 1645 transition count 2601
Deduced a syphon composed of 5 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 22 place count 1638 transition count 2601
Applied a total of 22 rules in 141 ms. Remains 1638 /1650 variables (removed 12) and now considering 2601/2611 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 1638/1650 places, 2601/2611 transitions.
RANDOM walk for 40000 steps (286 resets) in 717 ms. (55 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (26 resets) in 225 ms. (177 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (26 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (25 resets) in 179 ms. (222 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (27 resets) in 140 ms. (283 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (25 resets) in 159 ms. (250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (25 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (23 resets) in 270 ms. (147 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (27 resets) in 145 ms. (274 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (25 resets) in 193 ms. (206 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (25 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 108101 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 10
Probabilistic random walk after 108101 steps, saw 31431 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) 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-16125131358252757907.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17457090775468318929.kers'
[2026-05-22 22:19:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16125131358252757907.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17457090775468318929.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 1 ms.
// Phase 1: matrix 2601 rows 1630 cols 10222 entries
Finished phase 1 with 423 SingleSign rule and 911 generalized
[2026-05-22 22:19:55] [INFO ] Computed 304 invariants in 28 ms
Computed 304 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-17457090775468318929.kers
Total runtime 32 ms.
[2026-05-22 22:19:55] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 475/655 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/655 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 132/787 variables, 32/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/787 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 836/1623 variables, 210/292 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1623 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 15/1638 variables, 12/304 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1638 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 2601/4239 variables, 1638/1942 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4239 variables, 43/1985 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4239 variables, 0/1985 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/4239 variables, 0/1985 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4239/4239 variables, and 1985 constraints, problems are : Problem set: 0 solved, 10 unsolved in 8470 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, Generalized P Invariants (flows): 222/222 constraints, State Equation: 1638/1638 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 10/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 475/655 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/655 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 132/787 variables, 32/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/787 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 836/1623 variables, 210/292 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1623 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1623 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1623 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 15/1638 variables, 12/309 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1638 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1638 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 2601/4239 variables, 1638/1948 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4239 variables, 43/1991 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4239 variables, 7/1998 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4239/4239 variables, and 1998 constraints, problems are : Problem set: 0 solved, 10 unsolved in 75068 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, Generalized P Invariants (flows): 222/222 constraints, State Equation: 1638/1638 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 10/7 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 83607ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 180 out of 1638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1638/1638 places, 2601/2601 transitions.
Applied a total of 0 rules in 108 ms. Remains 1638 /1638 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 1638/1638 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1638/1638 places, 2601/2601 transitions.
Applied a total of 0 rules in 88 ms. Remains 1638 /1638 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2026-05-22 22:21:19] [INFO ] Invariant cache hit.
[2026-05-22 22:21:21] [INFO ] Implicit Places using invariants in 1557 ms returned [1, 19, 20, 22, 32, 50, 68, 130, 146, 160, 173, 176, 178, 196, 287, 299, 314, 317, 318, 319, 337, 355, 397, 414, 428, 452, 468, 471, 472, 473, 509, 564, 578, 587, 601, 617, 622, 623, 643, 661, 742, 755, 759, 760, 761, 779, 797, 849, 869, 882, 900, 901, 902, 922, 940, 982, 1014, 1036, 1050, 1051, 1052, 1053, 1054, 1072, 1090, 1163, 1176, 1190, 1192, 1193, 1194, 1212, 1230, 1285, 1320, 1333, 1334, 1335, 1336, 1337, 1355, 1454, 1459, 1471, 1472, 1473, 1474, 1475, 1498, 1500, 1503, 1521, 1522, 1523, 1524, 1538, 1544, 1550, 1556, 1562, 1568, 1581, 1587, 1593, 1600]
[2026-05-22 22:21:21] [INFO ] Actually due to overlaps returned [1498, 1475, 50, 178, 196, 319, 337, 643, 779, 922, 1054, 1072, 1194, 1212, 1355, 1503, 32, 473, 761, 1337, 318, 472, 623, 760, 902, 1053, 1193, 1336, 1474, 1522, 176, 317, 471, 622, 759, 901, 1052, 1192, 1335, 1473, 1500, 1521, 1, 299, 452, 601, 742, 882, 900, 1036, 1051, 1176, 1320, 1334, 1454, 1472, 19, 20, 68, 173, 314, 355, 468, 509, 617, 661, 755, 797, 940, 1050, 1090, 1190, 1230, 1333, 1471, 1524, 1568, 1587, 1600, 22, 160, 1459, 1523, 1538, 1544, 1550, 1556, 1562, 1581, 1593]
Discarding 90 places :
Implicit Place search using SMT only with invariants took 1588 ms to find 90 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1548/1638 places, 2601/2601 transitions.
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 1541 transition count 2499
Reduce places removed 102 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 122 rules applied. Total rules applied 231 place count 1439 transition count 2479
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 251 place count 1419 transition count 2479
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 251 place count 1419 transition count 2430
Deduced a syphon composed of 49 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 99 rules applied. Total rules applied 350 place count 1369 transition count 2430
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 20 rules applied. Total rules applied 370 place count 1359 transition count 2420
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 380 place count 1349 transition count 2420
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 389 place count 1340 transition count 2411
Iterating global reduction 5 with 9 rules applied. Total rules applied 398 place count 1340 transition count 2411
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 401 place count 1340 transition count 2408
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 403 place count 1338 transition count 2406
Iterating global reduction 6 with 2 rules applied. Total rules applied 405 place count 1338 transition count 2406
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 3 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 6 with 128 rules applied. Total rules applied 533 place count 1274 transition count 2342
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 534 place count 1273 transition count 2341
Iterating global reduction 6 with 1 rules applied. Total rules applied 535 place count 1273 transition count 2341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 536 place count 1273 transition count 2340
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 541 place count 1273 transition count 2335
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 546 place count 1268 transition count 2335
Free-agglomeration rule (complex) applied 46 times.
Iterating global reduction 8 with 46 rules applied. Total rules applied 592 place count 1268 transition count 2289
Ensure Unique test removed 1 places
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 8 with 47 rules applied. Total rules applied 639 place count 1221 transition count 2289
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 640 place count 1221 transition count 2288
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 658 place count 1221 transition count 2288
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 664 place count 1221 transition count 2288
Applied a total of 664 rules in 635 ms. Remains 1221 /1548 variables (removed 327) and now considering 2288/2601 (removed 313) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15423726698898921856.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9058898739543807784.kers'
[2026-05-22 22:21:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15423726698898921856.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9058898739543807784.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2288 rows 1221 cols 9202 entries
Finished phase 1 with 520 SingleSign rule and 506 generalized
[2026-05-22 22:21:21] [INFO ] Computed 195 invariants in 22 ms
Computed 195 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-9058898739543807784.kers
Total runtime 24 ms.
[2026-05-22 22:21:22] [INFO ] Implicit Places using invariants in 1027 ms returned [104, 110, 119, 128, 135, 136, 211, 218, 239, 240, 310, 332, 338, 340, 344, 444, 481, 577, 580, 582, 583, 589, 596, 598, 682, 685, 697, 698, 703, 704, 762, 782, 806, 811, 813, 814, 818, 824, 898, 905, 908, 931, 932, 985, 1008, 1021, 1025, 1027, 1107, 1114, 1117, 1119, 1203, 1216, 1220]
[2026-05-22 22:21:22] [INFO ] Actually due to overlaps returned [818, 698, 1027, 135, 239, 481, 824, 136, 240, 332, 340, 444, 577, 582, 682, 813, 898, 1025, 1114, 1119, 104, 110, 119, 128, 211, 218, 310, 344, 583, 589, 685, 697, 762, 782, 806, 814, 905, 908, 985, 1008, 1107, 1203, 1216, 1220]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 1039 ms to find 44 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1177/1638 places, 2288/2601 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1170 transition count 2281
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1170 transition count 2281
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 30 place count 1162 transition count 2273
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 31 place count 1162 transition count 2272
Free-agglomeration rule applied 13 times.
Iterating global reduction 0 with 13 rules applied. Total rules applied 44 place count 1162 transition count 2259
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 57 place count 1149 transition count 2259
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 1149 transition count 2258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 1148 transition count 2258
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 1148 transition count 2258
Applied a total of 62 rules in 285 ms. Remains 1148 /1177 variables (removed 29) and now considering 2258/2288 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1634790028747837048.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9957380002467107168.kers'
[2026-05-22 22:21:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1634790028747837048.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9957380002467107168.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2258 rows 1148 cols 8929 entries
Finished phase 1 with 490 SingleSign rule and 507 generalized
[2026-05-22 22:21:23] [INFO ] Computed 151 invariants in 22 ms
Computed 151 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-9957380002467107168.kers
Total runtime 24 ms.
[2026-05-22 22:21:23] [INFO ] Implicit Places using invariants in 784 ms returned [564, 566, 665, 666, 877, 878]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 788 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1142/1638 places, 2258/2601 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1141 transition count 2257
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1141 transition count 2257
Applied a total of 2 rules in 98 ms. Remains 1141 /1142 variables (removed 1) and now considering 2257/2258 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9258162226861722697.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13197456354923842635.kers'
[2026-05-22 22:21:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9258162226861722697.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13197456354923842635.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 2257 rows 1141 cols 8857 entries
Finished phase 1 with 496 SingleSign rule and 500 generalized
[2026-05-22 22:21:24] [INFO ] Computed 145 invariants in 36 ms
Computed 145 P flows in 37 ms.
Exported basis to /tmp/petrispot-output-13197456354923842635.kers
Total runtime 38 ms.
[2026-05-22 22:21:24] [INFO ] Implicit Places using invariants in 883 ms returned []
[2026-05-22 22:21:24] [INFO ] Invariant cache hit.
[2026-05-22 22:21:26] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-22 22:21:28] [INFO ] Implicit Places using invariants and state equation in 4051 ms returned []
Implicit Place search using SMT with State Equation took 4946 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 1141/1638 places, 2257/2601 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 9472 ms. Remains : 1141/1638 places, 2257/2601 transitions.
RANDOM walk for 40000 steps (384 resets) in 544 ms. (73 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (38 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (41 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (36 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (37 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (34 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (41 resets) in 163 ms. (243 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (38 resets) in 196 ms. (203 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (39 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (29 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (39 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 179770 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 10
Probabilistic random walk after 179770 steps, saw 34865 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2026-05-22 22:21:32] [INFO ] Invariant cache hit.
[2026-05-22 22:21:32] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 485/665 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/665 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 3/668 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/668 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 463/1131 variables, 98/143 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1131 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 10/1141 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1141 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 2257/3398 variables, 1141/1286 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3398 variables, 13/1299 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3398 variables, 0/1299 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/3398 variables, 0/1299 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3398/3398 variables, and 1299 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4760 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 1141/1141 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 10/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 485/665 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/665 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 3/668 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/668 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 463/1131 variables, 98/143 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1131 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1131 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1131 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 10/1141 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1141 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 2257/3398 variables, 1141/1294 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3398 variables, 13/1307 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3398 variables, 7/1314 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3398/3398 variables, and 1314 constraints, problems are : Problem set: 0 solved, 10 unsolved in 90041 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 1141/1141 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 10/7 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 94823ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 180 out of 1141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1141/1141 places, 2257/2257 transitions.
Applied a total of 0 rules in 44 ms. Remains 1141 /1141 variables (removed 0) and now considering 2257/2257 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1141/1141 places, 2257/2257 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1141/1141 places, 2257/2257 transitions.
Applied a total of 0 rules in 40 ms. Remains 1141 /1141 variables (removed 0) and now considering 2257/2257 (removed 0) transitions.
[2026-05-22 22:23:07] [INFO ] Invariant cache hit.
[2026-05-22 22:23:08] [INFO ] Implicit Places using invariants in 882 ms returned []
[2026-05-22 22:23:08] [INFO ] Invariant cache hit.
[2026-05-22 22:23:09] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-22 22:23:12] [INFO ] Implicit Places using invariants and state equation in 3781 ms returned []
Implicit Place search using SMT with State Equation took 4683 ms to find 0 implicit places.
[2026-05-22 22:23:12] [INFO ] Redundant transitions in 154 ms returned []
Running 2256 sub problems to find dead transitions.
[2026-05-22 22:23:12] [INFO ] Invariant cache hit.
[2026-05-22 22:23:12] [INFO ] State equation strengthened by 13 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1140 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 2256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1140/3398 variables, and 85 constraints, problems are : Problem set: 0 solved, 2256 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/45 constraints, Generalized P Invariants (flows): 85/100 constraints, State Equation: 0/1141 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 2256/2256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1140 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 2256 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1140/3398 variables, and 85 constraints, problems are : Problem set: 0 solved, 2256 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/45 constraints, Generalized P Invariants (flows): 85/100 constraints, State Equation: 0/1141 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 0/2256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61002ms problems are : Problem set: 0 solved, 2256 unsolved
Search for dead transitions found 0 dead transitions in 61012ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65927 ms. Remains : 1141/1141 places, 2257/2257 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 1141 transition count 2251
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1135 transition count 2251
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 1134 transition count 2251
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 1 with 2 rules applied. Total rules applied 15 place count 1133 transition count 2250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 1132 transition count 2249
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 1132 transition count 2249
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 1132 transition count 2248
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 1131 transition count 2247
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 1131 transition count 2246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 1130 transition count 2246
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 1130 transition count 2245
Applied a total of 23 rules in 252 ms. Remains 1130 /1141 variables (removed 11) and now considering 2245/2257 (removed 12) transitions.
Running SMT prover for 10 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-604543772130821371.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6556412789822517237.kers'
[2026-05-22 22:24:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-604543772130821371.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6556412789822517237.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2245 rows 1130 cols 8825 entries
Finished phase 1 with 489 SingleSign rule and 497 generalized
[2026-05-22 22:24:13] [INFO ] Computed 144 invariants in 26 ms
Computed 144 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-6556412789822517237.kers
Total runtime 28 ms.
[2026-05-22 22:24:14] [INFO ] [Real]Absence check using 45 positive place invariants in 28 ms returned sat
[2026-05-22 22:24:14] [INFO ] [Real]Absence check using 45 positive and 99 generalized place invariants in 94 ms returned sat
[2026-05-22 22:24:14] [INFO ] After 487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2026-05-22 22:24:14] [INFO ] [Nat]Absence check using 45 positive place invariants in 21 ms returned sat
[2026-05-22 22:24:14] [INFO ] [Nat]Absence check using 45 positive and 99 generalized place invariants in 39 ms returned sat
[2026-05-22 22:24:53] [INFO ] After 38224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2026-05-22 22:24:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2026-05-22 22:25:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1071 ms
TRAPS : Iteration 1
[2026-05-22 22:25:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
TRAPS : Iteration 2
[2026-05-22 22:25:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2026-05-22 22:25:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
TRAPS : Iteration 3
[2026-05-22 22:26:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 416 ms
TRAPS : Iteration 4
[2026-05-22 22:27:34] [INFO ] After 200005ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2026-05-22 22:27:47] [INFO ] After 213647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 214481 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 22:27:48] [INFO ] Flatten gal took : 109 ms
[2026-05-22 22:27:48] [INFO ] Applying decomposition
[2026-05-22 22:27:48] [INFO ] Flatten gal took : 95 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/graph10254841434522084015.txt' '-o' '/tmp/graph10254841434522084015.bin' '-w' '/tmp/graph10254841434522084015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10254841434522084015.bin' '-l' '-1' '-v' '-w' '/tmp/graph10254841434522084015.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:27:48] [INFO ] Decomposing Gal with order
[2026-05-22 22:27:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:27:49] [INFO ] Removed a total of 4204 redundant transitions.
[2026-05-22 22:27:49] [INFO ] Flatten gal took : 274 ms
[2026-05-22 22:27:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 115 ms.
[2026-05-22 22:27:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4382001598379130927.gal : 34 ms
[2026-05-22 22:27:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15709912758250381874.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/ReachabilityCardinality4382001598379130927.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15709912758250381874.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/ReachabilityCardinality15709912758250381874.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :270 after 6.83241e+07
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :6.83241e+07 after 5.48371e+19
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :5.48371e+19 after 1.45897e+31
Reachability property ASLink-PT-10a-ReachabilityCardinality-2024-14 is true.
FORMULA ASLink-PT-10a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Detected timeout of ITS tools.
[2026-05-22 22:57:49] [INFO ] Flatten gal took : 101 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4533891834174832041
[2026-05-22 22:57:49] [INFO ] Applying decomposition
[2026-05-22 22:57:49] [INFO ] Too many transitions (2257) to apply POR reductions. Disabling POR matrices.
[2026-05-22 22:57:49] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4533891834174832041
[2026-05-22 22:57:49] [INFO ] Flatten gal took : 76 ms
Running compilation step : cd /tmp/ltsmin4533891834174832041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '80' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18244564165051445320.txt' '-o' '/tmp/graph18244564165051445320.bin' '-w' '/tmp/graph18244564165051445320.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18244564165051445320.bin' '-l' '-1' '-v' '-w' '/tmp/graph18244564165051445320.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:57:49] [INFO ] Decomposing Gal with order
[2026-05-22 22:57:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:57:50] [INFO ] Removed a total of 3912 redundant transitions.
[2026-05-22 22:57:50] [INFO ] Flatten gal took : 118 ms
[2026-05-22 22:57:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 119 labels/synchronizations in 38 ms.
[2026-05-22 22:57:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality497108581426262749.gal : 22 ms
[2026-05-22 22:57:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3652105153972679694.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/ReachabilityCardinality497108581426262749.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3652105153972679694.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 ...306
Loading property file /tmp/ReachabilityCardinality3652105153972679694.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :3 after 81
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :81 after 101353
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :101353 after 2.45651e+11
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :2.45651e+11 after 6.96463e+16
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :6.96463e+16 after 2.575e+17
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :2.575e+17 after 4.22351e+17
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :4.22351e+17 after 6.77294e+17
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :6.77294e+17 after 1.48557e+18
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :1.48557e+18 after 8.22657e+18
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :8.22657e+18 after 4.15557e+19
Compilation finished in 5605 ms.
Running link step : cd /tmp/ltsmin4533891834174832041;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 100 ms.
Running LTSmin : cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202400==true'
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :4.15557e+19 after 2.2566e+20
WARNING : LTSmin timed out (>40 s) on command cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202400==true'
Running LTSmin : cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202401==true'
WARNING : LTSmin timed out (>40 s) on command cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202401==true'
Running LTSmin : cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202403==true'
WARNING : LTSmin timed out (>40 s) on command cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202403==true'
Running LTSmin : cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202404==true'
WARNING : LTSmin timed out (>40 s) on command cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202404==true'
Running LTSmin : cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202406==true'
WARNING : LTSmin timed out (>40 s) on command cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202406==true'
Running LTSmin : cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202408==true'
WARNING : LTSmin timed out (>40 s) on command cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202408==true'
Running LTSmin : cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202409==true'
WARNING : LTSmin timed out (>40 s) on command cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202409==true'
Running LTSmin : cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202410==true'
WARNING : LTSmin timed out (>40 s) on command cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202410==true'
Running LTSmin : cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202413==true'
WARNING : LTSmin timed out (>40 s) on command cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202413==true'
Retrying LTSmin with larger timeout 3200 s
Running LTSmin : cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202400==true'
WARNING : LTSmin timed out (>320 s) on command cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202400==true'
Running LTSmin : cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202401==true'
WARNING : LTSmin timed out (>320 s) on command cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202401==true'
Running LTSmin : cd /tmp/ltsmin4533891834174832041;'/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' 'ASLinkPT10aReachabilityCardinality202403==true'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-10a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is ASLink-PT-10a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-oct2-177944366300430"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-10a.tgz
mv ASLink-PT-10a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;